Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Every extraspecial p-group is an internal central product of nonabelian subgroups of order p3

Statement

Let P be an extraspecial p-group and Z(P)=⟨z⟩.

Splitting. If x,y∈P satisfy [x,y]≠e and F=⟨x,y⟩, then P=F CP(F) and F∩CP(F)=Z(P), so F and CP(F) form an internal central product of P (Internal central products of a finite family of subgroups, The centralizer CG(H) of a subgroup). Here F is extraspecial of order p3 with Z(F)=Z(P); and CP(F) has order ∣P∣/p2 with Z(CP(F))=Z(P), and is extraspecial when ∣P∣>p3.

Decomposition. There are n≥1 subgroups P1,…,Pn of P, each nonabelian of order p3 with Z(Pi)=Z(P), which form an internal central product of P; call such a family admissible. Moreover ∣P∣=p1+2n.

Peeling. For an admissible family, Pi∩Pj=Z(P) whenever i≠j; and when n≥2, for each index i the subgroup Ci=⟨Pj:j≠i⟩ satisfies [Pi,Ci]=1, P=PiCi, Pi∩Ci=Z(P) and Z(Ci)=Z(P), is extraspecial of order p1+2(n−1), and has (Pj)j≠i as an admissible family for itself.

Facts & Assumptions

Given: An extraspecial p-group P with Z(P)=⟨z⟩ of order p, the quotient V=P/Z(P) and its commutator pairing bz.

[F1]

Subgroups G1,…,Gr of G form an internal central product when they generate G and [Gi,Gj]=1 for i≠j (Internal central products of a finite family of subgroups).

[F2]

The commutator pairing of P relative to z is the map bz:V×V→Fp determined by [x,y]=z bz(xˉ,yˉ) (The commutator pairing of an extraspecial p-group relative to a chosen generator of its centre).

[F3]

Z(G):={z∈G:zg=gz for every g∈G} (The center Z(G) of a group).

[F4]

CG(H):={g∈G:gh=hg for every h∈H}, and CG(H)∩H=Z(H) (The centralizer CG(H) of a subgroup).

[L1]

For a finite p-group P the following are equivalent: P is extraspecial; P is nonabelian, ∣Z(P)∣=p and P/Z(P) is elementary abelian; P is nonabelian and Z(P)=P′=Φ(P) has order p (Three equivalent descriptions of an extraspecial p-group).

[L2]

The commutator pairing is well defined, Fp-bilinear and alternating, with bz(yˉ,xˉ)=−bz(xˉ,yˉ) (The commutator pairing is well defined on the central quotient, is bilinear over Fp, and is alternating).

[L3]

The radical of the commutator pairing is trivial (The commutator pairing of an extraspecial p-group has trivial radical).

[L4]

If [x,y]≠e in an extraspecial p-group P, then ⟨x,y⟩ contains Z(P), has order p3, is nonabelian, and is extraspecial with centre Z(P) (Two elements of an extraspecial p-group with nontrivial commutator generate an extraspecial subgroup of order p3).

[L5]

Subgroups G1,…,Gr form an internal central product of G if and only if the multiplication map G1×⋯×Gr→G 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).

[L6]

For a finite group G and H≤G, ∣G∣=[G:H] ∣H∣ (Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G).

[L7]

For every group G and x∈G, the centralizer CG(x) is a subgroup of G (CG(x) and NG(H) are subgroups of G).

[L8]

An elementary abelian p-group is a finite abelian p-group in which every nonidentity element has order p (Elementary abelian p-groups).

[L9]

For every homomorphism f:G→H, the rule gker⁡f↦f(g) is an isomorphism from G/ker⁡f onto im⁡f (First isomorphism theorem for groups: G/ker⁡f≅im⁡f).

[L11]

Proof

technique · induction
1.1F1F3F4L4L6base

If ∣P∣=p3 the one-member family P1=P is admissible, and p3=p1+2⋅1; moreover any F=⟨x,y⟩ with [x,y]≠e then has order p3 and equals P, so CP(F)=Z(P) has order p=∣P∣/p2 and the splitting clause holds.

1.2ih

Assume all three clauses of the theorem hold for every extraspecial p-group of order smaller than ∣P∣.

1.3F1F3F4L1L5L6L8L9

