Alphabeta Math
LemmaStatement: 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.

Extension from subobjects of a generator detects injectivity

Statement

Assume the Axiom of Choice.

Let A be a locally small Grothendieck category with a generator U, and let I be an object. If every morphism NI from every subobject NU extends to a morphism UI, then I is injective.

Facts & Assumptions

Given: A locally small Grothendieck category with a generator U and an object I satisfying the extension property for every subobject NU.

[L1]

In an abelian category, if a subobject AB is proper, then some morphism from the generator into B factors through B but not through A (A generator detects comparison of subobjects).

[L2]

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

[L3]

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

[L4]

Injective objects are exactly those extending morphisms across monomorphisms (Injective object).

[L5]

Zorn's lemma supplies maximal elements once every chain has an upper bound (Zorn's lemma).

Proof

technique · direct
1.1

To extend a map AI across a monomorphism AB, consider the set of pairs (A,u) with AAB a subobject and u:AI extending the original map. By [L3], the subobjects AB form a set up to equivalence, and local smallness makes the morphisms AI a set, so this collection is a set. Order it by inclusion of subobjects.

L3givenalgebra
2.1

If T is a chain of such partial extensions, let A be the union of the subobjects in that chain inside B. Because [L2] gives AB5, this filtered colimit is again a subobject of B, and the compatible maps in the chain induce a morphism u:AI extending the original map. Thus every chain has an upper bound.

L2step 1.1algebra
3.1

By [L5], choose a maximal partial extension (Amax,umax).

L5step 2.1choose
4.1

Suppose AmaxB. By [L1], there exists a morphism ψ:UB that does not factor through Amax. Let B0=im(ψ), let N=AmaxB0 inside B, and let M=ψ1(N)U. The composite MNAmaxumaxI extends by hypothesis to a morphism χ:UI.

L1step 3.1givenchoosealgebra
5.1

Because ker(ψ)M, the map χ vanishes on ker(ψ) and therefore factors through B0=im(ψ); write the factor map as u0:B0I. The maps umax:AmaxI and u0:B0I agree on N=AmaxB0, so they glue to a map Amax+B0I extending umax. Since ψ does not factor through Amax, the subobject Amax+B0 is strictly larger than Amax, contradicting maximality. Therefore Amax=B.

step 4.1algebra
6.1

Every map across a monomorphism extends, so I is injective by [L4].

L4step 5.1

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