Alphabeta Math
Session-authored (Fable 5 assisted)
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.

12 results · all verified · 9 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Frattini Subgroups and the Burnside Basis Theorem — Examples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The Frattini subgroup of a nontrivial cyclic p-group

Example

If P=g has order pn with n1, then Φ(P)=gp and d(P)=1. For n=1, this says Φ(P)=1.

Facts & Assumptions

Given: A cyclic group P=g of order pn with n1.

[L1]

For every finite p-group P, Φ(P)=PPp (Φ(P)=PPp for a finite p-group).

[L2]

If G=g has finite order m, then ord(ga)=m/gcd(a,m) (In a cyclic group of order m, ga has order m/gcd(a,m)).

[F1]

The subgroup generated by a subset is the smallest subgroup containing it, and a group is cyclic when it is generated by one element (The subgroup S generated by a subset, the cyclic subgroup g, and cyclic groups).

[F2]

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).

Verification

technique · direct
1.1

Every pth power in P is a power of gp, and conversely gp is a pth power, so [F1] gives Pp=gp. The group is abelian, so P=1. By [L2], gp has order pn1, including order one at n=1, and [L3] is consistent with this cyclic subgroup description.

givenL2F1L3algebra
2.1

Formula [L1] gives Φ(P)=gp. The quotient has order p, so its nonidentity coset gΦ(P) is a one-vector basis; hence [F2] gives d(P)=1.

step 1.1L1F2algebra
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The Frattini subgroup of (Z/p)n is trivial

Example

For every prime p and nN, Φ((Z/p)n)=1 and the generator rank is n.

Facts & Assumptions

Given: A prime p and a natural number n.

[L1]

A finite p-group has trivial Frattini subgroup if and only if it is elementary abelian (A finite p-group has trivial Frattini subgroup exactly when it is elementary abelian).

[F1]

A basis of an elementary abelian p-group is an independent spanning subset for its canonical Fp-linear structure (Fp-spanning sets, independence, and bases in an elementary abelian p-group).

[F2]

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).

Verification

technique · direct
1.1

Componentwise addition makes (Z/p)n a finite abelian group of order pn by [L2], and every nonzero element has order p. It is therefore elementary abelian and [L1] gives Φ((Z/p)n)=1. At n=0, the empty product is the trivial group and the same conclusion holds.

givenL1L2algebra
2.1

The standard coordinate vectors have unique coordinates, so they form a basis by [F1]. There are n of them, hence [F2] gives d((Z/p)n)=n, including the empty basis at n=0.

step 1.1F1F2L2algebra
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The Frattini subgroups of the dihedral and quaternion groups of order eight

Example

Let D:=Dih(C4)=D4 in the convention of Dih(Cn)=CnC2 with inversion action has order 2n and the dihedral relations, so D is the dihedral group of order eight, and let Q8 be the quaternion group. Then

Φ(D)=r2,Φ(Q8)={1,1}.

For the dihedral group of order eight and Q8, the Frattini subgroup has order two and the Frattini quotient is (Z/2)2. Both groups have generator rank two.

Facts & Assumptions

[L1]

For every finite 2-group P, Φ(P)=P2 (Φ(P)=P2 for a finite 2-group).

[L2]

In D=Dih(C4), r4=s2=1, srs1=r1, and every element is ri or ris; in Q8, the elements ±i,±j,±k have order four and 1 is the unique element of order two ( Dih(Cn)=CnC2 with inversion action has order 2n and the dihedral relations, Q8 is a subgroup of H× with eight elements, and 1 is its only element of order 2).

[F1]

The commutator subgroup is generated by [g,h]=ghg1h1 (Commutators [g,h]=ghg1h1 and the commutator subgroup [G,G]).

[F2]

The generator rank is the common size of a basis of the Frattini quotient (The generator rank d(P) of a finite p-group).

Verification

technique · direct
1.1

In D, (ri)2=r2i and (ris)2=1, so D2=r2. In Q8, the squares are 1 and 1, with every noncentral element squaring to 1, so Q82={1,1}. The commutators of [F1] give the same two subgroups: [r,s]=r(sr1s1)=rr=r2 and every commutator of D is a power of r2, so D=r2; and [i,j]=iji1j1=k(i)(j)=kij=k2=1, so Q8={1,1}.

givenL2F1algebra
2.1

