Alphabeta Math
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.

✓ 17 results · all verified · 7 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 10 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Absolute Values Completions and P Adic Numbers

1 · Prerequisites

2 · Summary

This page classifies the rank-one absolute values on Q, records the place language and the rational product formula, and then builds Qp as a completion before comparing it with the integral compatible-residue model.

The p-adic half keeps the model boundaries explicit. The completion field is constructed first, the integral subring is then identified with the (p)-adic completion of Z, and only after that do the digit expansion, compactness, Hensel lifting, Newton iteration, and square criteria appear.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Absolute values on a field

Definition

Let F be a field. An absolute value on F is a function ∣⋅∣:F→R≥0 such that for all x,y∈F:

∣x∣=0  ⟺  x=0,∣xy∣=∣x∣∣y∣,∣x+y∣≤∣x∣+∣y∣.

It is nonarchimedean when it satisfies the stronger inequality

∣x+y∣≤max⁡{∣x∣,∣y∣}

for all x,y∈F.

It is trivial when ∣x∣=1 for every nonzero x∈F.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

An absolute value is nonarchimedean exactly when every integer has absolute value at most one

Statement

Let F be a field with absolute value ∣⋅∣ in the sense of Absolute values on a field. Then ∣⋅∣ is nonarchimedean if and only if

∣n⋅1F∣≤1

for every integer n.

Facts & Assumptions

Given: A field F and an absolute value ∣⋅∣ on F.

[L1]

An absolute value is multiplicative and satisfies both the ordinary and, in the nonarchimedean case, the strong triangle inequality (Absolute values on a field).

Proof

technique · direct
1.1L1givenalgebra

Since 1F≠0, multiplicativity in [L1] gives ∣1F∣=∣1F∣2, hence ∣1F∣=1. Also ∣−1∣2=∣1∣=1, so ∣−1∣=1.

1.2L1givenalgebra

Assume conversely that ∣n1F∣≤1 for every integer n. Fix x,y∈F and put M:=max⁡{∣x∣,∣y∣}. If M=0 there is nothing to prove, so scale by a nonzero element and reduce to M=1. Then every binomial coefficient has absolute value at most 1, so ∣(x+y)m∣≤max⁡0≤k≤m∣(mk)∣ ∣x∣k∣y∣m−k≤1 for every m≥1. Hence ∣x+y∣m≤1 for all m, so ∣x+y∣≤1=M. Undoing the scaling gives ∣x+y∣≤max⁡{∣x∣,∣y∣}.

2.1L1step 1.1induction

Assume first that ∣⋅∣ is nonarchimedean. For n≥1, induction using step 1.1 and ∣(n+1)1F∣≤max⁡{∣n1F∣,∣1F∣} gives ∣n1F∣≤1. For negative n, ∣n1F∣=∣−1∣ ∣(−n)1F∣≤1, and ∣0∣=0≤1.

3.1step 2.1step 1.2∎

Thus the integer bound implies the strong triangle inequality, and step 2.1 proved the reverse implication.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Equivalent nontrivial absolute values

Definition

Let ∣⋅∣1 and ∣⋅∣2 be nontrivial absolute values on a field F. They are equivalent when there is a real number c>0 such that

∣x∣2=∣x∣1c

for every x∈F.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

Two nontrivial absolute values induce the same topology exactly when one is a positive power of the other

Statement

Let F be a field, and let ∣⋅∣1 and ∣⋅∣2 be nontrivial absolute values on F. Then they induce the same topology on F if and only if they are equivalent in the sense of Equivalent nontrivial absolute values.

Facts & Assumptions

Given: A field F and nontrivial absolute values ∣⋅∣1 and ∣⋅∣2 on F.

[L1]

Absolute values are multiplicative and have their open unit balls available, and equivalence means equality up to a positive power (Absolute values on a field, Equivalent nontrivial absolute values).

Proof

technique · direct
1.1L1givenalgebra

If ∣x∣2=∣x∣1c for some c>0, then t↦tc is increasing on R>0, so the conditions ∣x−a∣1<r and ∣x−a∣2<rc define the same neighborhoods of every point a. Hence the two absolute values induce the same topology.

1.2L1givenalgebra

Assume conversely that the two topologies agree. Then ∣x∣1<1  ⟺  xn→0 in ∣⋅∣1  ⟺  xn→0 in ∣⋅∣2  ⟺  ∣x∣2<1, and the same argument with x−1 gives ∣x∣1>1  ⟺  ∣x∣2>1 for every nonzero x.

2.1step 1.2givenalgebra

