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.
Relation, , , , and the specialisations "relation from to " and "relation on "
Definition
A relation is a set every element of which is an ordered pair (The Kuratowski ordered pair ). We write for .
By If every element of is an ordered pair, then and are sets, both included in the following two classes are sets, so the notation is legitimate:
the domain and the range of . The field of is (The union of a set, and the binary union ).
is a relation from to when (The Cartesian product , Subset , proper subset , and the separation notation ), and a relation on when .
Remarks
-
Domain and range are intrinsic; the sets and are not. A relation determines its own domain and range, but it is a relation from to for many different and : any containing and any containing will do. That is the content of Every relation satisfies , and is a relation from to if and only if and , and it is the same distinction that makes a codomain part of the declaration rather than of the set in A function is a relation with and implying ; , the value , domain and codomain.
-
The empty set is a relation. It has no elements, so the requirement that every element be an ordered pair holds vacuously, and . It is a relation on every set.