Finite types start at 0: Fin(5)={0,…,4}→Fin(3), complete images=[1, 0, 1, 0, 0]. Check the whole original total table before any candidate evaluation; empty-function properties depend on the declared codomain. Ordered target candidates=[0, 1]. Give (original images, two codomain-eligibility values, fibers or outside-codomain, each least preimage or does-not-exist/outside-codomain).
G001 — Finite types start at 0: Fin(5)={0,…,4}→Fin(3), complete images=[1, 0, 1, 0, 0]. Check the whole original total table before any candidate evaluation; empty-function properties depend on the declared codomain. Ordered target candidates=[0, 1]. Give (original images, two codomain-eligibility values, fibers or outside-codomain, each least preimage or does-not-exist/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.
all original inputs and outputs form a typed total table;labels start at0
Conditions: none
First validate the entire original table as a total function from Fin(n) to Fin(m),including cells not used by a query.Only then evaluate preimages for eligible targets and surjectivity.
First check0≤target<m.A legal target with no preimage has an empty fiber and no least preimage.An outside target is not a legal empty fiber,and negative indexing is not used.
First check0≤target<m.A legal target with no preimage has an empty fiber and no least preimage.An outside target is not a legal empty fiber,and negative indexing is not used.
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.