Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)audited 2026-08-28 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The axioms AB5 and AB5*

Definition

First fix the small-family operations used below. In an AB3 abelian category, the join of a small family (BiA)iI is the image of the induced morphism

iIBiA.

In an AB3* abelian category, let qi:AA/Bi be the quotient maps (The quotient of an object by a subobject). The meet of the family is the kernel of the induced morphism

AiIA/Bi.

These constructions have the claimed order properties. Indeed, each component BiA factors through the image of iBiA, while any common upper bound receives the coproduct map; image minimality (The image is the least subobject through which a morphism factors) therefore makes that image the least upper bound. Dually, the displayed kernel lies in every Bi because BiA is the kernel of qi (Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel), and every common lower bound is killed by every qi, hence by the product map, so it factors through the displayed kernel. Thus that kernel is the greatest lower bound. For a two-member family these constructions agree with the binary operations of The subobjects of an object in an abelian category form a lattice. The empty join is 0 and the empty meet is A.

An abelian category satisfies AB5 when it satisfies AB3 and for every small directed family of subobjects (Bi) of an object A and every subobject CA one has

(iBi)C=i(BiC).

It satisfies AB5* when it satisfies AB3* and for every small decreasing family of subobjects (Bi) of an object A and every subobject CA one has

(iBi)C=i(BiC).

The joins and meets in these formulas are the small-family constructions above.

Depends on

Used by

Dependency tree · two levels

21 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