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 semiadditive category is preadditive exactly when every morphism has an additive inverse
Statement
A semiadditive category is preadditive if and only if every morphism has an additive inverse for the canonical commutative-monoid law on its hom-set.
Facts & Assumptions
Given: A semiadditive category .
A semiadditive category has finite biproducts and therefore a canonical commutative-monoid enrichment with bilinear composition (Semiadditive category).
A preadditive category is exactly a category whose hom-sets are abelian groups and whose composition is bilinear (Preadditive category).
A bilinear commutative-monoid enrichment compatible with fixed finite biproducts is unique (The commutative-monoid enrichment of a category with finite biproducts is unique).
Proof
Assume is preadditive. [L2, L3] For parallel , product uniqueness gives , and bilinearity gives . Thus the hom-group addition is compatible with the biproduct diagrams and equals the canonical law by [L3]. Every hom-set is an abelian group by [L2], so every morphism has an inverse for the canonical law.
Conversely, assume every morphism in has an additive inverse for the commutative-monoid law from [L1]. Then every hom-set is a commutative monoid in which each element has an inverse, hence an abelian group. The bilinearity of composition is already part of [L1].
Therefore the hom-sets are abelian groups with bilinear composition exactly when every morphism has an additive inverse, which is the definition of preadditivity in [L2].
Depends on
Used by
- Commutative monoids are semiadditive and not additive Counterexample
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
- Saunders Mac Lane, Categories for the Working Mathematician, VIII.2, Exercise 2.4 (standard reference, not scraped)
- Peter Freyd, Abelian Categories, Exercise 2A.2 (standard reference, not scraped)