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.
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 .
Depends on
- A finite $p$-group has trivial Frattini subgroup exactly when it is elementary abelian
- The generator rank $d(P)$ of a finite $p$-group
- $\mathbb F_p$-spanning sets, independence, and bases in an elementary abelian $p$-group
- For every prime $p$, the two operations on $\mathbb{Z}/p$ make it a field
- For $n\ge 1$, every class in $\mathbb{Z}/n$ has one representative $r$ with $0\le r<n$, so $\lvert\mathbb{Z}/n\rvert=n$; while $\mathbb{Z}/0$ is in bijection with $\mathbb{Z}$
- The product rule: $\lvert A \times B\rvert = \lvert A\rvert\,\lvert B\rvert$, and $\big\lvert\prod_{i<m} A_i\big\rvert = \prod_{i<m}\lvert A_i\rvert$
Used by
Dependency tree · two levels
31 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, Definition 2.6 (standard reference, not scraped)
- K. Conrad, Generating Sets, §6 (standard reference, not scraped)