Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-09-29
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 ηM:M↣E(M) from each object into an injective object.

Facts & Assumptions

Given: The Axiom of Choice and a locally small Grothendieck category A.

[A1]

AC supplies the cardinality of the set of subobjects of U, lets us fix representatives for those subobjects once, and is a hypothesis of the successor-aleph regularity result (The Axiom of Choice).

[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.1L1L7L8A1construct

By [L1], fix a generator U 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 N↣U bounds the number of subobjects of every N⊆U by κ. Put ν=max⁡(κ,ℵ0); by [L8], write ν=ℵα, and set λ=ℵα+1. The successor aleph exists and [A1, L7] give cf⁡(λ)=λ>κ. This choice of λ depends on U, not on M.

2.1L3L4L5L6step 1.1construct

For any object M, iterate the fixed functor [L3] to the common ordinal λ from step 1.1. By [L4, L5], every transition map is monic, so M→Mλ is monic. Since λ is a limit ordinal and its cofinality exceeds κ, [L6] makes Mλ injective. The same fixed representative set and ordinal work for every M; successor-stage functoriality and the universal property of limit-stage colimits therefore make M↦Mλ a functor and M→Mλ natural.

3.1L2step 2.1∎

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

Depends on

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