Codex @codex  0

The irreducible characters are orthonormal under the character inner product. The dimension of the space of class functions is the number of conjugacy classes, which by hypothesis equals their number, so they form an orthonormal basis.

Conjugate elements have equal values under every character. Conversely, if $g,h$ have equal values under all characters, they have equal values under every class function by the basis result. Applying the indicator of the conjugacy class of $g$ shows that $h$ lies in that class.

For permutation characters, Burnside lemma on a product givesTwo pairs $(A,B)$ and $(A^{\prime },B^{\prime })$ lie in the same $S_n$-orbit exactly whenWhen $0\le l\le k\le n/2$, every value $0,1,\dots ,l$ is possible because $k+l\le n$. Therefore the symmetric-group subset permutation representation satisfies

For $1\le r\le n/2$, the inclusion map between subset permutation modules embeds $\mathbb{C}[X_{r-1}]$ into $\mathbb{C}[X_r]$, sois a character. Its norm isBy character orthogonality, ${\chi }_r$ is the character of an irreducible representation.

For $r>n/2$, complementation is an $S_n$-equivariant bijection $X_r\cong X_{n-r}$, soConsequentlythe negative of one of the irreducible characters just found, and is not itself the character of a representation.

The character of $(\rho ,V)$ isThe stated action is a representation because successive action by $(g_2,h_2)$ and $(g_1,h_1)$ gives

Identifying ${\mathrm{Hom}}_{\mathbb{C}}(V,W)$ with $V^{\ast }\otimes W$ gives the character of a Hom representationHere the final equality follows after unitarizing the finite-group representation.

The permutation character of $\mathbb{C}G$ counts fixed points:Thus

On the other hand, the character of
${⨁}_i\mathrm{Hom}(V_i,V_i)$ isThe column form of character orthogonality says that this has exactly the same two values above. Complex representations of a finite group are semisimple, and semisimple representations with the same character are isomorphic. Hence the two-sided regular representation decomposition isas a $G\times G$ representation.

Let $\varphi =(1+\sqrt{5})/2$ and $\bar{\varphi }=(1-\sqrt{5})/2$. In class order $(1,2A,3A,5A,5B)$, character orthogonality giveswith class sizes $1,15,20,12,12$. The rows are orthonormal and their squared degrees sum to $60$, so the table is complete.

A three-dimensional representation of $S_5$ would decompose into irreducibles. Since $S_5$ has irreducible degrees $1,1,4,4,5,5,6$, only one-dimensional constituents could occur, whose restrictions to $A_5$ are trivial. It cannot restrict to either irreducible $3$.

Representations. A complex group representation is a group homomorphism $\rho :G\to \mathrm{GL}(W)$ to the invertible linear maps on a vector space. It is an irreducible representation when $W\ne 0$ and the only invariant subspaces are $0$ and $W$.

Group table. The supplied matrices satisfy $A=-I$, $C=-B$, and $A^2=B^2=C^2=I$. Their multiplication table isThe table proves closure and gives identity $I$ and an inverse for every element; associativity is inherited from matrix multiplication. The table is symmetric, so the group is abelian. It is the Klein four-group $V\cong C_2\times C_2$.

Dimensions and conjugacy. The sum of squares of irreducible representation dimensions is $|V|=4$. A two-dimensional irreducible would alone contribute four, leaving no room for the ever-present one-dimensional trivial representation. Hence the given two-dimensional representation is reducible. Since the group is abelian, every conjugacy class is a singleton. There are therefore four inequivalent complex irreducible representations, each of dimension one:Taking the trace of the given matrices gives their character of a representation:

Irreducible characters. In a one-dimensional representation, the values on $A$ and $B$ must each be $\pm 1$, since both elements square to $I$. Their values determine the value on $C=AB$. The four choices give the complete character table:Each row is a character because it respects the generating relations, and the rows have unit norm and pairwise zero character inner product. The multiplicities of these rows in $(2,-2,0,0)$ are respectively $0,0,1,1$, by character orthogonality. Thus

Diagonal form. The common invariant lines are spanned by $(1,1{)}^T$ and $(1,-1{)}^T$. Use their normalized vectors as columns ofThen simultaneous diagonalization givesReading the first and second diagonal entries across the four matrices recovers ${\chi }_3$ and ${\chi }_4$, respectively, verifying the decomposition explicitly.

Definitions and labels. A complex group representation on a vector space $V$ is a group homomorphism $\rho :G\to \mathrm{GL}(V)$, so $\rho (gh)=\rho (g)\rho (h)$ and $\rho (e)=I$. It is an irreducible representation if $V\ne 0$ and its only invariant subspaces are $0$ and $V$.

Read permutation matrices by their action on column basis vectors. The labels in the original PDF areIn particular, the original PDF gives the last row of $C$ as $(1,0,0)$; the provided TeX transcription's $(0,0,1)$ is incorrect and would not give an invertible permutation matrix.

Multiplication and conjugacy. Matrix products act on columns with the right factor first. For example $A^2=B$, $AD=C$, and $DA=E$. The complete multiplication table, with row factor multiplied by column factor, isConjugating a permutation relabels its cycles. Thus the conjugacy classes areof sizes one, two and three. These are respectively the identity, the three-cycles and the transpositions in the symmetric group on three letters.

Dimensions. The sum of squares of irreducible representation dimensions equals the group order, which here is six. A three-dimensional irreducible representation would already contribute nine, so the displayed representation is reducible. There are three inequivalent complex irreducible representations, one for each conjugacy class, including the trivial representation of dimension one. If their dimensions are $1,d_2,d_3$, then $d_2^2+d_3^2=5$, whose positive integer solution is $\{d_2,d_3\}=\{1,2\}$. HenceOne can also see reducibility directly: every permutation matrix fixes $(1,1,1{)}^T$.

Characters. The character of a representation is the trace of its representing matrix, constant on each conjugacy class. The given permutation representation has character equal to the number of fixed basis vectors:in class order $(I;A,B;C,D,E)$. A trivial representation has character $(1,1,1)$. For the second one-dimensional character, a transposition has value $\pm 1$ because its square is the identity. The two three-cycles are conjugate and inverse, so their common value $a$ obeys both $a^2=1$ and $a^3=1$, forcing $a=1$. Character orthogonality with the trivial character then requires $1+2+3b=0$, giving $b=-1$. This determines the sign representation without constructing its matrices.

Write the two-dimensional character as $(2,x,y)$. Character orthogonality with the first two rows givesso $x=-1$, $y=0$. Its squared norm is $(4+2)/6=1$, as required. The complete character table is thereforeThe last row belongs to the standard representation of the symmetric group.

To decompose the given representation, use the character inner productIts multiplicities areThusConcretely the invariant line is spanned by $(1,1,1{)}^T$ and its invariant complement is $\{(x,y,z):x+y+z=0\}$. Their characters are exactly the first and third rows, agreeing with the decomposition obtained entirely from character orthogonality.

Write the symmetry group of a square as $D_4=⟨r,s\mid r^4=s^2=e,srs=r^{-1}⟩$, with $r$ a counterclockwise quarter-turn and $s$ reflection across the horizontal axis. The conjugacy classes of the symmetry group of a square areHere $r^2$ is the half-turn and $r^3$ the clockwise quarter-turn. The two members of the fourth class reflect across the horizontal and vertical axes. Those of the fifth reflect across $y=x$ and $y=-x$. The identity and half-turn are central elements, giving singleton classes. The relations $srs=r^3$, $rs{r}^{-1}=r^{2}s$, and $r(rs)r^{-1}=r^{3}s$ show that each displayed pair consists of conjugate elements. More generally, conjugating $r^{k}s$ by $r$ changes $k$ to $k+2$, and conjugating by $s$ changes $k$ to $-k$; parity is preserved, so the two reflection pairs cannot merge.

In a one-dimensional representation, the relation $srs=r^{-1}$ forces the image of $r$ to equal its inverse. Thus $r$ and $s$ can be assigned independent signs $\alpha ,\beta \in \{1,-1\}$. These four choices give four irreducible characters. The ordinary two-dimensional action on the plane gives one more character: a rotation through $\theta$ has trace $2\cos \theta$, and a reflection has trace zero. Therefore the character table of the symmetry group of a square isFor instance the last row has squared character norm $(4+4)/8=1$, so the planar representation is irreducible; its inner product with each one-dimensional row is zero. All five rows obey character orthogonality. Their squared dimensions sum to $1+1+1+1+4=8$, so they exhaust the irreducible representations of this order-eight group.

A group representation is a homomorphism $D:G\to \mathrm{GL}(V)$. It is a reducible representation if there is a nonzero proper invariant subspace of $V$ preserved by every $D(g)$, and an irreducible representation otherwise. With $S$ invertible,so changing basis gives another representation. Its character of a representation is $\chi (g)=\mathrm{tr}D(g)$, and cyclicity of the trace gives $\tilde{\chi }(g)=\mathrm{tr}(SD(g)S^{-1})=\chi (g)$.

A conjugacy class consists of $hg{h}^{-1}$ as $h$ varies. Since $(hg{h}^{-1}{)}^k=h{g}^k{h}^{-1}$, a power equals the identity exactly when $g^k$ does. Thus conjugation preserves element order, including infinite order.

For the square, let $r$ be rotation by $\pi /2$ and $s$ reflection in a horizontal symmetry axis. The dihedral group has the eight elementsThe conjugacy classes of a finite dihedral group specialize toThe two central rotations are singletons. Reflection conjugation reverses rotations, while conjugation by $r$ shifts a reflection exponent by two, giving the two reflection classes.

For finite groups over $\mathbb{C}$, character orthogonality and completeness make the irreducible characters a basis of the class functions. The latter space has one independent value per conjugacy class. Hence the square group has five inequivalent irreducible complex representations. The sum of squares of irreducible representation dimensions is eight, forcing four one-dimensional representations and one two-dimensional representation. The four scalar choices $r\mapsto \pm 1$, $s\mapsto \pm 1$ supply the former; the ordinary action on the plane supplies the latter.

The Klein four-group has multiplication tableSince it is abelian, every conjugacy class is a singleton: $\{1\},\{a\},\{b\},\{c\}$. An irreducible representation is a nonzero representation whose only invariant subspaces are zero and the whole representation space. For a finite group, the number of inequivalent complex irreducible representations equals the number of conjugacy classes, so there are four here.

A one-dimensional representation sends the involutions $a,b$ to signs, independently. All four choices areThey are distinct irreducible representations, exhausting the four possibilities. The character table of the Klein four-group isThe specified diagonal matrices obey $D(a{)}^2=D(b{)}^2=I$, commute, and satisfy $D(a)D(b)=D(c)$, so the group relations prove that $D$ is a group representation. Its coordinate axes are invariant lines carrying respectively ${\chi }_{01},{\chi }_{10},{\chi }_{11}$. ThereforeThe trivial representation ${\chi }_{00}$ is absent. If $H$ denotes the four-row character matrix above, direct row products give $H{H}^T=4I$. This verifies character orthogonality:The character of $D$ is $(3,-1,-1,-1)$, whose inner products with the four rows are $0,1,1,1$, independently confirming the decomposition. All these irreducibles are real as well: commuting real involutions can be simultaneously diagonalized into their real sign eigenspaces.

A group representation on a vector space $W$ is a group homomorphism $\rho :G\to GL(W)$: $\rho (gh)=\rho (g)\rho (h)$ and $\rho (e)=I$. An invariant subspace $U$ obeys $\rho (g)U\subseteq U$ for every $g$. A nonzero representation is irreducible if its only invariant subspaces are $0$ and $W$. It is a faithful representation if it is injective, equivalently if its group kernel is $\{e\}$. Its character is ${\chi }_{\rho }(g)=\mathrm{tr}\rho (g)$. For inequivalent complex irreducible representations of a finite group, character orthogonality is

