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.
Hom functors on a preadditive category are left exact
Statement
Let be a preadditive category and an object of . Then the covariant hom-functor and the contravariant hom-functor preserve every existing finite limit. In particular, they are left exact.
Facts & Assumptions
Given: A preadditive category and an object .
In a preadditive category, the hom-functors take values in abelian groups (The hom-bifunctor of a preadditive category takes values in abelian groups).
Every covariantly representable functor to preserves all existing small limits (Every covariantly representable functor to Set preserves all existing small limits).
The opposite of a preadditive category is preadditive (The opposite of a preadditive category is preadditive).
Proof
The underlying Set-valued functor of is covariantly representable, so [L2] says it preserves every existing small limit and hence every existing finite limit. By [L1], its values and structure maps already lie in , so this is exactly left exactness as an -valued functor.
By [L3], the opposite category is again preadditive. The contravariant hom-functor is the covariantly representable functor , so [L2] applied in gives the same finite-limit preservation there. Again [L1] says its values lie in .
Therefore both hom-functors are left exact. This is the representable-functor theorem applied once in and once in , with no separate elementwise exactness computation.
Depends on
Used by
Dependency tree · two levels
12 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
- The Stacks Project, Section 12.3: Preadditive and additive categories (standard reference, not scraped)