Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

All finite dihedral groups are M-groups

Example

For n≥1 let Dn:=Dih⁡(Cn)=Cn⋊C2=A⋊⟨s⟩,A=⟨r⟩≅Cn,srs−1=r−1, the dihedral group of order 2n in the notation of Dih⁡(Cn)=Cn⋊C2 with inversion action has order 2n and the dihedral relations. Then every irreducible complex character of Dn is monomial, so Dn is an M-group, and the monomial inductions can be written down. With f:=gcd⁡(2,n):

  • each irreducible character of Dn either is a linear character of Dn whose restriction to A is an s-fixed linear character of A — these are exactly the 2f linear characters, each of them an extension of its restriction — or is Ind⁡ADnλ for a linear character λ of the cyclic subgroup A that is not fixed by s, and then it has degree 2;
  • the second kind are exactly the n−f2 irreducible characters of degree 2, one for each two-element orbit {λ,sλ};
  • the list gives an inducing subgroup for every irreducible character: Dn itself for a linear character and A for a degree-two character. Thus Dn is an M-group; the displayed inducing subgroups need not be unique. The group Dn is also supersolvable: a prime-factor subgroup series of the cyclic group A has every term normal in Dn, and adjoining Dn gives a final factor of order two. This makes the result a special case of Finite supersolvable groups are M-groups, while the computation exhibits the characters and inductions explicitly.

Facts & Assumptions

Given: An integer n≥1, the group G:=Dn=Dih⁡(Cn)=A⋊⟨s⟩ with A=⟨r⟩≅Cn and inversion action srs−1=r−1, the number ζ=exp⁡(2πi/n), and an irreducible complex character χ∈Irr⁡(G).

[F1]

∣G∣=2n, rn=s2=1, srs−1=r−1, srjs−1=r−j for all j, and every element of G has a unique form rjsm with 0≤j<n, m∈{0,1}; at the degenerate values Dih⁡(C1)≅C2 and Dih⁡(C2)≅C2×C2 are abelian. ( Dih⁡(Cn)=Cn⋊C2 with inversion action has order 2n and the dihedral relations).

[F2]

Every irreducible complex representation of a finite abelian group has degree 1, and C is a splitting field for every finite group: it has characteristic 0 and contains all roots of unity. (Every irreducible representation of a finite abelian group over a splitting field is one-dimensional, A cyclotomic field splits a finite group).

[F3]

Conjugation of characters is gθ(h)=θ(g−1hg); for N⊴G the inertia group IG(θ)={g∈G:gθ=θ} satisfies N≤IG(θ)≤G, and for N≤H≤G one sets Irr⁡(H∣θ)={ψ∈Irr⁡(H):θ occurs in Res⁡NHψ}. (Inertia group and characters lying above a normal type).

[F4]

Clifford correspondence: for N⊴G, θ∈Irr⁡(N) and I=IG(θ), induction is a bijection Irr⁡(I∣θ)→Irr⁡(G∣θ), and the sets Irr⁡(G∣θ) indexed by distinct G-orbits in Irr⁡(N) partition Irr⁡(G). (Clifford correspondence).

[F5]

Clifford restriction formula: for χ∈Irr⁡(G∣θ) with I=IG(θ) there is a positive integer e with Res⁡NGχ=e∑gI∈G/Igθ. In particular I=G forces Res⁡NGχ=e θ. (Clifford restriction formula).

[F6]

For K≤H≤G with G finite, [G:K]=[G:H][H:K]. (For K≤H≤G with G finite, [G:K]=[G:H][H:K]).

[F7]

For a finite-dimensional H-representation W one has dim⁡Ind⁡HGW=[G:H]dim⁡W (The dimension of an induced finite-dimensional representation is [G:H]dim⁡W), and for H=G the covariance condition f(gh)=h−1f(g) determines f by f(1), so that evaluation at 1 is a G-isomorphism Ind⁡GGL→ ∼ L, f↦f(1) (The induced R-linear G-module Ind⁡HGW as H-covariant functions on G).

[F8]

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

