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.
For a finitely generated pro-p group, the Frattini formula retains the closure
Statement
For every finitely generated pro- group , one has
Facts & Assumptions
Given: A finitely generated pro- group .
The closure-sensitive pro- Frattini theorem states (For a finitely generated pro-p group, the Frattini subgroup is the closure of [G,G]G^p).
The subgroup is generated by the th powers (The th-power subgroup ).
Proof
The theorem [L1] applies to the finitely generated pro- group fixed in the Statement, and the notation is exactly that of [F2].
Therefore as stated. The closure cannot be discarded merely by reading the abstract-group notation .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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)