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.
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 .
Depends on
Used by
Nothing in the library uses this result yet.
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
- M. van Beek, Topics in Finite p-Groups, remark after Theorem 3.7 (standard reference, not scraped)