Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Prime-to-p roots lift uniquely in a complete DVR

Statement

Let O be a complete DVR with residue field k of characteristic p, and m≥1 with p∤m. Reduction is a group isomorphism μm(O)→μm(k). Write λ^ for its inverse. Lifts for different exponents agree whenever both are defined.

Facts & Assumptions

Given: O,k,m as stated; completeness and separation are for the maximal-ideal topology.

[F1]

The ring consists of elements of nonnegative discrete valuation (Discrete valuation rings).

Proof

1.1F1givenalgebra

Normalize the valuation by v(π)=1. An element is a unit exactly when its value is zero: if v(x)=0, then v(x−1)=0; if both x,x−1 are integral, their nonnegative values sum to zero. Thus the maximal ideal is (π). For λm=1 choose one representative x0; it is a unit, as is f′(x0)=mx0m−1 for f(X)=Xm−1.

2.1step 1.1givenalgebra

Define deterministically xn+1=xn−f(xn)/f′(xn). Taylor expansion f(x+h)=f(x)+f′(x)h+h2R with R∈O shows v(f(xn+1))≥2v(f(xn)). All xn retain residue λ, so every derivative is a unit. Starting with v(f(x0))≥1, we get v(xn+1−xn)≥2n (a zero error stays zero). The sequence converges by completeness to x≡λ; continuity of the finite polynomial operations and separation give f(x)=0. This is the simple-root Newton construction used in the Stacks complete-local-ring lifting proof specialized to a DVR.

2.2step 1.1algebra

If xm=ym=1 and xˉ=yˉ=λ, then 0=(x−y)∑j=0m−1xm−1−jyj. The sum has residue mλm−1≠0, hence is a unit by step 1.1. Thus x=y, the Stacks simple-root uniqueness argument.

3.1step 2.1step 2.2algebra∎

Products and inverses of lifted roots are roots lifting the corresponding products and inverses. Uniqueness therefore gives λν^=λ^ν^, 1^=1, and λ−1^=(λ^)−1. If two exponents occur, both lifts are roots for their least common multiple, still prime to p, so uniqueness there identifies them. When m=1 both groups are {1}.

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