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 one-step generator map is a functorial monomorphism
Statement
In a locally small Grothendieck category, for the one-step generator extension functor , the canonical map is a monomorphism, natural in . In addition, every indexed map from a subobject extends to a map one stage later.
Facts & Assumptions
Given: An object in a locally small Grothendieck category with fixed generator .
In a locally small Grothendieck category, the one-step generator extension is defined by a pushout over the set of subobjects of and maps into (The one-step generator extension functor).
Pushouts of monomorphisms are monomorphisms in an abelian category (The pushout of a monomorphism is a monomorphism).
AB5 implies AB4, so every small coproduct of monomorphisms in a Grothendieck category is monic (AB5 implies AB4).
Proof
In the defining pushout square of [L1], the left vertical map is the coproduct of the subobject inclusions , hence is monic by [L3]. Therefore the induced map is monic by [L2]. For every , the morphism supplied by [L1] is the map of pushouts induced by , so Thus the monomorphisms are natural in .
For each , let be the lower pushout map restricted to the corresponding summand. Commutativity of the defining square gives Hence every indexed map extends across after one application of .
Hence is a functorial monomorphism and every indexed generator-subobject map extends after one application of .
Depends on
Used by
Dependency tree · two levels
11 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 19.11: Injectives in Grothendieck categories (standard reference, not scraped)
- Romyar Sharifi, Homological Algebra (standard reference, not scraped)