Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedprecheck passaudited 2026-08-13
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.

Baer's criterion for injective modules

Statement

Assume the Axiom of Choice. A left R-module I is injective if and only if every homomorphism f:J→I from a left ideal J≤R extends to a homomorphism R→I.

The forward implication is choice-free. The converse uses AC through Zorn's lemma.

Facts & Assumptions

Given: A unital ring R and a left R-module I.

[F1]

Injectivity is extension of homomorphisms along every module monomorphism (Injective modules and the extension property).

[L1]

Under AC, every nonempty poset in which every chain has an upper bound has a maximal element (Zorn's lemma, The Axiom of Choice).

Proof

technique · direct
1.1

If I is injective, apply [F1] to the inclusion of any left ideal J↪R to extend each J→I to R→I.

assume-hypF1
1.2

Conversely, assume the ideal-extension condition. Given a submodule N≤M and a homomorphism f:N→I, let P be the poset of extensions (N′,f′) with N≤N′≤M, ordered by further extension. It is nonempty because (N,f)∈P.

assume-hypconstruct
2.1

The union of a chain of compatible extensions is a submodule and carries the unique map agreeing with every map in the chain, so it is an upper bound. By [L1], choose a maximal extension (N0,f0).

step 1.2L1choose
3.1

If N0≠M, choose x∈M∖N0 and put J={r∈R:rx∈N0}, a left ideal. The map h:J→I, h(r)=f0(rx), is R-linear and by hypothesis extends to H:R→I. Put y=H(1).

step 2.1chooseconstruct
4.1

Define f1:N0+Rx→I by f1(n+rx)=f0(n)+ry. If n+rx=n′+r′x, then (r−r′)x=n′−n∈N0, so r−r′∈J and f0(n′−n)=H(r−r′)=(r−r′)y; hence the formula is well defined. It is linear and extends f0.

step 3.1algebraconstruct
5.1

Since x∉N0, the domain N0+Rx strictly contains N0, contradicting maximality. Thus N0=M, so f extends to M and I is injective by [F1].

step 2.1step 3.1step 4.1F1
6.1

Steps 1.1 and 5.1 prove both directions, with Zorn used only in the converse.

step 1.1step 5.1∎

Depends on

Used by

Dependency tree · two levels

11 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