Alphabeta Math
PropositionStatement: Literature-sourcedProof: 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.

An automorphism of an extraspecial p-group acting trivially on its Frattini quotient is inner

Statement

Let P be an extraspecial p-group of order p1+2n and let ρP:Aut⁡(P)→Aut⁡Fp(P/Φ(P)) be the induced-action homomorphism. Then ker⁡ρP=Inn⁡(P): an automorphism of P acting trivially on the Frattini quotient is inner.

Facts & Assumptions

Given: An extraspecial p-group P of order p1+2n.

[F1]

Inn⁡(G):={cg:g∈G} with cg(x)=gxg−1 (Inner automorphisms and Inn⁡(G)).

[F2]

For a finite p-group P, the generator rank d(P) is the common size of a basis of P/Φ(P) (The generator rank d(P) of a finite p-group).

[F3]

Φ(G) is the intersection of the maximal proper subgroups of G (The Frattini subgroup Φ(G) as the intersection of the maximal subgroups of a finite group).

[F4]

An isomorphism is a bijective group homomorphism, and Aut⁡(G) is the set of automorphisms of G (Group isomorphisms, automorphisms and the set Aut⁡(G)).

[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]

An extraspecial p-group has ∣P∣=p1+2n with n≥1 and ∣P/Z(P)∣=p2n (An extraspecial p-group has order p1+2n for some n≥1).

[L3]

An extraspecial p-group of order p1+2n has Φ(P)=Z(P) of order p and generator rank d(P)=2n, and every minimal generating set has 2n elements (An extraspecial p-group of order p1+2n has generator rank 2n).

[L4]

Every automorphism of a finite p-group induces an Fp-linear automorphism of P/Φ(P), and these form a homomorphism ρP (Automorphisms act linearly on the Frattini quotient).

[L5]

A subset X of a finite p-group P is a minimal generating set if and only if the quotient map restricts to a bijection from X onto a basis of P/Φ(P) (Burnside Basis Theorem).

[L6]

G/Z(G)≅Inn⁡(G) (G/Z(G)≅Inn⁡(G)).

[L7]

If A and B are finite then A×B is finite and ∣A×B∣=∣A∣⋅∣B∣ (The product rule: ∣A×B∣=∣A∣ ∣B∣, and ∣∏i<mAi∣=∏i<m∣Ai∣).

[L8]

∣A∣ is the unique natural number n with A≈n (The cardinality ∣A∣ of a finite set).

Proof

technique · direct
1.1F2F3L1L2L3

The Frattini subgroup is Φ(P)=Z(P) of order p, the Frattini quotient has order p2n, and every minimal generating set of P has exactly 2n elements.

2.1F4L5step 1.1

Fix a minimal generating set X={g1,…,g2n}, which exists because the Burnside basis theorem matches minimal generating sets with bases of the Frattini quotient. An automorphism of P is determined by its values on X, since X generates P.

2.2F1L1L4step 1.1

Every inner automorphism lies in ker⁡ρP: for g,x∈P one has cg(x)x−1=gxg−1x−1∈[P,P]=Φ(P), so cg fixes every coset of Φ(P).

2.3F1L2L6step 1.1

The inner automorphism group has order ∣P/Z(P)∣=p2n.

3.1F3L4L7L8step 1.1step 2.1

If θ lies in ker⁡ρP then θ(gi)Φ(P)=giΦ(P) for each i, so θ(gi)=giui with ui∈Φ(P)=Z(P), a set of p elements. Hence θ is determined by the tuple (u1,…,u2n), and there are at most p2n such tuples, so ∣ker⁡ρP∣≤p2n.

4.1L8step 3.1step 2.2step 2.3∎

So Inn⁡(P) is a subset of ker⁡ρP of size p2n, while ker⁡ρP has at most p2n 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 Φ(P)=Z(P) of order p together with the generator rank 2n, and the lower bound uses ∣P/Z(P)∣=p2n. For a general finite p-group the kernel can be larger than the inner automorphism group; equality is not asserted or excluded without additional hypotheses.

Depends on

Used by

Dependency tree · two levels

56 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