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.
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.
Depends on
- Generation of a finite group is detected modulo its Frattini subgroup
- Minimal generating sets of a group
- The generator rank $d(P)$ of a finite $p$-group
- $\mathbb F_p$-spanning sets, independence, and bases in an elementary abelian $p$-group
- Finite elementary abelian $p$-groups have bases, basis extension, and a well-defined dimension
- The Frattini quotient is the largest elementary abelian quotient of a finite $p$-group
Used by
Dependency tree · two levels
21 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
- D. A. Craven, The Theory of p-Groups, Theorem 2.28 (standard reference, not scraped)
- K. Conrad, Generating Sets, Theorem 6.12 (standard reference, not scraped)
- M. van Beek, Topics in Finite p-Groups, Theorem 3.7 (standard reference, not scraped)