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.

Kernel and universal property of adic completion

Statement

Let R be a commutative ring, let I⊆R be an ideal, and let M be an R-module.

  1. The kernel of the completion map κM ⁣:M→M^ is ⋂n≥0InM. In particular, κM is injective exactly when M is I-adically separated.
  2. If N is an I-adically complete R-module, then every R-linear map f ⁣:M→N factors uniquely through κM by a continuous map when N has its I-adic topology and M^ has the inverse-limit topology whose basic neighbourhoods of 0 are Kn:=ker⁡(M^→M/InM)(n≥1). Thus there is a unique continuous R-linear map f^ ⁣:M^→N with f^∘κM=f.

Facts & Assumptions

Given: A commutative ring R, an ideal I⊆R, an R-module M, and for part 2 an I-adically complete R-module N together with an R-linear map f ⁣:M→N.

[L1]

The I-adic completion is M^=lim←⁡M/InM with completion map m↦(m mod InM)n (The I-adic completion of a module).

[L2]

An I-adically complete module is separated and its canonical map to the inverse limit of its quotients is an isomorphism (Separated and complete filtered modules).

[L3]

The I-adic topology has the submodules InN as a neighbourhood basis of 0 (The I-adic topology on a module).

[L4]

Compatible maps into an inverse limit factor uniquely through it (Universal property of an inverse limit of modules).

Proof

technique · direct
1.1L1L4

The completion map κM is the unique map into the inverse limit of [L1] whose nth component, for n≥1, is the quotient map qn ⁣:M→M/InM.

1.2L1algebra

An element lies in ker⁡(κM) exactly when every quotient map qn, n≥1, kills it, equivalently when it belongs to every InM for n≥1. Since I0M=M, this gives ker⁡(κM)=⋂n≥1InM=⋂n≥0InM.

1.3givenalgebra

Let f ⁣:M→N be R-linear with N complete. Since f is R-linear, one has f(InM)⊆InN for every n≥1, so f induces maps fn ⁣:M/InM→N/InN. These maps are compatible with the quotient transition maps.

1.4L1L4

By [L4], the compatible family (fn) yields a unique map f~ ⁣:M^→lim←⁡N/InN such that the nth projection of f~κM is fnqn. These are also the coordinates of κNf, so uniqueness in [L4] gives f~κM=κNf.

1.5L2L3choosealgebra

The image of κM is dense for the inverse-limit topology. Indeed, for x∈M^ and n≥1, choose m∈M representing πnM(x)∈M/InM; then x−κM(m)∈Kn. Now let g:M^→N be continuous and vanish on κM(M). If g(x)≠0, separatedness of N from [L2] gives n with g(x)∉InN. The inverse image g−1(g(x)+InN) is an open neighbourhood of x by [L3], so density gives some κM(m) in it. But gκM(m)=0, which would put g(x) in InN, a contradiction. Hence g=0. Applying this to the difference of two continuous extensions proves uniqueness.

2.1step 1.2L2

The last equality shows that κM is injective exactly when ⋂n≥0InM=0, which is exactly the definition of being I-adically separated.

2.2L2L3step 1.4algebra

Write πnM:M^→M/InM and πnN:lim←⁡N/InN→N/InN. Step 1.4 gives πnNf~=fnπnM, so f~(Kn)⊆ker⁡(πnN) for every n≥1. Hence f~ is continuous for the two inverse-limit topologies. Because N is complete, [L2] identifies κN:N→∼lim←⁡N/InN; under this isomorphism the preimage of ker⁡(πnN) is InN, so [L3] makes κN a homeomorphism from the I-adic topology to the inverse-limit topology. Thus f^:=κN−1f~:M^→N is continuous and satisfies f^κM=f.

3.1step 1.2step 1.5step 2.1step 2.2∎

Parts 1 and 2 are proved by steps 1.2, 1.5, 2.1, and 2.2.

Depends on

Used by

Dependency tree · two levels

6 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