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.
Extraspecial -Groups and Central Products
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Frattini Subgroups and the Burnside Basis Theorem
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Normal Subgroups and Quotient Groups
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Semidirect Products, Automorphism Groups and Split Extensions
- Sylow's Theorems, p-Groups and Nilpotent Groups
- The Fundamental Theorem of Finite Abelian Groups
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
Published notions of centre, commutator subgroup, quotient group, and semidirect product supply the ambient group theory, while the prerequisite Frattini page supplies Elementary abelian -groups, for a finite -group, The Frattini quotient is the largest elementary abelian quotient of a finite -group, and Burnside Basis Theorem. These are the inputs that turn the three standard descriptions of an extraspecial group into equivalent ones and that let the central quotient carry a genuine -linear structure.
The page defines special and extraspecial -groups, external and internal central products, the commutator pairing, the square map for the two-group case, and the plus/minus types. It then proves the class-two commutator formulas, the central-product universal property and recognition theorem, the decomposition of every extraspecial group into order- factors, the order and maximal-abelian consequences of that decomposition, the classification of the nonabelian groups of order , the odd- and two-primary classification theorems, the exponent dichotomy, and the two automorphism results that act on the Frattini quotient and on the commutator pairing.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Commutator identities in a group whose derived subgroup is central
Statement
Let be a group (Group and abelian group) whose derived subgroup is contained in the centre (Commutators and the commutator subgroup , The center of a group). If then , , and for every integer and all , integer powers being those of Powers : natural exponents in a monoid and integer exponents in a group, with .
Facts & Assumptions
Given: A group with , and elements .
For the commutator is , and is the subgroup generated by all commutators (Commutators and the commutator subgroup ).
For all one has and (Exponent laws in a group: and for all , and when and commute).
Proof
Every commutator lies in , hence in , so it commutes with every element of and may be moved to any position in a product without changing that product.
Expanding, , the last two equalities moving the central factor past and then past .
Expanding in the second variable, , where the central factor is moved past and then past .
For the identity follows by induction: at both sides are the identity, since is the identity and , and .
For a negative integer put ; then by step 2.1, so , and the identity is obtained the same way from step 2.2.
Remarks
The hypothesis is exactly the vanishing of the third term of the lower central series: is trivial precisely when every commutator commutes with every element of (Subgroup commutators and the lower central series).
The first two identities are additivity in each variable separately, and they fail without the hypothesis: in general , and the conjugating factor is what the hypothesis removes.
In a group with central derived subgroup,
Statement
Let be a group with (Commutators and the commutator subgroup , The center of a group) and let . If then for every , where is the binomial coefficient of The set of -element subsets and the binomial coefficient and the powers are those of Powers : natural exponents in a monoid and integer exponents in a group, with .
The commutator on the right is , not : in the convention fixed by Commutators and the commutator subgroup one has , and it is that factor which accumulates.
Facts & Assumptions
Given: A group with , elements , and .
For the commutator is (Commutators and the commutator subgroup ).
, the number of -element subsets of ; in particular , and whenever (The set of -element subsets and the binomial coefficient ).
If then , , and for every integer (Commutator identities in a group whose derived subgroup is central).
, with no restriction relating to (Pascal's rule , and the hockey-stick identity ).
For all one has (Exponent laws in a group: and for all , and when and commute).
Proof
At the exponent is zero because , and the asserted identity reads ; this is the base case.
For every , Pascal's rule at gives .
For all one has , hence ; applied to the pair this reads .
Assume the identity at a given , that is .
Applying step 1.3 to the pair gives , and , so .
Multiplying the assumption on the right by gives .
Substituting step 2.1 into step 2.2 and moving the central factor to the front gives .
By step 1.2 the exponent equals , so the identity holds at and therefore at every natural number.
Remarks
The formula is the reason the -th power map behaves differently at : the coefficient equals , so the commutator factor survives, whereas for odd the coefficient is a multiple of .
For an odd prime , the -th power map is a homomorphism on a finite group whose derived subgroup is central of exponent dividing
Statement
Let be an odd prime (Prime and composite integers: is prime when and its only positive divisors are and ) and let be a finite group with whose derived subgroup has exponent dividing (The exponent of a finite group, Commutators and the commutator subgroup , The center of a group). Then
so is a group homomorphism from to .
Facts & Assumptions
Given: An odd prime and a finite group with and dividing ; elements .
For a finite group , (The exponent of a finite group).
, the number of -element subsets of (The set of -element subsets and the binomial coefficient ).
If then for every (In a group with central derived subgroup, ).
For one has ( for ; hence , the quotient is a natural number, and ).
For all one has (Exponent laws in a group: and for all , and when and commute).
Proof
Taking in the product formula gives .
Since is odd and , the closed formula at and gives , and writing with turns this into , so .
The element lies in , and divides , say ; hence .
Combining, , so step 1.1 reads ; as this holds for all , the map is a homomorphism.
Remarks
Only the oddness of is used, in step 1.2; primality enters through the hypothesis on the derived subgroup rather than through the arithmetic. At the conclusion fails at the first step: , so and the commutator factor survives.
Special and extraspecial -groups
Definition
Let be a prime and let be a finite -group (A finite -group has order for a prime and some ). Write for its derived subgroup (Commutators and the commutator subgroup ), for its centre (The center of a group) and for its Frattini subgroup (The Frattini subgroup as the intersection of the maximal subgroups of a finite group).
A finite -group is special when is elementary abelian, and extraspecial when in addition is nonabelian and this common subgroup has order . Elementary abelian -groups are those of Elementary abelian -groups, and the trivial group is one of them.
Remarks
The nonabelian clause is stated rather than left implicit. It is not redundant for every formulation in the literature: the informal description " is elementary abelian and " is satisfied by the cyclic group of order , whose centre is the whole group, so a definition phrased that way must exclude the abelian case by hand. With the clause in force the exclusion is automatic, since an abelian group has trivial derived subgroup.
Two source conventions for extraspecial groups are in circulation and agree under the order- centre hypothesis. Craven asks that be elementary abelian and then that this common subgroup have order ; van Beek asks that have order and that have exponent . Their equivalence for nonabelian is the content of Three equivalent descriptions of an extraspecial -group.
Three equivalent descriptions of an extraspecial -group
Statement
For a finite -group the following are equivalent: is extraspecial; is nonabelian, and is elementary abelian; is nonabelian and has order .
Here , is the Frattini subgroup, and quotients are those of The quotient group and coset product .
Facts & Assumptions
Given: A prime and a finite -group (A finite -group has order for a prime and some ).
A finite -group is special when is elementary abelian, and extraspecial when in addition is nonabelian and this common subgroup has order (Special and extraspecial -groups).
For a finite -group , the quotient is elementary abelian, and for the quotient is elementary abelian if and only if (The Frattini quotient is the largest elementary abelian quotient of a finite -group).
For every finite -group , , where ( for a finite -group, The th-power subgroup ).
For , the quotient is abelian if and only if ( is abelian if and only if ).
An elementary abelian -group is a finite abelian -group in which every nonidentity element has order ; the trivial group is permitted (Elementary abelian -groups).
For every group , the center is a normal subgroup of (The center of a group is a normal subgroup).
For a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
In a finite group whose order is prime, every has order and generates (A finite group of prime order is cyclic and every nonidentity element generates it).
Proof
Suppose is extraspecial. Then is nonabelian, has order , and is elementary abelian; since this says is elementary abelian, the quotient being formed along a normal subgroup. So the second description holds.
Suppose is nonabelian with and elementary abelian. Applying the elementary abelian criterion to the normal subgroup gives , and an elementary abelian quotient is abelian, so . As is nonabelian, ; a subgroup of the group of order has order or , so . Then contains and is contained in , so has order , which is the third description.
Suppose is nonabelian with of order . A group of prime order is cyclic, hence abelian, and each of its nonidentity elements has order , so this common subgroup is elementary abelian; it is a finite -group because its order is . Thus meets the definition and is extraspecial.
The three implications close a cycle, so the three descriptions are equivalent.
Remarks
The nonabelian hypothesis does real work exactly once, in step 1.2, where it supplies . Dropping it leaves the cyclic group of order satisfying the second description with of order and trivial quotient, while its derived subgroup is trivial and the third description fails.
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.
The centre of an extraspecial -group has no complement
Statement
Let be an extraspecial -group. Then has no complement in : there is no subgroup with and .
Facts & Assumptions
Given: An extraspecial -group (Special and extraspecial -groups).
For subgroups of with , and , the group is the internal semidirect product of by , and is called a complement to in (An internal semidirect product and a complement to a normal 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).
For every homomorphism , the rule is an isomorphism from onto (First isomorphism theorem for groups: ).
An elementary abelian -group is a finite abelian -group in which every nonidentity element has order (Elementary abelian -groups).
Proof
Suppose is a complement to , so that and ; the centre is normal, so the quotient is defined.
Let be the quotient map and restrict it to . Its kernel is , and its image is all of because every is with and , whence ; so .
The quotient is elementary abelian, hence abelian, so is abelian.
Every element of is with central and , and , so is abelian; this contradicts the nonabelianness of an extraspecial group.
Remarks
The argument uses no bound on the order of , so the conclusion holds for every extraspecial group and not only for those of order . What fails is not that a complement is hard to find but that its existence would make the group abelian, which the definition forbids.
Every conjugacy class of an extraspecial -group outside the centre has exactly elements
Statement
Every conjugacy class of an extraspecial -group whose representative is not central has exactly elements. That is, for an extraspecial -group and ,
Facts & Assumptions
Given: An extraspecial -group (Special and extraspecial -groups) and an element with .
For the commutator is (Commutators and the commutator subgroup ).
For and , the right coset is (Left and right cosets and of a subgroup).
An extraspecial -group has derived subgroup of order (An extraspecial -group is nilpotent of class exactly two and its derived subgroup has order ).
for a finite group ( is a bijection, so whenever these cardinalities are finite).
For a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
, the number of left cosets of in (The coset set and the index of a subgroup).
A finite -group is a finite group whose order has the form for some (A finite -group has order for a prime and some ).
Proof
For every one has , so each conjugate of has the form .
The derived subgroup of is and has order , and is a finite -group, so for some .
The size of the class of is the index , and by Lagrange that index divides .
Each lies in , so every conjugate of lies in the right coset ; the map is a bijection from onto that coset, so the coset has elements and the class of has at most .
Since , some fails to commute with , so , its index is greater than one, and the class of has more than one element.
The class size divides , so it is a power of ; it lies strictly between and inclusive, and the only such power of is itself.
Remarks
The hypothesis is used only at step 2.2, and it is used to rule out the class of size one. A central runs through the same computation and comes out with the class , which is consistent with step 2.1 and shows that the two cases exhaust the group.
A noncentral element of an extraspecial -group has centraliser of index
Statement
Let be an extraspecial -group and let . Then
Facts & Assumptions
Given: An extraspecial -group and an element with .
, the number of left cosets of in (The coset set and the index of a subgroup).
Every conjugacy class of an extraspecial -group whose representative is not central has exactly elements (Every conjugacy class of an extraspecial -group outside the centre has exactly elements).
for a finite group ( is a bijection, so whenever these cardinalities are finite).
For a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
Proof
The class of has exactly elements, because is not central.
The size of that class is the index of the centraliser of in .
Hence , and Lagrange turns this into .
Remarks
Every centraliser named here is proper, since is noncentral, and maximal in the order sense: index is the smallest index a proper subgroup of a finite -group can have.
The central product of two groups along an isomorphism of central subgroups
Definition
Let and be groups, let and be subgroups of their centres (The center of a group, Subgroup), and let be an isomorphism (Group isomorphisms, automorphisms and the set ). Inside the external direct product (The external direct product with componentwise multiplication, is a group with identity , coordinatewise inverses, and homomorphic coordinate projections) put
For groups with central subgroups , and an isomorphism , the central product is the quotient of by , formed as in The quotient group and coset product :
That is a normal subgroup, so that the quotient is defined (Normal subgroup: invariance under conjugation), is proved in The identified subgroup used to form a central product is central, hence normal ↗.
Write for the quotient map and , for the canonical images of and .
Remarks
The identification is along and reverses the second coordinate: killing is exactly what makes hold in the quotient, so the two identified central subgroups become one. Killing instead would identify with , which is the central product along composed with inversion rather than along .
Craven writes for a central product and van Beek writes ; the notation is used here because the isomorphism is part of the data and different choices of can give non-isomorphic quotients.
Taking gives and recovers the direct product, so the construction is a genuine generalisation and not a separate object.
The identified subgroup used to form a central product is central, hence normal
Statement
Let and be groups with central subgroups and and an isomorphism . The subgroup of is central, hence normal, so the quotient of The central product of two groups along an isomorphism of central subgroups is defined.
Facts & Assumptions
Given: Groups , central subgroups and , and an isomorphism .
For groups with central subgroups , and an isomorphism , the central product is the quotient of by (The central product of two groups along an isomorphism of central subgroups).
A subset is a subgroup when , is closed under the operation, and is closed under inverses (Subgroup).
A subgroup is normal in when for every , where (Normal subgroup: invariance under conjugation).
A group homomorphism satisfies and (A group homomorphism automatically satisfies and , and for every ; for monoid homomorphisms preservation of the identity must be assumed).
The external direct product carries the componentwise operation (The external direct product with componentwise multiplication).
The componentwise operation makes a group with identity and ( is a group with identity , coordinatewise inverses, and homomorphic coordinate projections).
Proof
The isomorphism is in particular a homomorphism, so and ; moreover , so any two elements of commute and .
Hence lies in ; the product lies in ; and lies in . So is a subgroup of .
Every element of has first coordinate in and second coordinate in , and the operation is componentwise, so for every ; thus .
For and centrality gives , so and is normal; the quotient is therefore defined.
Remarks
Centrality is used twice. It makes the inverse-coordinate rule multiplicative, so that is a subgroup, and it then makes that subgroup central and hence normal. For merely isomorphic subgroups the displayed antidiagonal need be neither a subgroup nor a normal subset, so the quotient construction does not apply.
The two canonical maps into a central product are injective homomorphisms whose images commute, generate it, and meet in the identified centre
Statement
Let and be groups with central subgroups and and an isomorphism , and let be the quotient map. The canonical maps and are injective homomorphisms whose images commute elementwise, generate , and meet in the image of . They are and , and the intersection of their images is .
Facts & Assumptions
Given: Groups , central subgroups and , an isomorphism , and the quotient map .
For groups with central subgroups , and an isomorphism , the central product is the quotient of by (The central product of two groups along an isomorphism of central subgroups).
The quotient group has the left cosets as elements with product (The quotient group and coset product ).
For a group homomorphism , and (The kernel and image of a group homomorphism).
The subgroup of is central, hence normal (The identified subgroup used to form a central product is central, hence normal).
The external direct product carries the componentwise operation (The external direct product with componentwise multiplication).
is the smallest subgroup of containing , namely (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
An isomorphism is a bijective group homomorphism (Group isomorphisms, automorphisms and the set ).
Proof
The coordinate maps and are homomorphisms into , because the operation there is componentwise, and is a homomorphism onto the quotient; so both canonical maps are homomorphisms.
The kernel of is ; an equality gives and , so because is injective, and the kernel is trivial. Likewise gives and then . Both canonical maps are therefore injective.
In one has , so for all and : the two images commute elementwise.
Every element of is , so the two images together generate .
If then lies in , so and , that is ; conversely for every , since . Hence the two images meet exactly in .
Remarks
Injectivity is what makes the central product an honest amalgam: each factor embeds, and the only collapsing is the prescribed identification of with . If were merely a surjective homomorphism, would meet the first coordinate copy of in and that copy would not embed.
Order, centre and derived subgroup of a central product
Statement
Let and be groups with central subgroups and and an isomorphism , and write for the canonical images in . Then:
- if and are finite, ;
- , the image of ;
- , the image of .
Facts & Assumptions
Given: Groups , central subgroups and , an isomorphism , the quotient map , and the canonical images , .
For groups with central subgroups , and an isomorphism , the central product is the quotient of by (The central product of two groups along an isomorphism of central subgroups).
For the commutator is , and is the subgroup generated by all commutators (Commutators and the commutator subgroup ).
The canonical maps and are injective homomorphisms whose images commute elementwise, generate , and meet in the image of (The two canonical maps into a central product are injective homomorphisms whose images commute, generate it, and meet in the identified centre).
If and are finite groups, then their external direct product is finite and has order (For finite groups and , ).
For a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
is the smallest subgroup containing (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
The subgroup of is central, hence normal (The identified subgroup used to form a central product is central, hence normal).
Proof
The map is a bijection from onto , so ; with and Lagrange applied to , the number of cosets is , which is the order of .
The images of and of in commute elementwise, generate , and each canonical map is injective.
Let be central in and let . Then commutes with , so commutes with , hence is trivial; injectivity of the canonical map gives , so , and symmetrically .
Conversely, if and then commutes with every and with every , and those elements generate , so is central.
Because the two images commute elementwise, for all and .
Every element of is by step 1.2, so steps 2.1 and 2.2 identify as the image of ; and by step 2.3 the commutators of are exactly the products , whose generated subgroup is the image of .
Remarks
Clause 1 needs both factors finite; clauses 2 and 3 do not, since they use only that the two images commute and generate. The order formula divides by and not by : one copy of the identified subgroup survives inside the product, and it is the image described in the intersection clause of the canonical-maps proposition.
Homomorphisms out of a central product
Statement
Let and be groups with central subgroups and and an isomorphism , and let be a group. If and are homomorphisms with commuting images and , then there is a unique homomorphism restricting to and along the canonical maps. Explicitly it sends to .
Facts & Assumptions
Given: Groups , central subgroups and , an isomorphism , and homomorphisms , with for all and for all .
The external direct product carries the componentwise operation (The external direct product with componentwise multiplication).
For groups with central subgroups , and an isomorphism , the central product is the quotient of by (The central product of two groups along an isomorphism of central subgroups).
For a group homomorphism , (The kernel and image of a group homomorphism).
The quotient group has the left cosets as elements, with product (The quotient group and coset product ).
A group homomorphism satisfies and (A group homomorphism automatically satisfies and , and for every ; for monoid homomorphisms preservation of the identity must be assumed).
For the rule on left cosets is independent of the representatives and if and only if (Coset multiplication is well defined if and only if is normal).
The subgroup of is central, hence normal (The identified subgroup used to form a central product is central, hence normal).
The canonical maps and are injective homomorphisms whose images commute elementwise, generate , and meet in the image of (The two canonical maps into a central product are injective homomorphisms whose images commute, generate it, and meet in the identified centre).
Proof
The assignment satisfies , the middle equality being the commuting-images hypothesis; so is a homomorphism.
For , , so .
If in then , so and ; hence is a well-defined function on , and it is a homomorphism because is normal and .
On the canonical images, and ; and any homomorphism agreeing with and on the two images agrees with on a generating set of , hence everywhere.
Remarks
Both hypotheses are needed and neither is implied by the other. Without commuting images the assignment of step 1.1 is not a homomorphism on the direct product; without the agreement on the subgroup need not lie in the kernel, so nothing descends to the quotient.
Internal central products of a finite family of subgroups
Definition
Let be a group and let be subgroups of , where (Subgroup). Subgroups of form an internal central product when they generate and for , where is the generated subgroup of The subgroup generated by a subset, the cyclic subgroup , and cyclic groups and is the subgroup commutator of Subgroup commutators and the lower central series. The empty family is an internal central product of the trivial group.
Since the factors commute pairwise, as a set of products, and for every element of commutes with both and , so (The center of a group).
Remarks
The condition differs from that of an internal direct product (Internal direct products of finitely many normal subgroups) in exactly one place: there the factors are required to intersect trivially, here they are allowed to share a central subgroup. An internal direct product of normal subgroups is in particular an internal central product, since distinct factors of a direct product commute elementwise.
No hypothesis is placed on the intersections beyond what the commuting condition already forces. That is deliberate: the intersections are what the recognition theorem computes, rather than data prescribed in advance.
Internal central products are the images of external ones
Statement
Let be a group and . Subgroups form an internal central product of if and only if the multiplication map , , is a surjective homomorphism; each factor then meets its kernel trivially.
For two factors this identifies the internal notion with the external one: if form an internal central product of and , then and , and
the external central product of The central product of two groups along an isomorphism of central subgroups taken along the identity isomorphism of .
Facts & Assumptions
Given: A group and subgroups ; in the second half, and .
Subgroups of form an internal central product when they generate and for (Internal central products of a finite family of subgroups).
The external direct product carries the componentwise operation (The external direct product with componentwise multiplication).
For groups with central subgroups , and an isomorphism , the central product is the quotient of by (The central product of two groups along an isomorphism of central subgroups).
For a group homomorphism , and (The kernel and image of a group homomorphism).
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).
Proof
Suppose the subgroups generate and commute pairwise. Writing , the commuting hypothesis lets the factors of be sorted by index, so and is a homomorphism; its image is a subgroup containing every , hence equals , so is surjective.
For the converse, suppose is a surjective homomorphism. Surjectivity gives , so the subgroups generate. For , and , the tuples with in place and with in place commute in the direct product, so ; hence .
In either case a tuple with a single nonidentity entry has -value , so it lies in only if : each factor meets the kernel trivially.
Now let and let form an internal central product with . An element lies in , so it commutes with every element of , giving ; symmetrically .
The kernel of is , since lies in both subgroups.
That kernel is exactly the subgroup used to build , so the first isomorphism theorem gives .
Remarks
The commuting condition is imposed only for . A single factor is not required to be abelian, which is what allows a nonabelian group to be an internal central product of one factor, namely itself.
The identity isomorphism of is forced here rather than chosen: the kernel of the multiplication map is , and that is the identified subgroup of the external product along and along no other map.
A central product of extraspecial -groups identified along their centres is extraspecial
Statement
Let and be extraspecial -groups and let be an isomorphism. Then is extraspecial, of order , and its centre and derived subgroup are the common image of and .
Facts & Assumptions
Given: Extraspecial -groups , an isomorphism , and with canonical images for and for .
A finite -group is special when is elementary abelian, and extraspecial when in addition is nonabelian and this common subgroup has order (Special and extraspecial -groups).
A finite -group is a finite group whose order has the form for some (A finite -group has order for a prime and some ).
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 a central product of finite groups, ; without a finiteness hypothesis, its centre is the image of and its derived subgroup is the image of (Order, centre and derived subgroup of a central product).
The canonical maps and are injective homomorphisms whose images commute elementwise, generate , and meet in the image of (The two canonical maps into a central product are injective homomorphisms whose images commute, generate it, and meet in the identified centre).
For , the quotient is abelian if and only if ( is abelian if and only if ).
An elementary abelian -group is a finite abelian -group in which every nonidentity element has order (Elementary abelian -groups).
Proof
Each is nonabelian, has of order , and has elementary abelian central quotient .
The canonical maps embed and in ; their images commute elementwise and generate .
The central-product formulas give , which is a power of ; the centre of is the image of and the derived subgroup of is the image of . Those two subgroups of coincide by step 1.1, so ; the subgroup has order and contains the identified subgroup of order , so its image has order .
The group is nonabelian, because the canonical map embeds the nonabelian group into it.
Since , the quotient is abelian; and for , the commuting images give , where and because the central quotients are elementary abelian, so lies in . Every element of has this form, so every element of the finite abelian -group has order dividing and is elementary abelian.
So is a nonabelian finite -group with and elementary abelian central quotient, which is the second description in the characterisation; hence is extraspecial.
Remarks
The identification must be along the full centres: if a proper subgroup of were identified it would be trivial, the product would be the direct product, and its centre would have order . That is the case recorded on the companion page as a special group which is not extraspecial.
The commutator pairing of an extraspecial -group relative to a chosen generator of its centre
Definition
Let be an extraspecial -group (Special and extraspecial -groups) and fix a generator of its centre, so that has order . Write
which is elementary abelian (Three equivalent descriptions of an extraspecial -group, Elementary abelian -groups, The quotient group and coset product ), and give it its canonical -vector-space structure (An elementary abelian -group has a canonical -vector-space structure), where is the field of For every prime , the two operations on make it a field and For every natural , is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold, the group operation of is vector addition and the scalar action is . Elements of are written multiplicatively, denoting the coset ; scalars are written additively.
The commutator pairing of relative to is the map
Why the exponent exists and is unique. Every commutator of lies in (An extraspecial -group is nilpotent of class exactly two and its derived subgroup has order , Commutators and the commutator subgroup , The center of a group), so for some integer . Since has order (The order of a finite group and the order of an element, with when no positive power of is the identity, A finite group of prime order is cyclic and every nonidentity element generates it), depends only on the class of in , and forces ; so the class is determined by , and that class is .
That the value depends only on the cosets and , and not on the representatives and , is proved in The commutator pairing is well defined on the central quotient, is bilinear over , and is alternating ↗.
Remarks
The pairing depends on the choice of , and only on it: replacing by with replaces by . So the radical, the orthogonality relation and every statement about a subspace being self-orthogonal are independent of the choice, while the individual values are not. The companion page records the false statement that no choice is needed.
Nothing here is imported from a theory of bilinear forms. The target is the field , the vector-space structure on is the canonical scalar action of an elementary abelian -group, and every property of used below is proved from the commutator identities of a group whose derived subgroup is central.
The commutator pairing is well defined on the central quotient, is bilinear over , and is alternating
Statement
Let be an extraspecial -group with and . The commutator pairing is well defined on : the value of does not depend on the representatives and . It is -bilinear,
and alternating: for every . Consequently .
Facts & Assumptions
Given: An extraspecial -group with of order , the quotient with its canonical -structure, and the pairing defined by .
The commutator pairing of relative to is the map determined by , where carries the canonical scalar action (The commutator pairing of an extraspecial -group relative to a chosen generator of its centre).
For the commutator is (Commutators and the commutator subgroup ).
The rule gives every elementary abelian -group its canonical -vector-space structure, with the group operation as vector addition and the identity as zero (An elementary abelian -group has a canonical -vector-space structure).
An extraspecial -group is nilpotent of class exactly two, so its derived subgroup is central, and every nonidentity commutator has order (An extraspecial -group is nilpotent of class exactly two and its derived subgroup has order ).
If then , , and for every integer (Commutator identities in a group whose derived subgroup is central).
For every prime , the operations of addition and multiplication on make it a field (For every prime , the two operations on make it a field).
Proof
The derived subgroup of is central, so the two expansion identities and the power identity are available for all elements of .
Alternation: , so .
If then with , and because is central makes ; the second variable is the same computation with the other expansion identity. So depends only on the two cosets.
Additivity in the first variable: , and exponents of are determined modulo ; the second variable is symmetric.
Compatibility with scalars: for an integer , , and both sides depend only on modulo because has order ; the scalar action on is , so this is exactly , and likewise in the second variable.
Expanding by steps 2.2 and 1.2 gives , so .
Remarks
Alternation is the primitive property and skew symmetry is derived from it, not the other way round. At the two are not interchangeable: there , so skew symmetry says only that the pairing is symmetric, and it is the vanishing of that carries content.
The commutator pairing of an extraspecial -group has trivial radical
Statement
Let be an extraspecial -group with and , and let be its commutator pairing. The radical of is trivial: if satisfies for every , then is the identity of . Conversely the identity of pairs to zero with every element.
Facts & Assumptions
Given: An extraspecial -group with , the quotient , and the commutator pairing .
The commutator pairing of relative to is the map determined by , where (The commutator pairing of an extraspecial -group relative to a chosen generator of its centre).
The quotient group has the left cosets as elements (The quotient group and coset product ).
The commutator pairing is well defined on , is -bilinear, and is alternating (The commutator pairing is well defined on the central quotient, is bilinear over , and is alternating).
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
Let represent and suppose for every . Since every element of represents some coset, this says for every , that is for every .
Hence , so is the identity coset of .
Conversely, if is the identity of then , so and for every .
Remarks
Triviality of the radical, rather than merely its smallness, is exactly the statement that the centre is the whole kernel of the quotient map. It is what lets a single element of be detected by pairing it against the others, and it is used in that form by every counting argument below.
Two elements of an extraspecial -group with nontrivial commutator generate an extraspecial subgroup of order
Statement
Let be an extraspecial -group with , and let satisfy . Then contains , has order , is nonabelian, and is extraspecial with .
Facts & Assumptions
Given: An extraspecial -group with of order , the quotient with its commutator pairing , and elements with .
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).
A subset of an elementary abelian -group is independent when with finite support forces every , and it spans when every element is such a product (-spanning sets, independence, and bases in an elementary abelian -group).
An elementary abelian -group is a finite abelian -group in which every nonidentity element has order (Elementary abelian -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).
The commutator pairing is well defined, -bilinear and alternating, and satisfies (The commutator pairing is well defined on the central quotient, is bilinear over , and is alternating).
In a finite group whose order is prime, every has order and generates (A finite group of prime order is cyclic and every nonidentity element generates it).
For a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
If the quotient group is cyclic, then is abelian (If is cyclic, then is abelian).
is the smallest subgroup of containing (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
The rule gives every elementary abelian -group its canonical -vector-space structure (An elementary abelian -group has a canonical -vector-space structure).
If is a finite -group and , then for some (Every subgroup of a finite -group has order a power of ).
Proof
The element lies in and is not the identity, so it generates the group of order ; since , this gives .
Write ; then , so in .
The pair is independent in : if is the identity of , pairing with gives and hence , and pairing with gives and hence .
Since , the image of in is , and it equals ; independence makes the displayed products pairwise distinct, so and Lagrange gives .
is nonabelian because , and because an element central in is central in the subgroup containing it. The order of is a power of dividing and is not ; were it , the quotient would have order and hence be cyclic, forcing abelian. So and .
The quotient is a subgroup of the elementary abelian group , hence is itself a finite abelian -group all of whose nonidentity elements have order ; so is a nonabelian finite -group with centre of order and elementary abelian central quotient, and the characterisation makes it extraspecial.
Remarks
The hypothesis is on the pair, not on either element separately: and are automatically noncentral, since a central element commutes with everything, but two noncentral elements can commute and then generate an abelian subgroup.
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.
An extraspecial -group has order for some
Statement
Let be an extraspecial -group. Then for some integer , and . In particular no extraspecial group has order , and none has order .
Facts & Assumptions
Given: An extraspecial -group .
Every extraspecial -group is an internal central product of nonabelian subgroups of order with pairwise intersections , and (Every extraspecial -group is an internal central product of nonabelian subgroups of order ).
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 a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
, the number of left cosets of in (The coset set and the index of a subgroup).
Proof
The decomposition theorem writes as an internal central product of nonabelian subgroups of order and gives .
The centre of has order .
Lagrange applied to gives .
Since is odd, no extraspecial group has order an even power of ; and excludes the order , which corresponds to .
Remarks
The exponent is determined by the order and therefore by the group, so it can be used as an invariant even though the decomposition producing it is not unique. That is what the nonabelian clause of the definition buys: an abelian group with a centre of order would be the cyclic group of order , of order .
An extraspecial -group of order has generator rank
Statement
Let be an extraspecial -group of order . Then has order , the Frattini quotient has order , the generator rank is , and every minimal generating set of has exactly elements.
Facts & Assumptions
Given: An extraspecial -group of order .
For a finite -group , the generator rank is the common size of a basis of (The generator rank of a finite -group).
A subset of an elementary abelian -group spans when every element is a product with coefficients in , and is independent when such a product is the identity only for zero coefficients; a basis is an independent spanning subset (-spanning sets, independence, and bases in an elementary abelian -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).
An extraspecial -group has with and (An extraspecial -group has order for some ).
Every finite elementary abelian -group has a basis; every independent subset extends to a basis, every spanning subset contains a basis, and all bases have the same finite size (Finite elementary abelian -groups have bases, basis extension, and a well-defined dimension).
A subset of a finite -group is a minimal generating set if and only if the quotient map restricts to a bijection from onto a basis of (Burnside Basis Theorem).
The rule gives every elementary abelian -group its canonical -vector-space structure (An elementary abelian -group has a canonical -vector-space structure).
Proof
By the third description in the characterisation, has order , so the Frattini quotient is the central quotient.
The central quotient has order and is elementary abelian.
It therefore has a basis, and all of its bases have the same size, say ; independence and spanning make the map sending a coefficient family to the product of the corresponding powers a bijection from the coefficient families onto the group, so and .
Hence by the definition of the generator rank, and by the Burnside basis theorem a minimal generating set of is carried bijectively onto a basis of , so it has elements.
Remarks
The two clauses say different things. The first is about the quotient and is a count of a basis; the second is about itself and needs the Burnside basis theorem, because a generating set of of size could a priori collapse in the quotient. It is the restricted-bijection clause of that theorem which rules that out.
A subgroup of the central quotient and its orthogonal complement have orders multiplying to the order of the quotient
Statement
Let be an extraspecial -group of order , let and let be its commutator pairing. For a subgroup put
Then is a subgroup of and
This is a statement about this pairing on this quotient, proved by counting inside ; no theory of bilinear forms on a vector space is used.
Facts & Assumptions
Given: An extraspecial -group of order , the quotient with its commutator pairing , and a 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).
A subset of an elementary abelian -group spans when every element is a product with coefficients in , and is independent when such a product is the identity only for zero coefficients; a basis is an independent spanning subset (-spanning sets, independence, and bases in an elementary abelian -group).
An elementary abelian -group is a finite abelian -group in which every nonidentity element has order (Elementary abelian -groups).
The commutator pairing is well defined, -bilinear and alternating (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).
An extraspecial -group has with and (An extraspecial -group has order for some ).
Every finite elementary abelian -group has a basis; every independent subset extends to a basis, every spanning subset contains a basis, and all bases have the same finite size (Finite elementary abelian -groups have bases, basis extension, and a well-defined dimension).
The rule gives every elementary abelian -group its canonical -vector-space structure (An elementary abelian -group has a canonical -vector-space structure).
For every homomorphism , the rule is an isomorphism from onto (First isomorphism theorem for groups: ).
For a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
Proof
The group is elementary abelian of order , and is a subgroup of it, hence also a finite abelian -group whose nonidentity elements have order .
For each fixed the map is a homomorphism from to the additive group of , by additivity of in its first variable; is the intersection of the kernels of these maps as runs over , hence a subgroup of .
Choose a basis of and extend it to a basis of . Unique representation in a basis makes the assignment of coefficient families to elements a bijection, so and , whence .
Define by . It is a homomorphism, again by additivity in the first variable. If is the identity then independence of the basis forces for every , and then additivity in the second variable gives for every , so is the identity by triviality of the radical. Thus is injective, hence bijective because is finite.
Let send to ; unique representation makes a well-defined homomorphism, and it is surjective onto because it fixes each with . The composite is therefore a surjective homomorphism from onto , and is the identity exactly when for every , which by additivity in the second variable is exactly .
The first isomorphism theorem and Lagrange applied to give , that is .
Remarks
The two ends of the range behave as the formula predicts and are worth naming. For the trivial subgroup the formula reads , since the perpendicular of the trivial subgroup is all of ; for it reads , which is triviality of the radical.
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.
An extraspecial -group is the product of two maximal abelian subgroups meeting in its centre
Statement
Let be an extraspecial -group of order . Then there are maximal abelian subgroups and of , each of order , with
Facts & Assumptions
Given: An extraspecial -group of order with , the quotient and its commutator pairing .
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).
For subgroups , (Subgroup commutators and the lower central series).
Every extraspecial -group is an internal central product of nonabelian subgroups of order with and for (Every extraspecial -group is an internal central product of nonabelian subgroups of order , Internal central products of a finite family of subgroups).
The commutator pairing is well defined, -bilinear and alternating (The commutator pairing is well defined on the central quotient, is bilinear over , and is alternating).
Maximal abelian subgroups of contain , have order , and under the correspondence are exactly the subgroups containing whose image satisfies (In an extraspecial -group of order every maximal abelian subgroup has order ).
In a finite group whose order is prime, every has order and generates (A finite group of prime order is cyclic and every nonidentity element generates it).
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).
If and , then (Second isomorphism theorem for groups: ).
For every group and , the centralizer is a subgroup of ( and are subgroups of ).
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
Fix an internal central product decomposition with each nonabelian of order , , for , and .
Each is nonabelian, so it contains elements with nontrivial commutator; choose with . That commutator lies in and is not the identity, so it generates and equals with ; putting with in gives .
The pairing values are , while , and whenever the two elements lie in different factors or are equal, because distinct factors commute elementwise and the pairing is alternating.
Put and . Their generators commute pairwise, so the centraliser of each generator is a subgroup containing all of them and hence contains (respectively ); therefore each generator is central in (respectively ), and and are abelian.
The images and consist of the products and . If is the identity, pairing with gives , so the are independent and ; the same argument with the roles exchanged gives . If , pairing with gives and pairing with gives , so is trivial.
Since is abelian its image satisfies , and the counting formula gives , so and is maximal abelian of order ; likewise for .
In the abelian group the product is a subgroup and the second isomorphism theorem gives , so ; lifting along the correspondence, every has , hence because , and . The correspondence also gives trivial, so .
Finally is generated by commutators of elements of , so it lies in ; and it contains , which generates . Hence .
Remarks
The two subgroups are built from a chosen decomposition and are not canonical; another decomposition may yield the same pair or a different one. What the statement fixes is that a factorisation of this shape exists, with both factors as large as an abelian subgroup can be.
The Heisenberg group of order over
Definition
Let be a prime (Prime and composite integers: is prime when and its only positive divisors are and ) and let carry the addition and multiplication of For every natural , is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold, which make it a field (For every prime , the two operations on make it a field). The Heisenberg group of order is the set
with the multiplication
That this is a group law (Group and abelian group), that it is not commutative, and that has elements are proved in The Heisenberg multiplication is a group law, nonabelian, on a set of elements ↗.
Remarks
The same multiplication is written on the published example The finite Heisenberg group is the unique Sylow -subgroup of its coordinate upper-triangular group, where the triple records the three entries above the diagonal of a unipotent upper-triangular matrix over ; the two constructions produce the same group, and the notation is kept identical so that a reader meets one object rather than two.
The asymmetry of the third coordinate, rather than , is a choice of convention: the opposite choice gives the group with the roles of the first two coordinates exchanged, and the map carries one to the other. Nothing below depends on which is taken, provided one is taken throughout.
At the construction does not produce a group of exponent two: the element squares to , so has an element of order four.
The Heisenberg multiplication is a group law, nonabelian, on a set of elements
Statement
Let be a prime. The multiplication makes the set a group with identity and inverse ; the group is not abelian; and . Moreover , and for all , so those three elements generate (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups) and each has order (The order of a finite group and the order of an element, with when no positive power of is the identity, Powers : natural exponents in a monoid and integer exponents in a group, with ).
Facts & Assumptions
Given: A prime and the set with the multiplication above.
The Heisenberg group of order is the set with (The Heisenberg group of order over ).
A group is a set with an associative operation having a two-sided identity and two-sided inverses (Group and abelian group).
For every , is an abelian group, is a commutative monoid, and multiplication distributes over addition on both sides (For every natural , is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold).
If and are finite then is finite and (The product rule: , and ).
is the unique natural number with (The cardinality of a finite set).
For every prime , is a field (For every prime , the two operations on make it a field).
Proof
Associativity: both and have first coordinate , second coordinate , and third coordinate , the two computations differing only in the order in which the three products are formed.
The triple is a two-sided identity: and .
The triple is a two-sided inverse of : the product in one order is , and in the other it is .
The quotient set has the distinct classes , so it has elements. The underlying set of is the threefold product of those -element sets, and [L2] therefore gives .
The three displayed power formulas hold because , and , so each power is obtained from the previous one by adding one in the relevant coordinate.
By steps 1.1 to 1.3 the multiplication makes a group.
It is not abelian: while , and these differ because in for every prime .
Each of , and has -th power by step 1.5, hence order since each is not the identity; and , so the three elements generate .
Remarks
The verification of associativity is where the third coordinate earns its shape: the two bracketings produce the cross terms and respectively together with the common term , and they agree because multiplication in distributes over addition.
The Heisenberg group of order is extraspecial, and for odd it has exponent
Statement
Let be a prime and let be the Heisenberg group of order . Then
a subgroup of order , and is extraspecial. For odd the exponent of is . At the exponent is , since .
Facts & Assumptions
Given: A prime and the Heisenberg group .
The Heisenberg group of order is the set with (The Heisenberg group of order over ).
For the commutator is , and is the subgroup generated by all commutators (Commutators and the commutator subgroup ).
For a finite group , (The exponent of a finite group).
The Heisenberg multiplication is a group law with identity and inverse ; the group is not abelian, , and , , (The Heisenberg multiplication is a group law, nonabelian, on a set of elements).
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 , the quotient is abelian if and only if ( is abelian if and only if ).
If the quotient group is cyclic, then is abelian (If is cyclic, then is abelian).
For a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
An elementary abelian -group is a finite abelian -group in which every nonidentity element has order (Elementary abelian -groups).
For an odd prime and a finite group with of exponent dividing , for all (For an odd prime , the -th power map is a homomorphism on a finite group whose derived subgroup is central of exponent dividing ).
is the smallest subgroup of containing (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
A finite -group is a finite group whose order has the form (A finite -group has order for a prime and some ).
Proof
A triple commutes with exactly when . Taking gives , and taking gives ; conversely every commutes with everything. So , a subgroup of order .
For and one has and , so and therefore .
is a finite -group of order and is not abelian.
Every commutator lies in , and taking with gives the commutator , which generates that subgroup; hence , of order .
By Lagrange the quotient has order ; it is abelian because , and it is not cyclic, since a cyclic central quotient would make abelian. An abelian group of order that is not cyclic has no element of order , so every one of its nonidentity elements has order and it is elementary abelian.
By the second description in the characterisation, is extraspecial.
For odd , the derived subgroup is central of order , so the -th power map is a homomorphism; the three generators , and have -th power the identity, so the -th power map is trivial on a generating set and hence on . Since is nontrivial, its exponent is .
At the exponent is not : , which is not the identity, while , so has order and the exponent is .
Remarks
The group is extraspecial at every prime, included; only the exponent depends on the parity of . The step that fails at is the -th power homomorphism, whose hypothesis is that be odd, and the failure is visible in the element of order four.
Raising to the power is an automorphism of order of a cyclic group of order
Statement
Let be a prime. In the class of is a unit of multiplicative order , and for every . Consequently, if is a cyclic group of order , the map is an automorphism of of order (Group isomorphisms, automorphisms and the set ).
Facts & Assumptions
Given: A prime , the ring , and a cyclic group of order .
For every , is an abelian group, is a commutative monoid, and multiplication distributes over addition on both sides (For every natural , is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold).
when that set is nonempty (The order of a finite group and the order of an element, with when no positive power of is the identity).
is prime when and its only positive divisors are and (Prime and composite integers: is prime when and its only positive divisors are and ).
A cyclic group with a generator of finite order is isomorphic to (Every cyclic group is isomorphic to or to for its finite order ).
Proof
At the claim reads in .
Assume in for a given .
In the class of is zero, so holds exactly when divides , that is exactly when divides .
An automorphism of a cyclic group of order is for a unit class of , and this correspondence is an isomorphism of groups, so it preserves orders.
Then , the last equality because in .
Hence for every ; by step 1.3 this equals exactly when divides , so the least positive such is and the class of is a unit of order . Under the correspondence of step 1.4 it is the automorphism , which therefore has order .
Remarks
The computation holds at as well: there and in , so the automorphism of a cyclic group of order four is inversion and has order two.
The modular group of order as a semidirect product
Definition
Let be a prime, let be a cyclic group of order and let be a cyclic group of order (Every cyclic group is isomorphic to or to for its finite order ). Define
Why this is well defined and is an action by automorphisms. Each is an automorphism of of order (Raising to the power is an automorphism of order of a cyclic group of order ), so is the -th power of that automorphism and is an automorphism. If then divides , and the -th power of that automorphism is the identity, so . Finally , so is a homomorphism into and hence an action by automorphisms (An action of a group on a group by automorphisms, Group isomorphisms, automorphisms and the set ).
The modular group of order is the external semidirect product ( The external semidirect product , The semidirect-product multiplication makes a group)
Writing and for the canonical images of the two generators (The canonical copy of is normal, the canonical copy of is a complement, and conjugation induces the action), the group is generated by and subject to
Remarks
Craven writes for the analogous group of order and reserves for the exponent- group; only the case is built here. Its relation uses the standard order- power automorphism , the first nonidentity power automorphism congruent to the identity modulo .
At the relation reads , so the action is inversion and is the generalized dihedral group of a cyclic group of order four ( with inversion action has order and the dihedral relations).
The modular group of order is extraspecial, of exponent when is odd
Statement
Let be a prime and let be the modular group of order , with of order , of order and . Then , the group is nonabelian,
has order , and is extraspecial of exponent . At the group is the generalized dihedral group .
Facts & Assumptions
Given: A prime and the modular group with its generators and .
The modular group of order is with of order , of order , and (The modular group of order as a semidirect product ).
For the commutator is (Commutators and the commutator subgroup ).
For a finite group , (The exponent of a finite group).
In the sets and are subgroups, is normal, , every element has a unique factorisation , and (The canonical copy of is normal, the canonical copy of is a complement, and conjugation induces the action).
The class of in is a unit of multiplicative order , and (Raising to the power is an automorphism of order of a cyclic group of order ).
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 a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
If the quotient group is cyclic, then is abelian (If is cyclic, then is abelian).
For , the quotient is abelian if and only if ( is abelian if and only if ).
An elementary abelian -group is a finite abelian -group in which every nonidentity element has order (Elementary abelian -groups).
For , where the nonidentity element of acts by inversion ( with inversion action has order and the dihedral relations).
is the smallest subgroup of containing (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
For all one has (Exponent laws in a group: and for all , and when and commute).
Proof
Every element of has a unique factorisation with and , so and is a finite -group generated by and .
The relation gives , and has order because has order .
The element is central: it commutes with , and .
is nonabelian, since : equality would give , contradicting that has order .
Modulo the images of and commute, by step 1.2, and they generate; so is abelian and . With this gives , of order .
The centre contains and is not all of ; its order divides , and an order of would leave a quotient of order , necessarily cyclic, forcing abelian. So has order and equals .
The exponent is : the element has order , so the exponent is a multiple of dividing ; it is not , because an element of order in a group of order would generate it and make it cyclic, hence abelian.
The quotient has order , is abelian because , and is not cyclic, so all of its nonidentity elements have order and it is elementary abelian; by the second description in the characterisation is extraspecial.
At the relation reads , so the action of on is inversion and is by definition the semidirect product of a cyclic group of order four by a cyclic group of order two acting by inversion, which is .
Remarks
The group is extraspecial at every prime and its exponent is at every prime; what changes at is only that the resulting group already has a name, since inversion is the unique nontrivial power automorphism of a cyclic group of order four.
and are extraspecial of order , with six and two solutions of respectively
Statement
Both and are extraspecial groups of order : each is nonabelian, each has centre equal to its derived subgroup of order two, and each has elementary abelian central quotient. In there are exactly six solutions of , and in exactly two.
Facts & Assumptions
Given: The generalized dihedral group with of order four, and the quaternion group .
For the commutator is , and is the subgroup generated by all commutators (Commutators and the commutator subgroup ).
The generalized dihedral group of an abelian group is with the nonidentity element of acting by inversion ( The generalized dihedral group for an abelian group ).
inside the nonzero quaternions, where , , , , , and (The quaternion group inside the nonzero quaternions, The quaternions : real quadruples with componentwise addition and an explicit multiplication formula matching the table on ).
For , has order , and with and one has , , and every element has a unique form or with ( with inversion action has order and the dihedral relations).
is a subgroup of the nonzero quaternions with ; the element is the only element of order , is the only element of order , and each of has order ( is a subgroup of with eight elements, and is its only element of order ).
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 a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
If the quotient group is cyclic, then is abelian (If is cyclic, then is abelian).
For , the quotient is abelian if and only if ( is abelian if and only if ).
An elementary abelian -group is a finite abelian -group in which every nonidentity element has order (Elementary abelian -groups).
is the smallest subgroup of containing (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
Proof
In the relation gives , so , which differs from because ; and is central exactly when , that is when , that is when is or . So , of order two, and is nonabelian of order eight.
In one has ; modulo the images of and commute and generate, so and therefore .
In the squares are , , for each of the four values of , while and have order four. So exactly six elements satisfy .
In the element is central, and is not, since while and these are distinct elements of the eight-element set; the same computation excludes , since is central exactly when is. So , of order two, and is nonabelian of order eight.
In one has ; modulo the images of and commute and generate, so .
In the only solutions of are and , because every other element has order four.
For each of the two groups the central quotient has order four by Lagrange, is abelian because the derived subgroup equals the centre, and is not cyclic, since a cyclic central quotient would force commutativity; an abelian group of order four that is not cyclic has all nonidentity elements of order two, hence is elementary abelian.
Each group is therefore a nonabelian group of order with centre of order two and elementary abelian central quotient, so the second description in the characterisation makes both extraspecial; the solution counts are those of steps 1.3 and 1.6.
Remarks
The two solution counts are what separate the two groups: an isomorphism would carry solutions of to solutions of , and six is not two. Nothing about the centres or the derived subgroups distinguishes them, since those agree.
Both sources write the dihedral group of order eight as ; this library writes for the dihedral group of order , so the group here is , which is in that notation.
A nonabelian group of order is extraspecial
Statement
Let be a prime and let be a nonabelian group of order . Then is extraspecial: has order and is elementary abelian of order .
Facts & Assumptions
Given: A prime and a nonabelian group with .
A finite -group is a finite group whose order has the form (A finite -group has order for a prime and some ).
If is a nontrivial finite -group then divides (Every nontrivial finite -group has nontrivial center, in fact divides ).
If the quotient group is cyclic, then is abelian (If is cyclic, then is abelian).
For a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
If is prime and is a group of order , then is abelian (Every group of order , for prime , is abelian).
An elementary abelian -group is a finite abelian -group in which every nonidentity element has order (Elementary abelian -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).
If is a finite -group and then for some (Every subgroup of a finite -group has order a power of ).
Proof
is a nontrivial finite -group, so its centre has order a power of divisible by ; and because is nonabelian. So is or .
If then has order by Lagrange, hence is cyclic, and would be abelian. So .
By Lagrange has order , so it is abelian; it is not cyclic, since that would again force abelian; and an abelian group of order that is not cyclic has every nonidentity element of order , so it is elementary abelian.
So is a nonabelian finite -group with centre of order and elementary abelian central quotient, which is the second description in the characterisation; hence is extraspecial and has order .
Remarks
Order is the smallest order at which a nonabelian -group exists, and the argument shows the extraspecial condition is automatic there. At larger orders it is not: a direct product of two nonabelian groups of order is nonabelian of order with centre of order .
For each prime there are exactly two nonabelian groups of order up to isomorphism
Statement
For every prime there are exactly two nonabelian groups of order up to isomorphism. For odd they are the Heisenberg group , of exponent , and the modular group , of exponent . For they are and .
Facts & Assumptions
Given: A prime and a nonabelian group with .
The Heisenberg group of order is the set of triples over with (The Heisenberg group of order over ).
The modular group of order is with of order , of order and (The modular group of order as a semidirect product ).
For the commutator is (Commutators and the commutator subgroup ).
For a finite group , (The exponent of a finite group).
is the smallest subgroup of containing (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
For a group and a prime , (The th-power subgroup ).
A nonabelian group of order is extraspecial, with of order and elementary abelian of order (A nonabelian group of order is extraspecial).
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 every finite -group , ( for a finite -group).
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 ).
If then , , and for every integer (Commutator identities in a group whose derived subgroup is central).
For an odd prime and a finite group with of exponent dividing , for all (For an odd prime , the -th power map is a homomorphism on a finite group whose derived subgroup is central of exponent dividing ).
is the third coordinate axis, of order ; is extraspecial; and for odd its exponent is (The Heisenberg group of order is extraspecial, and for odd it has exponent ).
The Heisenberg multiplication is a group law with identity and inverse , the group is nonabelian of order , and , , (The Heisenberg multiplication is a group law, nonabelian, on a set of elements).
is nonabelian of order , extraspecial of exponent , with ; at it is (The modular group of order is extraspecial, of exponent when is odd).
and are extraspecial of order , with exactly six and exactly two solutions of respectively ( and are extraspecial of order , with six and two solutions of respectively).
The conditions , , hold if and only if conjugation restricts to an action and is an isomorphism carrying the canonical factors onto and ( Recognition theorem: with , exactly realises an external semidirect product).
For , with and , of order ( with inversion action has order and the dihedral relations).
, the element is its only element of order two, and each of has order four ( is a subgroup of with eight elements, and is its only element of order ).
For a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
For all one has and (Exponent laws in a group: and for all , and when and commute).
A cyclic group with a generator of finite order is isomorphic to (Every cyclic group is isomorphic to or to for its finite order ).
Proof
is extraspecial: has order , and is elementary abelian of order .
Since contains , every has .
Every element order divides ; an element of order would generate and make it abelian, so every element has order dividing and is or .
For odd the groups and are nonabelian of order with exponents and , so they are not isomorphic.
The groups and are nonabelian of order eight and have six and two solutions of , so they are not isomorphic.
First case: suppose for every . At this makes abelian, since ; so is odd here.
Second case: suppose instead that has an element of order . Then has order and index , and is a nonidentity element of , so .
In the first case, nonabelianness gives with ; then generates and has order , so .
In the second case, choose ; then properly contains a subgroup of index and so equals , and since otherwise would be abelian.
In the first case every element of is uniquely with in : the images generate , so the products meet every coset of , and there are exactly such triples of exponents.
In the second case lies in and is not the identity, so with ; choosing with and replacing by , which still lies outside because its image in is nontrivial, gives , that is . Moreover , say .
In the first case the class-two identities give , so , all exponents read modulo because .
In the second case with odd, the -th power map is a homomorphism, so has ; also , and .
In the second case with , the element lies in , and the relation reads .
In put , and . Then , and , so , which generates ; for odd every element of has -th power the identity, so steps 3.1 and 4.1 hold verbatim in with in place of .
In the second case with odd, is normal because conjugates it into itself and normalises it, is trivial because and has prime order, and , so is an internal semidirect product whose conjugation action sends to ; hence .
In the second case with and : is normal of index two, is trivial, and acts on by inversion, so is the internal semidirect product of a cyclic group of order four by a cyclic group of order two acting by inversion, that is .
In the second case with and : the eight elements with and are distinct and exhaust , and the relations , and determine every product of two of them. The quaternion group satisfies the same three relations with for and for , since , and , and , so its eight elements have the same normal form; matching normal forms is therefore an isomorphism and .
In the first case, matching normal forms gives a bijection carrying to , and both products are computed by the same rule, so it is an isomorphism and .
The two cases are exhaustive, and within the second the two parities are exhaustive; so for odd every nonabelian group of order is isomorphic to or to , and for to or to . With the two non-isomorphy statements this gives exactly two isomorphism classes at every prime.
Remarks
The parity of enters twice and in opposite directions. It rules out the exponent- case at , where it forces commutativity; and it is what allows the correction of the second generator in the exponent- case, since that correction is made with the -th power homomorphism, which is available only for odd . At the correction is not available and the two possible values of produce the two groups of order eight.
Statement
Let be the central product of two copies of the quaternion group along the unique isomorphism between their centres. Then is also an internal central product of two subgroups isomorphic to meeting in , and therefore
Facts & Assumptions
Given: Two copies of , the central product along the unique isomorphism of their centres, the canonical images of the generators of and of those of , and the common central image , so that , and .
For groups with central subgroups , and an isomorphism , the central product is the quotient of by (The central product of two groups along an isomorphism of central subgroups).
Subgroups of form an internal central product when they generate and for (Internal central products of a finite family of subgroups).
is the smallest subgroup of containing (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
, the element is its only element of order two, and each of has order four ( is a subgroup of with eight elements, and is its only element of order ).
and are extraspecial of order eight ( and are extraspecial of order , with six and two solutions of respectively).
The canonical maps into a central product are injective homomorphisms whose images commute elementwise, generate the product, and meet in the image of the identified subgroup (The two canonical maps into a central product are injective homomorphisms whose images commute, generate it, and meet in the identified centre).
A central product of two extraspecial -groups identified along their centres is extraspecial of order (A central product of extraspecial -groups identified along their centres is extraspecial).
Subgroups form an internal central product of if and only if the multiplication map from their direct product is a surjective homomorphism; for two factors along the identity of (Internal central products are the images of external ones).
For , with and , of order ( with inversion action has order and the dihedral relations).
The conditions , , hold if and only if conjugation restricts to an action and is an isomorphism ( Recognition theorem: with , exactly realises an external semidirect product).
For a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
Proof
The two canonical images are isomorphic copies of that commute elementwise, generate , and meet exactly in ; and is extraspecial of order .
Each has order four, since and with ; likewise each .
Put and . Then , because commutes with ; likewise .
Also , because commutes with everything in the first image; likewise .
Neither lies in nor in : if were a power of then would lie in the first canonical image, hence in , contradicting that has order four.
Set and . In the cyclic subgroup of order four is normalised by and meets trivially, and ; so is the internal semidirect product of a cyclic group of order four by a group of order two acting by inversion, that is of order eight with . The same holds for .
The four generators commute in pairs across the two subgroups: commutes with and with ; commutes with ; and while , and these agree because gives . Hence .
The two subgroups generate : they contain , hence and , hence both canonical images, which generate .
So and form an internal central product of , and the recognition theorem gives along the identity of . Comparing orders, , so and .
Since and are isomorphic to by isomorphisms carrying to the centre, is a central product of two copies of along the unique isomorphism of their centres, which is what was claimed.
Remarks
The identity is the whole of the computation in step 4.1, and it is where the quaternion hypothesis is spent: in a central product of two dihedral groups the corresponding squares are both trivial and the same computation succeeds for a different reason. What the statement records is that these two central products are the same group, so the number of quaternion factors in a decomposition is not an invariant of it.
A product formula for the number of square roots of the identity in a central product of extraspecial -groups
Statement
Let and be extraspecial -groups and let be the central product along an isomorphism of their centres. Write . Then
Facts & Assumptions
Given: Extraspecial -groups with of order two, an isomorphism , and with quotient map .
For groups with central subgroups , and an isomorphism , the central product is the quotient of by (The central product of two groups along an isomorphism of central subgroups).
The external direct product carries the componentwise operation (The external direct product with componentwise multiplication).
The quotient group has the left cosets as elements, with product (The quotient group and coset product ).
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).
An elementary abelian -group is a finite abelian -group in which every nonidentity element has order (Elementary abelian -groups).
The subgroup of is central, hence normal (The identified subgroup used to form a central product is central, hence normal).
The canonical maps into a central product are injective homomorphisms whose images commute elementwise, generate the product, and meet in the image of the identified subgroup (The two canonical maps into a central product are injective homomorphisms whose images commute, generate it, and meet in the identified centre).
For a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
is the unique natural number with (The cardinality of a finite set).
Proof
Since is elementary abelian, for every ; so splits into the elements with and the elements with .
The quotient map is surjective with kernel , which has two elements, so every element of has exactly two preimages in .
Because the two canonical images commute, for all and .
Hence exactly when , that is exactly when and , or and .
The number of pairs with is therefore .
Each element of with square the identity is counted exactly twice in that total, so is half of it, which is the displayed formula.
Remarks
The second summand is what makes the formula more than a product: an element of can square to the identity because both of its coordinates square to the identity, or because both square to the identified central element and those two squares cancel in the quotient.
Writing and with , the formula collapses to with : the signs multiply.
For each there are exactly two extraspecial groups of order
Statement
For each there are exactly two extraspecial groups of order up to isomorphism. Writing for the number of solutions of in , one of them has and the other has , and an extraspecial group of that order is determined up to isomorphism by which of the two values it takes.
Facts & Assumptions
Given: An integer and an extraspecial group of order with .
Subgroups of form an internal central product when they generate and for (Internal central products of a finite family of subgroups).
For groups with central subgroups , and an isomorphism , the central product is the quotient of by (The central product of two groups along an isomorphism of central subgroups).
is the smallest subgroup of containing (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
There are subgroups of , each nonabelian of order with , which form an internal central product of ; such a family is admissible, , and peeling one member leaves an extraspecial group of order with the induced admissible family (Every extraspecial -group is an internal central product of nonabelian subgroups of order ).
For every prime there are exactly two nonabelian groups of order up to isomorphism; at they are and (For each prime there are exactly two nonabelian groups of order up to isomorphism).
and are extraspecial of order eight, with exactly six and exactly two solutions of ( and are extraspecial of order , with six and two solutions of respectively).
For extraspecial -groups, (A product formula for the number of square roots of the identity in a central product of extraspecial -groups).
Subgroups form an internal central product of if and only if the multiplication map from their direct product is a surjective homomorphism; for two factors along the identity of (Internal central products are the images of external ones).
A central product of two extraspecial -groups identified along their centres is extraspecial of order (A central product of extraspecial -groups identified along their centres is extraspecial).
A finite -group is extraspecial when it is nonabelian and is elementary abelian of order (Special and extraspecial -groups).
For a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
Proof
At an extraspecial group of order eight is nonabelian, hence isomorphic to or to ; these have and , so there are exactly two and the value of tells them apart.
Assume, for every with : both values and are realised; every extraspecial group of order has an admissible family with at most one quaternion member; if that number is then ; and two such groups with equal are isomorphic.
If and are isomorphisms carrying the identified central subgroups to the identified central subgroups compatibly with the identifying isomorphisms, then carries onto and induces an isomorphism ; when all four identified subgroups have order two the compatibility is automatic, since a group of order two has only one automorphism.
Let be extraspecial of order with and take an admissible family ; each member is nonabelian of order eight, hence isomorphic to or to .
If two members are isomorphic to , then is an internal central product of them, so and is an internal central product of two subgroups isomorphic to with the same centre ; replacing by those two subgroups leaves an admissible family with two fewer quaternion members. Repeating, has an admissible family with quaternion members.
Fix such a family. Since and , some member is isomorphic to ; peeling it leaves , extraspecial of order with an admissible family of members of which are quaternion, and along the identity of .
By the induction hypothesis , and ; the counting formula then gives .
If and are extraspecial of order with , their normalised families have the same by step 4.1, so peeling a dihedral member from each gives and extraspecial of order with equal , hence isomorphic by the induction hypothesis, by an isomorphism carrying onto ; the peeled members are isomorphic too, so .
Both values are realised: if is extraspecial of order then is extraspecial of order with where , so the two groups supplied by the induction hypothesis produce one group of each value. With step 5.1 this gives exactly two isomorphism classes at order and completes the induction.
Remarks
The quaternion factors are not an invariant of the group, only their parity is: two of them can always be traded for two dihedral factors, and it is exactly that trade which leaves the count unchanged, since the two signs multiply.
The count is an isomorphism invariant because an isomorphism carries solutions of to solutions of ; that is what makes the two classes provably distinct rather than merely differently presented.
For odd , a central product of two modular groups of order is a central product of a modular group with a Heisenberg group
Statement
Let be an odd prime and let be a central product of two copies of the modular group along an isomorphism of their centres. Then is an internal central product of a subgroup isomorphic to the Heisenberg group and a subgroup isomorphic to ; consequently
Facts & Assumptions
Given: An odd prime , two copies of with generators of order and of order satisfying , and the central product of the two along an isomorphism of their centres, with canonical images of and common central image .
The modular group of order is with of order , of order , and (The modular group of order as a semidirect product ).
For groups with central subgroups , and an isomorphism , the central product is the quotient of by (The central product of two groups along an isomorphism of central subgroups).
For the commutator is (Commutators and the commutator subgroup ).
For a finite group , (The exponent of a finite group).
is the smallest subgroup of containing (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
is nonabelian of order , extraspecial of exponent , with (The modular group of order is extraspecial, of exponent when is odd).
A central product of two extraspecial -groups identified along their centres is extraspecial of order (A central product of extraspecial -groups identified along their centres is extraspecial).
The canonical maps into a central product are injective homomorphisms whose images commute elementwise, generate the product, and meet in the image of the identified subgroup (The two canonical maps into a central product are injective homomorphisms whose images commute, generate it, and meet in the identified centre).
For an odd prime and a finite group with of exponent dividing , for all (For an odd prime , the -th power map is a homomorphism on a finite group whose derived subgroup is central of exponent dividing ).
An extraspecial -group is nilpotent of class exactly two, its derived subgroup satisfies and has order , and every nonidentity commutator has order (An extraspecial -group is nilpotent of class exactly two and its derived subgroup has order ).
If then , , and for every integer (Commutator identities in a group whose derived subgroup is central).
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 ).
If satisfy and , then and , and is extraspecial of order with centre when (Every extraspecial -group is an internal central product of nonabelian subgroups of order , The centralizer of a subgroup).
For every prime there are exactly two nonabelian groups of order up to isomorphism; for odd they are , of exponent , and , of exponent (For each prime there are exactly two nonabelian groups of order up to isomorphism).
Subgroups form an internal central product of if and only if the multiplication map from their direct product is a surjective homomorphism; for two factors along the identity of (Internal central products are the images of external ones).
For all one has (Exponent laws in a group: and for all , and when and commute).
Proof
is extraspecial of order , its centre is the common image of the two centres, and the two canonical images commute elementwise, are injective and generate .
The generator may be replaced by a power with not divisible by without changing the relations of the second copy, and such a replacement multiplies by in the exponent; choosing suitably we may assume .
Each has order and each has order , and is the image of , so .
Put . The -th power map on is a homomorphism, because is odd and has order , so .
Moreover : otherwise would lie in both canonical images, hence in , contradicting that has order . So has order .
Since and lie in different canonical images they commute, so .
Hence is extraspecial of order with .
The elements of whose -th power is the identity form the kernel of the -th power homomorphism, hence a subgroup; it contains , and , so it contains , and has exponent .
By the splitting clause, with , and is extraspecial of order with ; so and form an internal central product of .
A nonabelian group of order and exponent is isomorphic to , since the other one has exponent ; so .
If had exponent then every element of would be a product of two commuting elements of -th power the identity, so would have exponent , contradicting that has order . Hence has exponent and .
Therefore is an internal central product of and meeting in , and the recognition theorem identifies it with along the identity of that centre.
Remarks
The construction of the exponent- subgroup is where oddness of is spent: the element has order only because the -th power map is a homomorphism, and at that map is not one. The corresponding statement at is the trade of two quaternion factors for two dihedral ones, which is a different computation with a different outcome.
For odd and each there are exactly two extraspecial groups of order , distinguished by their exponent
Statement
Let be an odd prime. For each there are exactly two extraspecial groups of order up to isomorphism, and they are distinguished by their exponent: one has exponent and the other has exponent .
Facts & Assumptions
Given: An odd prime , an integer , and an extraspecial group of order with .
Subgroups of form an internal central product when they generate and for (Internal central products of a finite family of subgroups).
For groups with central subgroups , and an isomorphism , the central product is the quotient of by (The central product of two groups along an isomorphism of central subgroups).
For a finite group , (The exponent of a finite group).
is the smallest subgroup of containing (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
For a group and a prime , (The th-power subgroup ).
The Heisenberg group is with (The Heisenberg group of order over ).
There are subgroups of , each nonabelian of order with , which form an internal central product of ; such a family is admissible, , and peeling one member leaves an extraspecial group of order with the induced admissible family (Every extraspecial -group is an internal central product of nonabelian subgroups of order ).
For every prime there are exactly two nonabelian groups of order up to isomorphism; for odd they are , of exponent , and , of exponent (For each prime there are exactly two nonabelian groups of order up to isomorphism).
For odd , a central product of two copies of along an isomorphism of their centres is an internal central product of a subgroup isomorphic to and a subgroup isomorphic to (For odd , a central product of two modular groups of order is a central product of a modular group with a Heisenberg group).
For an odd prime and a finite group with of exponent dividing , for all (For an odd prime , the -th power map is a homomorphism on a finite group whose derived subgroup is central of exponent dividing ).
An extraspecial -group is nilpotent of class exactly two, its derived subgroup satisfies and has order , and every nonidentity commutator has order (An extraspecial -group is nilpotent of class exactly two and its derived subgroup has order ).
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 every finite -group , ( for a finite -group).
Subgroups form an internal central product of if and only if the multiplication map from their direct product is a surjective homomorphism; for two factors along the identity of (Internal central products are the images of external ones).
A central product of two extraspecial -groups identified along their centres is extraspecial of order (A central product of extraspecial -groups identified along their centres is extraspecial).
is extraspecial and, for odd , has exponent (The Heisenberg group of order is extraspecial, and for odd it has exponent ).
is extraspecial of exponent (The modular group of order is extraspecial, of exponent when is odd).
For a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
The canonical maps from both factors into a central product are injective homomorphisms; their images commute and generate the central product (The two canonical maps into a central product are injective homomorphisms whose images commute, generate it, and meet in the identified centre).
Proof
At an extraspecial group of order is nonabelian, hence isomorphic to or to ; their exponents are and , so there are exactly two and the exponent tells them apart.
Assume, for every with : both exponents and are realised by extraspecial groups of order ; every such group has an admissible family with at most one modular member; its exponent is when that number is zero and when it is one; and two such groups with the same exponent are isomorphic.
If and are isomorphisms carrying the identified central subgroups onto the identified central subgroups compatibly with the identifying isomorphisms, then carries onto and induces an isomorphism .
Every has , so and the exponent of divides .
Let be extraspecial of order with and take an admissible family ; each member is nonabelian of order , hence isomorphic to or to .
If two members are isomorphic to , then is an internal central product of them, so and is an internal central product of a subgroup isomorphic to and one isomorphic to , both with centre ; replacing by those two leaves an admissible family with one fewer modular member. Repeating, has an admissible family with modular members.
If every member has exponent ; since the members commute and generate and the -th power map is a homomorphism, every element of is a product of elements of the members and has -th power the identity, so . If the modular member contains an element of order , so is a multiple of , and by step 1.4 it equals . Thus the exponent determines .
Since and , some member is isomorphic to ; peeling it leaves , extraspecial of order with an admissible family of members of which are modular, and along the identity of .
If and are extraspecial of order with the same exponent, their normalised families have the same by step 3.1, so the peeled subgroups and have the same exponent and are isomorphic by the induction hypothesis. Any such isomorphism restricts to an isomorphism . For the peeled Heisenberg factors, the maps with preserve the multiplication of [F7] and induce every automorphism of their order- centres; choose one whose central restriction makes the two factor isomorphisms compatible. Step 1.3 then induces .
Both exponents are realised: if is extraspecial of order then is extraspecial of order . When has exponent , the commuting generating images of [L13] and [L4] show that the product has exponent ; when has exponent , its injective canonical image from [L13] still contains an element of order , while step 1.4 bounds the product exponent by . Applying this to the two groups supplied by the induction hypothesis gives one group of each exponent. With step 4.1 this gives exactly two isomorphism classes at order and completes the induction.
Remarks
The modular factors are not an invariant of the group and, unlike the quaternion factors at , not even their parity is: two of them can be traded for one Heisenberg factor and one modular factor, so the count drops by one rather than by two. What survives is the presence or absence of an element of order , which is the exponent.
Plus and minus type of an extraspecial -group
Definition
Let be a prime and . By For odd and each there are exactly two extraspecial groups of order , distinguished by their exponent for odd and by For each there are exactly two extraspecial groups of order for , there are exactly two extraspecial groups of order up to isomorphism. They are named as follows.
For odd , write for the one of exponent and for the one of exponent (The exponent of a finite group). At these are the Heisenberg group and the modular group (The Heisenberg group of order is extraspecial, and for odd it has exponent , The modular group of order is extraspecial, of exponent when is odd).
For , write for the one with solutions of and for the one with solutions. At these are and ( and are extraspecial of order , with six and two solutions of respectively).
The two names are well defined because in each case the two classification theorems supply exactly two isomorphism classes and an invariant that separates them, so the label is a property of the isomorphism class and not of a presentation.
Remarks
The two source conventions differ in scope and are both recorded here. van Beek's Definition 2.38 writes for every prime, the sign being read off an iterated central product, which is the convention taken above. Craven's Definition 3.3 introduces only for the odd exponent- group of order and names the others by their constructions. Where the two overlap they agree, and the convention in force here is van Beek's.
At the signs multiply under central products, as the counting formula shows. At odd the notation records exponent instead: a central product is of plus type precisely when every order- factor is Heisenberg. If a modular factor occurs, the absorption lemma reduces all modular factors to one, so the product is of minus type. Thus the two uses of the signs agree on the basic plus factors but obey different product rules.
An extraspecial group of odd order has exponent or , and an extraspecial -group has exponent
Statement
Let be an extraspecial -group of order . If is odd then when is of plus type and when is of minus type. If then , whichever type is.
Facts & Assumptions
Given: An extraspecial -group of order with .
For a finite group , (The exponent of a finite group).
For odd , is the extraspecial group of that order with exponent and the one with exponent ; at the two are named by their number of solutions of (Plus and minus type of an extraspecial -group).
For a group and a prime , (The th-power subgroup ).
For odd there are exactly two extraspecial groups of order , distinguished by their exponent, which is for one and for the other (For odd and each there are exactly two extraspecial groups of order , distinguished by their exponent).
For each there are exactly two extraspecial groups of order , separated by the number of solutions of (For each there are exactly two extraspecial groups of order ).
There are subgroups of , each nonabelian of order with centre , forming an internal central product of (Every extraspecial -group is an internal central product of nonabelian subgroups of order ).
For every prime there are exactly two nonabelian groups of order ; at they are and (For each prime there are exactly two nonabelian groups of order up to isomorphism).
In the rotation has order four, and in the element has order four ( and are extraspecial of order , with six and two solutions of respectively, is a subgroup of with eight elements, and is its only element of order ).
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 every finite -group , ( for a finite -group).
Proof
Every has , a group of order , so and divides .
For odd the classification names the two isomorphism classes by their exponents, which are and , and the plus and minus labels are those names.
At , take an internal central product decomposition into subgroups of order eight; each is nonabelian, hence isomorphic to or to , and each contains an element of order four. So is a multiple of four, and by step 1.1 it divides four; hence for both types.
Remarks
At the exponent does not separate the two types, and that is why the classification there uses the number of solutions of instead. The two invariants are not interchangeable: for odd the exponent separates the types and the number of solutions of does so as well, while at only the second does.
The square map of an extraspecial -group relative to a chosen generator of its centre
Definition
Let be an extraspecial -group (Special and extraspecial -groups) and fix the generator of its centre, so with (The center of a group, The order of a finite group and the order of an element, with when no positive power of is the identity). Write with its canonical -vector-space structure (The quotient group and coset product , An elementary abelian -group has a canonical -vector-space structure, For every prime , the two operations on make it a field), and let be the commutator pairing (The commutator pairing of an extraspecial -group relative to a chosen generator of its centre).
The square map of relative to is
Why the exponent exists and is unique. The quotient is elementary abelian (Three equivalent descriptions of an extraspecial -group), so for every ; and , so exactly one class in records which of the two values takes.
That the value depends only on the coset , and the identity relating it to the commutator pairing, are proved in The square map is well defined on the central quotient and satisfies ↗.
Remarks
The map is not a homomorphism to : it fails additivity by exactly the value of the commutator pairing, and that failure is the whole content of the identity proved for it. Where the pairing vanishes the map is additive, and it is on such subspaces that the counting of elementary abelian subgroups is done.
The map is defined only at . For odd the corresponding assignment also lands in the centre, but it is a homomorphism by the class-two power formula (For an odd prime , the -th power map is a homomorphism on a finite group whose derived subgroup is central of exponent dividing ) and carries no extra information beyond the type.
The square map is well defined on the central quotient and satisfies
Statement
Let be an extraspecial -group with and , and let be its square map and its commutator pairing. Then is well defined on and
Moreover exactly when the elements of the coset satisfy ; a subgroup on which vanishes satisfies and has elementary abelian preimage in of order ; and every maximal elementary abelian subgroup of contains .
Facts & Assumptions
Given: An extraspecial -group with of order two, the quotient , the commutator pairing and the square map .
The square map of relative to is determined by (The square map of an extraspecial -group relative to a chosen generator of its centre).
The commutator pairing of relative to is determined by (The commutator pairing of an extraspecial -group relative to a chosen generator of its centre).
An elementary abelian -group is a finite abelian -group in which every nonidentity element has order (Elementary abelian -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).
If then for every (In a group with central derived subgroup, ).
An extraspecial -group is nilpotent of class exactly two, its derived subgroup satisfies and has order (An extraspecial -group is nilpotent of class exactly two and its derived subgroup has order ).
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 rule gives every elementary abelian -group its canonical -vector-space structure (An elementary abelian -group has a canonical -vector-space structure).
The quotient group has the left cosets as elements (The quotient group and coset product ).
Proof
Since is elementary abelian, for every , and ; so and the value of depends only on the coset , which makes well defined on .
By definition exactly when , and since is well defined this holds for one element of the coset exactly when it holds for both.
The class-two power formula at exponent two gives , and . Over one has , so ; hence and the displayed identity holds.
Let satisfy for every . Then for the identity gives , so .
Let be the preimage of such a in . It contains , has order , is abelian because vanishes on , and every one of its elements satisfies by step 2.1 together with ; so is elementary abelian of order .
If is elementary abelian and does not contain , then is trivial and is an abelian subgroup all of whose elements square to the identity, properly containing ; so a maximal elementary abelian subgroup contains .
Remarks
The identity is not additivity, and the correction term is where the two isomorphism types differ: on a subspace where vanishes the map is additive and its zero set is a subspace, and it is precisely the size of the largest such subspace that separates the two extraspecial groups of a given order.
An automorphism of an extraspecial -group acting trivially on its Frattini quotient is inner
Statement
Let be an extraspecial -group of order and let be the induced-action homomorphism. Then : an automorphism of acting trivially on the Frattini quotient is inner.
Facts & Assumptions
Given: An extraspecial -group of order .
with (Inner automorphisms and ).
For a finite -group , the generator rank is the common size of a basis of (The generator rank of a finite -group).
is the intersection of the maximal proper subgroups of (The Frattini subgroup as the intersection of the maximal subgroups of a finite group).
An isomorphism is a bijective group homomorphism, and is the set of automorphisms of (Group isomorphisms, automorphisms and the set ).
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).
An extraspecial -group has with and (An extraspecial -group has order for some ).
An extraspecial -group of order has of order and generator rank , and every minimal generating set has elements (An extraspecial -group of order has generator rank ).
Every automorphism of a finite -group induces an -linear automorphism of , and these form a homomorphism (Automorphisms act linearly on the Frattini quotient).
A subset of a finite -group is a minimal generating set if and only if the quotient map restricts to a bijection from onto a basis of (Burnside Basis Theorem).
If and are finite then is finite and (The product rule: , and ).
is the unique natural number with (The cardinality of a finite set).
Proof
The Frattini subgroup is of order , the Frattini quotient has order , and every minimal generating set of has exactly elements.
Fix a minimal generating set , which exists because the Burnside basis theorem matches minimal generating sets with bases of the Frattini quotient. An automorphism of is determined by its values on , since generates .
Every inner automorphism lies in : for one has , so fixes every coset of .
The inner automorphism group has order .
If lies in then for each , so with , a set of elements. Hence is determined by the tuple , and there are at most such tuples, so .
So is a subset of of size , while has at most elements; hence the two coincide.
Remarks
The equality is forced by two counts that happen to agree, and each uses the extraspecial hypothesis: the upper bound uses of order together with the generator rank , and the lower bound uses . For a general finite -group the kernel can be larger than the inner automorphism group; equality is not asserted or excluded without additional hypotheses.
An automorphism fixing the centre pointwise induces a pairing-preserving automorphism of the central quotient, with kernel the inner automorphisms
Statement
Let be an extraspecial -group with and commutator pairing , and let fix pointwise.
Then induces an automorphism of satisfying
for all . The kernel of the action of the centre-fixing automorphism subgroup on is .
Facts & Assumptions
Given: An extraspecial -group with , its commutator pairing , and an automorphism fixing pointwise.
For an extraspecial -group with , the commutator pairing is the map determined by (The commutator pairing of an extraspecial -group relative to a chosen generator of its centre).
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).
Every extraspecial -group has order for some (An extraspecial -group has order for some ).
For an extraspecial -group of order , an automorphism acting trivially on its Frattini quotient is inner (An automorphism of an extraspecial -group acting trivially on its Frattini quotient is inner).
Group isomorphisms, automorphisms and the set . (Group isomorphisms, automorphisms and the set ).
Inner automorphisms and . (Inner automorphisms and ).
Proof
Because fixes pointwise, it sends each coset to ; this is well defined, so induces an automorphism of . Also , so for all .
If is the identity on , then acts trivially on the central quotient. Since is extraspecial, [L1] gives and [L2] supplies the order hypothesis of [L3], so acts trivially on the Frattini quotient and is inner. Conversely, every inner automorphism acts trivially on because by [L1] and [L6]. Hence the kernel of the action on is exactly .
The maximal elementary abelian subgroups of the two extraspecial groups of order have orders and
Statement
The maximal elementary abelian subgroups of the two extraspecial groups of order have orders and .
Facts & Assumptions
Given: The hypotheses of the Statement.
For an extraspecial -group of order with , the square map is the function determined by , with values in (The square map of an extraspecial -group relative to a chosen generator of its centre).
The square map is well defined on the central quotient and satisfies (The square map is well defined on the central quotient and satisfies ).
For each there are exactly two extraspecial groups of order up to isomorphism, with and solutions of (For each there are exactly two extraspecial groups of order ).
If and are extraspecial -groups with solutions of , then has such solutions (A product formula for the number of square roots of the identity in a central product of extraspecial -groups).
Every maximal abelian subgroup of an extraspecial -group of order has order (In an extraspecial -group of order every maximal abelian subgroup has order ).
An extraspecial -group has order for some (An extraspecial -group has order for some ).
The commutator pairing is independent of the coset representatives, is -bilinear on , and is alternating (The commutator pairing is well defined on the central quotient, is bilinear over , and is alternating).
The commutator pairing of an extraspecial -group has trivial radical (The commutator pairing of an extraspecial -group has trivial radical).
For an extraspecial -group with , the commutator pairing is the map determined by (The commutator pairing of an extraspecial -group relative to a chosen generator of its centre).
An elementary abelian -group is a finite abelian -group in which every nonidentity element has order ; the trivial group is permitted (,, ). (Elementary abelian -groups).
The set is independent when with finite support forces every . A basis of an elementary abelian -group is an independent spanning subset for its canonical -linear structure. (-spanning sets, independence, and bases in an elementary abelian -group).
Every finite elementary abelian -group has a basis; every independent subset extends to a basis, every spanning subset contains a basis, and all bases have the same finite size. (Finite elementary abelian -groups have bases, basis extension, and a well-defined dimension).
An extraspecial -group of order is of plus type when it has solutions of and of minus type when it has such solutions; for odd , plus and minus mean exponent and respectively (Plus and minus type of an extraspecial -group).
A central product of extraspecial -groups identified along their centres is extraspecial (A central product of extraspecial -groups identified along their centres is extraspecial).
Every extraspecial -group is an internal central product of nonabelian subgroups of order pairwise intersecting in its centre (Every extraspecial -group is an internal central product of nonabelian subgroups of order ).
Proof
A maximal elementary abelian subgroup contains , so has order with , and vanishes on .
On a coset with the map is a nonzero -linear functional on , so its kernel has index two and exactly of the coset's classes have .
Maximality of says no orthogonal to has : the polar identity would make vanish on , whose preimage is a strictly larger elementary abelian subgroup.
On the coset itself vanishes identically, contributing classes.
On a coset with the correction term vanishes, so is constantly by step 2.1 and the coset contributes no class.
With there are cosets inside the complement and outside, so the classes with number , and the elements with number twice that.
The classification counts those elements as in the plus case and in the minus case, so .
The left side is strictly increasing in , so in the plus case and in the minus case are the only solutions; both are attained, giving and for EVERY maximal elementary abelian subgroup.
Independently, is abelian, so the maximal-abelian bound gives and hence without the monotonicity argument; this is the free half of the plus case.
5 · Examples, counterexamples and false statements
None yet.
Sources
- D. A. Craven, The Theory of p-Groups, Lemma 2.11(i)-(iii)
- M. van Beek, Topics in Finite p-Groups, §2.3
- D. A. Craven, The Theory of p-Groups, Lemma 2.11 and §3.1
- D. A. Craven, The Theory of p-Groups, §3.1, proof of Theorem 3.14
- D. A. Craven, The Theory of p-Groups, Definition 3.1
- M. van Beek, Topics in Finite p-Groups, Definitions 2.28 and 2.30
- D. A. Craven, The Theory of p-Groups, Definition 3.1 and §2.2 Theorem 2.19
- M. van Beek, Topics in Finite p-Groups, Proposition 2.29
- D. A. Craven, The Theory of p-Groups, §3.1
- M. van Beek, Topics in Finite p-Groups, Proposition 2.32(ii)
- M. van Beek, Topics in Finite p-Groups, Proposition 2.41(ii)
- D. A. Craven, The Theory of p-Groups, Theorem 3.6 and §3.1
- M. van Beek, Topics in Finite p-Groups, Definition 2.34
- D. Kaur and A. Kulshrestha, Characters of real special 2-groups, §2.2
- D. A. Craven, The Theory of p-Groups, Theorem 3.6
- D. A. Craven, The Theory of p-Groups, Proposition 3.5 and Theorem 3.6
- D. A. Craven, The Theory of p-Groups, Proposition 3.5
- M. van Beek, Topics in Finite p-Groups, Definition 2.34 and Proposition 2.36
- M. van Beek, Topics in Finite p-Groups, §2.4
- M. van Beek, Topics in Finite p-Groups, Propositions 2.36 and 2.39(i)
- D. A. Craven, The Theory of p-Groups, §3.3
- D. A. Craven, The Theory of p-Groups, Definition 3.7 and §3.2
- D. A. Craven, The Theory of p-Groups, Lemma 3.7 and §3.2
- D. A. Craven, The Theory of p-Groups, §3.2
- D. Kaur and A. Kulshrestha, Characters of real special 2-groups, §2 opening
- D. A. Craven, The Theory of p-Groups, §3.2, proof of Theorem 3.9
- M. van Beek, Topics in Finite p-Groups, Theorem 2.40(iii)
- D. A. Craven, The Theory of p-Groups, Theorem 3.9
- M. van Beek, Topics in Finite p-Groups, Theorem 2.40(i) and Proposition 2.41(i)
- D. A. Craven, The Theory of p-Groups, Theorem 2.28 and §3.2
- M. van Beek, Topics in Finite p-Groups, Theorem 3.7
- D. A. Craven, The Theory of p-Groups, Lemma 3.10 and Lemma 3.11
- M. van Beek, Topics in Finite p-Groups, Theorem 2.40
- M. van Beek, Topics in Finite p-Groups, Proposition 2.41(iii) and Theorem 2.40(v)
- D. A. Craven, The Theory of p-Groups, Lemma 3.12
- M. van Beek, Topics in Finite p-Groups, Proposition 2.41(iv) and Theorem 2.40(iv)
- M. van Beek, Topics in Finite p-Groups, Definition 2.31
- D. A. Craven, The Theory of p-Groups, Definition 3.3
- M. van Beek, Topics in Finite p-Groups, Proposition 2.32(iii)
- M. van Beek, Topics in Finite p-Groups, Proposition 2.32(i) and 2.32(iv)
- D. A. Craven, The Theory of p-Groups, Example 3.2
- M. van Beek, Topics in Finite p-Groups, Exercise 2.33
- D. A. Craven, The Theory of p-Groups, Lemma 2.7
- D. A. Craven, The Theory of p-Groups, Lemma 3.4
- D. A. Craven, The Theory of p-Groups, Proposition 3.13(i)
- M. van Beek, Topics in Finite p-Groups, Exercise 2.37
- D. A. Craven, The Theory of p-Groups, Theorem 3.14(ii)
- D. Kaur and A. Kulshrestha, Characters of real special 2-groups, Remark 2.4
- M. van Beek, Topics in Finite p-Groups, Theorem 2.42
- D. A. Craven, The Theory of p-Groups, Proposition 3.13(ii)
- D. A. Craven, The Theory of p-Groups, Theorem 3.14(i)
- M. van Beek, Topics in Finite p-Groups, Definition 2.38
- M. van Beek, Topics in Finite p-Groups, Proposition 2.39(iii)
- D. Kaur and A. Kulshrestha, Characters of real special 2-groups, §2.1
- D. Kaur and A. Kulshrestha, Characters of real special 2-groups, §2 opening and §2.1
- D. A. Craven, The Theory of p-Groups, Theorem 3.15(i)
- D. A. Craven, The Theory of p-Groups (Hilary Term 2008), 48 pp.
- M. van Beek, Topics in Finite p-Groups, 62 pp.
- D. Kaur and A. Kulshrestha, Characters of real special 2-groups (arXiv:1510.06583v1)
- D. A. Craven, The Theory of p-Groups, Proposition 3.14(ii)
- M. van Beek, Topics in Finite p-Groups, Proposition 2.39(ii)