Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passaudited 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.

Biproduct data characterisation without addition

Statement

Let a category with zero morphisms contain a finite family (Ai)iI and an object B such that (B,ιi) is a coproduct and (B,pi) is a product. Let c:BB be the canonical comparison determined by these supplied structures. Then c=1B if and only if

pjιi={1Ai,i=j,0Ai,Aj,ij.

Facts & Assumptions

Given: A finite family (Ai)iI with maps ιi:AiB and pi:BAi in a category with zero morphisms.

[L1]

A biproduct is a coproduct and a product whose canonical comparison is an isomorphism (Biproduct).

Proof

technique · direct
1.1

If c=1B, then the defining equations pjcιi=δij for the canonical comparison immediately give the displayed zero equations for pjιi.

L1L2given
1.2

Conversely, assume the displayed equations hold. For every i,j, the definition of c and the assumed equations give pjcιi=pjιi. Therefore cιi=ιi by the product universal property. Since the ιi form a coproduct, c=1B. The supplied structures therefore form the normalized biproduct diagram of Biproduct.

L1L2
2.1

Steps 1.1 and 1.2 prove the equivalence. No addition on hom-sets was used anywhere; only the given zero morphisms and the product-coproduct universal properties entered.

step 1.1step 1.2given

Depends on

Used by

Dependency tree · two levels

5 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