Choose a∈F× with ∣a∣1>1; then step 1.2 gives ∣a∣2>1. Set c:=log⁡∣a∣2log⁡∣a∣1>0. Fix x∈F×. If m/n<log⁡∣x∣1/log⁡∣a∣1, then ∣x∣1n<∣a∣1m, so ∣xna−m∣1<1 and therefore ∣xna−m∣2<1 by step 1.2. This gives nlog⁡∣x∣2<mlog⁡∣a∣2. Reversing the inequality yields the opposite bound. Rational approximation therefore forces log⁡∣x∣2log⁡∣a∣2=log⁡∣x∣1log⁡∣a∣1, so ∣x∣2=∣x∣1c.

3.1step 1.1step 2.1∎

Step 1.1 proves one direction and step 2.1 proves the other, so the two topologies agree exactly when the absolute values are equivalent.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The p-adic absolute value on the rationals

Definition

Let p be a prime. For x∈Q define

∣0∣p:=0,∣x∣p:=p−vp(x)(x≠0),

where vp is the rational p-adic valuation of The p-adic valuation extends to the nonzero rationals by vp(a/b):=vp(a)−vp(b)∈Z, independently of the representation; it satisfies vp(xy)=vp(x)+vp(y), and vp(x+y)≥min⁡{vp(x),vp(y)} whenever x, y and x+y are nonzero. In particular,

∣p∣p=p−1.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

The p-adic absolute value is nonarchimedean

Statement

Let p be a prime and let ∣⋅∣p be the absolute value of The p-adic absolute value on the rationals. Then for all x,y∈Q one has

∣xy∣p=∣x∣p∣y∣p,∣x+y∣p≤max⁡{∣x∣p,∣y∣p}.

So ∣⋅∣p is a nonarchimedean absolute value on Q.

Facts & Assumptions

Given: A prime p and rational numbers x,y.

[L2]

The p-adic absolute value is defined by ∣x∣p=p−vp(x) for nonzero x, with ∣0∣p=0 (The p-adic absolute value on the rationals).

Proof

technique · direct
1.1L1L2givenalgebra

If one of x or y is zero then ∣xy∣p=0=∣x∣p∣y∣p. If both are nonzero, [L1] and [L2] give ∣xy∣p=p−vp(xy)=p−vp(x)−vp(y)=∣x∣p∣y∣p.

1.2L1L2givenalgebra

If x+y=0, then ∣x+y∣p=0≤max⁡{∣x∣p,∣y∣p}. If x,y,x+y are nonzero, [L1] gives vp(x+y)≥min⁡{vp(x),vp(y)}, so exponentiating by p−t, which reverses order, yields ∣x+y∣p≤max⁡{∣x∣p,∣y∣p}.

2.1step 1.1step 1.2∎

The multiplicative law is step 1.1 and the strong triangle inequality is step 1.2, so ∣⋅∣p is nonarchimedean.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

Ostrowski's theorem for the rationals

Statement

Let ∣⋅∣ be a nontrivial absolute value on Q in the sense of Absolute values on a field. Then exactly one of the following holds.

  1. ∣⋅∣ is equivalent to the usual absolute value on Q.
  2. There is a unique prime p such that ∣⋅∣ is equivalent to ∣⋅∣p of The p-adic absolute value on the rationals.

Facts & Assumptions

Proof

technique · cases
1.1L1L2L3L4assume-case nonarchimedean

Assume as the first case that ∣n∣≤1 for every integer n. Then [L1] makes ∣⋅∣ nonarchimedean. Because the absolute value is nontrivial, there is an integer m with ∣m∣≠1; the inequality ∣m∣≤1 forces ∣m∣<1, so some prime divisor p of m has ∣p∣<1 by [L4]. If also ∣q∣<1 for a different prime q, then [L3] gives up+vq=1, and the nonarchimedean inequality yields 1=∣1∣≤max⁡{∣u∣∣p∣,∣v∣∣q∣}<1, impossible because integers all have absolute value at most 1. Thus there is a unique prime p with ∣p∣<1.

1.2L4givenassume-case archimedeanalgebra

Assume as the second case that ∣n∣>1 for some integer n. Choosing a prime divisor of n and using [L4], at least one prime p satisfies ∣p∣>1. Put α:=log⁡∣p∣/log⁡p>0 and, for each integer t∈{0,…,p−1}, let Cp:=max⁡∣t∣. For every positive integer m, write the base-p expansion m=a0+a1p+⋯+arpr with 0≤ai<p. The triangle inequality gives ∣m∣≤∑i=0r∣ai∣ ∣p∣i≤Cp(r+1)∣p∣r≤Cp(1+log⁡pm) mα, because pr≤m<pr+1. Applying the same estimate to mk and taking k-th roots gives ∣m∣≤(Cp(1+klog⁡pm))1/kmα, so letting k→∞ yields ∣m∣≤mα. Now fix m>1 and put αm:=log⁡∣m∣/log⁡m. Writing pk in base m and repeating the same argument with m in place of p gives ∣p∣k≤Cm(1+klog⁡mp) pkαm for some constant Cm, hence ∣p∣≤pαm after taking k-th roots and letting k→∞. Therefore α≤αm. Since ∣m∣≤mα is exactly αm≤α, we get αm=α for every m>1. Thus ∣m∣=mα for every positive integer m, and then ∣a/b∣=∣a∣/∣b∣=∣a/b∣∞α for every nonzero rational.

