Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 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 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 C consists of a class Ob⁡(C) of objects, a class Mor⁡(C) of morphisms, functions dom⁡,cod⁡:Mor⁡(C)→Ob⁡(C), an identity morphism 1A:A→A for every object A, and a composite g∘f:A→C whenever f:A→B and g:B→C.

These data satisfy, whenever the composites are defined,

h∘(g∘f)=(h∘g)∘f,1B∘f=f=f∘1A.

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

…and 32 more results.

Dependency tree · two levels

7 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources