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.

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 limnZ/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

{xQp:xp1}.

Facts & Assumptions

Proof

technique · constructive
1.1

Let RQp be the set of classes having a p-adically Cauchy representative (zn) with every znZ. For x=[(zn)]R and each m1, the sequence (znmodpm) is eventually constant, because znznpmZ for all large n,n. Thus x determines a compatible residue system and hence a map Φ:RZp. Equivalent integer representatives give the same eventual residues, so Φ is well defined and is a ring homomorphism.

L1L2givenconstruct
1.2

Conversely, let (am)mZp be a compatible residue system and choose the standard lift bm{0,,pm1} of am. Compatibility means bm+1bm(modpm), so bm+1bmppm. Hence (bm) is a p-adic Cauchy sequence of integers and defines an element of R. This construction inverts Φ, so RZp as rings.

L1L2givenconstruct
2.1

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 xp1. After passing to a tail, take xnp1 and write xn=an/bn in lowest terms. Then pbn by [L4]. For each n, [L3] gives an integer cn with bncnan(modpn). Hence cnxnp=bncnanbnppn. Thus (cn) is an integer Cauchy sequence equivalent to (xn), so xR. Therefore R={xQp:xp1}.

L1L3L4step 1.1algebra
3.1

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 N0 one has pNxnp1 eventually. Passing to the limit and using step 2.1 gives pNxR, while pNR is nonzero. Hence x=pNxpN. Since R is a subring of the field Qp, its fraction field is all of Qp.

L1step 2.1algebra
4.1

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

step 1.2step 2.1step 3.1discharge-construct

Depends on

Used by

Dependency tree · two levels

45 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