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.
An extraspecial -group is nilpotent of class exactly two and its derived subgroup has order
Statement
Let be an extraspecial -group. Then is nilpotent of nilpotency class exactly two, its derived subgroup satisfies and has order , and every nonidentity commutator of has order .
Facts & Assumptions
Given: An extraspecial -group (Special and extraspecial -groups).
For a finite -group the following are equivalent: is extraspecial; is nonabelian, and is elementary abelian; is nonabelian and has order (Three equivalent descriptions of an extraspecial -group).
For subgroups the subgroup commutator is , and the lower central series is , (Subgroup commutators and the lower central series).
is nilpotent exactly when its lower central series reaches , and the least with is its nilpotency class (Nilpotence via central series, the upper central series, and the lower central series, Nilpotent groups and nilpotency class).
In a finite group whose order is prime, every has order (A finite group of prime order is cyclic and every nonidentity element generates it).
Proof
By the third description in the characterisation, has order and is nonabelian.
The second term of the lower central series is , and the third is .
Every element of commutes with every element of , so each generator of is the identity and .
Hence is nilpotent of class at most two; the class is not zero or one, since class at most one would give and is nonabelian, so the class is exactly two.
Every commutator lies in , a group of order , so a nonidentity commutator has order .
Remarks
Both conclusions are hypotheses of the class-two commutator calculus: the derived subgroup is central, which is what class two says, and it has exponent , which is what the order- conclusion says.
Depends on
- Three equivalent descriptions of an extraspecial $p$-group
- Nilpotent groups and nilpotency class
- Nilpotence via central series, the upper central series, and the lower central series
- Subgroup commutators and the lower central series
- The center $Z(G)$ of a group
- A finite group of prime order is cyclic and every nonidentity element generates it
- Special and extraspecial $p$-groups
Used by
- The commutator pairing of an extraspecial p-group relative to a chosen generator of its centre Definition
- The square map of an extraspecial 2-group relative to a chosen generator of its centre Definition
- For odd p, a central product of two modular groups of order p³ is a central product of a modular group with a Heisenberg group Lemma
- The commutator pairing is well defined on the central quotient, is bilinear over Fₚ, and is alternating Lemma
- The square map is well defined on the central quotient and satisfies q(x̄ȳ)=q(x̄)+q(ȳ)+b(x̄,ȳ) Lemma
- Every conjugacy class of an extraspecial p-group outside the centre has exactly p elements Proposition
- For odd p and each n≥1 there are exactly two extraspecial groups of order p¹⁺²ⁿ, distinguished by their exponent Theorem
Dependency tree · two levels
32 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
- M. van Beek, Topics in Finite p-Groups, Proposition 2.29 (standard reference, not scraped)
- D. A. Craven, The Theory of p-Groups, §3.1 (standard reference, not scraped)