Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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 conjugacy class of an extraspecial p-group outside the centre has exactly p elements

Statement

Every conjugacy class of an extraspecial p-group whose representative is not central has exactly p elements. That is, for an extraspecial p-group P and xPZ(P),

ClP(x)=p.

Facts & Assumptions

Given: An extraspecial p-group P (Special and extraspecial p-groups) and an element xP with xZ(P).

[F1]

ClG(x):={gxg1:gG} and CG(x):={gG:gx=xg}={gG:gxg1=x} (The conjugacy class ClG(x) and centralizer CG(x) of an element).

[F2]

Z(G):={zG:zg=gz for every gG} (The center Z(G) of a group).

[F3]

For g,hG the commutator is [g,h]:=ghg1h1 (Commutators [g,h]=ghg1h1 and the commutator subgroup [G,G]).

[F4]

For HG and gG, the right coset is Hg:={hg:hH} (Left and right cosets gH and Hg of a subgroup).

[L1]

An extraspecial p-group has derived subgroup P=Z(P) of order p (An extraspecial p-group is nilpotent of class exactly two and its derived subgroup has order p).

[L3]

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

[L4]

[G:H]:=G/H, the number of left cosets of H in G (The coset set G/H and the index [G:H] of a subgroup).

[L5]

A finite p-group is a finite group whose order has the form P=pn for some nN (A finite p-group has order pn for a prime p and some nN).

Proof

technique · direct
1.1

For every gP one has [g,x]x=(gxg1x1)x=gxg1, so each conjugate of x has the form [g,x]x.

F3algebra
1.2

The derived subgroup of P is Z(P) and has order p, and P is a finite p-group, so P=pn for some n.

L1L5
1.3

The size of the class of x is the index [P:CP(x)], and by Lagrange that index divides P.

F1L2L3L4
2.1

Each [g,x] lies in P=Z(P), so every conjugate of x lies in the right coset Z(P)x; the map zzx is a bijection from Z(P) onto that coset, so the coset has p elements and the class of x has at most p.

F4step 1.1step 1.2algebra
2.2

Since xZ(P), some gP fails to commute with x, so CP(x)P, its index is greater than one, and the class of x has more than one element.

F1F2step 1.3
3.1

The class size divides pn, so it is a power of p; it lies strictly between 1 and p inclusive, and the only such power of p is p itself.

step 1.2step 1.3step 2.1step 2.2

Remarks

The hypothesis xZ(P) is used only at step 2.2, and it is used to rule out the class of size one. A central x runs through the same computation and comes out with the class {x}, which is consistent with step 2.1 and shows that the two cases exhaust the group.

Depends on

Used by

Dependency tree · two levels

38 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