Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Surface finite completion factors

Statement

Assume AC. For a finite map R→S of Noetherian rings and p∈Spec⁡R, Rp^⊗RS≅∏q∩R=pSq^. The finitely many factors use their maximal-adic completions. Thus formal fibres for finite extensions are factors of residue-field base changes of the original formal fibres.

Facts & Assumptions

Given: A finite map R→S of Noetherian rings and a prime p∈Spec⁡R.

[F1]

def-axiom-of-choice. The Axiom of Choice (AC) is the following statement. > Every family of nonempty sets has a choice function > (def-choice-function). Written out: for every set F all of whose members are nonempty, there exists a function g with domain F satisfying g(S)∈S for all S∈F. (The Axiom of Choice)

[F2]

def-dependent-choice. Let X be a set and let R⊆X×X be a binary relation on X. Call R entire on X when for every x∈X there is y∈X with xRy. The Axiom of Dependent Choice, written DC, is the following statement. (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain)

[F3]

thm-completion-is-exact-on-finite-modules. Assume the Axiom of Choice. Let R be a Noetherian commutative ring, let I⊆R be an ideal, and let 0→M′→M→M′′→0 be a short exact sequence of finitely generated R-modules. Then the induced sequence of I-adic completions 0→M′^→M^→M′′^→0 is exact. (Adic completion is exact on finite modules over a Noetherian ring)

[F4]

thm-completion-of-a-noetherian-local-ring. Assume the Axiom of Choice. Let (R,m) be a Noetherian local ring, and let R^ be its m-adic completion. 1. R^ is a Noetherian local ring with maximal ideal mR^. 2. The residue field is unchanged: R^/mR^≅R/m. 3. The completion map R→R^ is faithfully flat. (Completion of a Noetherian local ring is local with the same residue field)

Proof

1.1F3given

For each n≥1 the ring Sp/pnSp is a finite module over the Artinian local ring Rp/pnRp, hence Artinian; its finitely many maximal ideals correspond to the primes q of S with q∩R=p, and the Chinese remainder decomposition of an Artinian ring gives Sp/pnSp≅∏qSq/pnSq.

2.1F4step 1.1

In each factor the radical of pSq is qSq, so the p-adic and q-adic topologies coincide and the inverse limit of the factors is ∏qSq^, the product of the maximal-adic completions; the product is finite, so it commutes with the inverse limit.

3.1F3step 1.1step 2.1

The left-hand side of the inverse limit is the p-adic completion of the finite Rp-module Sp, which by exactness of completion on finite modules is Rp^⊗RpSp=Rp^⊗RS.

4.1F3step 2.1step 3.1

Combining the two computations of the inverse limit gives the asserted isomorphism Rp^⊗RS≅∏q∩R=pSq^, with finitely many factors.

5.1F1F2step 4.1∎

Tensoring the isomorphism with the residue field identifies the formal fibre of the finite extension at q as a factor of the base change of the formal fibre of R at p; the Axiom of Choice and the Axiom of Dependent Choice are inherited from the completion suppliers.

Remarks

  • The decomposition is the Chinese remainder decomposition of an Artinian quotient, not a general formal-gluing statement.
  • Finiteness of R→S is used to make the quotients finite and the number of primes over p finite.

Depends on

Used by

Dependency tree · two levels

18 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