[F9]

ker⁡χ={g∈G:χ(g)=χ(1)} equals ker⁡ρ for every representation ρ affording χ. (The kernel of a complex character agrees with the kernel of any representation affording it).

[F10]

If N⊴G and a representation ρ of G has N⊆ker⁡ρ, then ρ factors through G/N, and V is irreducible over G if and only if it is irreducible over G/N. (A representation with kernel containing a normal subgroup factors through the quotient, and irreducibility is unchanged by inflation).

[F11]

The n-th roots of unity in C are exactly ζk for 0≤k<n, and these are n distinct numbers. (The n-th roots of a complex number and the n distinct roots of unity for every n≥1).

[F12]

For n≥1 and integers a,b the congruence ax≡b(modn) is solvable exactly when gcd⁡(a,n)∣b, and then it has exactly gcd⁡(a,n) solution classes modulo n. (For n≥1, ax≡b(modn) is solvable exactly when gcd⁡(a,n)∣b, and then has exactly gcd⁡(a,n) solution classes modulo n).

Verification

technique · direct
1.1

By [F1] the group G=A⋊⟨s⟩ has order 2n, the subgroup A=⟨r⟩≅Cn is cyclic of index [G:A]=2 and normal, s2=1, and sas−1=a−1 for a∈A; in particular s has order 2 modulo A and G/A≅C2.

F1given
1.2

A is cyclic, hence abelian, so by [F2] every irreducible complex character of A is one-dimensional, i.e. a group homomorphism A→C×; moreover C is a splitting field for every finite group.

F2given
1.3

By [F7] a linear character of G is monomial: taking H=G and the one-dimensional module L affording it, evaluation at 1 is an isomorphism Ind⁡GGL→L, so χ=Ind⁡GGχ has the monomial form of [F8]; conversely, if χ=Ind⁡HGλ with λ linear then χ(1)=[G:H]λ(1)=[G:H], so a monomial character of G is linear exactly when it is induced from G itself.

F7F8
2.1

The homomorphisms λk:A→C×, k∈Z, defined by λk(rj):=ζjk, are well defined because ζn=1, and λk(rj+l)=ζ(j+l)k=λk(rj)λk(rl); for 0≤k<n they are pairwise distinct, since ζk=λk(r)≠λk′(r)=ζk′ for k≠k′ by [F11]. Conversely, if λ:A→C× is any homomorphism then λ(r)n=λ(rn)=1, so by [F11] there is k with λ(r)=ζk, whence λ(rj)=λ(r)j=ζjk=λk(rj) for all j and λ=λk. Hence Irr⁡(A)={λk:0≤k<n} consists of exactly n distinct linear characters by step 1.2, and λk=λk′ exactly when k≡k′(modn).

F11step 1.1step 1.2
2.2

The claim that Dn is supersolvable also uses a genuine normal series with prime-order factors. Write n=p1⋯pt with primes repeated according to multiplicity and let Ai be the unique subgroup of the cyclic group A of order p1⋯pi, with A0=1 and At=A. Each Ai is characteristic in A and therefore normal in Dn because A⊴Dn by step 1.1; each Ai/Ai−1 has prime order pi, and Dn/A has order two. Hence 1=A0◃⋯◃At=A◃Dn is a normal prime-factor series, including n=1 when t=0, as required by Finite supersolvable groups are M-groups.

F1step 1.1
3.1

For each k the conjugate sλk is λ−k: by [F3] and the inversion action of step 1.1, (sλk)(rj)=λk(s−1rjs)=λk(r−j)=ζ−jk=λ−k(rj) for all j, so the two homomorphisms of A agree on the generator r of A. By step 2.1 the orbit of λk under the action of G on Irr⁡(A) is therefore {λk,λ−k}, of size 1 exactly when k≡−k(modn).

F3step 1.1step 2.1
3.2

The restriction of χ to the normal subgroup A is a nonzero finite-dimensional A-module, so it has an irreducible A-submodule, whose character is some λk∈Irr⁡(A) by step 2.1; this λk occurs in Res⁡AGχ, that is, χ∈Irr⁡(G∣λk) in the notation of [F3].

