Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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.

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.

Depends on

Used by

Dependency tree · two levels

19 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