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.
A subset topologically generates a finitely generated pro-p group exactly when its image spans the Frattini quotient over Fp
Statement
Let be a finitely generated pro- group and let . Then topologically generates if and only if its image spans the elementary abelian quotient over .
Facts & Assumptions
Given: A finitely generated pro- group and a subset .
In a finite -group, a subset generates exactly when its image in the Frattini quotient spans that quotient (Burnside Basis Theorem).
For a finite group, generation is detected modulo the Frattini subgroup (Generation of a finite group is detected modulo its Frattini subgroup).
Proof
Suppose topologically generates . Then for every open normal subgroup , the image of generates the finite -group . By [L3], its image therefore generates , and by [L2] that is the same as spanning the Frattini quotient over . Passing over all finite quotients shows that the image of spans .
Conversely, suppose the image of spans . Let be any open normal subgroup. The image of in then spans by functoriality of the Frattini quotient and [L1], so [L2] says that the image of generates . Hence the closure of the subgroup generated by surjects onto every finite quotient , and therefore equals . So topologically generates .
Steps 1.1 and 2.1 prove the equivalence. The empty set fits the statement when , because then .
Depends on
Used by
Dependency tree · two levels
15 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
- Gareth Wilkes, Profinite Groups and Group Cohomology lecture notes (standard reference, not scraped)
- Alexander Lubotzky, Combinatorial group theory for pro-p groups (standard reference, not scraped)