F3step 1.2step 2.1given
4.1

Fix k. By [F3] the inertia group I:=IG(λk) contains A and is contained in G; by [F6] applied to A≤I≤G one has 2=[G:A]=[G:I][I:A], so [I:A]∈{1,2} and I=A or I=G. By steps 1.1 and 3.1 the equality I=G holds exactly when s∈I, i.e. exactly when λk=λ−k, which by step 2.1 is exactly the condition n∣2k; equivalently λk(r)2=1. Hence the number of s-fixed characters of A is the number of solutions of 2k≡0(modn), which by [F12] (with a=2, b=0) is f=gcd⁡(2,n).

F3F6F12step 1.1step 2.1step 3.1
5.1

Case IG(λk)=A. By [F4] applied to N=A and θ=λk, the irreducible characters of G lying over λk are exactly the Ind⁡AGψ with ψ∈Irr⁡(A∣λk). Every ψ∈Irr⁡(A) is linear by step 1.2, so Res⁡AAψ=ψ occurs in itself, and ψ lies over λk exactly when ψ=λk, by the distinctness in step 2.1. Hence χ=Ind⁡AGλk with λk linear: χ is monomial by [F8], and χ(1)=[G:A]λk(1)=2 by [F7] and step 1.1.

F4F7F8step 1.1step 1.2step 2.1step 3.2step 4.1
5.2

Case IG(λk)=G: then λk is s-fixed. By [F5] with I=G, Res⁡AGχ=e λk for the positive integer e=χ(1)/[G:G]λk(1)=χ(1), that is, χ(a)=χ(1)λk(a) for all a∈A; and by step 4.1 the s-fixedness says λk(r)2=1, hence λk(r2)=1 and λk(a)2=1 for every a∈A.

F3F5step 3.1step 4.1
6.1

Put K:=ker⁡λk≤A. Then K is normal in G: for a∈K and g∈G one has λk(g−1ag)=λk(a)=1, because IG(λk)=G fixes λk, so g−1ag∈K. Moreover K≤ker⁡χ: for a∈K the formula of step 5.2 gives χ(a)=χ(1)λk(a)=χ(1), so a∈ker⁡χ by [F9].

F3F9step 4.1step 5.2
6.2

For example, when n=4 the subgroup H=⟨r2,s⟩≅C2×C2 is normal of index two in D4 and differs from A=⟨r⟩. Define its linear character ν by ν(r2)=−1 and ν(s)=1. Conjugation by r sends s to r2s, so rν(s)=ν(r−1sr)=ν(r2s)=−1≠ν(s) and ID4(ν)=H. Since H is abelian, its only irreducible character lying over ν is ν itself; [F4] therefore makes Ind⁡HD4ν an irreducible character of degree [D4:H]=2 by [F7]. Thus the degree-two character of D4 has an inducing subgroup other than A.

F4F7step 1.1step 5.1
7.1

In the quotient Gˉ:=G/K the images rˉ,sˉ generate Gˉ (they are the images of the generators r,s of G), and they commute: rˉ2=r2‾=1ˉ because r2∈K by step 5.2, likewise sˉ2=1ˉ, and sˉrˉsˉ−1=srs−1‾=r−1‾=rˉ−1=rˉ, so sˉrˉ=rˉsˉ. A group generated by two commuting elements is abelian, so Gˉ is a finite abelian group.

step 1.1step 5.2step 6.1
8.1

Let ρ be a representation affording χ, so ker⁡ρ=ker⁡χ by [F9] and K⊆ker⁡ρ by step 6.1. By [F10] the representation ρ factors through Gˉ=G/K and V stays irreducible over Gˉ; so χ(1)=dim⁡V=ψ(1) for some ψ∈Irr⁡(Gˉ). Since Gˉ is finite abelian by step 7.1 and C is a splitting field, [F2] gives ψ(1)=1, hence χ(1)=1: in this case χ is a linear character of G. By step 1.3 χ is monomial, and since χ(1)=1 and χ∈Irr⁡(G∣λk) with λk of degree 1, its restriction is Res⁡AGχ=λk (a degree-1 character occurring in a degree-1 character), so χ extends λk.

