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.
Every extraspecial -group is an internal central product of nonabelian subgroups of order
Statement
Let be an extraspecial -group and .
Splitting. If satisfy and , then and , so and form an internal central product of (Internal central products of a finite family of subgroups, The centralizer of a subgroup). Here is extraspecial of order with ; and has order with , and is extraspecial when .
Decomposition. There are subgroups of , each nonabelian of order with , which form an internal central product of ; call such a family admissible. Moreover .
Peeling. For an admissible family, whenever ; and when , for each index the subgroup satisfies , , and , is extraspecial of order , and has as an admissible family for itself.
Facts & Assumptions
Given: An extraspecial -group with of order , the quotient and its commutator pairing .
Subgroups of form an internal central product when they generate and for (Internal central products of a finite family of subgroups).
The commutator pairing of relative to is the map determined by (The commutator pairing of an extraspecial -group relative to a chosen generator of its centre).
, and (The centralizer of a subgroup).
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).
The commutator pairing is well defined, -bilinear and alternating, with (The commutator pairing is well defined on the central quotient, is bilinear over , and is alternating).
The radical of the commutator pairing is trivial (The commutator pairing of an extraspecial -group has trivial radical).
If in an extraspecial -group , then contains , has order , is nonabelian, and is extraspecial with centre (Two elements of an extraspecial -group with nontrivial commutator generate an extraspecial subgroup of order ).
Subgroups form an internal central product of if and only if the multiplication map is a surjective homomorphism; for two factors this identifies the internal product with the external central product along the identity on their intersection (Internal central products are the images of external ones).
For a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
For every group and , the centralizer is a subgroup of ( and are subgroups of ).
An elementary abelian -group is a finite abelian -group in which every nonidentity element has order (Elementary abelian -groups).
For every homomorphism , the rule is an isomorphism from onto (First isomorphism theorem for groups: ).
is the smallest subgroup of containing (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
For every prime , is a field (For every prime , the two operations on make it a field).
Proof
If the one-member family is admissible, and ; moreover any with then has order and equals , so has order and the splitting clause holds.
Assume all three clauses of the theorem hold for every extraspecial -group of order smaller than .
Suppose satisfy , , and . An element of commutes with and, lying in , with , hence with , so ; and lies in and is central in , so . The multiplication map is a surjective homomorphism. If , then , while every with lies in the kernel. Thus is the antidiagonal of and has order , so and . If were abelian it would equal and would be ; so for the group is nonabelian, and is a subgroup of the elementary abelian group , hence elementary abelian, so is extraspecial.
If then is extraspecial of order with , and is a nonzero element of the field , hence invertible.
Let be an admissible family and fix an index , writing . Each generator of commutes with every element of , and the centraliser of an element is a subgroup, so and ; then is a subgroup containing every member of the family, so ; and , while gives the reverse inclusion. Taking to be a single shows .
For put and and . Bilinearity and alternation give and , so and .
Applying step 1.3 with and gives and ; when the subgroup contains the nonabelian , so and is extraspecial. The members with generate it, commute pairwise and have centre , so they form an admissible family for it; since has smaller order, the induction hypothesis applied to that -member family gives .
Hence commutes with and with ; the centraliser of is a subgroup containing both, hence contains , so and . Therefore , and , so and form an internal central product of ; step 1.3 with and supplies the order of , its centre, and that it is extraspecial when .
If , choose , which exists because is nonabelian, and then with , which exists because the radical is trivial; put and . By step 3.1 the group is extraspecial of order , so the induction hypothesis gives an admissible family for with . Then generate , commute pairwise, are nonabelian of order and have centre , so they form an admissible family for , and ; with step 1.1 this completes the induction.
Remarks
The factors are not canonical: the subgroup depends on the choice of and of a partner , and the companion page records two decompositions of one group with different factors. What the order formula does fix is the number of factors.
The splitting and peeling clauses are stated for an arbitrary noncommuting pair and an arbitrary admissible family because the classification arguments need to remove a factor of a prescribed isomorphism type, not the one this proof happens to construct.
Depends on
- Three equivalent descriptions of an extraspecial $p$-group
- Internal central products of a finite family of subgroups
- Internal central products are the images of external ones
- The commutator pairing of an extraspecial $p$-group relative to a chosen generator of its centre
- The commutator pairing is well defined on the central quotient, is bilinear over $\mathbb F_p$, and is alternating
- The commutator pairing of an extraspecial $p$-group has trivial radical
- Two elements of an extraspecial $p$-group with nontrivial commutator generate an extraspecial subgroup of order $p^3$
- The centralizer $C_G(H)$ of a subgroup
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
- The center $Z(G)$ of a group
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
- $C_G(x)$ and $N_G(H)$ are subgroups of $G$
- Elementary abelian $p$-groups
- First isomorphism theorem for groups: $G/\ker f\cong\operatorname{im}f$
- The quotient group $G/N$ and coset product $(gN)(hN)=ghN$
- For every prime $p$, the two operations on $\mathbb{Z}/p$ make it a field
Used by
- An extraspecial group of odd order has exponent p or p², and an extraspecial 2-group has exponent 4 Corollary
- An extraspecial p-group has order p¹⁺²ⁿ for some n≥1 Corollary
- An extraspecial p-group is the product of two maximal abelian subgroups meeting in its centre Corollary
- FALSE: some extraspecial p-group has order p²ⁿ False statement
- 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 maximal elementary abelian subgroups of the two extraspecial groups of order 2¹⁺²ⁿ have orders 2ⁿ⁺¹ and 2ⁿ Proposition
- For each n≥1 there are exactly two extraspecial groups of order 2¹⁺²ⁿ Theorem
- 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
68 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
- D. A. Craven, The Theory of p-Groups, Theorem 3.9 (standard reference, not scraped)
- M. van Beek, Topics in Finite p-Groups, Theorem 2.40(iii) (standard reference, not scraped)