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 , the closure of is all of . However, the additive group is not cyclic as an abstract group.
Facts & Assumptions
Given: The additive group of and the element .
The canonical image of in is dense (The canonical map from the integers into Zp is injective and has dense image).
Proof
The subgroup generated by consists exactly of the integer multiples , so it is the canonical image of in . Therefore [L1] says that its closure is all of .
For every binary sequence , define a compatible tuple by If two binary sequences first differ at index , their -st coordinates differ because their difference is divisible by but not by . Hence is injective.
Cantor's diagonal argument shows that is uncountable, so step 1.2 makes uncountable. Every abstract cyclic group is the image of the countable group under for one generator , and is therefore countable. Hence the additive group of cannot be cyclic.
Step 1.1 proves topological generation by , while steps 1.2 and 2.1 show that no element can generate the additive group abstractly.
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
- Brian Osserman, Inverse limits and profinite groups (standard reference, not scraped)
- Gareth Wilkes, Profinite Groups and Group Cohomology lecture notes (standard reference, not scraped)