Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)audited 2026-08-11
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 Class-sized category theory in ZFC: definable-class schemas, small and locally small categories, and why CAT\mathbf{CAT} is not formed, 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 C\mathcal C consists of a class Ob(C)\operatorname{Ob}(\mathcal C) of objects, a class Mor(C)\operatorname{Mor}(\mathcal C) of morphisms, functions dom,cod:Mor(C)Ob(C)\operatorname{dom},\operatorname{cod}:\operatorname{Mor}(\mathcal C)\to \operatorname{Ob}(\mathcal C), an identity morphism 1A:AA1_A:A\to A for every object AA, and a composite gf:ACg\circ f:A\to C whenever f:ABf:A\to B and g:BCg:B\to C.

These data satisfy, whenever the composites are defined,

h(gf)=(hg)f,1Bf=f=f1A.h\circ(g\circ f)=(h\circ g)\circ f,\qquad 1_B\circ f=f=f\circ1_A.

We write C(A,B)\mathcal C(A,B), or HomC(A,B)\operatorname{Hom}_{\mathcal C}(A,B), for the hom-collection of morphisms with domain AA and codomain BB. 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 AA to BB are for each pair of objects. When it is, Mor(C)\operatorname{Mor}(\mathcal C) is the disjoint union of those hom-collections: a morphism is a triple (A,B,f)(A,B,f) with ff in the collection assigned to (A,B)(A,B), and dom\operatorname{dom} and cod\operatorname{cod} 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 ff with (a,b)f(a,b) \in f and (a,c)f(a,c) \in f implying b=cb = c; f:ABf : A \to B, the value f(a)f(a), domain and codomain), so the empty function is a function B\varnothing\to B for every BB at once; reading the morphisms of Set\mathbf{Set} as bare functions would give that one set two different codomains and leave cod\operatorname{cod} 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.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 25 results over 8 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources