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.
In an extraspecial -group of order every maximal abelian subgroup has order
Statement
Let be an extraspecial -group of order . Call an abelian subgroup of maximal abelian when it is not properly contained in any abelian subgroup of . Then maximal abelian subgroups exist, every one of them contains , and every one of them has order . Under the correspondence they are exactly the subgroups with whose image in satisfies .
Facts & Assumptions
Given: An extraspecial -group of order , the quotient with its commutator pairing , and for the subgroup .
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).
is the smallest subgroup of containing (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
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).
An extraspecial -group has with and (An extraspecial -group has order for some ).
For the maps and are inverse inclusion-preserving bijections between subgroups with and subgroups (Correspondence theorem: subgroups of correspond to subgroups of containing , with normality preserved).
For a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
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).
Proof
If is abelian then is a subgroup, because is normal, and it is abelian, because for ; it contains . So a maximal abelian subgroup equals and contains .
For with image : two elements of commute exactly when , that is exactly when ; so is abelian exactly when .
The correspondence is an inclusion-preserving bijection between the subgroups of containing and the subgroups of , and by Lagrange.
If then , so .
The trivial subgroup satisfies , and is finite, so among the subgroups with there is one of largest order, and it is maximal with that property.
Combining the previous three observations, carries the maximal abelian subgroups of bijectively onto the subgroups of that are maximal subject to .
Let be maximal subject to and suppose . Pick with and set , whose elements are the products . For such elements, , using , the choice of , skew symmetry and alternation. So and properly contains , contradicting maximality. Hence and , so .
Therefore maximal abelian subgroups exist, each contains , each corresponds to a subgroup with of order , and each has order .
Remarks
Maximality is under inclusion, not merely maximality of order, and the two agree here only because step 2.2 shows every maximal self-orthogonal subgroup has the same order. That is what makes the conclusion a statement about every maximal abelian subgroup rather than about a largest one.
Depends on
- Three equivalent descriptions of an extraspecial $p$-group
- 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
- An extraspecial $p$-group has order $p^{1+2n}$ for some $n\ge1$
- A subgroup of the central quotient and its orthogonal complement have orders multiplying to the order of the quotient
- The center $Z(G)$ of a group
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
- The quotient group $G/N$ and coset product $(gN)(hN)=ghN$
- Correspondence theorem: subgroups of $G/N$ correspond to subgroups of $G$ containing $N$, with normality preserved
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
Used by
- An extraspecial p-group is the product of two maximal abelian subgroups meeting in its centre Corollary
- The three maximal abelian subgroups of Dih(C₄) have order four, as the general bound predicts Example
- The maximal elementary abelian subgroups of the two extraspecial groups of order 2¹⁺²ⁿ have orders 2ⁿ⁺¹ and 2ⁿ Proposition
Dependency tree · two levels
52 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.41(iii) and Theorem 2.40(v) (standard reference, not scraped)
- D. A. Craven, The Theory of p-Groups, Lemma 3.12 (standard reference, not scraped)