Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-09-01 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Grothendieck abelian categories have functorial injective embeddings

Statement

Assume the Axiom of Choice.

Every locally small Grothendieck abelian category admits a functorial monomorphism ηM:ME(M) from each object into an injective object.

Facts & Assumptions

Given: A locally small Grothendieck category A.

[L1]

A Grothendieck category is an abelian category with AB5 and a generator (Grothendieck category).

[L2]

Injectivity is detected by extension from subobjects of the fixed generator (Extension from subobjects of a generator detects injectivity).

[L3]

The one-step generator extension is a functor (The one-step generator extension functor).

[L4]

Its structure maps are functorial monomorphisms (The one-step generator map is a functorial monomorphism).

[L5]

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).

[L6]

A sufficiently long iteration is injective (A sufficiently long generator-extension iteration is injective).

Proof

technique · direct
1.1

By [L1], fix a generator U. For any object M, iterate the functor [L3] transfinitely: M=M0M1M2. By [L4] and [L5], every transition map is monic, so the composite MMλ is a monomorphism for every limit stage λ.

L1L3L4L5construct
2.1

Choose a limit stage λ as in [L5]. Then [L6] makes Mλ injective. Because [L3] is functorial at successor stages and colimits preserve that functoriality at limit stages, the assignment MMλ is a functor, and the composite MMλ is natural.

L5L6step 1.1choose
3.1

Writing E(M):=Mλ, the maps ηM:ME(M) give functorial injective embeddings. The detecting lemma [L2] is the reason the transfinite construction closes at stage λ.

L2step 2.1

Depends on

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