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.
Grothendieck abelian categories have functorial injective embeddings
Statement
Assume the Axiom of Choice.
Every locally small Grothendieck abelian category admits a functorial monomorphism from each object into an injective object.
Facts & Assumptions
Given: A locally small Grothendieck category .
A Grothendieck category is an abelian category with AB5 and a generator (Grothendieck category).
Injectivity is detected by extension from subobjects of the fixed generator (Extension from subobjects of a generator detects injectivity).
The one-step generator extension is a functor (The one-step generator extension functor).
Its structure maps are functorial monomorphisms (The one-step generator map is a functorial monomorphism).
Transfinite iteration preserves monomorphisms and factorizes maps from generator-subobjects at a sufficiently large limit stage (Transfinite iteration of the generator extension preserves monomorphisms and factorizes small-source maps).
A sufficiently long iteration is injective (A sufficiently long generator-extension iteration is injective).
Proof
By [L1], fix a generator . For any object , iterate the functor [L3] transfinitely: By [L4] and [L5], every transition map is monic, so the composite is a monomorphism for every limit stage .
Choose a limit stage as in [L5]. Then [L6] makes injective. Because [L3] is functorial at successor stages and colimits preserve that functoriality at limit stages, the assignment is a functor, and the composite is natural.
Writing , the maps give functorial injective embeddings. The detecting lemma [L2] is the reason the transfinite construction closes at stage .
Depends on
- Grothendieck category
- Extension from subobjects of a generator detects injectivity
- The one-step generator extension functor
- The one-step generator map is a functorial monomorphism
- Transfinite iteration of the generator extension preserves monomorphisms and factorizes small-source maps
- A sufficiently long generator-extension iteration is injective
Used by
Dependency tree · two levels
15 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)