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.
Extension from subobjects of a generator detects injectivity
Statement
Assume the Axiom of Choice.
Let be a locally small Grothendieck category with a generator , and let be an object. If every morphism from every subobject extends to a morphism , then is injective.
Facts & Assumptions
Given: A locally small Grothendieck category with a generator and an object satisfying the extension property for every subobject .
In an abelian category, if a subobject is proper, then some morphism from the generator into factors through but not through (A generator detects comparison of subobjects).
A Grothendieck category is an abelian category with AB5 and a generator (Grothendieck category).
In a locally small abelian category with a generator, every object has only a set of subobjects up to equivalence (An AB3 locally small abelian category with a generator is well-powered).
Injective objects are exactly those extending morphisms across monomorphisms (Injective object).
Zorn's lemma supplies maximal elements once every chain has an upper bound (Zorn's lemma).
Proof
To extend a map across a monomorphism , consider the set of pairs with a subobject and extending the original map. By [L3], the subobjects form a set up to equivalence, and local smallness makes the morphisms a set, so this collection is a set. Order it by inclusion of subobjects.
If is a chain of such partial extensions, let be the union of the subobjects in that chain inside . Because [L2] gives AB5, this filtered colimit is again a subobject of , and the compatible maps in the chain induce a morphism extending the original map. Thus every chain has an upper bound.
By [L5], choose a maximal partial extension .
Suppose . By [L1], there exists a morphism that does not factor through . Let , let inside , and let . The composite extends by hypothesis to a morphism .
Because , the map vanishes on and therefore factors through ; write the factor map as . The maps and agree on , so they glue to a map extending . Since does not factor through , the subobject is strictly larger than , contradicting maximality. Therefore .
Every map across a monomorphism extends, so is injective by [L4].
Depends on
Used by
Dependency tree · two levels
19 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)