Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 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.

A small product of abelian categories is abelian

Statement

Every set-indexed product of abelian categories is abelian. In particular, the empty product category is abelian.

Facts & Assumptions

Given: A set-indexed family (Ai)iI of abelian categories.

[L1]

A small product of preadditive categories is preadditive (A small product of preadditive categories is preadditive).

[L2]

Abelian categories are additive and compute kernels, cokernels, and coimage-image comparison maps internally (Abelian category).

Proof

technique · direct
1.1

By [L1], the product category iIAi is preadditive. If I=, this product has one object and one morphism, which is simultaneously zero and identity, so it is already an abelian zero category. For nonempty I, the zero object, finite biproducts, kernels, cokernels, and canonical coimage-image maps are all computed coordinatewise from the corresponding structures in each factor from [L2].

L1L2
2.1

Therefore the product category is additive and satisfies the AB1 and AB2 clauses coordinatewise. So every small product of abelian categories is abelian.

L2step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

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