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.
, and for
Definition
Let be an indexed family (An indexed family is a function with domain ; is its range). Its indexed union is
the union of its range (The union of a set, and the binary union ); so holds if and only if for some .
When its indexed intersection is
which is legitimate because a family with has a value at some index, so its range is nonempty (Relation, , , , and the specialisations "relation from to " and "relation on ") and For a set the collection is a set, and it does not depend on the member of used to separate it applies (The intersection of a nonempty set, the binary intersection , and disjointness); so holds if and only if for every .
Remarks
-
The empty index set. , because the empty family has empty range and (There is exactly one set with no elements, written ). The indexed intersection is left undefined there, for the reason recorded at There is no set with , so is undefined: no set has every set as an element.
-
Indexing changes nothing about the operations. Both notations are the primitive and applied to the range of the family, so every law proved for and transfers verbatim; that transfer is For a nonempty index set : , , , and .
Depends on
An indexed family is a function with domain ; is its range
The union of a set, and the binary union
The intersection of a nonempty set, the binary intersection , and disjointness
For a set the collection is a set, and it does not depend on the member of used to separate it
Relation, , , , and the specialisations "relation from to " and "relation on "
There is exactly one set with no elements, written