Apply [L1] to step 1.1. Each quotient has order four and exponent two, with the classes of r,s and of i,j respectively as two-vector bases. Thus both quotients are (Z/2)2, and [F2] gives generator rank two.

step 1.1L1L2F2algebra
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The 3×3 upper-unitriangular group over a prime field has generator rank two

Example

For a prime p, let Hp be the set of 3×3 upper-unitriangular matrices over the prime field Z/p under matrix multiplication. Writing

M(a,b,c)=(1ac01b001)(a,b,cZ/p),

the assignment (a,b,c)M(a,b,c) is a bijection from (Z/p)3 onto Hp that turns matrix multiplication into

(a,b,c)(a,b,c)=(a+a,b+b,c+c+ab).

Working in these coordinates, Hp is a group of order p3,

Φ(Hp)={(0,0,c):cZ/p},

and d(Hp)=2. This includes p=2, when Hp does not have exponent p.

Facts & Assumptions

Given: A prime p, the 3×3 upper-unitriangular matrices over Z/p, and the displayed coordinate parametrisation.

[L1]

For every finite p-group P, Φ(P)=PPp (Φ(P)=PPp for a finite p-group).

[F1]

The generator rank is the common size of a basis of the Frattini quotient (The generator rank d(P) of a finite p-group).

[F2]

A basis is an independent spanning subset for the canonical Fp-linear structure (Fp-spanning sets, independence, and bases in an elementary abelian p-group).

Verification

technique · direct
1.1

Multiplying M(a,b,c)M(a,b,c) entrywise gives the matrix with (1,2) entry a+a, (2,3) entry b+b and (1,3) entry c+c+ab, so the parametrisation carries matrix multiplication to the displayed coordinate operation and is a bijection. Direct substitution shows associativity; the identity is (0,0,0) and (a,b,c)1=(a,b,c+ab). By [L2] the set has order p3, so this is a finite p-group.

givenL2algebra
2.1

A calculation with the inverse in step 1.1 gives [(a,b,c),(a,b,c)]=(0,0,abab). Every commutator lies on the central c-axis, and (0,0,t)=[(t,0,0),(0,1,0)], so Hp={(0,0,c)}.

step 1.1L2algebra
3.1

Induction gives (a,b,c)m=(ma,mb,mc+(m2)ab). For odd p, every pth power is the identity; for p=2, every square is (0,0,ab) and hence lies on the central axis. Since the derived subgroup already equals that axis, [L1] gives Φ(Hp)={(0,0,c)} in both cases.

step 1.1step 2.1L1algebra
4.1

Modulo the central axis, the first two coordinate classes give unique coordinates and form a two-vector basis by [F2]. Therefore [F1] gives d(Hp)=2.

step 3.1F1F2algebra

Remarks

The prime field is a hypothesis, not a convenience. Over Fq with q=pe the same coordinates and the same two computations give H={(0,0,c):cFq} and (a,b,c)p=(0,0,(p2)ab), so the Frattini subgroup is again that central axis and the Frattini quotient is FqFq — a vector space of dimension 2e over Fp, not 2. For q=4 the generator rank is therefore 4.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-24Open item page →

The maximal subgroups of the dihedral group of order eight as Frattini hyperplanes

Example

For D=Dih(C4)=r,s, the maximal subgroups are

r,r2,s,r2,rs.

Modulo Φ(D)=r2, these are the hyperplanes of (Z/2)2.

Facts & Assumptions

Given: The dihedral group D=Dih(C4) of order eight.

[L1]

For D=Dih(C4) one has Φ(D)=r2, and for the dihedral group of order eight and Q8 the Frattini subgroup has order two and the Frattini quotient is (Z/2)2 (The Frattini subgroups of the dihedral and quaternion groups of order eight).

[L2]

If π:PE=P/Φ(P) is the quotient map, the maximal subgroups of P are exactly π1(kerλ)=ker(λπ) for nonzero Fp-linear homomorphisms λ:EZ/p (Maximal subgroups of a finite p-group are the inverse images of Frattini hyperplanes).

Verification

technique · direct
1.1

The three displayed subgroups have order four, are distinct, and contain Φ(D)=r2 from [L1]. Since D has order eight, each is maximal.

givenL1algebra
2.1

Use the quotient basis (rΦ(D),sΦ(D)). The quotient images of the displayed subgroups are the lines spanned by (1,0), (0,1), and (1,1), which are respectively the kernels of (a,b)b, (a,b)a, and (a,b)a+b. These are precisely the hyperplanes described by [L2].

