Use the complete total map Fin(5)={0,…,4}→Fin(3) with images=[2, 1, 0, 0, 0] in source-index order. Validate every image in the declared codomain first. Equal finite cardinalities do not make the given map bijective. Ordered queries=[0, 2]. Give (images, bijectivity, two codomain type guards, two inverse values). If f is not bijective use not-an-inverse-function for each value; otherwise an untyped query yields outside-codomain.
G001 — Use the complete total map Fin(5)={0,…,4}→Fin(3) with images=[2, 1, 0, 0, 0] in source-index order. Validate every image in the declared codomain first. Equal finite cardinalities do not make the given map bijective. Ordered queries=[0, 2]. Give (images, bijectivity, two codomain type guards, two inverse values). If f is not bijective use not-an-inverse-function for each value; otherwise an untyped query yields outside-codomain.
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.
complete typed total map;inverse is not reciprocal
Conditions: none
Validate the whole original total table first.Equal finite cardinalities do not ensure this particular table is bijective,and a zero function value does not prohibit an inverse.
Step identifiers and dependencies
Rule: inverse_typed_map_scope · Uses: G001
S002 · implies
Before
target=0;original images=[2, 1, 0, 0, 0]
After
fiber=[2, 3, 4];unique=No
Conditions: none
Scan every original input and list all preimages of this declared target.An empty or multiple-preimage fiber cannot supply a cell of a total inverse.
For the already total map,exactly one preimage per codomain target is equivalent to bijectivity.The empty-to-empty map qualifies;checking n=m alone is insufficient.
Step identifiers and dependencies
Rule: inverse_bijection_gate · Uses: G001, S004
S006 · implies
Before
query0=0;bijective=No;in Fin(3)=Yes
After
inverse value/status=does not define an inverse function
Conditions: none
Retain the query type mask separately.A nonbijective original map takes precedence and yields not-an-inverse-function.Read the unique preimage only if the inverse exists and the target is typed.
inverse value/status=does not define an inverse function
Conditions: none
Retain the query type mask separately.A nonbijective original map takes precedence and yields not-an-inverse-function.Read the unique preimage only if the inverse exists and the target is typed.
S007 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S006 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S005 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S004 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S003 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S002 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
Result
([2, 1, 0, 0, 0], No, [Yes, Yes], [not-an-inverse-function, not-an-inverse-function])
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.