2.1step 1.1L4L5algebra

For any prime q≠p, step 1.1 and [L3] applied to p and q give ∣q∣=1. Hence if x=±pka/b with p∤ab, uniqueness of factorisation [L4] gives ∣x∣=∣p∣k. Writing c:=−log⁡∣p∣/log⁡p>0, this becomes ∣x∣=∣x∣pc, so ∣⋅∣ is equivalent to ∣⋅∣p by [L5].

3.1step 2.1step 1.2L2cases-exhaustive∎

Step 2.1 gives the nonarchimedean case and step 1.2 gives the archimedean case, and the two cases are disjoint because [L2] says every p-adic absolute value is nonarchimedean. Therefore every nontrivial absolute value on Q is equivalent either to the usual absolute value or to a unique p-adic one.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Places of the rationals

Definition

A place of Q is an equivalence class of nontrivial absolute values on Q. By Ostrowski's theorem for the rationals, every place is represented either by the usual absolute value or by a unique p-adic absolute value. We therefore write

∞, p

for the archimedean place and the place represented by ∣⋅∣p.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

The product formula for the rationals

Statement

For every nonzero rational number x,

∏v≤∞∣x∣v=1,

where v runs over the archimedean place and all prime places, and all but finitely many factors are equal to 1.

Facts & Assumptions

Proof

technique · direct
1.1L1L2givenalgebra

Write x=±∏i=1rpiei with distinct primes pi and integers ei, as supplied by [L2]. Then ∣x∣pi=pi−ei for the listed primes and ∣x∣q=1 for every other prime q.

2.1step 1.1algebra∎

The archimedean factor is ∣x∣∞=∏i=1rpiei, so ∣x∣∞∏i=1r∣x∣pi=(∏i=1rpiei)(∏i=1rpi−ei)=1. Since the omitted prime factors are all 1, this is exactly the full product formula.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Weak approximation for rational places

Statement

Let v1,…,vr be distinct places of Q. For each i, let ai∈Q, and let εi>0. Then there exists x∈Q such that

∣x−ai∣vi<εi(1≤i≤r).

Consequently, after completing Q at these places, the diagonal copy of Q is dense in the finite product of the local fields.

Facts & Assumptions

Given: Distinct places v1,…,vr, rational targets a1,…,ar, and positive reals ε1,…,εr.

[L1]

The places of Q are the archimedean place and the prime places (Places of the rationals).

Proof

technique · constructive
1.1L1givenconstruct

Reorder the places so that v1,…,vs are the finite places p1,…,ps and, if the archimedean place occurs, it is vr=∞. Choose integers Ni≥1 with pi−Ni<εi for 1≤i≤s. Let D0 be a common positive denominator of the finite targets a1,…,as, and replace it by D:=TD0, where T is a large integer coprime to every pi; this keeps every Dai integral and lets us later make M/D as small as we wish.

2.1L2step 1.1construct

Put M:=∏i=1spiNi+vpi(D). By [L2], there is an integer y such that y≡Dai(modpiNi+vpi(D))(1≤i≤s). Then for x0:=y/D one has vpi(x0−ai)≥Ni, hence ∣x0−ai∣pi≤pi−Ni<εi for every finite place in the list.

3.1step 1.1step 2.1cases

If ∞ is not among the chosen places, then x:=x0 works. Otherwise every number of the form xk:=x0+kM/D has the same finite-place congruence conditions as x0, because vpi(M/D)=Ni(1≤i≤s). By taking T in step 1.1 so large that M/D<εr, the arithmetic progression x0+Z(M/D) has mesh smaller than εr, so some integer k satisfies ∣xk−ar∣∞<εr.

4.1step 2.1step 3.1discharge-construct∎

The chosen x satisfies all requested inequalities. The density formulation is the same statement with the local targets first approximated by rational elements in each factor.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-04Open item page →

The p-adic numbers as a metric completion

Definition

Let p be a prime. The space of p-adic numbers Qp is the Cauchy-sequence quotient and metric constructed in assertions 1--4 of Every metric space has a completion, constructed as the equivalence classes of its Cauchy sequences for the metric

dp(x,y):=∣x−y∣p,

