How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
A function is a relation with and implying ; , the value , domain and codomain
Definition
A function is a relation such that and imply ; "relation" is as in Relation, , , , and the specialisations "relation from to " and "relation on ".
For there is such a , and by the condition just stated there is only one; denotes that unique , so that holds if and only if and ( if and only if and ).
We write , and say is a function from to , when is a function with and (Subset , proper subset , and the separation notation ); is the domain of and is a codomain for . Equivalently with (The Cartesian product , The Kuratowski ordered pair ).
Definition references
Remarks
-
The codomain belongs to the declaration, not to the set. A function is a set of ordered pairs, and that set determines its domain and its range but not a codomain: the same satisfies for every containing . So being onto is a property of the declaration rather than of , while being one-to-one is a property of alone. This convention is what makes a function for every at once.
-
Total on its domain by construction. There is no partial function here: if then is not defined, and a function has equal to exactly, not merely included in it.