Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 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 profinite completion of the integers is the direct product of the p-adic integer groups over all primes

Statement

There is a canonical topological group isomorphism

Z^p primeZp,

where the right-hand side is the external direct product equipped with the product topology.

Facts & Assumptions

Given: The profinite completion Z^ and the family (Zp)p.

[L1]

For each prime p, the inverse limit of the p-power quotients of Z is Zp (Zp is the pro-p completion of the integers).

[F1]

The external direct product is formed componentwise (The external direct product G×H with componentwise multiplication).

[L2]

Compatible tuples satisfy the inverse-limit universal property (The compatible-tuple construction satisfies the inverse-limit universal property in groups).

Proof

technique · direct
1.1

For each positive integer n=ppvp(n), the Chinese remainder theorem gives Z/nZpnZ/pvp(n)Z. These decompositions are compatible with the reduction maps as n varies by divisibility.

givenF1algebra
2.1

Passing to the inverse limit over all n therefore separates the finite quotients prime by prime: Z^=limnZ/nZplimrZ/prZ. The right-hand inverse limit is Zp by [L1], and [L2] identifies the induced map as the unique compatible morphism. Hence Z^pZp.

L1L2step 1.1algebra

Depends on

Used by

Dependency tree · two levels

9 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