The explicitly typed relation R⊆Fin(3)×Fin(3) has ordered pairs=[[0, 0], [0, 1]]. Normalize repeated pairs as a set, in lexicographic order. A relation need not be single-valued or total; its converse need not be an inverse function. Give ([n,m], swapped type sizes [m,n], original normalized pairs, normalized converse pairs, double-converse pairs, does the double converse equal the original?).
G001 — The explicitly typed relation R⊆Fin(3)×Fin(3) has ordered pairs=[[0, 0], [0, 1]]. Normalize repeated pairs as a set, in lexicographic order. A relation need not be single-valued or total; its converse need not be an inverse function. Give ([n,m], swapped type sizes [m,n], original normalized pairs, normalized converse pairs, double-converse pairs, does the double converse equal the original?).
Definition and scope
Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.
Validate both types of every ordered pair,then deduplicate identical pairs.Swapping coordinates forms the converse,not a sorting of one pair.A relation may be multivalued or partial.
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.
This question review and source binding
Review date: 2026-10-26
Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.