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 let the dihedral group of order in the notation of with inversion action has order and the dihedral relations. Then every irreducible complex character of is monomial, so is an -group, and the monomial inductions can be written down. With :
- each irreducible character of either is a linear character of whose restriction to is an -fixed linear character of — these are exactly the linear characters, each of them an extension of its restriction — or is for a linear character of the cyclic subgroup that is not fixed by , and then it has degree ;
- the second kind are exactly the irreducible characters of degree , one for each two-element orbit ;
- the list gives an inducing subgroup for every irreducible character: itself for a linear character and for a degree-two character. Thus is an -group; the displayed inducing subgroups need not be unique. The group is also supersolvable: a prime-factor subgroup series of the cyclic group has every term normal in , and adjoining 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 , the group with and inversion action , the number , and an irreducible complex character .
, , , for all , and every element of has a unique form with , ; at the degenerate values and are abelian. ( with inversion action has order and the dihedral relations).
Every irreducible complex representation of a finite abelian group has degree , and is a splitting field for every finite group: it has characteristic 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).
Conjugation of characters is ; for the inertia group satisfies , and for one sets occurs in . (Inertia group and characters lying above a normal type).
Clifford correspondence: for , and , induction is a bijection , and the sets indexed by distinct -orbits in partition . (Clifford correspondence).
Clifford restriction formula: for with there is a positive integer with . In particular forces . (Clifford restriction formula).
For with finite, . (For with finite, ).
For a finite-dimensional -representation one has (The dimension of an induced finite-dimensional representation is ), and for the covariance condition determines by , so that evaluation at is a -isomorphism , (The induced -linear -module as -covariant functions on ).
A character of is monomial if for some and linear character , and is an -group if every irreducible complex character of is monomial. (Monomial representations, monomial characters, and M-groups).
equals for every representation affording . (The kernel of a complex character agrees with the kernel of any representation affording it).
If and a representation of has , then factors through , and is irreducible over if and only if it is irreducible over . (A representation with kernel containing a normal subgroup factors through the quotient, and irreducibility is unchanged by inflation).
The -th roots of unity in are exactly for , and these are distinct numbers. (The -th roots of a complex number and the distinct roots of unity for every ).
For and integers the congruence is solvable exactly when , and then it has exactly solution classes modulo . (For , is solvable exactly when , and then has exactly solution classes modulo ).
Verification
By [F1] the group has order , the subgroup is cyclic of index and normal, , and for ; in particular has order modulo and .
is cyclic, hence abelian, so by [F2] every irreducible complex character of is one-dimensional, i.e. a group homomorphism ; moreover is a splitting field for every finite group.
By [F7] a linear character of is monomial: taking and the one-dimensional module affording it, evaluation at is an isomorphism , so has the monomial form of [F8]; conversely, if with linear then , so a monomial character of is linear exactly when it is induced from itself.
The homomorphisms , , defined by , are well defined because , and ; for they are pairwise distinct, since for by [F11]. Conversely, if is any homomorphism then , so by [F11] there is with , whence for all and . Hence consists of exactly distinct linear characters by step 1.2, and exactly when .
The claim that is supersolvable also uses a genuine normal series with prime-order factors. Write with primes repeated according to multiplicity and let be the unique subgroup of the cyclic group of order , with and . Each is characteristic in and therefore normal in because by step 1.1; each has prime order , and has order two. Hence is a normal prime-factor series, including when , as required by Finite supersolvable groups are M-groups.
For each the conjugate is : by [F3] and the inversion action of step 1.1, for all , so the two homomorphisms of agree on the generator of . By step 2.1 the orbit of under the action of on is therefore , of size exactly when .
The restriction of to the normal subgroup is a nonzero finite-dimensional -module, so it has an irreducible -submodule, whose character is some by step 2.1; this occurs in , that is, in the notation of [F3].
Fix . By [F3] the inertia group contains and is contained in ; by [F6] applied to one has , so and or . By steps 1.1 and 3.1 the equality holds exactly when , i.e. exactly when , which by step 2.1 is exactly the condition ; equivalently . Hence the number of -fixed characters of is the number of solutions of , which by [F12] (with , ) is
Case . By [F4] applied to and , the irreducible characters of lying over are exactly the with . Every is linear by step 1.2, so occurs in itself, and lies over exactly when , by the distinctness in step 2.1. Hence with linear: is monomial by [F8], and by [F7] and step 1.1.
Case : then is -fixed. By [F5] with , for the positive integer , that is, for all ; and by step 4.1 the -fixedness says , hence and for every .
Put . Then is normal in : for and one has , because fixes , so . Moreover : for the formula of step 5.2 gives , so by [F9].
For example, when the subgroup is normal of index two in and differs from . Define its linear character by and . Conjugation by sends to , so and . Since is abelian, its only irreducible character lying over is itself; [F4] therefore makes an irreducible character of degree by [F7]. Thus the degree-two character of has an inducing subgroup other than .
In the quotient the images generate (they are the images of the generators of ), and they commute: because by step 5.2, likewise , and , so . A group generated by two commuting elements is abelian, so is a finite abelian group.
Let be a representation affording , so by [F9] and by step 6.1. By [F10] the representation factors through and stays irreducible over ; so for some . Since is finite abelian by step 7.1 and is a splitting field, [F2] gives , hence : in this case is a linear character of . By step 1.3 is monomial, and since and with of degree , its restriction is (a degree- character occurring in a degree- character), so extends .
The linear characters of are exactly the extensions of the -fixed characters of found in step 4.1. Indeed, if is -fixed, i.e. by step 4.1, then for the formula is well defined by the uniqueness of the normal form [F1], and it is multiplicative: by [F1] the product of and is , and of that product is , which equals because and ; so is a linear character with and , and . Conversely a linear character of restricts to an -fixed by step 2.1, since , and is determined by together with (as ), hence equals for one ; by step 8.1 every linear character arises in this way from an -fixed . Distinct pairs give distinct characters, because their restrictions to differ or their values at differ, so there are exactly linear characters in total.
Every is monomial: if it is by step 5.1, and if it is linear by step 8.1, hence monomial by step 1.3. Therefore is an -group by [F8].
The degree- irreducible characters are exactly the characters of step 5.1, that is, the for that is not -fixed. Each such has orbit of size two by step 3.1, distinct orbits give disjoint sets by [F4], and by step 4.1 every orbit of size two arises from a character that is not -fixed. Since by step 4.1 exactly of the characters of are -fixed and the remaining split into two-element orbits, there are exactly irreducible characters of degree , each induced from the cyclic index-two subgroup ; the remaining irreducible characters are the linear ones of step 9.1. This constructs an inducing subgroup for every irreducible character without asserting that the subgroup is unique.
The degenerate cases are covered by the same statements. For the group is by [F1], and , and step 9.1 returns the two linear characters of and no character of degree ; for one has by [F1], and , and step 9.1 returns all four linear characters of , again with no character of degree . Both agree with steps 9.2 and 10.1, since in these cases every irreducible character is linear and hence monomial.
The example is verified: for every each irreducible complex character of is either a linear character extending an -fixed linear character of the cyclic subgroup (the characters of step 9.1) or the monomial character of a linear character of that is not -fixed, of degree (the characters of step 10.1); in either case it is monomial, so is an -group, with and including the degenerate cases .
Depends on
- Monomial representations, monomial characters, and M-groups
- Finite supersolvable groups are M-groups
- Clifford correspondence
- $\operatorname{Dih}(C_n)=C_n\rtimes C_2$ with inversion action has order $2n$ and the dihedral relations
- Clifford restriction formula
- Inertia group and characters lying above a normal type
- Every irreducible representation of a finite abelian group over a splitting field is one-dimensional
- A cyclotomic field splits a finite group
- A representation with kernel containing a normal subgroup factors through the quotient, and irreducibility is unchanged by inflation
- The kernel of a complex character agrees with the kernel of any representation affording it
- For $K\le H\le G$ with $G$ finite, $[G:K]=[G:H][H:K]$
- The induced $R$-linear $G$-module $\operatorname{Ind}_H^G W$ as $H$-covariant functions on $G$
- The dimension of an induced finite-dimensional representation is $[G:H]\dim W$
- The $n$-th roots of a complex number and the $n$ distinct roots of unity for every $n\ge1$
- For $n\ge1$, $ax\equiv b\pmod n$ is solvable exactly when $\gcd(a,n)\mid b$, and then has exactly $\gcd(a,n)$ solution classes modulo $n$
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
- Tammo tom Dieck, Representation Theory — (4.2.4)–(4.2.7), printed pp. 55–57; §4.3, printed pp. 57–59 (standard reference, not scraped)
- Wen-Wei Li, Yanqi Lake Lectures on Algebra I — §12.5, printed pp. 146–148 (standard reference, not scraped)