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

Depends on

Used by

Dependency tree · two levels

51 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