Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01
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 integers as an inverse limit and as a completion

Example

Let p be a prime integer. The inverse system

Z/p3ZZ/p2ZZ/pZ

with the natural reduction maps has inverse limit

Zp:=limnZ/pnZ.

This module is canonically the (p)-adic completion of Z.

Facts & Assumptions

Given: A prime integer p.

[L2]

The (p)-adic completion of Z is

Z^(p)=limnZ/pnZ

with completion map m(mmodpn)n (The I-adic completion of a module).

[L3]

The completion map has kernel n0pnZ (Kernel and universal property of adic completion).

Verification

technique · direct
1.1

By [L2], applying the adic-completion definition to the ring Z and the ideal (p) gives exactly the inverse system displayed above. Therefore its inverse limit is canonically the (p)-adic completion of Z.

L2
1.2

Under this identification, the completion map is the familiar residue map ZZp,m(mmodpn)n1. Its kernel is n0pnZ, which is 0 because the only integer divisible by every power of p is 0.

L3algebra
2.1

So the compatible-residue construction of Zp and the (p)-adic-completion construction agree canonically.

step 1.1step 1.2

Depends on

Used by

Nothing in the library uses this result yet.

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