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 be a Noetherian commutative ring, let be an ideal, and let be a finitely generated -module. Then the canonical -linear map is an isomorphism.
Facts & Assumptions
Given: A Noetherian commutative ring , an ideal , and a finitely generated -module .
Completion is exact on finitely generated modules over a Noetherian ring (Adic completion is exact on finite modules over a Noetherian ring).
Tensor products are right exact (Tensoring is right exact).
For every module , the canonical map is an isomorphism, and tensor products commute with finite direct sums (The regular module is a tensor unit: and ).
Proof
If , then by [L3], and this is exactly . Therefore is an isomorphism.
Choose an exact sequence with and finite free. Tensoring with and using [L2] gives an exact row Completing the exact sequence and using [L1] gives another exact row
Since tensor products commute with finite direct sums by [L3], the same is true for finite free modules: Thus is an isomorphism for every finite free module . In particular, and are isomorphisms in step 1.2.
The maps , , and 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 as cokernels of isomorphic maps. Therefore is an isomorphism.
So the completion of a finite module is obtained by extension of scalars from to .
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
- A. Altman and S. Kleiman, A Term of Commutative Algebra, 13th ed., Corollary 22.20 (standard reference, not scraped)
- J. S. Milne, A Primer of Commutative Algebra, Proposition 24.5 (standard reference, not scraped)