where ∣⋅∣p is the absolute value of The p-adic absolute value on the rationals. Thus its points are equivalence classes of rational dp-Cauchy sequences, two sequences being equivalent when their termwise distance tends to 0. Assertions 1--4 are choice-free and give Qp its metric and its named dense isometric embedding of Q. The general theorem's Countable-Choice-dependent completeness assertion is not used in this definition. The next theorem equips this metric space with the field operations extending those of Q and proves its completeness choice-free from the fixed countable enumeration of Q.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

The p-adic completion is a complete valued field

Statement

Let Qp be the Cauchy-sequence quotient of The p-adic numbers as a metric completion. Then termwise addition and multiplication of rational Cauchy sequences descend to well-defined operations on Qp, the absolute value extends to a nonarchimedean absolute value on Qp, every nonzero element has an inverse, and the resulting valued field is complete.

Facts & Assumptions

Given: A prime p and Qp as the Cauchy-sequence quotient of (Q,dp).

[L1]

Assertions 1--4 of the Cauchy-sequence construction give a metric on the quotient, an isometric embedding of the original space, and density of its image; these assertions do not use Countable Choice (Every metric space has a completion, constructed as the equivalence classes of its Cauchy sequences).

[L2]

The rational p-adic absolute value is multiplicative and nonarchimedean (The p-adic absolute value is nonarchimedean).

[L3]

Qp is the Cauchy-sequence quotient of (Q,dp) selected in The p-adic numbers as a metric completion.

[L4]

There is a bijection e:N→Q, obtained without any choice principle (Q is countably infinite).

[L5]

Density means that every positive-radius ball about a point meets the dense image; every nonempty subset of N has a least element (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, Open ball, closed ball and sphere in a metric space, The well-ordering principle).

[L7]

A real limit preserves an eventual non-strict upper bound (Limits preserve non-strict inequalities).

[L8]

Cauchyness and convergence in a metric space are tested by positive real tolerances (Cauchy sequence in a metric space, Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R).

Proof

technique · constructive
1.1L1L3construct

By the specific construction fixed in [L3] and supplied by [L1], an element of Qp is represented by a dp-Cauchy sequence (xn) in Q, and the distance between classes is d^p([x],[y])=lim⁡n∣xn−yn∣p. Define [x]+[y]:=[xn+yn],[x][y]:=[xnyn],∣[x]∣p:=lim⁡n∣xn∣p.

2.1L1L2step 1.1algebra

The nonarchimedean inequality in [L2] shows that sums and differences of Cauchy sequences are Cauchy. A Cauchy sequence in a nonarchimedean metric is bounded, so products of Cauchy sequences are again Cauchy, and equivalent representatives give equivalent sums and products because xnyn−xn′yn′=xn(yn−yn′)+yn′(xn−xn′). Passing to the limit through [L2] proves representative independence of the extended absolute value as well.

3.1step 1.1step 2.1algebra

Let [x]∈Qp be nonzero. Then ∣[x]∣p>0, and step 1.1 says ∣xn∣p→∣[x]∣p in R. So there are a real constant c>0 and an index N with ∣xn∣p≥c for all n≥N. In particular xn≠0 eventually. For n,m≥N, ∣xn−1−xm−1∣p=∣xn−xm∣p∣xn∣p∣xm∣p≤c−2∣xn−xm∣p, and the right-hand side tends to 0 because (xn) is Cauchy. Thus (xn−1) is eventually defined and Cauchy, so every nonzero class has an inverse.

4.1L2step 2.1step 3.1

Multiplicativity and the strong triangle inequality on Qp follow by taking limits of the corresponding rational identities from [L2].

5.1step 4.1L1L4L5L6construct

With the valued-field structure established in step 4.1, it remains to prove completeness without invoking assertion 5 of the general completion theorem. Fix once and for all a bijection e:N→Q from [L4]; fixing this single supplied bijection is ordinary existential instantiation, not a family of choices. Let (ξn) be a Cauchy sequence in Qp. By density in [L1], each set Sn:={k∈N:d^p(ι(e(k)),ξn)<2−n} is nonempty. Define kn:=min⁡Sn and qn:=e(kn). The least-index rule in [L5] determines the whole sequence (qn) and makes no choice.

6.1step 5.1L1L6L8algebra

The rational sequence (qn) is dp-Cauchy. Indeed, given ε>0, use [L6] and Cauchyness of (ξn) to choose N such that 2−n<ε/3 for n≥N and d^p(ξm,ξn)<ε/3 for m,n≥N. Since ι is isometric by [L1], for such m,n the triangle inequality gives dp(qm,qn)=d^p(ι(qm),ι(qn))<ε. Thus x:=[(qn)] is a point of Qp.

