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.
Implications and limits for M-groups
Statement
For finite groups the implications
hold (Monomial representations, monomial characters, and M-groups, Finite supersolvable groups are M-groups, M-groups are solvable (Taketa)).
Remarks
-
Strictness of the second implication. The companion counterexample A solvable group that is not an M-group ↗ constructs the binary tetrahedral group of order and verifies that it is solvable, has a faithful irreducible complex representation of degree two, and has no subgroup of index two. The dimension formula The dimension of an induced finite-dimensional representation is then excludes induction of that representation from a linear character, so the later example proves that solvable does not imply -group. These group facts are established there, not used to derive the implication chain above.
-
Brauer's monomial induction theorem (Virtual characters are integrally generated by monomial characters from elementary subgroups) is a different assertion from " is an -group": it states that every virtual character of is an integral combination of monomial characters induced from elementary subgroups, with coefficients that may be negative and with elementary subgroups that need not be the inertia groups of the irreducible constituents. It therefore does not produce a monomial irreducible character of , and the companion counterexample shows that it cannot: for the virtual-character statement holds by Virtual characters are integrally generated by monomial characters from elementary subgroups while one of the irreducible characters of is not monomial.
-
This remark does not address whether the first implication reverses. The standard witness that not every -group is supersolvable is not developed on this page.
-
The implication chain above is the reason this page treats supersolvable groups as the principal source of -groups: combining Finite supersolvable groups are M-groups with M-groups are solvable (Taketa) and The derived series, solvable groups, and derived length places every finite supersolvable group in the hierarchy supersolvable -group solvable, in which the second inclusion is strict by the companion counterexample and the first is not settled here.
Depends on
- Monomial representations, monomial characters, and M-groups
- Finite supersolvable groups are M-groups
- M-groups are solvable (Taketa)
- Virtual characters are integrally generated by monomial characters from elementary subgroups
- The quaternion group $Q_8=\{\pm1,\pm i,\pm j,\pm k\}$ inside the nonzero quaternions
- The derived series, solvable groups, and derived length
- The dimension of an induced finite-dimensional representation is $[G:H]\dim W$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
46 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
- Tammo tom Dieck, Representation Theory — §4.3, Problem 1 (binary tetrahedral group), printed pp. 58–59 (standard reference, not scraped)
- SLMath, Character Theory of Finite Groups, Chapter 9 — slides 391–404 and 408 (Taketa; supersolvable is strictly stronger) (standard reference, not scraped)