Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 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.

Sets and functions form the large locally small category Set

Statement

Sets as objects and functions as morphisms form a large locally small category Set.

Facts & Assumptions

Given: Sets A,B,C and functions f:A→B, g:B→C.

[L1]

A category has associative composition and an identity at every object, and when it is presented by its hom-collections a morphism is the triple (A,B,f), so that dom⁡ and cod⁡ are the projections (Category, object, morphism, domain, codomain, identity, composition, and hom-collection); a function is a set of ordered pairs with a set domain and a uniquely determined value at each point of it, and does not itself 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); the functions A→B form the set BA (The set BA of all functions A→B).

[L2]

Small, locally small, and large have the meanings in Small, locally small, and large categories, and the ordinals do not form a set (Burali-Forti: there is no set of all ordinals).

Proof

technique · direct
1.1

Identity functions are functions, composites of functions are functions, function composition is associative, and 1B∘f=f=f∘1A.

givenL1
2.1

Hence sets and functions satisfy every axiom of a category.

step 1.1L1
3.1

For fixed A,B, the hom-collection is {(A,B,f):f∈BA}, a set in bijection with the set BA from [L1]; the tagging is what gives each morphism a unique codomain, since the empty function alone would be a morphism into every set. The object class contains every ordinal and therefore is not a set, so Set is locally small and large.

step 2.1L1L2∎

Depends on

Used by

…and 30 more results.

Dependency tree · two levels

15 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