Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck 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 additive topological group of Zp is topologically generated by 1, although it is not abstractly cyclic

Statement

In the additive topological group Zp, the closure of Z1 is all of Zp. However, the additive group Zp is not cyclic as an abstract group.

Facts & Assumptions

Given: The additive group of Zp and the element 1Zp.

[L1]

Proof

technique · direct
1.1

The subgroup generated by 1 consists exactly of the integer multiples n1, so it is the canonical image of Z in Zp. Therefore [L1] says that its closure is all of Zp.

L1givenalgebra
1.2

For every binary sequence ϵ=(ϵi)i0{0,1}N, define a compatible tuple x(ϵ) by x(ϵ)n:=i=0n1ϵipi(modpn). If two binary sequences first differ at index j, their (j+1)-st coordinates differ because their difference is divisible by pj but not by pj+1. Hence ϵx(ϵ) is injective.

givenconstructalgebra
2.1

Cantor's diagonal argument shows that {0,1}N is uncountable, so step 1.2 makes Zp uncountable. Every abstract cyclic group is the image of the countable group Z under nnγ for one generator γ, and is therefore countable. Hence the additive group of Zp cannot be cyclic.

step 1.2algebra
3.1

Step 1.1 proves topological generation by 1, while steps 1.2 and 2.1 show that no element can generate the additive group abstractly.

step 1.1step 1.2step 2.1

Depends on

Used by

Dependency tree · two levels

3 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