7.1step 6.1L1L7L8

The embedded sequence ι(qn) converges to x. For fixed n, the quotient metric of [L1] gives d^p(ι(qn),x)=lim⁡m→∞dp(qn,qm). Given ε>0, Cauchyness of (qn) supplies N such that dp(qn,qm)<ε/2 whenever m,n≥N. Hence for every fixed n≥N the displayed real sequence is eventually bounded above by ε/2, so [L7] gives d^p(ι(qn),x)≤ε/2<ε. This is convergence to x.

8.1step 5.1step 7.1L6L8discharge-construct∎

Finally, step 5.1 and the triangle inequality give d^p(ξn,x)≤d^p(ξn,ι(qn))+d^p(ι(qn),x)<2−n+d^p(ι(qn),x). Given ε>0, [L6] and step 7.1 make the two terms on the right smaller than ε/2 for all sufficiently large n, so d^p(ξn,x)<ε. Thus every Cauchy sequence in Qp converges, so Qp is complete. Together with steps 1.1--4.1, it is a complete nonarchimedean valued field, with no choice principle used.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

P-adic balls are clopen and intersecting comparable balls are nested

Statement

In Qp, every open or closed ball is both open and closed. Moreover, if two balls of radii r≤s intersect, then the smaller one is contained in the larger.

Facts & Assumptions

Given: Points a,b,x∈Qp and positive radii r≤s.

[L1]

The extended absolute value on Qp is nonarchimedean (The p-adic completion is a complete valued field).

[L2]

Qp is the p-adic Cauchy quotient of The p-adic numbers as a metric completion, equipped with its complete valued-field structure by The p-adic completion is a complete valued field.

Proof

technique · direct
1.1L1L2givenalgebra

If x lies in the open ball B(a,r), then ∣x−a∣p<r. For any y with ∣y−x∣p<r, [L1] gives ∣y−a∣p≤max⁡{∣y−x∣p,∣x−a∣p}<r, so y∈B(a,r). Thus every point of an open ball is again a center, hence every open ball is open and every closed ball is open by the same argument with ≤r.

2.1L1step 1.1givenalgebra

If ∣y−x∣p<∣x−a∣p, then [L1] forces ∣y−a∣p=∣x−a∣p. Hence, if x∉B(a,r), then ∣x−a∣p≥r and so y∉B(a,r); and if x lies outside the closed ball of radius r around a, then ∣x−a∣p>r and so y lies outside that closed ball as well. Thus the complement of either the open or the closed ball around a is a union of open balls. Therefore every open or closed ball is also closed.

3.1L1givenalgebra∎

If B(a,r) and B(b,s) intersect, choose x in the intersection. For any y∈B(a,r), ∣y−b∣p≤max⁡{∣y−x∣p,∣x−b∣p}<max⁡{r,s}=s, so y∈B(b,s). The same proof works for closed balls. Hence intersecting comparable balls are nested.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The p-adic completion agrees with the fraction field of Z_p

Statement

Let Zp denote the (p)-adic completion of Z, equivalently the inverse limit lim←⁡nZ/pnZ from The I-adic completion of a module. Then the metric-completion field Qp of The p-adic numbers as a metric completion is canonically isomorphic to the fraction field of Zp. Under the canonical embedding produced by this isomorphism, the image of Zp is exactly

{x∈Qp:∣x∣p≤1}.

Facts & Assumptions

Proof

technique · constructive
1.1L1L2givenconstruct

Let R⊆Qp be the set of classes having a p-adically Cauchy representative (zn) with every zn∈Z. For x=[(zn)]∈R and each m≥1, the sequence (zn mod pm) is eventually constant, because zn−zn′∈pmZ for all large n,n′. Thus x determines a compatible residue system and hence a map Φ:R⟶Zp. Equivalent integer representatives give the same eventual residues, so Φ is well defined and is a ring homomorphism.

1.2L1L2givenconstruct

Conversely, let (am)m∈Zp be a compatible residue system and choose the standard lift bm∈{0,…,pm−1} of am. Compatibility means bm+1≡bm(modpm), so ∣bm+1−bm∣p≤p−m. Hence (bm) is a p-adic Cauchy sequence of integers and defines an element of R. This construction inverts Φ, so R≅Zp as rings.

2.1L1L3L4step 1.1algebra

The subring R is exactly the closed unit ball. One inclusion is immediate because every integer has p-adic absolute value at most 1. Conversely, let x=[(xn)] satisfy ∣x∣p≤1. After passing to a tail, take ∣xn∣p≤1 and write xn=an/bn in lowest terms. Then p∤bn by [L4]. For each n, [L3] gives an integer cn with bncn≡an(modpn). Hence ∣cn−xn∣p=∣bncn−anbn∣p≤p−n. Thus (cn) is an integer Cauchy sequence equivalent to (xn), so x∈R. Therefore R={x∈Qp:∣x∣p≤1}.

