Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01
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.

Complete Nakayama lemma

Statement

Assume the Axiom of Dependent Choice.

Let R be a commutative ring, let I⊆R be an ideal, and let M be an R-module. Assume that R is I-adically complete and that M is I-adically separated.

If m1,…,mr∈M have images that generate M/IM as an R/I-module, then m1,…,mr generate M as an R-module.

Facts & Assumptions

Given: A commutative ring R, an ideal I⊆R, an R-module M with R I-adically complete and M I-adically separated, and elements m1,…,mr∈M whose classes generate M/IM.

[L1]

An I-adically complete module is identified with the inverse limit of its quotients, and separated means ⋂n≥0InM=0 (Separated and complete filtered modules).

Proof

technique · direct
1.1givenchoose

Let N:=Rm1+⋯+Rmr. We prove M=N. Fix x∈M. Since the classes of the mi generate M/IM, choose coefficients ai,0∈R and an element x1∈IM such that x=∑i=1rai,0mi+x1.

2.1step 1.1choose

Suppose xn∈InM has been constructed. Because multiplication by elements of In shows that the classes of the mi also generate InM/In+1M, choose coefficients ai,n∈In and xn+1∈In+1M such that xn=∑i=1rai,nmi+xn+1. Inductively, for every N≥0, x=∑n=0N∑i=1rai,nmi+xN+1 with xN+1∈IN+1M.

3.1L1step 2.1choose

For each i, the partial sums Ai,N:=∑n=0Nai,n form a Cauchy sequence in the I-adic topology on R, because Ai,N′−Ai,N∈IN+1 for N′≥N. Since R is complete, there is Ai∈R with Ai−Ai,N∈IN+1 for every N.

4.1L1step 2.1step 3.1algebra

Set y:=∑i=1rAimi∈N. Using the identity in step 2.1, x−y=(x−∑i=1rAi,Nmi)−∑i=1r(Ai−Ai,N)mi. The first term lies in IN+1M because it equals xN+1, and the second term also lies in IN+1M because each Ai−Ai,N∈IN+1. Hence x−y∈IN+1M for every N. By separatedness and [L1], x−y∈⋂N≥0IN+1M=0, so x=y∈N.

5.1step 4.1∎

Since every x∈M lies in N, one has M=N, so m1,…,mr generate M.

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