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.
M-groups are solvable (Taketa)
Statement
Let be a finite -group (Monomial representations, monomial characters, and M-groups) and let be the distinct degrees of its irreducible complex characters, so that . Then for every with and every irreducible complex character of with the -th derived subgroup of satisfies (The derived series, solvable groups, and derived length, The kernel of a complex character). In particular : every finite -group is solvable, and its derived length satisfies .
Facts & Assumptions
Given: A finite -group with distinct irreducible character degrees , an index , and an irreducible complex character of with .
Every irreducible complex character of an -group is monomial: for some subgroup and some linear character of . (Monomial representations, monomial characters, and M-groups).
The derived series is , , hence ; is solvable when for some , and the derived length is the least such . (The derived series, solvable groups, and derived length).
is characteristic, hence normal, in , and every homomorphism from into an abelian group has in its kernel; characteristic subgroups are normal and characteristicness is transitive. (The derived subgroup is characteristic and the abelianization is universal, Characteristic subgroups are normal, and characteristicity is transitive).
for complex characters of and of . (Frobenius reciprocity for complex characters).
The irreducible complex characters of a finite group form an orthonormal basis of its class functions, and for an honest character the multiplicities in satisfy . (The irreducible complex characters form an orthonormal basis of , The class-function inner product equals ).
for a finite-dimensional complex -representation , and the character of an induced module is the induced character. (The dimension of an induced finite-dimensional representation is , The induced character of a complex character, The induced -linear -module as -covariant functions on ).
For a nonzero finite-dimensional complex -representation one has , and for this kernel is . (Kernel of an induced representation is the intersection of the conjugates of the kernel of the inducing representation).
The intersection of the kernels of all irreducible complex characters of a finite group is trivial, and the trivial character is an irreducible character of degree . (The normal subgroups of a finite group are exactly the intersections of kernels of irreducible complex characters, An irreducible complex character, Subrepresentations, direct sums of representations, and irreducibility).
The kernel of a direct sum of representations is the intersection of the kernels of its summands; hence a subgroup lying in the kernel of every irreducible constituent of an honest character lies in the kernel of that character.
Proof
Base case : then is a linear character, that is, a homomorphism into the abelian group , so by [F3].
Induction hypothesis: for every with and every irreducible character of with , one has .
Assume now . By [F1] the irreducible character of degree is monomial, say with and a linear character of . By [F6], , so is a proper subgroup. Let be the induced trivial character; again , and by Frobenius reciprocity [F4], .
Writing the honest character in the orthonormal basis of irreducible characters as with multiplicities by [F5], step 1.3 gives ; evaluating at gives , so and every constituent of has degree , hence for a unique index .
For every constituent of , step 2.1 gives with , so the induction hypothesis of step 1.2 yields , and since the series is descending by [F2], so . The trivial constituent satisfies . By [A1] the kernel of is the intersection of the kernels of its constituents, so .
The kernel formula [F7] for the induced trivial representation gives , so by step 3.1.
Therefore by [F2], and because is a homomorphism into the abelian group , by [F3].
Each term of the derived series is characteristic, hence normal, in by [F2] and [F3]; so for every by step 5.1. Hence by the kernel formula [F7] applied to , which completes the induction step.
By step 1.1 and step 6.1 the assertion holds for every and every irreducible with . Taking and using that the series is descending [F2], for every irreducible character of , so by [F8]. Thus , is solvable with . ∎
Depends on
- Monomial representations, monomial characters, and M-groups
- The derived series, solvable groups, and derived length
- The kernel of a complex character
- The derived subgroup is characteristic and the abelianization is universal
- Characteristic subgroups are normal, and characteristicity is transitive
- Frobenius reciprocity for complex characters
- The irreducible complex characters form an orthonormal basis of $\mathrm{cf}(G)$
- The class-function inner product $\langle\chi_V,\chi_W\rangle$ equals $\dim\operatorname{Hom}_G(W,V)$
- The dimension of an induced finite-dimensional representation is $[G:H]\dim W$
- The induced character $\operatorname{Ind}_H^G\chi$ of a complex character
- Kernel of an induced representation is the intersection of the conjugates of the kernel of the inducing representation
- The normal subgroups of a finite group are exactly the intersections of kernels of irreducible complex characters
- An irreducible complex character
- Subrepresentations, direct sums of representations, and irreducibility
- The induced $R$-linear $G$-module $\operatorname{Ind}_H^G W$ as $H$-covariant functions on $G$
Used by
Dependency tree · two levels
48 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
- SLMath, Character Theory of Finite Groups, Chapter 9 — slides 391–404 (Taketa's theorem, ordered character-degree induction) (standard reference, not scraped)