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

✓ 7 results · all verified · 5 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Pro P Groups and the P Adic Integers - Examples

1 · Prerequisites

2 · Summary

These examples make the compatible-digit model explicit, show concrete convergence and Cauchy behavior in Zp, identify easy completions and Frattini quotients, and isolate the distinction between topological density and abstract equality.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

A p-adic integer is encoded by a compatible sequence of residue digits

Example

For fixed digits a0,a1,a2,…∈{0,…,p−1}, the sequence

xn:=a0+a1p+⋯+an−1pn−1(modpn)

defines an element of Zp.

Facts & Assumptions

Given: Digits ai∈{0,…,p−1} for i≥0.

[L1]

Verification

technique · direct
1.1givenalgebra

For each n≥1, reducing xn+1 modulo pn removes only the final term anpn, so xn+1 mod pn=xn. Thus the tuple (xn)n≥1 is compatible.

2.1L1step 1.1∎

By [L1], every compatible tuple defines an element of Zp. Hence the displayed digit data encodes a p-adic integer.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The partial sums of a p-adic expansion converge in the inverse-limit topology

Example

If x∈Zp is represented by digits a0,a1,…, then the partial sums

sn:=a0+a1p+⋯+an−1pn−1∈Z

converge to x in the inverse-limit topology on Zp.

Facts & Assumptions

Given: An element x∈Zp with compatible digit truncations (sn mod pr)r.

[L1]

The inverse-limit topology is the p-adic metric topology (The inverse-limit topology on Zp agrees with the p-adic metric topology).

Verification

technique · direct
1.1givenalgebra

For each fixed r≥1, once n≥r the residue of sn modulo pr is already a0+a1p+⋯+ar−1pr−1, which is exactly the r-th coordinate of x. So the first r coordinates of sn and x agree for all sufficiently large n.

2.1L1step 1.1∎

Step 1.1 says that for every r, the sequence eventually lies in the basic neighbourhood of x determined by the first r coordinates. By [L1], that is exactly convergence to x in the inverse-limit topology.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

A standard p-adic digit sequence is Cauchy and converges in Zp

Example

The sequence

tn:=1+p+⋯+pn−1∈Z⊆Zp

is Cauchy for the additive p-adic metric and converges in Zp.

Facts & Assumptions

Given: The sequence tn=1+p+⋯+pn−1 in Zp.

[F1]

The p-adic metric measures how many initial residue coordinates agree (The p-adic metric on Zp is determined by the first coordinate at which two compatible residue systems differ).

Verification

technique · direct
1.1F1givenalgebra

If m>n, then tm−tn=pn(1+p+⋯+pm−n−1), so the first n residue coordinates of tm and tn agree. By [F1], this gives dp(tm,tn)≤p−n. Hence (tn) is Cauchy.

2.1L1step 1.1∎

Since Zp is complete by [L1], the Cauchy sequence (tn) converges to some element of Zp.

ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

A finite p-group is naturally isomorphic to its own pro-p completion

Example

If P is a finite p-group, then the canonical map P→P^(p) is an isomorphism.

Facts & Assumptions

Given: A finite p-group P.

[F1]

The pro-p completion is the inverse limit over all finite p-group quotients (The pro-p completion of an abstract group is the inverse limit over its finite p-group quotients).

Verification

technique · direct
1.1F1givenalgebra

The subgroup 1⊴P is one of the indexing subgroups in [F1], and its quotient is the initial object P/1≅P of the quotient diagram: it has the natural quotient map to every P/N.

2.1L1step 1.1∎

A compatible tuple is uniquely determined by its coordinate in the initial object P/1, and every element of P/1 determines such a tuple by its images in the other quotients. Therefore P^(p)≅P, and the canonical completion map is exactly this isomorphism. The conclusion is consistent with [L1], since P was already pro-p to begin with.

ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-09-04Open item page →

The Frattini quotient of Zp is the one-dimensional vector space Fp

Example

For the additive pro-p group Zp, one has

Φ(Zp)=pZpandZp/Φ(Zp)≅Fp.

Facts & Assumptions

Given: The additive pro-p group Zp.

[L1]

For a finitely generated pro-p group, the Frattini subgroup is [G,G]Gp‾ (For a finitely generated pro-p group, the Frattini subgroup is the closure of [G,G]G^p).

Verification

technique · direct
1.1L1givenalgebra

The additive group Zp is abelian, so [Zp,Zp]=0. Its pth-power subgroup in additive notation is pZp, which is already closed. Therefore [L1] gives Φ(Zp)=pZp.

2.1step 1.1algebra∎

Reduction modulo p is a surjective homomorphism Zp→Z/pZ with kernel pZp. By step 1.1, the quotient by Φ(Zp) is therefore Fp.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-09-04Open item page →

In Zp squared, topological generation is detected by the Frattini quotient coordinates

Example

In G=Zp×Zp, a pair (u,v) topologically generates G if and only if their reductions modulo p form a basis of Fp2.

Facts & Assumptions

Given: The pro-p group G=Zp×Zp.

[L1]

Topological generation in a finitely generated pro-p group is detected on the Frattini quotient (A subset topologically generates a finitely generated pro-p group exactly when its image spans the Frattini quotient over Fp).

[F1]

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

Verification

technique · direct
1.1F1givenalgebra

By coordinatewise addition in [F1], the subgroup pG consists of pairs whose two coordinates are divisible by p. Therefore G/pG≅(Zp/pZp)×(Zp/pZp)≅Fp2.

2.1L1step 1.1algebra∎

The Frattini quotient of the abelian pro-p group G is exactly G/pG, so [L1] says that a subset topologically generates G exactly when its image spans Fp2. For a pair (u,v), spanning Fp2 is the same as being a basis.

CounterexampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The embedded integers form an abstractly proper but topologically dense subgroup of Zp

Statement refuted

Every dense subgroup of Zp is all of Zp as an abstract subgroup.

Facts & Assumptions

Given: The embedded copy of Z inside Zp.

[L2]

The additive group of Zp is not abstractly cyclic, even though the closure of Z⋅1 is all of Zp (The additive topological group of Zp is topologically generated by 1, although it is not abstractly cyclic).

Counterexample

technique · direct
1.1L1given

By [L1], the embedded copy of Z is dense in Zp.

2.1L2step 1.1

The embedded copy of Z is exactly Z⋅1. By [L2], its closure is all of Zp but it is not equal to Zp as an abstract subgroup. Thus a dense subgroup can be proper.

3.1step 1.1step 2.1∎

Therefore the stated universal claim is false, and the embedded copy of Z is the required counterexample.

Sources