3.1L1step 2.1algebra

Every element of Qp is a fraction of elements of R. Indeed, if x=[(xn)], the Cauchy sequence (xn) is bounded, so for some integer N≥0 one has ∣pNxn∣p≤1 eventually. Passing to the limit and using step 2.1 gives pNx∈R, while pN∈R is nonzero. Hence x=pNxpN. Since R is a subring of the field Qp, its fraction field is all of Qp.

4.1step 1.2step 2.1step 3.1discharge-construct∎

Transporting step 2.1 through the ring isomorphism R≅Zp from step 1.2 identifies Qp canonically with Frac⁡(Zp) and identifies Zp with the closed unit ball.

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Z_p is the valuation ring of Q_p

Statement

Under the comparison of The p-adic completion agrees with the fraction field of Z_p, the (p)-adic completion Zp of Z identifies with

{x∈Qp:∣x∣p≤1}.

Facts & Assumptions

Given: The canonical embedding Zp↪Qp.

[L1]

The comparison theorem identifies Qp with the fraction field of Zp and identifies the embedded copy of Zp with the closed unit ball (The p-adic completion agrees with the fraction field of Z_p).

Proof

technique · direct
1.1L1given

By [L1], an element of Qp lies in the image of Zp exactly when its p-adic absolute value is at most 1.

2.1step 1.1∎

Thus the image is exactly {x∈Qp:∣x∣p≤1}, which is the valuation ring of the valued field Qp.

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

The maximal ideal and residue field of Z_p

Statement

The unique maximal ideal of Zp is pZp, and the quotient Zp/pZp is canonically isomorphic to Fp.

Facts & Assumptions

Given: Zp viewed inside Qp.

[L1]

Zp is the subring of Qp cut out by ∣x∣p≤1 (Z_p is the valuation ring of Q_p).

[L2]

Zp is also the compatible-residue inverse limit (The p-adic completion agrees with the fraction field of Z_p).

Proof

technique · direct
1.1L1givenalgebra

An element x∈Zp is a unit exactly when ∣x∣p=1: if ∣x∣p=1 then ∣x−1∣p=1 as well, so x−1∈Zp by [L1]; if ∣x∣p<1 then ∣x−1∣p>1, so x−1∉Zp. Therefore the nonunits are precisely the elements with ∣x∣p<1, which is the principal ideal pZp.

2.1L2step 1.1algebra

In the compatible-residue model of [L2], multiplication by p is exactly the condition that the first residue coordinate is 0. Therefore the quotient by pZp remembers only the first residue class, giving a canonical map Zp/pZp→Z/pZ=Fp. This map is bijective because every residue class lifts to a compatible system and two systems differ by an element of pZp exactly when their first coordinates agree.

3.1step 1.1step 2.1∎

Since the quotient by pZp is the field Fp, the ideal pZp is maximal, and step 1.1 shows it contains every nonunit, so it is the unique maximal ideal.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Every p-adic number has a unique digit expansion

Statement

Every nonzero x∈Qp can be written uniquely in the form

x=∑n=N∞anpn,

where N∈Z, aN≠0, and each digit an lies in {0,…,p−1}. The zero element has the all-zero expansion.

Facts & Assumptions

Given: A prime p and an element x∈Qp.

[L1]

Qp is the fraction field of Zp (The p-adic completion agrees with the fraction field of Z_p).

[L2]

Zp is the closed unit ball of Qp (Z_p is the valuation ring of Q_p).

[L3]

Q embeds densely in Qp because Qp is the p-adic metric completion (The p-adic numbers as a metric completion).

[L4]

Qp is a complete valued field (The p-adic completion is a complete valued field).

Proof

technique · constructive
1.1L2L3L4givenchoosealgebra

If x=0, take every digit an=0. Now assume x≠0. By the density statement in [L3], choose q∈Q with ∣x−q∣p<∣x∣p. The ultrametric inequality from [L4] then gives ∣q∣p=∣x∣p. Write q=pNa/b with N∈Z and integers a,b not divisible by p; then ∣q∣p=p−N, so ∣x∣p=p−N. Put u:=p−Nx. Then ∣u∣p=1, so u∈Zp by [L2], and also ∣u−1∣p=1, so u−1∈Zp. Hence u∈Zp×.

2.1L1L2L4step 1.1chooseconstruct