Suppose A,B≤P satisfy [A,B]=1, P=AB, A∩B=Z(P) and ∣A∣=p3. An element of Z(B) commutes with B and, lying in B, with A, hence with AB=P, so Z(B)≤Z(P); and Z(P)=A∩B lies in B and is central in P, so Z(B)=Z(P). The multiplication map μ:A×B→P is a surjective homomorphism. If μ(a,b)=e, then a=b−1∈A∩B, while every (z,z−1) with z∈A∩B lies in the kernel. Thus ker⁡μ is the antidiagonal of A∩B and has order p, so ∣P∣=p3∣B∣/p and ∣B∣=∣P∣/p2. If B were abelian it would equal Z(B)=Z(P) and ∣P∣ would be p3; so for ∣P∣>p3 the group B is nonabelian, and B/Z(B)=B/Z(P) is a subgroup of the elementary abelian group V, hence elementary abelian, so B is extraspecial.

1.4F2L4L10L11

If [x,y]≠e then F=⟨x,y⟩ is extraspecial of order p3 with Z(F)=Z(P), and β=bz(xˉ,yˉ) is a nonzero element of the field Fp, hence invertible.

1.5F1F3F4L7L10

Let (P1,…,Pn) be an admissible family and fix an index i, writing Ci=⟨Pj:j≠i⟩. Each generator of Ci commutes with every element of Pi, and the centraliser of an element is a subgroup, so [Pi,Ci]=1 and Ci≤CP(Pi); then PiCi is a subgroup containing every member of the family, so P=PiCi; and Pi∩Ci≤Pi∩CP(Pi)=Z(Pi)=Z(P), while Z(P)=Z(Pj)≤Pj≤Ci gives the reverse inclusion. Taking Ci to be a single Pj shows Pi∩Pj=Z(P).

2.1F2L2L11step 1.4

For g∈P put s=β−1bz(gˉ,yˉ) and r=−β−1bz(gˉ,xˉ) and u=xsyr. Bilinearity and alternation give bz(uˉ,xˉ)=r bz(yˉ,xˉ)=−rβ=bz(gˉ,xˉ) and bz(uˉ,yˉ)=s bz(xˉ,yˉ)=sβ=bz(gˉ,yˉ), so bz(gu−1‾,xˉ)=0 and bz(gu−1‾,yˉ)=0.

2.2F1F3ihstep 1.2step 1.3step 1.5

Applying step 1.3 with A=Pi and B=Ci gives Z(Ci)=Z(P) and ∣Ci∣=∣P∣/p2; when n≥2 the subgroup Ci contains the nonabelian Pj, so ∣P∣>p3 and Ci is extraspecial. The members Pj with j≠i generate it, commute pairwise and have centre Z(Ci), so they form an admissible family for it; since Ci has smaller order, the induction hypothesis applied to that (n−1)-member family gives ∣Ci∣=p1+2(n−1).

3.1F1F4L7L10step 1.3step 1.4step 2.1

Hence gu−1 commutes with x and with y; the centraliser of gu−1 is a subgroup containing both, hence contains F, so gu−1∈CP(F) and g=(gu−1)u∈CP(F)F. Therefore P=F CP(F), and F∩CP(F)=Z(F)=Z(P), so F and CP(F) form an internal central product of P; step 1.3 with A=F and B=CP(F) supplies the order of CP(F), its centre, and that it is extraspecial when ∣P∣>p3.

4.1F1F2F3L1L3L10ihstep 1.1step 1.2step 3.1discharge-induction∎

If ∣P∣>p3, choose x∉Z(P), which exists because P is nonabelian, and then y with bz(xˉ,yˉ)≠0, which exists because the radical is trivial; put F=⟨x,y⟩ and C=CP(F). By step 3.1 the group C is extraspecial of order ∣P∣/p2, so the induction hypothesis gives an admissible family P2,…,Pn for C with ∣C∣=p1+2(n−1). Then F,P2,…,Pn generate P, commute pairwise, are nonabelian of order p3 and have centre Z(C)=Z(P), so they form an admissible family for P, and ∣P∣=p2∣C∣=p1+2n; with step 1.1 this completes the induction.

Remarks

The factors are not canonical: the subgroup F depends on the choice of x and of a partner y, and the companion page records two decompositions of one group with different factors. What the order formula does fix is the number of factors.

The splitting and peeling clauses are stated for an arbitrary noncommuting pair and an arbitrary admissible family because the classification arguments need to remove a factor of a prescribed isomorphism type, not the one this proof happens to construct.

Depends on

Used by

Dependency tree · two levels

68 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources