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.
Frattini Subgroups and the Burnside Basis Theorem — Examples
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
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- 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
- Primitive Roots and Unit Groups Modulo N
- 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
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Fundamental Theorem of Finite Abelian Groups
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The Frattini subgroup of a nontrivial cyclic -group
Example
If has order with , then and . For , this says .
Facts & Assumptions
Given: A cyclic group of order with .
For every finite -group , ( for a finite -group).
If has finite order , then (In a cyclic group of order , has order ).
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 generated by a subset, the cyclic subgroup , and cyclic groups).
Every subgroup of a cyclic group is cyclic (Every subgroup of a cyclic group is cyclic; the least positive exponent in a nontrivial subgroup supplies a generator).
The generator rank is the common size of a basis of (The generator rank of a finite -group).
Verification
Every th power in is a power of , and conversely is a th power, so [F1] gives . The group is abelian, so . By [L2], has order , including order one at , and [L3] is consistent with this cyclic subgroup description.
Formula [L1] gives . The quotient has order , so its nonidentity coset is a one-vector basis; hence [F2] gives .
The Frattini subgroup of is trivial
Example
For every prime and , and the generator rank is .
Facts & Assumptions
Given: A prime and a natural number .
A finite -group has trivial Frattini subgroup if and only if it is elementary abelian (A finite -group has trivial Frattini subgroup exactly when it is elementary abelian).
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).
The quotient has elements, is a field, and a finite Cartesian product has the product cardinality (For , every class in has one representative with , so ; while is in bijection with , For every prime , the two operations on make it a field, The product rule: , and ).
The generator rank is the common size of a basis of (The generator rank of a finite -group).
Verification
Componentwise addition makes a finite abelian group of order by [L2], and every nonzero element has order . It is therefore elementary abelian and [L1] gives . At , the empty product is the trivial group and the same conclusion holds.
The standard coordinate vectors have unique coordinates, so they form a basis by [F1]. There are of them, hence [F2] gives , including the empty basis at .
The Frattini subgroups of the dihedral and quaternion groups of order eight
Example
Let in the convention of with inversion action has order and the dihedral relations, so is the dihedral group of order eight, and let be the quaternion group. Then
For the dihedral group of order eight and , the Frattini subgroup has order two and the Frattini quotient is . Both groups have generator rank two.
Facts & Assumptions
Given: The normal forms and in , and the multiplication table of ( The generalized dihedral group for an abelian group , The quaternion group inside the nonzero quaternions).
For every finite -group , ( for a finite -group).
In , , , and every element is or ; in , the elements have order four and is the unique element of order two ( with inversion action has order and the dihedral relations, is a subgroup of with eight elements, and is its only element of order ).
The commutator subgroup is generated by (Commutators and the commutator subgroup ).
The generator rank is the common size of a basis of the Frattini quotient (The generator rank of a finite -group).
Verification
In , and , so . In , the squares are and , with every noncentral element squaring to , so . The commutators of [F1] give the same two subgroups: and every commutator of is a power of , so ; and , so .
Apply [L1] to step 1.1. Each quotient has order four and exponent two, with the classes of and of respectively as two-vector bases. Thus both quotients are , and [F2] gives generator rank two.
The upper-unitriangular group over a prime field has generator rank two
Example
For a prime , let be the set of upper-unitriangular matrices over the prime field under matrix multiplication. Writing
the assignment is a bijection from onto that turns matrix multiplication into
Working in these coordinates, is a group of order ,
and . This includes , when does not have exponent .
Facts & Assumptions
Given: A prime , the upper-unitriangular matrices over , and the displayed coordinate parametrisation.
For every finite -group , ( for a finite -group).
The generator rank is the common size of a basis of the Frattini quotient (The generator rank of a finite -group).
The operations make a field with elements, and the threefold Cartesian product has elements (For every prime , the two operations on make it a field, For , every class in has one representative with , so ; while is in bijection with , The product rule: , and ).
A basis is an independent spanning subset for the canonical -linear structure (-spanning sets, independence, and bases in an elementary abelian -group).
Verification
Multiplying entrywise gives the matrix with entry , entry and entry , so the parametrisation carries matrix multiplication to the displayed coordinate operation and is a bijection. Direct substitution shows associativity; the identity is and . By [L2] the set has order , so this is a finite -group.
A calculation with the inverse in step 1.1 gives . Every commutator lies on the central -axis, and , so .
Induction gives . For odd , every th power is the identity; for , every square is and hence lies on the central axis. Since the derived subgroup already equals that axis, [L1] gives in both cases.
Modulo the central axis, the first two coordinate classes give unique coordinates and form a two-vector basis by [F2]. Therefore [F1] gives .
Remarks
The prime field is a hypothesis, not a convenience. Over with the same coordinates and the same two computations give and , so the Frattini subgroup is again that central axis and the Frattini quotient is — a vector space of dimension over , not . For the generator rank is therefore .
The maximal subgroups of the dihedral group of order eight as Frattini hyperplanes
Example
For , the maximal subgroups are
Modulo , these are the hyperplanes of .
Facts & Assumptions
Given: The dihedral group of order eight.
For one has , and for the dihedral group of order eight and the Frattini subgroup has order two and the Frattini quotient is (The Frattini subgroups of the dihedral and quaternion groups of order eight).
If is the quotient map, the maximal subgroups of are exactly for nonzero -linear homomorphisms (Maximal subgroups of a finite -group are the inverse images of Frattini hyperplanes).
Verification
The three displayed subgroups have order four, are distinct, and contain from [L1]. Since has order eight, each is maximal.
Use the quotient basis . The quotient images of the displayed subgroups are the lines spanned by , , and , which are respectively the kernels of , , and . These are precisely the hyperplanes described by [L2].
A nonsurjective homomorphism need not carry the Frattini subgroup into the target Frattini subgroup
Statement refuted
For every group homomorphism , one has . This fails for the embedding below: .
Facts & Assumptions
Given: The cyclic group , the symmetric group with the cycle convention of The finite symmetric group , one-line notation, and cycle notation, and the homomorphism defined by (Monoid homomorphism and group homomorphism).
If has order with , then and (The Frattini subgroup of a nontrivial cyclic -group).
The Frattini subgroup of every finite group is nilpotent (The Frattini subgroup of a finite group is nilpotent).
For , the normal subgroups of are (For , the only proper nontrivial normal subgroup of is ).
The groups and are not solvable ( and for are not solvable).
Every nilpotent group is solvable (Nilpotent groups, and in particular finite -groups, are solvable).
The Frattini subgroup is characteristic and hence normal (The Frattini subgroup of a finite group is characteristic, The Frattini subgroup as the intersection of the maximal subgroups of a finite group).
Counterexample
The -cycle has order four, so is an embedding. By [L1], , and .
By [L2] and [L6], is nilpotent and normal. The list [L3] leaves only ; [L4] and [L5] exclude the latter two, so .
Step 1.1 exhibits a nonidentity element of , while step 1.2 makes the target Frattini subgroup trivial. Hence .
The Fitting subgroup of does not contain its centralizer
Statement refuted
For every finite group , one has . For , one has and , so solvability cannot be omitted.
Facts & Assumptions
Given: The alternating group and its Fitting subgroup (The Fitting subgroup of a finite group).
For every finite group , 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).
The group is simple ( is simple for every ).
The group is not solvable ( and for are not solvable).
Every nilpotent group is solvable (Nilpotent groups, and in particular finite -groups, are solvable).
The centralizer consists of the elements of that commute with every element of (The centralizer of a subgroup).
Counterexample
By [L1], is normal and nilpotent. Simplicity [L2] leaves or ; the second would make nilpotent and hence solvable by [L4], contradicting [L3]. Thus .
For , one has and , since every element centralizes the trivial subgroup by [F1]. Therefore .
Inversion on is detected on its Frattini quotient
Example
Inversion on 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 .
If has order with , then and (The Frattini subgroup of a nontrivial cyclic -group).
If a -subgroup of acts trivially on , then it is trivial (Hall–Burnside: coprime automorphisms are detected on the Frattini quotient).
Verification
By [L1], . The unit gives inversion by [L3]; it sends to and its square is the identity, so it is a nonidentity automorphism of order two.
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 is coprime to .
FALSE: the Frattini subgroup is the union of the maximal subgroups
Statement
False claim. For a finite group , the Frattini subgroup is the union of all maximal proper subgroups of .
Facts & Assumptions
Given: The elementary abelian group .
For every prime and , and the generator rank is (The Frattini subgroup of is trivial).
The Frattini subgroup is the intersection of the maximal proper subgroups (The Frattini subgroup as the intersection of the maximal subgroups of a finite group, Maximal proper subgroups).
Refutation
Every nonzero vector of spans one of the three order-two subgroups , , and . Each has index two and is maximal.
Their union is all of , while their intersection is , which is by [L1] and [F1]. Since is nontrivial, the union is not the Frattini subgroup.
FALSE: every homomorphism carries the Frattini subgroup into the target Frattini subgroup
Statement
False claim. Every homomorphism between finite groups satisfies .
Facts & Assumptions
Given: Finite groups and their Frattini subgroups (The Frattini subgroup as the intersection of the maximal subgroups of a finite group).
The embedding sending a generator to a -cycle has (A nonsurjective homomorphism need not carry the Frattini subgroup into the target Frattini subgroup).
Refutation
The embedding in [L1] is a homomorphism for which the claimed inclusion fails, so it refutes the universal statement.
Surjectivity gives the valid replacement. If is onto and is maximal in , then is maximal in : a subgroup properly containing it has , hence ; for every , choose with , and then , so . Therefore every lies in every , and lies in every maximal , hence in .
Step 1.1 shows that nonsurjective homomorphisms need not satisfy the inclusion, while step 1.2 identifies the missing sufficient hypothesis.
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 .
A subset is a minimal generating set when it generates and no proper subset generates (Minimal generating sets of a group, The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
The quotient group is the additive group (For every , the congruence-class group is the quotient group ).
Refutation
The singleton generates , and its only proper subset is empty, which generates only . Thus it is minimally generating by [F1].
The set generates because . The singleton generates and generates , so neither proper singleton generates; hence the two-element set is also minimal by [F1].
Steps 1.1 and 1.2 exhibit minimal generating sets of sizes one and two in the same finite group, refuting the claim.
FALSE: the Fitting subgroup always contains its centralizer
Statement
False claim. For every finite group , one has .
Facts & Assumptions
Given: The Fitting subgroup and its centralizer in a finite group.
For , one has and (The Fitting subgroup of does not contain its centralizer).
If is finite and solvable, then (Philip Hall: in a finite solvable group the Fitting subgroup contains its own centralizer).
Refutation
For , [L1] gives and .
Thus the claimed inclusion fails for . The valid theorem [L2] has finite solvability as a hypothesis, and lies outside that hypothesis.
The strict failure in step 1.1 refutes the hypothesis-free claim.
Sources
- K. Conrad, Generating Sets, Example 6.9
- D. A. Craven, The Theory of p-Groups, Definition 2.6
- K. Conrad, Generating Sets, §6
- K. Conrad, Generating Sets, Example 6.10
- K. Conrad, Generating Sets, Example 6.11
- Y. Harpaz and O. Wittenberg, The Massey Vanishing Conjecture for Number Fields, §2
- D. A. Craven, The Theory of p-Groups, §2.2
- J. S. Milne, Group Theory
- D. A. Craven, The Theory of p-Groups, §1.1
- T. Judson, Abstract Algebra: Theory and Applications, Simplicity of $A_n$
- D. A. Craven, Finite Group Theory, Theorem 2.13