Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 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.

Finite modules over complete Noetherian rings are complete

Statement

Assume the Axiom of Choice.

Let R be a Noetherian commutative ring, let I⊆R be an ideal, and assume that R is I-adically complete. Then every finitely generated R-module M is I-adically complete.

Facts & Assumptions

Given: A Noetherian commutative ring R, an ideal I⊆R, and a finitely generated R-module M, with R I-adically complete.

[L1]

Completion of a finite module is extension of scalars: M⊗RR^→∼M^ (Completion of a finite module is extension of scalars).

[L2]

An I-adically complete ring is identified with its own completion (Separated and complete filtered modules, The I-adic completion of a module).

Proof

technique · direct
1.1L2algebra

Since R is I-adically complete, [L2] gives an isomorphism κR ⁣:R→∼R^. Tensoring with the finite module M yields an isomorphism M⊗RR→∼M⊗RR^. Using the unit isomorphism M⊗RR≅M, we get an isomorphism M→∼M⊗RR^.

2.1L1step 1.1∎

Composing the isomorphism of step 1.1 with [L1] gives an isomorphism M→∼M^. By construction this composite sends m to the compatible residue class system (m mod InM)n, so it is exactly the completion map κM. Therefore κM is an isomorphism and M is I-adically complete.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 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