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.

The opposite of a preadditive category is preadditive

Statement

If C is preadditive, then the opposite category Cop is preadditive.

Facts & Assumptions

Given: A preadditive category C.

[L1]

The opposite category has the same objects and the same hom-sets, with composition reversed (Opposite category Cop).

[L2]

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

Proof

technique · direct
1.1L1L2

By [L1], for objects A,B the hom-set Cop(A,B)=C(B,A) already carries the abelian group structure given by [L2].

1.2L1L2

Let f,g:B→A in C and let h:C→B, k:A→D. In Cop the corresponding arrows are fop,gop:A→B, hop:B→C, and kop:D→A. The inherited addition satisfies fop+gop=(f+g)op. Reversing composition and applying bilinearity gives hop∘(fop+gop)=((f+g)∘h)op=(f∘h+g∘h)op=hop∘fop+hop∘gop. Every arrow in this equality goes from A to C in the opposite category. Similarly, (fop+gop)∘kop=(k∘(f+g))op=(k∘f+k∘g)op=fop∘kop+gop∘kop, with every arrow going from D to B. These are the two required distributive laws.

2.1step 1.1step 1.2L2∎

Thus Cop has abelian-group hom-sets and bilinear composition, so it is preadditive.

Depends on

Used by

Dependency tree · two levels

3 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