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: The Axiom of Choice and a locally small Grothendieck category .
AC supplies the cardinality of the set of subobjects of , lets us fix representatives for those subobjects once, and is a hypothesis of the successor-aleph regularity result (The Axiom of Choice).
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).
Under AC, every successor aleph is regular ( is regular in ZF; assuming the Axiom of Choice every successor aleph is regular; , so is singular, and under choice it is the least singular infinite cardinal).
Every infinite cardinal is an aleph (Every infinite cardinal is for exactly one ordinal , in ZF; and, assuming the Axiom of Choice, every infinite set is equinumerous with exactly one aleph).
Proof
By [L1], fix a generator and, using [A1], fix representatives of its subobjects once for the functor [L3]. The set of these subobjects has a cardinality under [A1]; composition with bounds the number of subobjects of every by . Put ; by [L8], write , and set . The successor aleph exists and [A1, L7] give . This choice of depends on , not on .
For any object , iterate the fixed functor [L3] to the common ordinal from step 1.1. By [L4, L5], every transition map is monic, so is monic. Since is a limit ordinal and its cofinality exceeds , [L6] makes injective. The same fixed representative set and ordinal work for every ; successor-stage functoriality and the universal property of limit-stage colimits therefore make a functor and 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
- The Axiom of Choice
- Every infinite cardinal is $\aleph_\alpha$ for exactly one ordinal $\alpha$, in ZF; and, assuming the Axiom of Choice, every infinite set is equinumerous with exactly one aleph
- $\aleph_0$ is regular in ZF; assuming the Axiom of Choice every successor aleph $\aleph_{\alpha+1}$ is regular; $\operatorname{cf}(\aleph_\omega) = \aleph_0$, so $\aleph_\omega$ is singular, and under choice it is the least singular infinite cardinal
Used by
Dependency tree · two levels
43 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)