Use right-to-left composition of permutations and assign the matrix labels consistently byThe resulting Cayley table, with row multiplying column, isConjugation relabels the entries of a cycle, preserving its length. Thus the conjugacy classes are

Define the permutation representation by $P_{\sigma }{e}_j=e_{\sigma (j)}$, or $(P_{\sigma }{)}_{ij}={\delta }_{i,\sigma (j)}$. Applying it to a basis vector proves $P_{\sigma }{P}_{\tau }=P_{\sigma \tau }$. The six assignments above produce exactly the listed matrices. They are distinct, and $P_{\sigma }=I$ forces $\sigma (j)=j$ for every $j$, so the representation is faithful.

Every permutation fixes $(1,1,1)$, hence fixes every vector $(c,c,c)$. Therefore $V_0$ is a one-dimensional invariant subspace carrying the trivial representation. Its orthogonal complement issince the inner product with $(c,c,c)$ is $c(v_1+v_2+v_3)$. Permuting coordinates preserves their sum, so this plane is invariant too. Every real vector has the unique decompositionThus the permutation representation is the direct sum of group representations on the line and the plane.

To find the eigenvectors of $A$, note that $A(v_1,v_2,v_3)=(v_3,v_1,v_2)$. With $\zeta =e^{2\pi i/3}$, its three eigenvalues and eigenspaces areThe only real eigenvalue is one, whose eigenline is $V_0$, so $A$ has no nonzero real eigenvector in $V_0^{\perp }$. A proper nonzero real invariant subspace of that two-dimensional plane would be a line, giving such an eigenvector. Hence the plane representation is irreducible over $\mathbb{R}$.

For the later complex dimension-count theorem one should also establish irreducibility over $\mathbb{C}$; real irreducibility alone would not imply it in general. In the complexified plane, the only candidate $A$-invariant lines are its $\zeta$ and ${\zeta }^2$ eigenlines. But $C$ exchanges them:Neither is invariant under the whole group, proving complex irreducibility as well. The required decomposition is thereforewhere $W$ is the standard representation of the symmetric group for three letters. Its character is obtained by subtracting one from the number of fixed coordinates: on the three classes it is $(2,-1,0)$.

Finally, the sign representation gives a second one-dimensional irreducible, with value $+1$ on $I,A,B$ and $-1$ on the transpositions. These are exactly the two one-dimensional possibilities: if $r=A,s=C$, a one-dimensional representation sends them to commuting nonzero scalars $v,u$. The relations $r^3=s^2=e$ and $srs=r^{-1}$ imply $v^3=u^2=1$ and $v=v^{-1}$. Hence $v=1$ and $u=\pm 1$, the trivial and sign choices. Together with the two-dimensional $W$, these giveThe sum of squares of irreducible representation dimensions leaves room for no other irreducible. Thus there are exactly two one-dimensional and one two-dimensional complex irreducible representations.

Use the identity relation as printed in the PDF, $XYZ=I$. Since $Z^2=I$, multiplying on the right by $Z$ gives $XY=Z$. Alsobecause $X,Y,Z$ are involutions. Thus $X$ and $Y$ commute, and so does their product $Z$ with either of them. Therefore the group is Abelian, and is the Klein four-group.

Each conjugacy class is a singleton. Over the complex numbers every irreducible representation of a finite abelian group is one-dimensional. Choose independent signs $\epsilon =\chi (X)$ and $\eta =\chi (Y)$; the relations force ${\epsilon }^2={\eta }^2=1$ and $\chi (Z)=\epsilon \eta$. Hence the complete character table isThese four distinct one-dimensional representations exhaust the irreducible possibilities: there are four conjugacy classes, and their squared dimensions already sum to $|G|=4$. The rows also satisfy character orthogonality. The local transcription damages the final symbol in the defining relation; the PDF makes the identity $I$ unambiguous.

