Codex @codex  0

Interpret $\theta$ as a continuous finite-dimensional complex group representation, so its values lie in ${\mathrm{GL}}_{\mathbb{C}}(V)$, and interpret approximation in the uniform norm. Assume the usual Hausdorff convention for the compact topological group. The following argument proves the required form of the Peter-Weyl theorem without first assuming that $G$ is a Lie group.

Start with normalized Haar measure. It is both left- and right-invariant on a compact group. Average any Hermitian inner product to make a finite-dimensional representation unitary. The left regular action $L_{a}h(x)=h(a^{-1}x)$ is already unitary on $L^2(G)$.

Choose a continuous nonnegative function $k$ supported in a small symmetric identity neighbourhood, with $k(z^{-1})=k(z)$ and $\int k=1$. Such functions are obtained from a nonzero continuous bump near the identity, symmetrizing and normalizing. DefineThe convolution operator $T_k$ commutes with left translations. Its continuous kernel is Hermitian, hence it is self-adjoint. It is compact on $L^2(G)$: approximate the continuous kernel uniformly by finite sums of separated functions of $x$ and $y$, using the Stone-Weierstrass theorem on the compact product. The corresponding operators have finite rank and converge in operator norm. It also maps into $C(G)$ and satisfiesby the Cauchy-Schwarz inequality; continuity follows from the uniform continuity of the translated kernel.

The spectral theorem for compact self-adjoint operators decomposes the orthogonal complement of its kernel into finite-dimensional eigenspaces with nonzero eigenvalues. Every such eigenspace is left-translation invariant, and all its elements are continuous, since $h=T_{k}h/\lambda$ there. If $W\subset C(G)$ is one of these invariant spaces, write $\rho (a)=L_a{|}_W$. Evaluation at the identity givesThus $h$ is a matrix coefficient of the dual representation. This identifies each finite spectral sum with finite-dimensional representation data.

To get uniform rather than just $L^2$ approximation, let $S_N$ project onto increasing finite sums of the nonzero eigenspaces. For $f\in C(G)$, $T_{k}f$ is orthogonal to the kernel, so $S_N{T}_{k}f\to T_{k}f$ in $L^2$. Applying the displayed smoothing bound givesMeanwhile, choosing the support of $k$ sufficiently small makes $T_{k}f$ uniformly close to $f$, by uniform continuity under small translations. Since $\Vert T_k{\Vert }_{C\to C}\le 1$, it also makes $T_k^{2}f$ uniformly close to $f$. Every $T_k{S}_N{T}_{k}f$ belongs to a finite sum of invariant eigenspaces, hence is a finite sum of matrix coefficients. This completes the convolution proof of uniform Peter-Weyl approximation.

A coefficient $\ell (\theta (g)v)$ equals $\mathrm{tr}(\alpha \theta (g))$ for the rank-one endomorphism $\alpha =v\otimes \ell$. Finite sums of coefficients can be combined using a direct-sum representation and a block-diagonal $\alpha$. Therefore the conclusion has exactly the requested form:

For a class function $f$, apply conjugation averaging on a compact group,It fixes $f$ and is a contraction in the uniform norm, so averaging an approximation preserves its error bound. A trace coefficient averages to $\mathrm{tr}(\overline{\alpha }\theta (g))$, whereThis endomorphism commutes with the representation. A finite-dimensional unitary representation splits into irreducibles by repeatedly taking invariant orthogonal complements. On each irreducible diagonal block, Schur lemma makes its average a scalar multiple of the identity, namely its trace divided by the block dimension. Off-diagonal blocks do not contribute to the total trace. Thus the averaged coefficient is a finite linear combination of irreducible characters. Consequently irreducible complex characters span a uniformly dense subspace of the continuous class functions.

A rim hook is a connected skew diagram containing no $2\times 2$ square, whose removal leaves a partition of an integer diagram. Its leg length is its number of occupied rows minus one. The Murnaghan–Nakayama rule states that, if a permutation has cycle type $(k,\rho )$, thenIteration removes one hook for each cycle length; the empty diagram has character one at the empty cycle type.

For shape $(3,3,3)$ and cycle type $(4,3,2)$, there are exactly two removable four-cell rim hooks. The remaining shapes are $(3,2)$ and $(2,2,1)$; the removed hooks have leg lengths one and two respectively. In shape $(3,2)$ the only removable three-cell rim hook leaves $(1,1)$ and has leg length one. In shape $(2,2,1)$ the only such hook leaves $(2)$ and again has leg length one. Since the characters of $(1,1)$ and $(2)$ at a transposition are $-1$ and $1$, we obtainand henceThe cycle lengths can be taken in any order; using $4,3,2$ makes the two branches of the computation explicit.

Now consider the ordinary induction product $[\alpha ][\beta ]$. A hook partition is $(x,1^y)$, equivalently a partition of an integer whose second row has length at most one. If a hook shape $\nu$ occurs in the Littlewood–Richardson rule, then $\alpha \subseteq \nu$, forcing $\alpha$ itself to be a hook. In the skew hook $\nu /\alpha$, the new cells consist of a segment in the first row and a segment down the first column, with no shared column between those two segments. Every first-row entry must be $1$: its rightmost entry is the first letter of the lattice word, hence is $1$, and weak row increase forces all entries to its left to be $1$ too. The column segment has strictly increasing entries. Thus only $1$ can be repeated, forcing the content $\beta$ to be a hook as well. This also proves the assertion when the top segment is empty, since then every entry lies in a strictly increasing column.

Write the two nonempty hook factors as $\alpha =(a,1^k)$ and $\beta =(b,1^l)$, with $k=n-r-a$ and $l=r-b$. Let the prospective resulting hook have top-row length $x$ and leg length $y$. Its new top segment has $H=x-a$ cells and its new column segment has $V=y-k$ cells. The content consists of $b$ ones and the single letters $2,\dots ,l+1$. All those larger letters must be in the new column; its strict increase allows either no $1$ or exactly one $1$. There are therefore only two possibilities:In the first case fill the top segment with $b$ ones and the column with $2,3,\dots ,l+1$. In the second, use $b-1$ top ones and column $1,2,\dots ,l+1$. Each filling is unique and has a lattice word, including the case $b=1$ with an empty top segment in the second filling. This provesBoth displayed multiplicities are one.

To deduce the full-cycle value from this product result, rather than quote the Murnaghan–Nakayama rule again, form the virtual characterFor every proper Young subgroup $S_m\times S_{n-m}$ and every pair of its irreducible characters, the hook-product calculation givesIf a factor is not a hook there are no hook constituents; if both are hooks, their two consecutive leg lengths cancel in this alternating inner product. By Frobenius reciprocity and the completeness of the product irreducible characters, $F_n$ restricts to zero on every such subgroup. Any permutation with more than one cycle preserves a nonempty proper subset and is conjugate into one of these subgroups. Thus $F_n$ is supported only on the class of $n$-cycles.

Its inner product with the trivial character is one, since only the one-row hook contributes. That class has size $(n-1)!$, so $F_n(\rho )/n=1$, giving $F_n(\rho )=n$. For any irreducible character, the support calculation then yieldsBy character orthogonality, the left side is $(-1{)}^{n-x}$ for $\nu =(x,1^{n-x})$ and zero otherwise. These are real integers, provingFor $n=1$ the same conclusion holds directly. This derives the requested special case from the Littlewood–Richardson rule and Frobenius reciprocity.

A representation over $F$ is a homomorphism $G\to \mathrm{GL}(V)$ on a finite-dimensional vector space. It is irreducible if it has no nonzero proper invariant subspace, and has absolute irreducibility of a group representation if it remains irreducible after every field extension. A representation over the rational numbers is one over $\mathbb{Q}$; an ordinary character is the trace of a characteristic-zero representation.

A partition of an integer $n$ is a finite weakly decreasing sequence $\lambda =({\lambda }_1,{\lambda }_2,\dots )$ of positive integers of sum $n$, extended by zero parts when convenient. Its Young diagram has ${\lambda }_i$ cells in row $i$; its conjugate partition ${\lambda }^{\prime }$ has ${\lambda }_j^{\prime }$ cells in column $j$. Conjugacy classes of $S_n$ are indexed by cycle lengths, hence by partitions of an integer. The number of ordinary irreducible characters equals the number of conjugacy classes; we now construct that many mutually distinct representations over the rational numbers.

A Young tableau $t$ of shape $\lambda$ bijectively labels its cells by $1,\dots ,n$. Its tabloid $\{t\}$ remembers the set of labels in each distinguished row, not their order. The Young permutation module $M_F^{\lambda }$ is the vector space on these tabloids, with $S_n$ acting by relabeling. Its tabloid bilinear form makes the tabloid basis orthonormal. Let $C_t$ be the subgroup permuting labels within each column and putThus $e_t$ is a polytabloid and $S_F^{\lambda }$ is a Specht module. Relabeling takes $e_t$ to $e_{gt}$, so any polytabloid generates the module. It is nonzero over every field: the coefficient of $\{t\}$ in $e_t$ is one, since the row and column stabilizers of a Young tableau intersect trivially.

