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
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
- 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
- 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
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- Sylow's Theorems, p-Groups and Nilpotent Groups
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
Finite -groups are nilpotent, so their maximal proper subgroups are normal of prime index; Lagrange specializes that index to . The Frattini subgroup is the intersection of the maximal proper subgroups and consists of the nongenerators, while Fitting theory records the nilpotence of the Fitting subgroup and the solvable-group centralizer bound. These results supply the finite-group generation and normal-subgroup framework used below.
Elementary abelian -groups receive their canonical -linear structure, and the Frattini quotient is identified as the largest elementary abelian quotient. The formula leads to subgroup, quotient, direct-product, and square-subgroup laws. Burnside basis then identifies minimal generators with quotient bases and yields generator-rank and hyperplane consequences. The induced automorphism action on the quotient culminates in Hall–Burnside and the -group kernel theorem.
3 · Logical flowchart
4 · Definitions, theorems and proofs
The Frattini subgroup of a finite group is characteristic
Statement
For every finite group , the subgroup is characteristic in and hence normal.
Facts & Assumptions
Given: A finite group and an automorphism of .
For a finite group , the Frattini subgroup is ; if , the empty intersection inside is (The Frattini subgroup as the intersection of the maximal subgroups of a finite group).
A subgroup is characteristic when for every automorphism of (Characteristic subgroups).
Proof
If is maximal proper, then is proper and maximal: any subgroup strictly between and pulls back under to one strictly between and . Thus permutes the family of maximal proper subgroups.
An automorphism carries an intersection to the intersection of the images, so step 1.1 and [F1] give . This is characteristicity by [F2]. Every inner automorphism is an automorphism, so is normal. The same argument covers .
Generation of a finite group is detected modulo its Frattini subgroup
Statement
A subset of a finite group generates if and only if its image generates (The Frattini subgroup as the intersection of the maximal subgroups of a finite group).
Facts & Assumptions
Given: A finite group , its normal subgroup from The Frattini subgroup of a finite group is characteristic, the quotient map , and a subset .
For a finite group , an element lies in if and only if, for every subset , implies (The Frattini subgroup consists exactly of the nongenerators of a finite group).
For , subgroups of correspond inclusion-preservingly to subgroups of containing (Correspondence theorem: subgroups of correspond to subgroups of containing , with normality preserved).
Proof
If , then applying the quotient map gives .
Conversely, suppose generates the quotient. Then . The subgroup is finite, so list its elements and remove them one at a time from this generating set: [L1] says each is a nongenerator. After all have been removed, .
Steps 1.1 and 1.2 prove both implications. When , both the empty subset and its empty quotient image generate, so the boundary case also agrees.
Elementary abelian -groups
Definition
An elementary abelian -group is a finite abelian -group in which every nonidentity element has order ; the trivial group is permitted (A finite -group has order for a prime and some , Group and abelian group, The order of a finite group and the order of an element, with when no positive power of is the identity).
An elementary abelian -group has a canonical -vector-space structure
Statement
The rule gives every elementary abelian -group its canonical -vector-space structure, with the group operation as vector addition and the identity as zero.
Facts & Assumptions
Given: An elementary abelian -group , a residue class , and , with integer powers as in Powers : natural exponents in a monoid and integer exponents in a group, with .
An elementary abelian -group is a finite abelian -group in which every nonidentity element has order ; the trivial group is permitted (Elementary abelian -groups).
For every prime , addition and multiplication make a field (For every prime , the two operations on make it a field).
The additive structure of is an abelian group and multiplication distributes over addition (For every natural , is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold).
For integers , one has and ; if , then (Exponent laws in a group: and for all , and when and commute).
Proof
If , then for an integer . Since by [F1], the power laws in [L3] give . Thus is independent of the representative.
The power laws in [L3] and commutativity give , , , , and . Together with [L1] and [L2], these are the vector-space axioms.
The scalar structure uses the existing abelian group law and does not change its elements. In particular its additive group remains finite, abelian, and of exponent , including the zero-dimensional trivial case.
-spanning sets, independence, and bases in an elementary abelian -group
Definition
Let be an elementary abelian -group with the canonical scalar action of An elementary abelian -group has a canonical -vector-space structure.
A subset spans when every can be written as a finite product
with all but finitely many coefficients zero. Equivalently, (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
The set is independent when with finite support forces every . A basis of an elementary abelian -group is an independent spanning subset for its canonical -linear structure.
The empty subset is independent. It spans exactly the trivial group, so the trivial group has the empty basis.
Finite elementary abelian -groups have bases, basis extension, and a well-defined dimension
Statement
Every finite elementary abelian -group has a basis; every independent subset extends to a basis, every spanning subset contains a basis, and all bases have the same finite size.
Facts & Assumptions
Given: A finite elementary abelian -group , an independent subset , and a spanning subset .
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 cardinality of a finite Cartesian product is the product of the cardinalities of its factors (The product rule: , and ).
If a positive integer is written as a finite product of powers of distinct primes, every exponent equals the corresponding canonical valuation (For and any injective list of primes containing every prime divisor of , one has ; the exponents are determined by , and for every prime outside the list).
Every nonempty subset of has a least element (The well-ordering principle).
Proof
The set of cardinalities of spanning subsets of is nonempty because spans itself, so [L3] gives its least member; choose a spanning subset of that size. It is inclusion-minimal, and if a nontrivial linear relation existed in , one member with nonzero coefficient could be solved for using its inverse scalar, contradicting minimality. Thus is a basis by [F1].
Starting from , adjoin an element outside its span while one exists; adjoining such an element preserves independence, and finiteness makes the process terminate at a spanning independent set. This extends to a basis. Applying the deletion argument of step 1.1 inside extracts a basis from every spanning set.
If is a basis, uniqueness of coordinates gives a bijection , so [L1] gives . For two bases , the equality and uniqueness of the exponent of the prime in [L2] give .
The th-power subgroup
Definition
For a group and a prime (Prime and composite integers: is prime when and its only positive divisors are and ), the th-power subgroup is
where powers are those of Powers : natural exponents in a monoid and integer exponents in a group, with and the generated subgroup is that of The subgroup generated by a subset, the cyclic subgroup , and cyclic groups. This notation denotes the subgroup generated by the powers, not merely the set of powers, which need not itself be a subgroup in an arbitrary group.
The Frattini quotient is the largest elementary abelian quotient of a finite -group
Statement
For a finite -group , the quotient is elementary abelian (Elementary abelian -groups, The quotient group and coset product ), and for the quotient is elementary abelian if and only if .
Facts & Assumptions
Given: A finite -group , its Frattini subgroup , and a normal subgroup .
For a finite group , is the intersection of all maximal proper subgroups; for the intersection is (The Frattini subgroup as the intersection of the maximal subgroups of a finite group).
Every finite -group is nilpotent; every maximal proper subgroup of a finite nilpotent group is normal and has prime index; Lagrange's theorem makes that index divide , so the index is ; and every group of prime order is cyclic (Every finite -group is nilpotent, Maximal subgroups of finite nilpotent groups are normal of prime index, Lagrange's theorem: for every subgroup of a finite group , A finite group of prime order is cyclic and every nonidentity element generates it).
Every finite elementary abelian -group has its canonical -linear structure, has a basis, and every independent subset extends to a basis (An elementary abelian -group has a canonical -vector-space structure, -spanning sets, independence, and bases in an elementary abelian -group, Finite elementary abelian -groups have bases, basis extension, and a well-defined dimension).
For , subgroups of correspond inclusion-preservingly to subgroups of containing (Correspondence theorem: subgroups of correspond to subgroups of containing , with normality preserved).
For every finite group , is characteristic and hence normal (The Frattini subgroup of a finite group is characteristic).
Proof
By [L1], each maximal subgroup of is normal with cyclic of order . Hence every commutator and every th power lies in every . Their images are therefore trivial modulo the normal subgroup from [L4] and [F1], so is abelian of exponent at most , and thus elementary abelian, including the trivial quotient.
For the forward direction of the kernel criterion, suppose is elementary abelian and let . The nonzero vector extends by [L2] to a basis of . The span of the other basis vectors is a maximal proper subgroup not containing ; by [L3], its preimage is a maximal subgroup of containing but not . Thus , and so .
For the reverse direction, suppose . Step 1.1 places every commutator and every th power of inside and hence inside , so is abelian and every element of it has th power the identity. It is therefore elementary abelian, including the trivial quotient . Together with step 1.2 this proves the iff.
for a finite -group
Statement
For every finite -group , the subgroup is characteristic and
where (Commutators and the commutator subgroup ) and is the subgroup generated by the th powers.
Facts & Assumptions
Given: A finite -group .
For a group and a prime , the th-power subgroup is (The th-power subgroup ).
For a finite -group , is elementary abelian, and is elementary abelian exactly when (The Frattini quotient is the largest elementary abelian quotient of a finite -group).
The commutator subgroup is normal in (The commutator subgroup is normal).
If and , then is a subgroup (If and , then is a subgroup and ).
Proof
Every automorphism sends to , so it preserves the generating set in [F1] and hence is characteristic; conjugation by an element of is an automorphism, so is normal. By [L2], is normal as well, so [L3] makes a subgroup, and for every makes it normal.
The elementary abelian quotient is abelian and has exponent by [L1], so it kills every commutator and every th power. Thus .
The quotient is abelian because it kills , and every element has th power one because it kills . It is therefore elementary abelian, so the kernel criterion in [L1] gives . Together with step 2.1 this proves equality.
If are finite -groups, then
Statement
If are finite -groups, then .
Facts & Assumptions
Given: Finite -groups .
For every finite -group , ( for a finite -group).
For every subgroup , one has (Homomorphisms respect commutator subgroups and derived series).
Proof
By [L2], . Every th power of an element of is also a th power of an element of , so .
Multiplying the inclusions in step 1.1 gives , and [L1] identifies these products with and .
for a normal subgroup of a finite -group
Statement
If and is a finite -group, then
Facts & Assumptions
Given: A finite -group , a normal subgroup , and the quotient map .
For every finite -group , ( for a finite -group).
A surjective homomorphism sends the derived subgroup onto the derived subgroup of the target (Homomorphisms respect commutator subgroups and derived series).
In , coset multiplication satisfies , and subgroups of correspond to subgroups of containing by and inverse image (For , the cosets form a group with identity and inverse , Correspondence theorem: subgroups of correspond to subgroups of containing , with normality preserved).
Proof
By [L2], . Also , so .
Apply [L1] in and use step 1.1: . Directly, , so the correspondence in [L3] gives .
for finite -groups
Statement
For finite -groups and ,
Facts & Assumptions
Given: Finite -groups .
The external direct product has componentwise multiplication, and this operation makes a group (The external direct product with componentwise multiplication, is a group with identity , coordinatewise inverses, and homomorphic coordinate projections).
The commutator subgroup is generated by the elements , and natural powers are defined recursively from the group operation (Commutators and the commutator subgroup , Powers : natural exponents in a monoid and integer exponents in a group, with ).
For every finite -group , ( for a finite -group).
Proof
Componentwise commutators and powers give and .
By [L1] and step 1.1, .
for a finite -group
Statement
For every finite -group , .
Facts & Assumptions
Given: A finite -group .
For every finite -group , the subgroup is characteristic and ( for a finite -group).
The square subgroup is (The th-power subgroup ).
For , the quotient is abelian if and only if ( is abelian if and only if ).
Proof
By [L1], is characteristic and hence normal. Every element of has square one by [F1]. In any group of exponent at most two, gives , so is abelian.
By [L2], step 1.1 gives . Substituting in [L1] yields , including .
A finite -group has trivial Frattini subgroup exactly when it is elementary abelian
Statement
A finite -group has trivial Frattini subgroup if and only if it is elementary abelian.
Facts & Assumptions
Given: A finite -group .
For a finite -group , is elementary abelian, and is elementary abelian exactly when (The Frattini quotient is the largest elementary abelian quotient of a finite -group).
An elementary abelian -group is a finite abelian -group in which every nonidentity element has order ; the trivial group is permitted (Elementary abelian -groups).
Proof
For the forward direction, if , then [L1] identifies with its elementary abelian Frattini quotient.
For the reverse direction, if is elementary abelian, apply the kernel criterion in [L1] with to obtain , hence .
Minimal generating sets of a group
Definition
A subset of a group is a minimal generating set when it generates and no proper subset of generates. In symbols,
with generated subgroups as in The subgroup generated by a subset, the cyclic subgroup , and cyclic groups. Here minimal means inclusion-minimal, not minimum cardinality.
The generator rank of a finite -group
Definition
For a finite -group , the generator rank is the common size of a basis of .
This is well defined: The Frattini quotient is the largest elementary abelian quotient of a finite -group makes the quotient elementary abelian, and Finite elementary abelian -groups have bases, basis extension, and a well-defined dimension proves that it has bases and that all have the same finite size in the sense of -spanning sets, independence, and bases in an elementary abelian -group. In particular , since the trivial quotient has the empty basis.
Burnside Basis Theorem
Statement
A subset of a finite -group is a minimal generating set if and only if the quotient map restricts to a bijection from onto a basis of . Equivalently, the indexed family is a basis.
The restricted-bijection clause is essential: the image set alone would forget whether two distinct elements of lie in the same Frattini coset. Every basis in this theorem has members (The generator rank of a finite -group).
Facts & Assumptions
Given: A finite -group , the quotient map , and a subset .
A subset of a finite group generates if and only if its image generates (Generation of a finite group is detected modulo its Frattini subgroup).
A subset is a minimal generating set when it generates and no proper subset generates (Minimal generating sets of a group).
Every finite elementary abelian -group has a basis; every independent subset extends to a basis, every spanning subset contains a basis, and all bases have the same finite size (Finite elementary abelian -groups have bases, basis extension, and a well-defined dimension, -spanning sets, independence, and bases in an elementary abelian -group).
For a finite -group , the quotient is elementary abelian (The Frattini quotient is the largest elementary abelian quotient of a finite -group).
Proof
For the forward direction, suppose is minimally generating. By [L1], spans. If mapped to zero, or if distinct had the same image, deleting one of them would leave the same spanning image and [L1] would make a proper subset generate, contrary to [F1]. Thus is injective. Any proper subset of that spanned would likewise pull back to a proper generating subset of , so spans and no proper subset of it does. By [L2] it contains a basis ; since spans, the failure of every proper subset to span forces , so is itself a basis.
For the reverse direction, suppose is a bijection onto a basis. The basis spans, so [L1] gives . Removing any removes its distinct basis vector; the remaining basis vectors do not span, so [L1] says does not generate. Thus is minimal by [F1].
Steps 1.1 and 1.2 prove both implications. For , the quotient has the empty basis and the empty set is the minimal generating set, so the same statement applies.
Minimal generating sets of a finite -group have size
Statement
Every minimal generating set of a finite -group has size , and every generating set contains a minimal generating subset of that size.
Facts & Assumptions
Given: A finite -group .
A subset is minimally generating exactly when the quotient map restricts to a bijection from onto a basis of (Burnside Basis Theorem).
Every spanning subset of a finite elementary abelian -group contains a basis, and all bases have the same finite size (Finite elementary abelian -groups have bases, basis extension, and a well-defined dimension).
The generator rank is the common size of a basis of (The generator rank of a finite -group).
Proof
By [L1], every minimal generating set is in bijection with a quotient basis. All such bases have size by [F1] and [L2].
If generates , its quotient image spans. Choose by [L2] a basis contained in that finite image and, for each basis vector, retain one element of mapping to it. The resulting subset maps bijectively onto the basis, so [L1] makes it minimally generating; step 1.1 gives its size.
Every element outside belongs to a minimal generating set of
Statement
Every element of belongs to a minimal generating set of the finite -group .
Facts & Assumptions
Given: A finite -group and (The Frattini subgroup as the intersection of the maximal subgroups of a finite group).
A subset is minimally generating exactly when the quotient map restricts to a bijection from onto a basis of (Burnside Basis Theorem).
Every independent subset of a finite elementary abelian -group extends to a basis (Finite elementary abelian -groups have bases, basis extension, and a well-defined dimension).
For a finite -group , the quotient is elementary abelian (The Frattini quotient is the largest elementary abelian quotient of a finite -group).
Proof
By [L3] the quotient is a finite elementary abelian -group, so [L2] applies to it. The coset is nonzero, so its singleton is independent in .
Extend that singleton by [L2] to a finite basis. For every other basis vector choose one lift in and adjoin it to . The quotient map restricts to a bijection from this lifted set onto the basis, so [L1] makes it a minimal generating set containing . The assertion is vacuous for .
A nontrivial finite -group is cyclic exactly when
Statement
A nontrivial finite -group is cyclic if and only if , while .
Facts & Assumptions
Given: A finite -group .
A subset is minimally generating exactly when the quotient map restricts to a bijection from onto a basis of (Burnside Basis Theorem).
The generator rank is the common size of a basis of (The generator rank of a finite -group).
A group is cyclic when for some (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
Proof
For the reverse direction, if , choose a one-element quotient basis and lift it. By [L1] the lift is a one-element generating set, so is cyclic by [F2].
For the forward direction, if nontrivial is cyclic with generator , then is minimally generating because the empty set generates only the trivial subgroup. By [L1], its quotient image is a one-element basis, so by [F1].
If , its Frattini quotient has the empty basis, hence by [F1]; this is why nontriviality is needed in the biconditional.
Maximal subgroups of a finite -group are the inverse images of Frattini hyperplanes
Statement
Let be the quotient map. The maximal subgroups (Maximal proper subgroups) of a finite -group are exactly the inverse images of codimension-one subgroups of . Equivalently, they are the subgroups
for nonzero -linear homomorphisms (Monoid homomorphism and group homomorphism).
Facts & Assumptions
Given: A finite -group and quotient map .
The Frattini subgroup is the intersection of the maximal proper subgroups, so for every maximal subgroup (The Frattini subgroup as the intersection of the maximal subgroups of a finite group).
The quotient is elementary abelian (The Frattini quotient is the largest elementary abelian quotient of a finite -group).
Every independent subset extends to a basis, every spanning subset contains a basis, and all bases have equal finite size (Finite elementary abelian -groups have bases, basis extension, and a well-defined dimension, -spanning sets, independence, and bases in an elementary abelian -group).
Subgroups of correspond inclusion-preservingly to subgroups of containing (Correspondence theorem: subgroups of correspond to subgroups of containing , with normality preserved).
Proof
If is maximal in , [F1] and [L3] make maximal proper in . Choose a basis of this subgroup and extend it by [L2] to a basis of . Maximality permits exactly one added basis vector, since two would create a proper intermediate span. Thus has codimension one.
The coordinate of the omitted basis vector defines a nonzero linear homomorphism whose kernel is . Conversely, let be linear and nonzero and choose with . Every splits as with the first summand in , and , so a basis of together with spans and is independent; it is therefore a basis of by [L2], and has codimension one. Any subgroup strictly between and would contain some with and hence a scalar multiple of equal to modulo , so it would be all of ; thus is maximal proper and [L3] makes its inverse image maximal in .
The quotient and inverse-image maps in [L3] are inverse, so steps 1.1 and 2.1 give the stated classification. The trivial group has neither maximal subgroups nor nonzero linear homomorphisms.
Automorphisms act linearly on the Frattini quotient
Statement
Every automorphism of a finite -group induces an -linear automorphism of , and these form a homomorphism
Facts & Assumptions
Given: A finite -group , an automorphism , and the quotient map .
For every finite group , is characteristic and hence normal (The Frattini subgroup of a finite group is characteristic).
The rule gives every elementary abelian -group its canonical -vector-space structure (An elementary abelian -group has a canonical -vector-space structure, The Frattini quotient is the largest elementary abelian quotient of a finite -group).
The automorphisms of a group form a group under composition (The automorphisms of a group form a group under composition).
A homomorphism that kills a normal subgroup factors uniquely through the quotient group (A homomorphism that kills a normal subgroup factors uniquely through the quotient group).
Proof
By [L1], , so kills . The universal property [L4] gives a quotient automorphism with ; applying the same construction to supplies its inverse.
For , , so is linear by [L2].
The induced map of the identity is the identity, and uniqueness in [L4] gives . Thus preserves the group law in [L3] and defines .
Hall–Burnside: coprime automorphisms are detected on the Frattini quotient
Statement
Let be a finite -group, and let be a finite subgroup whose order is not divisible by . If acts trivially on through , then .
Facts & Assumptions
Given: A finite -group and a finite -subgroup acting trivially on .
A subset is minimally generating exactly when the quotient map restricts to a bijection from onto a basis of (Burnside Basis Theorem).
If a prime divides the order of a finite group, that group contains an element of order (Cauchy's theorem: if a prime divides , then has an element of order ).
If a finite -group acts on a finite set whose size is not divisible by , then it has a fixed point (A finite -group action on has a global fixed point whenever ).
Every automorphism of induces its action on through (Automorphisms act linearly on the Frattini quotient).
The order of a subgroup divides the order of a finite group (Lagrange's theorem: for every subgroup of a finite group ).
Proof
Suppose, for contradiction, that . Choose a prime dividing ; [L2] gives of order . Since , one has .
Triviality of the quotient action in [L4] means that preserves each coset of . Each coset has , a power of by [L5], elements. The cyclic -group acts on that coset, and makes [L3] provide an -fixed representative in every coset.
Starting from the finite generating set , delete redundant elements until a minimal generating set remains; [L1] sends it bijectively onto a basis of . Using step 2.1, choose a fixed representative of each of these finitely many basis cosets. By [L1] those representatives generate . Since fixes every generator, it fixes every element of , so is the identity, contradicting its prime order.
The contradiction shows that the assumed nontrivial -subgroup cannot exist; hence .
The kernel of the automorphism action on is a -group
Statement
Let be a finite -group. The kernel of
is a finite -group.
Facts & Assumptions
Given: A finite -group and .
Every automorphism of a finite -group induces an -linear automorphism of , and these form a homomorphism (Automorphisms act linearly on the Frattini quotient).
If a -subgroup of acts trivially on , then it is trivial (Hall–Burnside: coprime automorphisms are detected on the Frattini quotient).
If a prime divides the order of a finite group, that group contains an element of order (Cauchy's theorem: if a prime divides , then has an element of order ).
A positive integer is the product of powers of its prime divisors, with uniquely determined exponents (For and any injective list of primes containing every prime divisor of , one has ; the exponents are determined by , and for every prime outside the list).
Proof
By [L1], is a subgroup of . Since is finite, its automorphism group is a subgroup of the finite permutation group of its underlying set, so is finite.
If a prime divided , [L3] would give of order . Then would be a nontrivial -subgroup acting trivially on the quotient, contradicting [L2].
By [L4], no prime other than occurs in , so is a power of . The exponent-zero case gives the trivial kernel, including .
5 · Examples, counterexamples and false statements
None yet.
Sources
- D. A. Craven, The Theory of p-Groups, §2.2
- K. Conrad, Generating Sets, §6
- D. A. Craven, The Theory of p-Groups, Proposition 2.18
- K. Conrad, Generating Sets, Theorem 6.12
- D. A. Craven, The Theory of p-Groups, Definition 2.6
- K. Conrad, Generating Sets, consequences of Theorem 6.12
- M. van Beek, Topics in Finite p-Groups, Theorem 3.7
- D. A. Craven, The Theory of p-Groups, Definition 2.26
- D. A. Craven, The Theory of p-Groups, Proposition 2.24
- M. van Beek, Topics in Finite p-Groups, Lemma 3.4
- D. A. Craven, The Theory of p-Groups, Proposition 2.25
- M. van Beek, Topics in Finite p-Groups, Proposition 3.5
- M. van Beek, Topics in Finite p-Groups, Lemma 3.6(i)
- M. van Beek, Topics in Finite p-Groups, Lemma 3.6(ii)
- M. van Beek, Topics in Finite p-Groups, Lemma 3.6(iii)
- M. van Beek, Topics in Finite p-Groups, Lemma 3.6(iv)
- M. van Beek, Topics in Finite p-Groups, before Theorem 3.7
- D. A. Craven, The Theory of p-Groups, Theorem 2.28 and Definition 2.29
- D. A. Craven, The Theory of p-Groups, Theorem 2.28
- M. van Beek, Topics in Finite p-Groups, remark after Theorem 3.7
- M. van Beek, Topics in Finite p-Groups, §3.1
- D. A. Craven, The Theory of p-Groups, discussion before Theorem 2.30
- M. van Beek, Topics in Finite p-Groups, Proposition 4.10
- D. A. Craven, The Theory of p-Groups, Theorem 2.30