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.
Category, object, morphism, domain, codomain, identity, composition, and hom-collection
Definition
Under the definable-class convention of The first-order language of set theory: , , formulas with parameters, and class abbreviations, every class below is a formula and every function whose domain may be proper-class-sized is a definable class-function schema. When its domain is a set, it is an ordinary set-valued function.
A category consists of a class of objects, a class of morphisms, functions , an identity morphism for every object , and a composite whenever and .
These data satisfy, whenever the composites are defined,
We write , or , for the hom-collection of morphisms with domain and codomain . The object class is allowed to be empty; then the morphism class is empty and all axioms are vacuous.
Morphisms carry their domain and codomain. A category is often presented the other way round, by saying what the morphisms from to are for each pair of objects. When it is, is the disjoint union of those hom-collections: a morphism is a triple with in the collection assigned to , and and are the first two projections, which are then functions in the required sense. This is not a technicality that can be dropped. In this library a function is a set of ordered pairs and does not determine a codomain (A function is a relation with and implying ; , the value , domain and codomain), so the empty function is a function for every at once; reading the morphisms of as bare functions would give that one set two different codomains and leave undefined. Every concrete category below whose morphisms are described as structure-preserving maps is to be read with this tagging, and each hom-collection is then in canonical bijection with the corresponding collection of untagged maps, so no size or smallness claim is affected.
Remarks
Class-sized category theory in ZFC: definable-class schemas, small and locally small categories, and why is not formed gives contextual discussion of the convention used here.