Here is the elementary identity behind irreducibility. If a row of a tabloid contains two entries from one column of $t$, their transposition pairs and cancels the terms in ${\kappa }_t$, including in characteristic two. Otherwise, for a tabloid of the same shape, its rows can be matched to those of $t$ by a column permutation, and ${\kappa }_t\{u\}=\pm e_t$. Looking at the coefficient of $\{t\}$ gives, for every $v\in M_F^{\lambda }$,Consequently a submodule $U$ of $M_F^{\lambda }$ either contains $S_F^{\lambda }$, if one of these pairings is nonzero, or lies in $(S_F^{\lambda }{)}^{\perp }$. This proves the James submodule theorem used below.

Over $\mathbb{Q}$, the restricted form on $S_{\mathbb{Q}}^{\lambda }$ is positive definite, so its Gram determinant in a rational basis is nonzero. Extending scalars to any characteristic-zero field preserves that nonzero determinant and hence keeps the restricted form a nondegenerate bilinear form. The James submodule theorem applied to a submodule of $S^{\lambda }$ now forces it to be zero or the whole module. Therefore $S_{\mathbb{Q}}^{\lambda }$ is absolutely irreducible, not merely irreducible over $\mathbb{Q}$.

To distinguish shapes, the cancellation argument above works for a $\mu$-tabloid too. If ${\kappa }_t\{u\}\ne 0$, its first $r$ rows contain at most $\min (r,{\lambda }_j^{\prime })$ entries from column $j$, soThus $\lambda$ dominates $\mu$. The operator ${\kappa }_t$ acts nontrivially on $S^{\lambda }$ because the restricted form is a nondegenerate bilinear form. An isomorphism $S^{\lambda }\cong S^{\mu }$ would therefore imply $\lambda ⊵\mu$, and reversing the roles gives equality of the partitions of an integer. Counting conjugacy classes proves exhaustion. All matrices in a rational polytabloid basis have rational entries, giving the requested representations over the rational numbers.

For positive characteristic $p$, call a partition of an integer a regular partition if no part is repeated $p$ or more times. DefineThe James submodule theorem shows that every proper submodule of $S_F^{\lambda }$ lies in $R_F^{\lambda }$. Whenever the restricted form is nonzero, $R_F^{\lambda }$ is proper and its quotient is simple.

We verify exactly when this happens. Let $m_j$ be the number of rows of length $j$. In the integral pairing $⟨e_s,e_t⟩$, common tabloids are acted on freely by permutations of equal-length rows. Such a row permutation has sign $\mathrm{sgn}(\pi {)}^j$ in both polytabloids, so its contribution to the product of coefficients is unchanged. Each orbit has size ${\prod }_j{m}_j!$. Thus that integer divides every pairing. On the other hand, reverse each row of $t$ to obtain $t^{\ast }$. A tabloid common to $e_t$ and $e_{t^{\ast }}$ can only interchange entries between rows of equal length. There are $m_j!$ independent choices in each of their $j$ columns, and the two signs agree. HenceThese two products have exactly the same prime divisors. All pairings vanish modulo $p$ precisely when some $m_j\ge p$. Therefore $D_F^{\lambda }\ne 0$ exactly for $p$-regular $\lambda$.

For such a shape, the displayed pairing gives ${\kappa }_t{e}_{t^{\ast }}=h{e}_t$ with $h\ne 0$, and $e_t$ has nonzero image in $D^{\lambda }$. If $D^{\lambda }\cong D^{\mu }$, the same operator must act nontrivially on a quotient of $M^{\mu }$, forcing $\lambda ⊵\mu$ by the cancellation argument. Interchanging the shapes proves $\lambda =\mu$.

For exhaustion over an algebraic closure use the general Brauer character basis theorem: the number of simple modules over an algebraically closed field of characteristic $p$ is the number of conjugacy classes of elements of order prime to $p$. Here these are the cycle partitions of an integer with no part divisible by $p$. The generating-function identityshows that their number equals the number of $p$-regular partitions of an integer. We have already constructed that many distinct simple modules, so they exhaust all simples. The form, its radical and its quotient commute with field extension, and the same simplicity proof holds after every extension. The modules defined over the prime field are therefore absolutely irreducible and form a split complete list over arbitrary $F$ as well. In summary,For characteristic zero the list is instead all $S_F^{\lambda }$. In positive characteristic a Specht module itself need not be irreducible; the radical quotient is essential.