step 1.1L2algebra
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

A nonsurjective homomorphism need not carry the Frattini subgroup into the target Frattini subgroup

Statement refuted

For every group homomorphism f:GH, one has f(Φ(G))Φ(H). This fails for the embedding f:C4S5 below: f(Φ(C4))Φ(S5).

Facts & Assumptions

Given: The cyclic group C4=g, the symmetric group S5 with the cycle convention of The finite symmetric group Sn, one-line notation, and cycle notation, and the homomorphism f:C4S5 defined by f(g)=(1234) (Monoid homomorphism and group homomorphism).

[L1]

If P=g has order pn with n1, then Φ(P)=gp and d(P)=1 (The Frattini subgroup of a nontrivial cyclic p-group).

[L2]

The Frattini subgroup of every finite group is nilpotent (The Frattini subgroup of a finite group is nilpotent).

[L3]

For n5, the normal subgroups of Sn are 1,An,Sn (For n5, the only proper nontrivial normal subgroup of Sn is An).

[L4]

The groups A5 and S5 are not solvable (A5 and Sn for n5 are not solvable).

Counterexample

technique · direct
1.1

The 4-cycle has order four, so f is an embedding. By [L1], Φ(C4)=g2, and f(g2)=(13)(24)1.

givenL1algebra
1.2

By [L2] and [L6], Φ(S5) is nilpotent and normal. The list [L3] leaves only 1,A5,S5; [L4] and [L5] exclude the latter two, so Φ(S5)=1.

givenL2L3L4L5L6algebra
2.1

Step 1.1 exhibits a nonidentity element of f(Φ(C4)), while step 1.2 makes the target Frattini subgroup trivial. Hence f(Φ(C4))Φ(S5).

step 1.1step 1.2
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The Fitting subgroup of A5 does not contain its centralizer

Statement refuted

For every finite group G, one has CG(F(G))F(G). For A5, one has F(A5)=1 and CA5(F(A5))=A5, so solvability cannot be omitted.

Facts & Assumptions

Given: The alternating group A5 and its Fitting subgroup (The Fitting subgroup F(G)=pOp(G) of a finite group).

[L1]

For every finite group G, F(G) is nilpotent and normal, and every normal nilpotent subgroup is contained in it (The Fitting subgroup is nilpotent and is the largest normal nilpotent subgroup of a finite group).

[L2]

The group A5 is simple (An is simple for every n5).

[L3]

The group A5 is not solvable (A5 and Sn for n5 are not solvable).

[F1]

The centralizer CG(H) consists of the elements of G that commute with every element of H (The centralizer CG(H) of a subgroup).

Counterexample

technique · direct
1.1

By [L1], F(A5) is normal and nilpotent. Simplicity [L2] leaves F(A5)=1 or F(A5)=A5; the second would make A5 nilpotent and hence solvable by [L4], contradicting [L3]. Thus F(A5)=1.

givenL1L2L3L4algebra
2.1

For A5, one has F(A5)=1 and CA5(F(A5))=A5, since every element centralizes the trivial subgroup by [F1]. Therefore CA5(F(A5))F(A5).

step 1.1F1givenalgebra
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-24Open item page →

Inversion on C3 is detected on its Frattini quotient

Example

Inversion on C3 is a nontrivial automorphism of order two, and its action on the Frattini quotient is nontrivial. Thus Hall–Burnside detects it; the theorem does not assert that coprime automorphisms are absent.

Facts & Assumptions

Given: The cyclic group C3=g.

[L1]

If P=g has order pn with n1, then Φ(P)=gp and d(P)=1 (The Frattini subgroup of a nontrivial cyclic p-group).

[L2]

If a p-subgroup of Aut(P) acts trivially on P/Φ(P), then it is trivial (Hall–Burnside: coprime automorphisms are detected on the Frattini quotient).

[L3]

For Cn=g, every unit class [a](Z/n)× defines the automorphism gga ( Aut(Cn)(Z/nZ)×).

Verification

technique · direct
1.1

By [L1], Φ(C3)=g3=1. The unit [1]3 gives inversion by [L3]; it sends g to g1=g2g and its square is the identity, so it is a nonidentity automorphism of order two.

givenL1L3algebra
2.1

