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.

Completion of a finite module is extension of scalars

Statement

Assume the Axiom of Choice.

Let R be a Noetherian commutative ring, let IR be an ideal, and let M be a finitely generated R-module. Then the canonical R-linear map θM ⁣:MRR^M^,m(rn)n(mrnmodInM)n, is an isomorphism.

Facts & Assumptions

Given: A Noetherian commutative ring R, an ideal IR, and a finitely generated R-module M.

[L1]

Completion is exact on finitely generated modules over a Noetherian ring (Adic completion is exact on finite modules over a Noetherian ring).

[L2]

Tensor products are right exact (Tensoring is right exact).

[L3]

For every module N, the canonical map NRRN is an isomorphism, and tensor products commute with finite direct sums (The regular module is a tensor unit: RRNN and MRRM).

Proof

technique · direct
1.1

If M=R, then RRR^R^ by [L3], and this is exactly θR. Therefore θR is an isomorphism.

L3
1.2

Choose an exact sequence F1uF0M0 with F0 and F1 finite free. Tensoring with R^ and using [L2] gives an exact row F1RR^u1F0RR^MRR^0. Completing the exact sequence F1uF0M0 and using [L1] gives another exact row F1^u^F0^M^0.

L1L2choose
2.1

Since tensor products commute with finite direct sums by [L3], the same is true for finite free modules: RmRR^R^mRm^. Thus θF is an isomorphism for every finite free module F. In particular, θF0 and θF1 are isomorphisms in step 1.2.

step 1.1L3
3.1

The maps θF1, θF0, and θM form a commutative diagram between the two exact rows of step 1.2. Since the first two vertical maps are isomorphisms by step 2.1, the two rows present MRR^andM^ as cokernels of isomorphic maps. Therefore θM is an isomorphism.

step 1.2step 2.1
4.1

So the completion of a finite module is obtained by extension of scalars from R to R^.

step 3.1

Depends on

Used by

Dependency tree · two levels

20 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