In the compatible-residue description of Zp from [L1], for each m≥1 choose the unique digits a0,…,am−1∈{0,…,p−1} such that u≡a0+a1p+⋯+am−1pm−1(modpm). Because u is a unit, its residue modulo p is nonzero, so a0≠0. Writing sm:=∑j=0m−1ajpj, one has u−sm∈pmZp, hence ∣u−sm∣p≤p−m. So (sm) is Cauchy and converges to u by [L4]. Multiplying by pN gives x=∑m=0∞ampm+N; renaming the digits by index shift yields the claimed expansion with leading digit aN=a0≠0.

3.1step 2.1L2algebra

For uniqueness, suppose ∑n=N∞anpn=∑n=M∞bnpn with digits in {0,…,p−1} and nonzero leading digits. Equality of absolute values forces N=M. If an≠bn first occurs at n=k, then the difference of the two series equals (ak−bk)pk+pk+1y for some y∈Zp. Since ak−bk is not divisible by p, that difference has p-adic absolute value p−k and cannot be 0. Therefore all digits agree.

4.1step 2.1step 3.1constructdischarge-construct∎

Thus every p-adic number has a unique base-p digit expansion.

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Q_p is locally compact and totally disconnected

Statement

Assume the Axiom of Countable Choice ACω of The Axiom of Countable Choice (ACω). Then the field Qp is locally compact and totally disconnected. In particular, Zp is a compact open subring.

Facts & Assumptions

Given: The p-adic field Qp and ACω.

[L1]

Zp={x:∣x∣p≤1}, and p-adic balls are clopen (Z_p is the valuation ring of Q_p, P-adic balls are clopen and intersecting comparable balls are nested).

[L2]

Every element of Zp has a digit expansion (Every p-adic number has a unique digit expansion).

[L3]

Assuming ACω, a complete totally bounded metric space is compact (A complete, totally bounded metric space is compact, proved from countable choice used exactly once).

Proof

technique · direct
1.1L1L2L3givenalgebra

By [L1], Zp is the closed unit ball, and by the clopen-ball lemma it is open. To prove compactness, note first that Zp is complete as a closed subset of the complete field Qp. It is totally bounded because for each N≥1, every element of Zp differs by at most p−N from one of the finitely many truncations a0+a1p+⋯+aN−1pN−1 with digits ai∈{0,…,p−1}, by [L2]. Hence [L3] makes Zp compact.

2.1L1step 1.1algebra∎

Every point of Qp has a compact open neighborhood, namely a scalar multiple of Zp, so Qp is locally compact. If x≠y, choose a ball around x whose radius is smaller than ∣x−y∣p; by [L1] this ball is clopen and does not contain y. Therefore points are separated by clopen sets, so Qp is totally disconnected.

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

Simple roots lift uniquely in Z_p

Statement

Let f∈Zp[X] and a0∈Zp. If

f(a0)≡0(modp),f′(a0)≢0(modp),

then there is a unique a∈Zp such that a≡a0(modp) and f(a)=0.

Facts & Assumptions

Given: A polynomial f∈Zp[X] and a0∈Zp with f(a0)∈pZp and f′(a0)∉pZp.

[L1]

Zp is the valuation ring in Qp (Z_p is the valuation ring of Q_p).

Proof

technique · constructive
1.1L1giveninductionconstruct

Construct an∈Zp inductively so that an≡a0(modp),f(an)∈pn+1Zp. Given an, write an+1=an+tnpn+1 with tn∈{0,…,p−1}. Taylor expansion modulo pn+2 gives f(an+1)≡f(an)+tnpn+1f′(an)(modpn+2). Since f′(an)≡f′(a0)≢0(modp), there is a unique choice of tn modulo p making the right-hand side 0 modulo pn+2.

2.1L2step 1.1algebra

The differences satisfy an+1−an∈pn+1Zp, so (an) is a p-adic Cauchy sequence. By [L2] it converges to some a∈Zp, and continuity of polynomial evaluation gives f(a)=0. Also a−a0∈pZp, so a≡a0(modp).

3.1L1step 2.1algebradischarge-construct∎

If b is another root with b≡a0(modp), then 0=f(a)−f(b)=(a−b)g(a,b) for the usual divided-difference polynomial g. Modulo p, one has g(a,b)≡f′(a0)≢0, so g(a,b) is a unit of Zp by [L1]. Therefore a−b=0.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Newton's criterion in Q_p

Statement

Let f∈Zp[X] and a0∈Zp. If

∣f(a0)∣p<∣f′(a0)∣p2,

then the Newton iterates

an+1:=an−f(an)f′(an)

are defined, converge in Zp to a root a of f, satisfy ∣a−a0∣p≤∣f(a0)/f′(a0)∣p, and that root is unique in the closed ball of that radius around a0.

Facts & Assumptions

Given: A polynomial f∈Zp[X] and a0∈Zp with ∣f(a0)∣p<∣f′(a0)∣p2.

