Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27
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.

In a preadditive category, an object is initial exactly when it is terminal

Statement

In a preadditive category, an object is initial if and only if it is terminal.

Facts & Assumptions

Given: A preadditive category C and an object Z of C.

[L1]

In a preadditive category every hom-set is an abelian group and composition is bilinear (Preadditive category).

[L2]

An initial object has a unique map out of it, and a terminal object has a unique map into it (Initial object, terminal object, and zero object).

Proof

technique · direct
1.1

Assume Z is initial. Then C(Z,Z) has exactly one element by [L2], so its identity morphism and its additive zero coincide. Hence 1Z=0Z,Z.

L1L2
2.1

Let f:AZ. Using step 1.1, f=1Zf=0Z,Zf. By bilinearity from [L1], the right-hand side is the zero element of C(A,Z). Thus every morphism AZ equals the same zero arrow, so there is exactly one such morphism and Z is terminal.

L1L2step 1.1
2.2

The same argument with arrows reversed shows that a terminal object is initial: if Z is terminal then C(Z,Z) again has one element, so 1Z=0Z,Z, and for any g:ZA one has g=g1Z=g0Z,Z=0. Hence there is exactly one map from Z to A.

L1L2step 1.1
3.1

Steps 2.1 and 2.2 prove the two implications, so initial and terminal are equivalent in a preadditive category.

step 2.1step 2.2

Depends on

Used by

Dependency tree · two levels

4 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