The explicitly typed relation R⊆Fin(2)×Fin(2) has ordered pairs=[[0, 0], [1, 1], [0, 0]]. 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], normalized pairs, each source fiber size, at-most-one value per source?, exactly-one value per source?, total image table or not-a-total-function).
G001 — The explicitly typed relation R⊆Fin(2)×Fin(2) has ordered pairs=[[0, 0], [1, 1], [0, 0]]. 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], normalized pairs, each source fiber size, at-most-one value per source?, exactly-one value per source?, total image table or not-a-total-function).
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.
At most one value permits missing sources;exactly one makes a total function.On an empty source both universal conditions are true and the table is empty.Repeating a pair does not increase a fiber size.
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.