Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-28
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.

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 (Bi↣A)i∈I is the image of the induced morphism

∐i∈IBi⟶A.

In an AB3* abelian category, let qi:A→A/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

A⟶∏i∈IA/Bi.

These constructions have the claimed order properties. Indeed, each component Bi→A factors through the image of ∐iBi→A, 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 Bi↣A 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 C≤A one has

(⋁iBi)∧C=⋁i(Bi∧C).

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

(⋀iBi)∨C=⋀i(Bi∨C).

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

Depends on

Dependency tree · 2 levels

Sources