[L1]

Zp is the valuation ring of Qp (Z_p is the valuation ring of Q_p).

[L2]

Qp is a complete nonarchimedean valued field (The p-adic completion is a complete valued field).

Proof

technique · constructive
1.1L1L2givenconstruct

Put hn:=f(an)/f′(an) whenever an is defined. Since ∣h0∣p<∣f′(a0)∣p≤1, we have h0∈pZp, so a1=a0−h0 lies in Zp. For any x∈Zp, Taylor expansion gives f(x−h)=f(x)−hf′(x)+h2gx(h) with gx(h)∈Zp. Hence f(an+1)=hn2gan(hn), so ∣f(an+1)∣p≤∣hn∣p2.

2.1L2step 1.1induction

The derivative also satisfies f′(an+1)=f′(an)+hnun for some un∈Zp. Because ∣hn∣p<∣f′(an)∣p, the ultrametric inequality gives ∣f′(an+1)∣p=∣f′(an)∣p. By induction, every iterate is defined, each f′(an) has the same nonzero absolute value, and ∣an+1−an∣p=∣hn∣p≤∣f(an)∣p∣f′(a0)∣p≤(∣f(a0)∣p∣f′(a0)∣p2)2n−1∣h0∣p. So the differences tend to 0 quadratically.

3.1L2step 2.1algebra

The series of successive differences is therefore Cauchy, so (an) converges in Zp by [L2]; call its limit a. Continuity of polynomial evaluation gives f(a)=0, and the ultrametric inequality applied to a−a0=∑n≥0(an+1−an) shows ∣a−a0∣p≤∣h0∣p=∣f(a0)/f′(a0)∣p.

4.1L1step 3.1algebradischarge-construct∎

If b is another root in the closed ball of radius ∣h0∣p about a0, then 0=f(b)−f(a)=(b−a)v for the usual divided-difference element v∈Zp. Because a−a0 and b−a0 both have absolute value at most ∣h0∣p, each term of v−f′(a0) contains one factor from (a−a0)Zp or (b−a0)Zp. Thus ∣v−f′(a0)∣p≤∣h0∣p<∣f′(a0)∣p. The ultrametric inequality therefore gives ∣v∣p=∣f′(a0)∣p≠0, so v is nonzero and hence b−a=0. Therefore b=a.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

Square criterion in Q_p for odd p

Statement

Let p be odd and let x∈Qp×. Write

x=pnu

with n∈Z and u∈Zp×. Then x is a square in Qp if and only if n is even and the reduction of u in Fp× is a square.

Facts & Assumptions

Given: An odd prime p and x=pnu with u∈Zp×.

[L1]

Zp is the valuation ring of Qp (Z_p is the valuation ring of Q_p).

[L2]

Simple roots lift uniquely in Zp (Simple roots lift uniquely in Z_p).

Proof

technique · direct
1.1L1givenalgebra

If x=y2, write y=pmv with v∈Zp×. Then x=p2mv2, so n=2m is even and the reduction of u is the square of the reduction of v in Fp×.

1.2L2givenalgebra

Conversely, assume n=2m and the residue class of u is c2 in Fp×. Choose a0∈Zp with a0≡c(modp). For f(X)=X2−u, one has f(a0)≡0(modp) and f′(a0)=2a0≢0(modp) because p is odd and c≠0. By [L2], f has a root v∈Zp with v2=u. Then y:=pmv satisfies y2=x.

2.1step 1.1step 1.2∎

Step 1.1 proves necessity and step 1.2 proves sufficiency.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Square criterion in Q_2

Statement

Let x∈Q2×. Write

x=2nu

with n∈Z and odd u∈Z2×. Then x is a square in Q2 if and only if n is even and u≡1(mod8).

Facts & Assumptions

Given: x=2nu with odd u∈Z2×.

[L1]

Z2 is the valuation ring of Q2 (Z_p is the valuation ring of Q_p).

[L2]

Newton's criterion holds in Q2 (Newton's criterion in Q_p).

Proof

technique · direct
1.1L1givenalgebra

If x=y2, write y=2mv with odd v∈Z2×. Then n=2m is even. Every odd square is congruent to 1 modulo 8, so the unit factor u is congruent to 1 modulo 8.

1.2L2givenalgebra

Conversely, assume n=2m and u≡1(mod8). For f(X)=X2−u at a0=1, ∣f(1)∣2=∣1−u∣2≤2−3<2−2=∣f′(1)∣22. By [L2], Newton iteration converges to a root v∈Z2 of f, so v2=u. Then y:=2mv satisfies y2=x.

2.1step 1.1step 1.2∎

This proves both directions of the criterion.

5 · Examples, counterexamples and false statements

None yet.

Sources