F2F9F10step 1.3step 2.1step 3.2step 5.2step 6.1step 7.1
9.1

The linear characters of G are exactly the 2f extensions of the f s-fixed characters of A found in step 4.1. Indeed, if λk is s-fixed, i.e. λk(r)2=1 by step 4.1, then for ε∈{1,−1} the formula χk,ε(rjsm):=λk(r)jεm(0≤j<n, m∈{0,1}) is well defined by the uniqueness of the normal form [F1], and it is multiplicative: by [F1] the product of rjsm and rj′sm′ is rj+(−1)mj′sm+m′, and χk,ε of that product is λk(r)j(λk(r)(−1)m)j′εm+m′, which equals λk(r)jεm⋅λk(r)j′εm′ because λk(r)−j′=λk(r)j′ and ε2=1; so χk,ε is a linear character with Res⁡AGχk,ε=λk and χk,ε(s)=ε, and χk,1≠χk,−1. Conversely a linear character χ of G restricts to an s-fixed λk by step 2.1, since λk(r)=χ(r)=χ(srs−1)=χ(r)−1, and χ is determined by λk together with χ(s)∈{1,−1} (as χ(s)2=χ(s2)=1), hence equals χk,ε for one ε; by step 8.1 every linear character arises in this way from an s-fixed λk. Distinct pairs (k,ε) give distinct characters, because their restrictions to A differ or their values at s differ, so there are exactly 2f linear characters in total.

F1step 1.1step 2.1step 4.1step 8.1
9.2

Every χ∈Irr⁡(G) is monomial: if IG(λk)=A it is Ind⁡AGλk by step 5.1, and if IG(λk)=G it is linear by step 8.1, hence monomial by step 1.3. Therefore Dn=Dih⁡(Cn) is an M-group by [F8].

F8step 1.3step 5.1step 8.1given
10.1

The degree-2 irreducible characters are exactly the characters of step 5.1, that is, the Ind⁡AGλk for λk that is not s-fixed. Each such λk has orbit {λk,λ−k} of size two by step 3.1, distinct orbits give disjoint sets Irr⁡(G∣λk) by [F4], and by step 4.1 every orbit of size two arises from a character that is not s-fixed. Since by step 4.1 exactly f of the n characters of A are s-fixed and the remaining n−f split into two-element orbits, there are exactly n−f2 irreducible characters of degree 2, each induced from the cyclic index-two subgroup A; the remaining irreducible characters are the 2f linear ones of step 9.1. This constructs an inducing subgroup for every irreducible character without asserting that the subgroup is unique.

F4step 3.1step 4.1step 5.1step 9.1
11.1

The degenerate cases are covered by the same statements. For n=1 the group is G≅C2 by [F1], f=gcd⁡(2,1)=1 and n−f2=0, and step 9.1 returns the two linear characters of C2 and no character of degree 2; for n=2 one has G≅C2×C2 by [F1], f=gcd⁡(2,2)=2 and n−f2=0, and step 9.1 returns all four linear characters of C2×C2, again with no character of degree 2. Both agree with steps 9.2 and 10.1, since in these cases every irreducible character is linear and hence monomial.

F1step 1.1step 4.1step 9.1step 9.2step 10.1
12.1

The example is verified: for every n≥1 each irreducible complex character of Dn=Dih⁡(Cn) is either a linear character extending an s-fixed linear character of the cyclic subgroup A=⟨r⟩ (the 2f characters of step 9.1) or the monomial character Ind⁡ADnλ of a linear character λ of A that is not s-fixed, of degree 2 (the n−f2 characters of step 10.1); in either case it is monomial, so Dn is an M-group, with f=gcd⁡(2,n) and including the degenerate cases n=1,2.

step 8.1step 9.1step 9.2step 10.1step 11.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

71 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