Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-16
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.

Subobjects and quotient objects form oppositely oriented partially ordered collections

Statement

Fix an object C of a category C. For monomorphisms m,n into C put [m][n]m factors through n, and for epimorphisms q,r out of C put the dual orientation [q][r]r factors through q. Each relation depends only on the mutual-factorisation classes of its two arguments, and each is reflexive, transitive, and antisymmetric in the sense that [m][n] together with [n][m] forces [m]=[n], and likewise for quotients.

Those four properties are the whole content, and they are what the phrase partially ordered collection abbreviates here. They are asserted of a relation between representatives, not of a set: a subobject is a class rather than a set under this development's convention (Class-sized category theory in ZFC: definable-class schemas, small and locally small categories, and why CAT is not formed), so nothing below gathers the subobjects of C into a collection. Along any set of monomorphisms into C carrying exactly one representative of each class, the relation descends to an ordinary partial order on that set (Partial order and partially ordered set); the later size hypotheses on this page are what produce such a set.

Facts & Assumptions

Given: The subobject and quotient-object equivalence classes of an object C.

[L1]

Mutually factoring monomorphisms, and dually epimorphisms, determine the same class through unique inverse factor maps (Mutual factorisation is an equivalence relation on monomorphisms into an object and dually on epimorphisms out of it).

[L2]

A partial order on a set P is a binary relation that is reflexive, antisymmetric, and transitive (Partial order and partially ordered set). The cited definition is stated for a set, and this item does not claim its hypothesis: what is verified below are those same three conditions, clause by clause, for the factorisation relation between representatives of a fixed object's subobject and quotient-object classes. The cited definition applies verbatim only once a set of representatives is in hand.

Proof

technique · direct
1.1

If m=ma and m=ma represent the same subobject, and similarly n and n, then any factorisation m=nu transports by composition to a factorisation of m through n, and conversely. Thus the relation is independent of representatives by [L1].

L1
2.1

Identity factorisations give reflexivity and composites give transitivity. If [m][n] and [n][m], then the representatives mutually factor, so [L1] makes their classes equal. The subobject relation is therefore reflexive, transitive and antisymmetric — the three conditions [L2] names — and by step 1.1 each is a statement about the classes rather than about chosen representatives.

step 1.1L1L2
3.1

For quotient representatives the same argument is dual, but the order is reversed because [q][r] means that r factors through q. Reflexivity, transitivity, and antisymmetry follow by the epic half of [L1].

step 2.1L1L2
4.1

Nothing in steps 1.1--3.1 quantifies over a collection whose members are subobjects: each is a statement about monomorphisms into C and about the factorisation relation between them, which is what the bracket notation abbreviates. Restricting that relation to a set of monomorphisms into C carrying one representative per class therefore gives a relation on a set satisfying the three conditions of [L2], hence a partial order there.

step 1.1step 2.1step 3.1L2

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 16 results over 11 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