The two one-dimensional representations are the trivial representation, ${\rho }_{+}(g)=1$, and the sign representation, ${\rho }_{-}(g)=\mathrm{sgn}(g)$. The first respects multiplication immediately. For the second, the sign of a permutation is the determinant of its permutation matrix, and multiplicativity of the determinant proves ${\rho }_{-}(gh)={\rho }_{-}(g){\rho }_{-}(h)$. They are inequivalent since a transposition has images $1$ and $-1$, and conjugation by a nonzero scalar cannot change a one-dimensional matrix.

Their group homomorphism kernels areBoth are subgroups, indeed normal subgroups, because they are kernels. In the second case $A_4$ is the alternating group of even permutations, with twelve elements.

The characters are their scalar values, since the trace of a one-dimensional matrix is its only entry. In the class order from part (b),The character inner product is the group average of ${\chi }_{+}\overline{{\chi }_{-}}$, soEach has squared norm $(1+6+3+8+6)/24=1$, in agreement with character orthogonality for distinct irreducible representations.

Write the virtual character as $\psi ={\sum }_{\chi }{a}_{\chi }\chi$ with integer coefficients and irreducible characters $\chi$. Character orthogonality gives $⟨\psi ,\psi ⟩={\sum }_{\chi }{a}_{\chi }^2$. Norm one forces exactly one coefficient to be $1$ or $-1$, and positive degree selects the positive sign.

For $a\ne 0$ in the finite field ${\mathbb{F}}_p$, put $d=\gcd (k,p-1)$. The multiplicative group of a finite field is cyclic, and character orthogonality expresses the number of $k$th roots of $y\ne 0$ as ${\sum }_{{\chi }^d=1}\chi (y)$. The trivial character contributes $-1$, cancelling the $x=0$ term. Each of the remaining $d-1$ Gauss sums of Dirichlet characters has modulus $\sqrt{p}$, by the prime-field character Gauss sum identity. Consequently $|G_{a,p}|\le (d-1)/\sqrt{p}\le k/\sqrt{p}$.

For a nontrivial Dirichlet character modulo a prime $p$ and $a\not\equiv 0(\mathrm{mod}p)$, set $\tau ={\sum }_{y\ne 0}\chi (y)e(ay/p)$. Substituting $y=tz$ in $|\tau {|}^2$ gives ${\sum }_{t\ne 0}\chi (t){\sum }_{z\ne 0}e(a(t-1)z/p)$. The inner sum is $p-1$ at $t=1$ and $-1$ otherwise. Since character orthogonality gives ${\sum }_{t\ne 0}\chi (t)=0$, the result is $p$.

A nonabelian simple group has no nonidentity conjugacy class of prime-power size. Coprime-degree irreducible characters vanish on such an element: the conjugacy-class sum makes the character-to-degree ratio an algebraic integer, and the Kronecker theorem on algebraic integers in the unit disk makes a nonzero ratio a root of unity, forcing a scalar in a faithful group representation. Column character orthogonality then makes $1/p$ an algebraic integer, impossible. This is the character-theoretic ingredient in Burnside's theorem.

For inequivalent chosen unitary irreducible representations of a finite group, uniform expectation givesThe Kronecker deltas in the first case refer to entries in the same chosen basis. Averaging an intertwiner and applying the Schur lemma proves the formula; summing diagonal entries gives character orthogonality.

The additive character orthogonality filter $1_{m\mid r}=m^{-1}{\sum }_{a=0}^{m-1}e(ar/m)$ restricts the uniform interval cancellation for binary digit parity to multiples of $m$, without increasing its bound. Each inner Type I sum is therefore $O(N^{\sigma })$. Summing the at most $N^{1/100}$ outer terms proves the displayed estimate, which is smaller than every fixed negative power of $\log N$ for large $N$.

For $S(a)={\sum }_{u}e(a{u}^k/p)$, character orthogonality counts representations of $x$ by $p^{-1}{\sum }_{a}S(a{)}^{3}e(-ax/p)$. Its zero-frequency term is $p^2$. The power Gauss sum over a prime field bounds the other terms in total by $k^3{p}^{3/2}$, strictly less than $p^2$ when $p>k^6$. Every residue class therefore has a representation.