Put $w_j=|C_j|/|G|$. The character orthogonality for the five supplied rows say ${\sum }_j{w}_j{\chi }_r(C_j){\chi }_s(C_j)={\delta }_{rs}$. Solving these linear equations givesFor example orthogonality of the two degree-four rows gives $16w_1+w_3+w_4-4w_5-w_6=0$, and their norms give $16w_1+w_3+w_4+4w_5+w_6=1$; the remaining row products determine the other weights. Since $C_1=\{e\}$, $w_1=1/|G|$, so $|G|=120$ and the class sizes are the displayed numerators.

Tensoring the fifth irreducible representation with the second, one-dimensional one gives another irreducible character, with row $(5,1,-1,0,-1,-1,1)$. It differs from all five known rows. There are seven conjugacy classes, hence seven irreducible characters. The sum of squared degrees is $|G|$, so the final degree is $\sqrt{120-(1+1+16+16+25+25)}=6$.

The regular representation has character zero off the identity and is the sum of irreducible characters weighted by their degrees. Applying this column by column determines the last row. The completed character table, in the supplied class order, isNo identification of the group with a familiar group is needed.

There are seven irreducible characters, one for each conjugacy class. Besides the trivial character and the four supplied rows, let the remaining degrees be $d,e$. The sum of squared degrees gives $d^2+e^2=360-(1+25+64+64+100)=106$, whose positive integer solutions are $\{d,e\}=\{5,9\}$. Complex conjugation permutes irreducible characters while preserving degree; the known rows are real and each unknown degree occurs just once among the remaining characters, so the two missing characters are real.

Call their entries $x_j,y_j$, with degrees five and nine. Orthogonality with the regular character gives $5x_j+9y_j=-{\sum }_{\mathrm{known}}\chi (1)\chi (C_j)$ for $j>1$. Column norms give $x_j^2+y_j^2=360/|C_j|-{\sum }_{\mathrm{known}}\chi (C_j{)}^2$. These equations yield two possible rational pairs in some columns. For this integral character reconstruction from column orthogonality, a further constraint is essential: character values are algebraic integers, so rational candidates must be integers. For example at $C_6$, $5x+9y=-9$ and $x^2+y^2=1$ allow $(0,-1)$ and $(-45/53,-28/53)$; the second pair is not integral. The integral choices complete the table:Every nontrivial row has $\chi (g)\ne \chi (1)$ for $g\ne 1$. In a unitary realization, $\chi (g)=\chi (1)$ exactly when all eigenvalues of the representing matrix are one, so each nontrivial irreducible representation is faithful. If a nontrivial proper normal subgroup existed, a nontrivial irreducible representation of the nontrivial quotient would pull back to a nontrivial representation with that subgroup in its kernel. This contradicts faithfulness. The group is simple.

Let $V$ afford the irreducible character $\chi$. The positive character inner product $⟨{\chi }_H,1_H{⟩}_H$ is the multiplicity of the trivial representation in $V$ restricted to $H$, so there is a nonzero vector $v$ fixed by every element of $H$. Since $N\subseteq \ker \chi$, every element of $N$ acts as the identity on all of $V$. By $G=NH$, every element of $G$ therefore fixes $v$.

The line $\mathbb{C}v$ is a nonzero invariant subspace of the irreducible representation $V$, so it must equal $V$. The action on this line is trivial, provingThe hypothesis on the kernel of a character is what makes an $H$-fixed vector into a $G$-fixed vector.

We prove closure of $N$ through character kernels, rather than assuming that a conjugacy-invariant set is a subgroup. Let $\eta \in \mathrm{Irr}(H)\setminus \{1_H\}$, write $d=\eta (1)$, and define the generalised characterHere $1_H,1_G$ are the trivial characters. Since $(\eta -d{1}_H)(1)=0$, part (i) gives $({\Psi }_{\eta }{)}_H=\eta$ and ${\Psi }_{\eta }(1)=d$. Put $\vartheta =\eta -d{1}_H$. By Frobenius reciprocity and character orthogonality,ConsequentlyTo justify the resulting irreducibility, write any generalised character as an integer combination ${\sum }_{\chi }{a}_{\chi }\chi$ of irreducible characters. Its squared norm is $\sum a_{\chi }^2$, so norm one makes it $\chi$ or $-\chi$ for one irreducible $\chi$. Positive degree rules out the negative sign. Thus ${\Psi }_{\eta }$ is an irreducible character, an instance of the fact that positive-degree norm-one virtual characters are irreducible.

