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 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 .
Depends on
- $\Phi(P)=P'P^p$ for a finite $p$-group
- The generator rank $d(P)$ of a finite $p$-group
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
- In a cyclic group of order $m$, $g^a$ has order $m/\gcd(a,m)$
- Every subgroup of a cyclic group is cyclic; the least positive exponent in a nontrivial subgroup supplies a generator
Used by
Dependency tree · two levels
25 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
- K. Conrad, Generating Sets, Example 6.9 (standard reference, not scraped)