Since the Frattini subgroup is trivial, the induced quotient action is the same nontrivial inversion. This is consistent with [L2], which forbids this order-two subgroup from acting trivially because 2 is coprime to 3.

step 1.1L2
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

FALSE: the Frattini subgroup is the union of the maximal subgroups

Statement

False claim. For a finite group G, the Frattini subgroup Φ(G) is the union of all maximal proper subgroups of G.

Facts & Assumptions

Given: The elementary abelian group E=(Z/2)2.

[L1]

For every prime p and nN, Φ((Z/p)n)=1 and the generator rank is n (The Frattini subgroup of (Z/p)n is trivial).

[F1]

Refutation

technique · direct
1.1

Every nonzero vector of E spans one of the three order-two subgroups (1,0), (0,1), and (1,1). Each has index two and is maximal.

givenL1algebra
2.1

Their union is all of E, while their intersection is {(0,0)}, which is Φ(E) by [L1] and [F1]. Since E is nontrivial, the union is not the Frattini subgroup.

step 1.1L1F1algebra
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

FALSE: every homomorphism carries the Frattini subgroup into the target Frattini subgroup

Statement

False claim. Every homomorphism f:GH between finite groups satisfies f(Φ(G))Φ(H).

Facts & Assumptions

[L1]

The embedding C4S5 sending a generator to a 4-cycle has f(Φ(C4))Φ(S5) (A nonsurjective homomorphism need not carry the Frattini subgroup into the target Frattini subgroup).

Refutation

technique · direct
1.1

The embedding in [L1] is a homomorphism for which the claimed inclusion fails, so it refutes the universal statement.

L1
1.2

Surjectivity gives the valid replacement. If f:GH is onto and M is maximal in H, then f1(M) is maximal in G: a subgroup K properly containing it has f(K)>M, hence f(K)=H; for every gG, choose kK with f(k)=f(g), and then gk1kerff1(M)K, so K=G. Therefore every xΦ(G) lies in every f1(M), and f(x) lies in every maximal M, hence in Φ(H).

givenalgebra
2.1

Step 1.1 shows that nonsurjective homomorphisms need not satisfy the inclusion, while step 1.2 identifies the missing sufficient hypothesis.

step 1.1step 1.2
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

FALSE: all minimal generating sets of a finite group have the same size

Statement

False claim. All inclusion-minimal generating sets of an arbitrary finite group have the same size.

Facts & Assumptions

Given: The additive group Z/6.

[F1]

A subset X is a minimal generating set when it generates and no proper subset generates (Minimal generating sets of a group, The subgroup S generated by a subset, the cyclic subgroup g, and cyclic groups).

[L1]

The quotient group (Z,+)/6Z is the additive group Z/6 (For every nN, the congruence-class group (Z/n,+) is the quotient group (Z,+)/nZ).

Refutation

technique · direct
1.1

The singleton {[1]} generates Z/6, and its only proper subset is empty, which generates only [0]. Thus it is minimally generating by [F1].

givenF1L1algebra
1.2

The set {[2],[3]} generates because [2]+[2]+[3]=[1]. The singleton {[2]} generates {[0],[2],[4]} and {[3]} generates {[0],[3]}, so neither proper singleton generates; hence the two-element set is also minimal by [F1].

givenF1L1algebra
2.1

Steps 1.1 and 1.2 exhibit minimal generating sets of sizes one and two in the same finite group, refuting the claim.

step 1.1step 1.2
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-24Open item page →

FALSE: the Fitting subgroup always contains its centralizer

Statement

False claim. For every finite group G, one has CG(F(G))F(G).

Facts & Assumptions

Given: The Fitting subgroup and its centralizer in a finite group.

[L1]

For A5, one has F(A5)=1 and CA5(F(A5))=A5 (The Fitting subgroup of A5 does not contain its centralizer).

[L2]

If G is finite and solvable, then CG(F(G))F(G) (Philip Hall: in a finite solvable group the Fitting subgroup contains its own centralizer).

Refutation

technique · direct
1.1

For A5, [L1] gives F(A5)=1 and CA5(F(A5))=A5.

L1
2.1

Thus the claimed inclusion fails for A5. The valid theorem [L2] has finite solvability as a hypothesis, and A5 lies outside that hypothesis.

step 1.1L2
3.1

The strict failure in step 1.1 refutes the hypothesis-free claim.

step 1.1step 2.1

Sources