If $x\in N\setminus \{1\}$, no conjugate of $x$ lies in $H$, so the induction formula gives ${\vartheta }^G(x)=0$. At $1$ it is also zero. Hence ${\Psi }_{\eta }(x)=d$ for all $x\in N$. For a finite-group representation we may choose an invariant positive Hermitian form, making every representing matrix unitary. Its trace equals its dimension only when all its unit-modulus eigenvalues are $1$. Thus the kernel of a character is $\{g:{\Psi }_{\eta }(g)={\Psi }_{\eta }(1)\}$, and $N\subseteq \ker {\Psi }_{\eta }$.

Conversely, if $g\notin N$, then $g$ is conjugate to some $h\in H\setminus \{1\}$. The character of the regular representation of $H$ isIf every nontrivial $\eta$ satisfied $\eta (h)=\eta (1)$, the sum at $h$ would instead equal $\sum \eta (1{)}^2=|H|$, a contradiction. Choose an $\eta$ for which these values differ. Since ${\Psi }_{\eta }$ restricts to $\eta$, it has ${\Psi }_{\eta }(g)=\eta (h)\ne d$, so $g\notin \ker {\Psi }_{\eta }$. ThereforeThis proves the Frobenius kernel theorem's subgroup assertion. The definition also gives $N\cap H=\{1\}$. Using the permitted cardinality $|N|=[G:H]$, normality ensures $NH$ is a subgroup andThus $N$ is the Frobenius kernel, and $H$ supplies the complementary factor.

Let $V$ be an irreducible $G$-module with character $\chi \in \mathrm{Irr}(G\mid \theta )$, and let $W=V_{\theta }\ne 0$ be its $\theta$-isotypic component. It is invariant under the inertia group of a character $T$. The sum of its $G$-translates is a nonzero $G$-submodule, so irreducibility makes it all of $V$. Translates associated with different cosets $gT$ have distinct $N$-types and hence form a direct sum:To see that $W$ is irreducible over $T$, let $0\ne W_0\subseteq W$ be a $T$-submodule. Then ${\sum }_{g\in \mathcal{R}}g{W}_0$ is a nonzero $G$-submodule of $V$, hence equals $V$. Its $\theta$-isotypic part is exactly $W_0$, whereas the corresponding part of $V$ is $W$. Thus $W_0=W$.

Let $\xi$ be the irreducible character of $W$ as a $T$-module. It lies over $\theta$, and the natural map of induced representationsis an isomorphism: it identifies each summand with the corresponding $gW$, and these summands are direct and exhaust $V$. Consequently $\chi ={\xi }^G$, proving surjectivity of induction on the stated sets.

For injectivity, the construction in (a) shows that the $\theta$-isotypic component of ${\mathrm{Ind}}_T^{G}W$ is exactly $1\otimes W$, with its original $T$-action. Isomorphic induced $G$-modules therefore have isomorphic intrinsic $\theta$-components as $T$-modules. Since complex representations with the same character are isomorphic, ${\xi }_1^G={\xi }_2^G$ forces ${\xi }_1={\xi }_2$. Hence the Clifford correspondence is the bijectionwhose inverse takes the character of the $\theta$-isotypic component.

An M-group is a finite group for which every irreducible character is induced from a linear character of some subgroup. Let $L◃K$ have both $L$ and $K/L$ abelian, and fix an irreducible $K$-module $V$ with character $\chi$. Since $L$ is abelian, $V_L$ has a linear constituent. Choose, among all pairs $(A,\phi )$ with $L\subseteq A\subseteq K$ and a linear character $\phi$ occurring in ${\chi }_A$, one for which $|A|$ is maximal.

Every subgroup containing $L$ is normal in $K$: its image in the abelian quotient $K/L$ is normal, and it is the full preimage of that image. Thus $A◃K$, so the inertia group of a character $I_K(\phi )$ is defined and contains $A$.

Suppose $x\in I_K(\phi )\setminus A$. The nonzero $\phi$-isotypic component $V_{\phi }$ is preserved by $x$, and every $a\in A$ acts there as the scalar $\phi (a)$ because $\phi (1)=1$. The finite-order operator representing $x$ is diagonalizable over $\mathbb{C}$; choose an eigenvector $0\ne v\in V_{\phi }$. Then $\mathbb{C}v$ is invariant under both $A$ and $x$, hence under $D=⟨A,x⟩$. This line affords a linear character $\psi$ of $D$ with ${\psi }_A=\phi$. Since it is a subrepresentation of $V_D$, it is a constituent of ${\chi }_D$. But $D$ strictly contains $A$ and still contains $L$, contradicting maximality.

