Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-27
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 G be a finite M-group (Monomial representations, monomial characters, and M-groups) and let 1=f1<f2<⋯<fr be the distinct degrees of its irreducible complex characters, so that r=∣cd(G)∣. Then for every k with 1≤k≤r and every irreducible complex character χ of G with χ(1)=fk the k-th derived subgroup of G satisfies G(k)≤ker⁡χ (The derived series, solvable groups, and derived length, The kernel of a complex character). In particular G(r)=1: every finite M-group is solvable, and its derived length satisfies dl(G)≤r=∣cd(G)∣.

Facts & Assumptions

Given: A finite M-group G with distinct irreducible character degrees 1=f1<f2<⋯<fr, an index k∈{1,…,r}, and an irreducible complex character χ of G with χ(1)=fk.

[F1]

Every irreducible complex character of an M-group is monomial: χ=Ind⁡HGλ for some subgroup H≤G and some linear character λ of H. (Monomial representations, monomial characters, and M-groups).

[F2]

The derived series is G(0)=G, G(m+1)=[G(m),G(m)], hence G(m+1)≤G(m); G is solvable when G(n)=1 for some n, and the derived length is the least such n. (The derived series, solvable groups, and derived length).

[F3]

G′ is characteristic, hence normal, in G, and every homomorphism from G into an abelian group has G′ 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).

[F4]

⟨Ind⁡HGψ,η⟩G=⟨ψ,Res⁡HGη⟩H for complex characters ψ of H and η of G. (Frobenius reciprocity for complex characters).

[F5]

The irreducible complex characters of a finite group form an orthonormal basis of its class functions, and for an honest character π the multiplicities in π=∑θmθθ satisfy mθ=⟨π,θ⟩=dim⁡Hom⁡G(Vπ,Vθ)∈Z≥0. (The irreducible complex characters form an orthonormal basis of cf(G), The class-function inner product ⟨χV,χW⟩ equals dim⁡Hom⁡G(W,V)).

[F6]

dim⁡CInd⁡HGW=[G:H]dim⁡CW for a finite-dimensional complex H-representation W, and the character of an induced module is the induced character. (The dimension of an induced finite-dimensional representation is [G:H]dim⁡W, The induced character Ind⁡HGχ of a complex character, The induced R-linear G-module Ind⁡HGW as H-covariant functions on G).

[F7]

For a nonzero finite-dimensional complex H-representation W one has ker⁡(Ind⁡HGW)=⋂g∈Gg(ker⁡W)g−1, and for W=1H this kernel is Core⁡G(H)≤H. (Kernel of an induced representation is the intersection of the conjugates of the kernel of the inducing representation).

[F8]

The intersection of the kernels of all irreducible complex characters of a finite group G is trivial, and the trivial character 1G is an irreducible character of degree 1. (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).

[A1]

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

technique · induction on $k$
1.1

Base case k=1: then χ is a linear character, that is, a homomorphism G→C× into the abelian group C×, so G(1)=G′≤ker⁡χ by [F3].

F3givenbase
1.2

Induction hypothesis: for every j with 1≤j<k and every irreducible character χ′ of G with χ′(1)=fj, one has G(j)≤ker⁡χ′.

ih
1.3

Assume now k≥2. By [F1] the irreducible character χ of degree fk is monomial, say χ=Ind⁡HGλ with H≤G and λ a linear character of H. By [F6], fk=χ(1)=[G:H]⋅1=[G:H]≥2, so H is a proper subgroup. Let π=Ind⁡HG1H be the induced trivial character; again π(1)=[G:H]=fk, and by Frobenius reciprocity [F4], ⟨π,1G⟩G=⟨1H,1H⟩H=1.

F1F4F6given
2.1

Writing the honest character π in the orthonormal basis of irreducible characters as π=∑θmθθ with multiplicities mθ=⟨π,θ⟩∈Z≥0 by [F5], step 1.3 gives m1G=1; evaluating at 1∈G gives fk=π(1)=∑θmθθ(1), so ∑θ≠1Gmθθ(1)=fk−1 and every constituent θ≠1G of π has degree θ(1)≤fk−1<fk, hence θ(1)=fj for a unique index j<k.

F5step 1.3
3.1

For every constituent θ≠1G of π, step 2.1 gives θ(1)=fj with j≤k−1, so the induction hypothesis of step 1.2 yields G(j)≤ker⁡θ, and since j≤k−1 the series is descending by [F2], so G(k−1)≤G(j)≤ker⁡θ. The trivial constituent satisfies G(k−1)≤G=ker⁡1G. By [A1] the kernel of π is the intersection of the kernels of its constituents, so G(k−1)≤ker⁡π.

A1F2step 1.2step 2.1
4.1

The kernel formula [F7] for the induced trivial representation gives ker⁡π=Core⁡G(H)≤H, so G(k−1)≤H by step 3.1.

F7step 3.1
5.1

Therefore G(k)=[G(k−1),G(k−1)]≤[H,H]=H′ by [F2], and H′≤ker⁡λ because λ is a homomorphism into the abelian group C×, by [F3].

F2F3step 4.1
6.1

Each term of the derived series is characteristic, hence normal, in G by [F2] and [F3]; so gG(k)g−1=G(k)≤g(ker⁡λ)g−1 for every g∈G by step 5.1. Hence G(k)≤⋂g∈Gg(ker⁡λ)g−1=ker⁡χ by the kernel formula [F7] applied to χ=Ind⁡HGλ, which completes the induction step.

F3F7step 5.1
7.1

By step 1.1 and step 6.1 the assertion G(k)≤ker⁡χ holds for every k∈{1,…,r} and every irreducible χ with χ(1)=fk. Taking k=r and using that the series is descending [F2], G(r)≤ker⁡χ for every irreducible character χ of G, so G(r)≤⋂χ∈Irr⁡(G)ker⁡χ=1 by [F8]. Thus G(r)=1, G is solvable with dl(G)≤r=∣cd(G)∣. ∎

F2F8step 1.1step 6.1discharge-induction: step 1.2

Depends on

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