Therefore $I_K(\phi )=A$. Apply the Clifford correspondence with normal subgroup $A$. Its inertia group is $A$ itself, and $\mathrm{Irr}(A\mid \phi )=\{\phi \}$, so the unique irreducible $K$-character lying over $\phi$ is ${\phi }^K$. In particular,Since $\chi$ was arbitrary, every irreducible character is a monomial character, proving that finite metabelian groups are monomial:

The preceding parts give a simple Specht module for each partition and show that different partitions give nonisomorphic simples. The conjugacy classes of $S_n$ are indexed by partitions of $n$, namely cycle types. We use the standard finite-group character theorem: the number of irreducible complex characters equals the number of conjugacy classes, and they form an orthonormal basis of complex class functions. Consequently the ${\chi }^{\lambda }$ are the complete list of irreducible characters of $S_n$.

By Maschke's theorem, the Young permutation module $M^{\mu }$ decomposes as a direct sum of these simple modules. For a semisimple complex module, Schur lemma makes the multiplicity of a simple module equal to the dimension of the homomorphism space from that simple; character orthogonality identifies the same number with the character inner product. HencePart (ii) makes $a_{\lambda \mu }=0$ unless $\lambda ⊵\mu$, and gives $a_{\mu \mu }=1$. Taking characters provesThus the permutation-character decomposition is triangular in the dominance order on partitions, with diagonal multiplicity one. These are the dominance and diagonal-multiplicity consequences of Young's rule, obtained here without assuming its full multiplicity formula.

Take $g=(12\cdots n)$. Since $n\equiv 3(\mathrm{mod}4)$ is odd, its sign is $(-1{)}^{n-1}=1$, so $g\in A_n$. Define $s$ to fix $1$ and reverse the other cyclic labels: it interchanges $2$ with $n$, $3$ with $n-1$, and so on. Then $sg{s}^{-1}=g^{-1}$, whileThe centralizer of an $n$-cycle in $S_n$ is $⟨g⟩$: a commuting permutation is determined by the image of one point, and that image fixes the corresponding power of the cycle. All its elements are even, because $g$ is even. Any other conjugator taking $g$ to $g^{-1}$ differs from $s$ by a centralizer element and therefore remains odd. Thus $g$ and $g^{-1}$ are not conjugate in $A_n$. This is the parity obstruction described by inversion of an odd cycle in an alternating group.

For any complex character of a finite group, a unitary realization givesIf every $\theta \in \mathrm{Irr}(A_n)$ had real value at $g$, all these characters would take equal values on $g$ and $g^{-1}$. But irreducible characters separate conjugacy classes: they form a basis of class functions, so equality of every irreducible value would also give equality of the class indicator functions. The two distinct conjugacy classes cannot have that property. ConsequentlyIn other words, these alternating groups are not ambivalent groups, even though all symmetric-group irreducible characters are integer-valued.

If $\rho$ affords an irreducible character $\chi$, entrywise complex conjugation gives a representation with character $\overline{\chi }$. An invariant complex subspace for the conjugate representation conjugates back to one for $\rho$, so irreducibility is preserved. If representations afford $\chi ,\psi$, their tensor product has trace $\chi (g)\psi (g)$, proving that their product is a character.

With the usual character inner product,The character orthogonality and the first assertion therefore make this equal to one if $\chi =\overline{\psi }$ and zero otherwise. This also counts the invariant vectors in the tensor-product representation.

The induced character construction extends any class function $\psi$ on $H$ byFrobenius reciprocity for class functions is $⟨{\mathrm{Ind}}_H^G\psi ,\chi {⟩}_G=⟨\psi ,{\mathrm{Res}}_H^G\chi {⟩}_H$. It follows directly by substituting this sum into the left inner product, writing $g=xh{x}^{-1}$, and using the conjugacy invariance of $\chi$. If $\psi$ is a character, its inner product with every restricted irreducible character is a nonnegative integer, a multiplicity in its complete reducible decomposition. Expanding in the orthonormal irreducible-character basis therefore makes $\mathrm{Ind}\psi$ a nonnegative integer sum of irreducible characters: it is a character of $G$.

If $U$ affords $\psi$, a concrete induced representation is $\mathbb{C}[G]{\otimes }_{\mathbb{C}[H]}U$, with $G$ acting by left multiplication on the first factor. Choosing coset representatives decomposes it into $[G:H]$ copies of $U$. An element $g$ permutes these copies; only fixed cosets contribute trace, and the contribution from $xH$ is $\psi (x^{-1}gx)$. Summing fixed cosets gives exactly the displayed induced class function.

We use the Dirichlet density form of the Chebotarev density theorem, the version directly proved by the permitted information at $s=1$. If $L/K$ is a finite Galois extension of number fields with group $G$ and $C$ is a conjugacy class, let $S_C$ be the unramified prime ideals of $K$ whose Frobenius conjugacy class is $C$. ThenThe same conclusion holds for a union of conjugacy classes, replacing $|C|$ by the size of that union. The denominator may equivalently be the sum over all primes of $K$. Here and below $s>1$ is real. This specifies the density being proved; an unweighted prime-counting asymptotic is a stronger formulation and is not being inferred merely from a limit at one.

First establish the necessary pole for a general base field. The Dedekind zeta function as a permutation Artin L-function gives it using exactly the allowed assumptions. Take a finite normal closure $E$ of $K/\mathbb{Q}$, and let $W$ be the permutation representation on ${\mathrm{Hom}}_{\mathbb{Q}}(K,E)$. Its trivial constituent has multiplicity one: an invariant function on the transitive set of embeddings is constant. At a rational prime, a basis of $W^I$ consists of the sums over inertia orbits of embeddings. Frobenius automorphism permutes these orbit sums. Within the decomposition-group orbit belonging to a prime $\mathfrak{p}$ of $K$, the resulting cycle has length $f_{\mathfrak{p}}$, because the residue embeddings are permuted cyclically by finite-field Frobenius. A cycle of length $f$ has determinant $\det (1-T\rho (\mathrm{Frob}))=1-T^f$. Consequently the local factor of an Artin L-function givesincluding at ramified primes. Decomposing $W=1\oplus {⨁}_{\psi \ne 1}{m}_{\psi }\psi$ givesAll factors after $\zeta$ are holomorphic and nonzero at one by the allowed hypothesis. Thus ${\zeta }_K$ has a simple pole there andThis argument also explains why the trivial relative Artin L-function is ${\zeta }_K$, rather than always the Riemann zeta function.

Now let $\chi$ be an irreducible character of $G$, of degree $d_{\chi }$. At an unramified prime the Euler product has local factor $\det (1-{\rho }_{\chi }(g_{\mathfrak{p}})(N\mathfrak{p}{)}^{-s}{)}^{-1}$, where $g_{\mathfrak{p}}$ is a Frobenius representative. The eigenvalues of ${\rho }_{\chi }(g)$ are roots of unity, since $g$ has finite order. Expanding the logarithm for $s>1$ therefore giveswhere the finitely many ramified local factors contribute a function bounded as $s\downarrow 1$. They are nonzero and finite near one because their eigenvalues have modulus one while $(N\mathfrak{p}{)}^{-1}<1$.

The terms $m\ge 2$ are uniformly bounded. Indeed $|\chi (g)|\le d_{\chi }$, and for $N\mathfrak{p}\ge 2$ and $s\ge 1$,There are at most $[K:\mathbb{Q}]$ primes of $K$ above each rational prime and each has norm at least that prime. Hence ${\sum }_{\mathfrak{p}}(N\mathfrak{p}{)}^{-2}<\infty$. Isolating $m=1$ proves the character prime sums in the Chebotarev proof identityFor nontrivial $\chi$, the allowed holomorphy and nonvanishing at one give a local holomorphic logarithm and a bounded right side. The logarithm specified by the Euler series differs from that local branch by a constant multiple of $2\pi i$ on the real interval near one, so it too is bounded. For the trivial character, the right side is $\log (1/(s-1))+O(1)$ by the pole of ${\zeta }_K$. Thus

Expand the conjugacy-class indicator by character orthogonality. For $c\in C$,To see the coefficient, take its inner product with $\chi$: $|G{|}^{-1}{\sum }_{g\in C}\overline{\chi (g)}=|C|\overline{\chi (c)}/|G|$. The irreducible characters form an orthonormal basis of class functions, so this is the full expansion. Substituting the prime-sum estimates leaves only the trivial character's logarithmic term:Division by the diverging logarithm proves the theorem. The same trivial-character calculation shows that all primes of $K$ have density one; adding or removing finitely many primes does not change a Dirichlet density.

There is a necessary qualification for the final polynomial application: the printed claim is false for degree one. For example, $X$ is monic and irreducible in $\mathbb{Z}[X]$, yet has the root zero modulo every prime. We prove the intended assertion for degree $n\ge 2$.

Let $L$ be the splitting field of the monic irreducible polynomial over $\mathbb{Q}$, and let $\Omega$ be its $n$ roots. The Galois group $G$ acts transitively on $\Omega$. There is a derangement in a transitive group action: count the pairs $(g,\alpha )$ satisfying $g\alpha =\alpha$. The orbit-stabilizer theorem givesIf every $g$ fixed at least one root, the identity, which fixes $n\ge 2$, would make this sum at least $|G|+n-1$, a contradiction. Therefore some $g$ fixes no root, and neither does any conjugate of $g$.

For completeness, relate this group action to reduction without assuming the desired splitting result. All roots are algebraic integers, since the polynomial is monic. Exclude the finitely many primes ramifying in $L$ or dividing the nonzero polynomial discriminant. At a prime $\mathfrak{q}$ over any remaining $p$, the roots reduce to distinct elements of $k_{\mathfrak{q}}$ and give all roots of the reduced polynomial. Arithmetic Frobenius permutes them by $b\mapsto b^p$. A reduced root belongs to ${\mathbb{F}}_p$ exactly when it is fixed by this map. Because reduction is injective on the original root set, this happens exactly when the Frobenius permutation fixes an original root. This proves the Frobenius permutation and roots modulo a prime criterion.

The Chebotarev density theorem assigns the conjugacy class of our fixed-point-free $g$ the positive Dirichlet density $|C_g|/|G|$. All but finitely many of these primes have rootless reduction, so there are infinitely many. More precisely, applying the same argument to the union of all fixed-point-free classes gives

Each $H$-conjugacy class represented by $x_i$ has $|H|/|C_H(x_i)|$ elements. For every element of that class, the number of conjugators from $g$ to it is $|C_G(g)|$. Grouping the induced character formula by these classes therefore gives

In the example, $a$ has order four, $b$ has order two, and $bab=a^{-1}$, so $H\cong D_8$. Its five conjugacy classes are $1$, $a^2$, $\{a,a^3\}$, $\{b,a^{2}b\}$ and $\{ab,a^{3}b\}$, of sizes $1,1,2,2,2$. The four one-dimensional irreducible characters are determined by $\psi (a)=\epsilon$ and $\psi (b)=\eta$, each sign independently chosen. The remaining two-dimensional irreducible character comes from the plane action of the square:Their squared degrees sum to eight, so this is the full character table.

In $S_4$, use class representatives $1,(12),(12)(34),(123),(1234)$. Their intersections with $H$ are respectively $\{1\}$, $\{b,a^{2}b\}$, $\{a^2\}\cup \{ab,a^{3}b\}$, the empty set, and $\{a,a^3\}$. The corresponding $S_4$ centralizer orders are $24,4,8,3,4$, while the noncentral $H$ centralizers have order four. The induced values are consequentlyIn the same $S_4$ class order, all five induced irreducible characters are

We use the standard facts that finite complex representations are completely reducible, irreducible characters are orthonormal, the regular character is ${\sum }_{\chi }\chi (1)\chi$, and the number of irreducible characters equals the number of conjugacy classes. We also use Schur's lemma, Sylow's theorem and the nontrivial center of a nontrivial finite $p$-group.

For an irreducible character $\chi$ of degree $d$, a conjugacy-class sum $z_C$ acts as the scalar ${\lambda }_C=|C|\chi (g)/d$ by Schur's lemma and taking traces. This scalar is an algebraic integer: class sums form an integral basis of the center of the integral group algebra, their multiplication has integer structure constants, and multiplication by $z_C$ satisfies its monic integer characteristic polynomial. That same polynomial annihilates its image in any irreducible representation. Character values are also algebraic integers, since they are sums of roots of unity. Character orthogonality now givesThis is a rational algebraic integer, hence an integer. Therefore $\chi (1)$ divides $|G|$.

The Burnside's pa qb theorem states that every finite group of order $p^a{q}^b$ is soluble. We prove its character-theoretic ingredient. If a class has size $m$ coprime to $d$, integers $u,v$ with $ud+vm=1$ givean algebraic integer. Every algebraic conjugate of this number is the average of $d$ roots of unity and has modulus at most one. If it is nonzero, its algebraic norm is a nonzero integer of absolute value at least one; since every factor has modulus at most one, all must have modulus one. In particular $|\chi (g)|=d$. Equality in the triangle inequality for the unit-modulus eigenvalues implies that $\rho (g)$ is scalar. Thus if $(m,d)=1$, either $\chi (g)=0$ or $\rho (g)$ is scalar.