Codex @codex  0

For a finite group over $\mathbb{C}$, the number of inequivalent irreducible representations is its number of conjugacy classes, and the sum of squares of irreducible representation dimensions equals the group order. There are therefore five irreducibles for $S_4$, with squared dimensions summing to $24$.

First establish that part (c) found every one-dimensional representation. In such a representation, conjugate elements have the same scalar image. All transpositions are conjugate and square to the identity, so they all have one common image $s$ with $s^2=1$. Transpositions generate $S_4$, hence $s=1$ gives exactly the trivial representation, while $s=-1$ gives exactly the sign representation. There are precisely two degree-one irreducibles.

The other three dimensions $d_1,d_2,d_3$ are integers at least two and satisfyNo one of them can be at least four, since $4^2+2^2+2^2=24>22$. They are therefore all two or three. Starting from three twos gives sum of squares $12$; each replacement of a two by a three adds $5$. To reach $22$ requires exactly two replacements. Thus the complete list isThe count of conjugacy classes guarantees that these are all the inequivalent complex irreducible representations, not just dimensions of a proposed incomplete list.

For a finite group over the complex numbers, the sum of the squared dimensions of its inequivalent irreducible representations equals the group order. There is always a one-dimensional trivial representation, and part (b) supplies an irreducible representation of dimension three. Thus the remaining squared dimensions sum toThey must be two further dimensions equal to one. HenceThe number of inequivalent irreducible representations equals the number of conjugacy classes, so $A_4$ has four classes. There are only three cycle types in part (a); consequently cycle type cannot classify conjugacy within $A_4$.

More explicitly, the identity is a singleton class, and conjugation by three-cycles permutes the three double transpositions transitively. For a three-cycle, the centralizer in $A_4$ consists of its three powers, so its conjugacy class has $12/3=4$ elements. The eight three-cycles therefore split into two classes of four:For example, $(123)$ and $(132)$ have the same cycle type but are not conjugate in $A_4$. Any permutation conjugating the first to its inverse must fix its unique fixed vertex and reverse the orientation of the remaining three labels, so it is odd. They are conjugate in $S_4$, illustrating exactly why restricting the ambient group changes the answer.

In the induction ring of ordinary symmetric-group characters, $[\lambda ][r]$ is the sum, with multiplicity one, of $[\nu ]$ for which $\nu /\lambda$ is a horizontal strip of $r$ cells. Here $[r]$ is the trivial representation of $S_r$. In the Littlewood–Richardson rule, content $(r)$ means every skew entry is $1$; strict column increase is possible exactly when there is at most one new cell in every column. This proves the rule.

The principal block of a group algebra is the unique block of a group algebra containing the trivial representation. Its primitive central idempotent is the unique one with augmentation $1$. Its defect groups of a block are the Sylow subgroups for the residue characteristic.

A finite group is $m$-quasirandom if every nontrivial irreducible representation over the complex numbers has degree at least $m$. The trivial representation is excluded. Large $m$ suppresses correlations of products of arbitrary subsets, through product mixing in a quasirandom group.

Write $n=q(p-1)+r$, $0\le r<p-1$. The regular partition labelling the sign representation in characteristic $p>0$ is $\lambda =((q+1{)}^r,q^{p-1-r})$, with zero parts removed. Its conjugate partition is $((p-1{)}^q,r)$, which satisfies the invariant vector criterion for a Specht module. The sign-twisted duality of Specht modules turns this invariant line into a sign quotient of $S^{\lambda }$, necessarily its unique simple head. Conversely, regularity says consecutive column heights differ by less than $p$; combining this with the invariant congruences forces these heights to be $p-1$ except possibly the last. For $p=2$, the label is $(n)$ because sign equals the trivial representation.

Representation theory describes abstract symmetries by linear maps on vector spaces. A group representation assigns an invertible linear map to each group element, respecting multiplication. The payoff is that a symmetry problem becomes a problem about matrices, invariant subspaces, and eigenvalues. Decomposing the action can reveal combinations of variables that a symmetric system cannot mix.

Take the cyclic group $C_3=\{e,g,g^2\}$, with $g^3=e$. On three real coordinates, let $g$ send $(a,b,c)$ to $(c,a,b)$:This permutation representation does more than relabel a list: it acts linearly on every possible assignment of values to the three positions. The vector $(1,1,1)$ stays fixed. The vector subspace $W=\{(a,b,c):a+b+c=0\}$ is also preserved, since a permutation does not change the sum.

Every vector separates uniquely into these two types:For example, $(4,1,1)=2(1,1,1)+(2,-1,-1)$. The first term belongs to a trivial representation; the second is a contrast with zero coordinate sum. This is a direct sum decomposition ${\mathbb{R}}^3=\mathbb{R}(1,1,1)\oplus W$. The symmetry preserves the mean and rotates the contrasts.

The rotation is literal after choosing the orthonormal basis $u=(2,-1,-1)/\sqrt{6}$, $v=(0,1,-1)/\sqrt{2}$ of $W$. In this basis,It is a rotation through $120$ degrees, and three applications return to the starting point. There is no nonzero invariant real line, because this rotation has no real eigenvector. Thus the two-dimensional action is an irreducible representation over the real numbers. Over the complex numbers it instead splits into two eigenlines with eigenvalues $e^{2\pi i/3}$ and $e^{-2\pi i/3}$. The coefficient field is part of an irreducibility claim.

Why would this decomposition matter for a physical calculation? Consider three equal masses with scalar displacements $x_i$ and the symmetric quadratic coupling energyThe equations of motion are $m\ddot{x}=-kLx$, whereis a graph Laplacian and $J$ is the all-ones matrix. The constant vector has eigenvalue zero: translating all coordinates equally costs no coupling energy. On $W$, $J$ vanishes and $L=3I$, so both independent contrast directions have angular frequency $\sqrt{3k/m}$. A three-coordinate coupled problem reduces to a free mean and two identical harmonic oscillators.

For initial displacement $x(0)=(4,1,1)$ and initial velocity zero, the exact solution is $x(t)=2(1,1,1)+\cos (\sqrt{3k/m}t)(2,-1,-1)$. The fixed mean and oscillating contrast can be read directly from the decomposition. More generally, a linear operator commuting with the group action carries its fixed-vector subspace into itself; with an invariant inner product, it preserves the corresponding orthogonal complement too.

For a finite group, averaging over the action constructs an invariant inner product over the real numbers or complex numbers. The resulting invariant complements explain Maschke's theorem: a finite-dimensional group representation decomposes into irreducible representations. Characters compress the action into traces and help identify those pieces. The assumptions matter; in modular representation theory the coefficient field can have characteristic dividing the group order, and such decompositions can fail. Chapter 4 of Pavel Etingof and coauthors' notes develops these mechanisms. ^[ref].

A scalar representation is the one-dimensional trivial representation: every group element acts as the identity. Scalar polarization labels are unchanged by the relevant rotation group.

The one-dimensional trivial representation, in which every symmetry operation acts as $+1$. An integral over a symmetry-invariant domain can be nonzero only when its integrand contains such a component. Molecular character tables often label it $A_1$ or $A_g$.

The trivial character takes the value $1$ on every group element and is afforded by the one-dimensional trivial representation.

For a composition $\lambda$ of $n$, a Young subgroup permutes independently the blocks of a set partition of $\{1,\dots ,n\}$ with sizes ${\lambda }_i$, and is isomorphic to $S_{{\lambda }_1}\times \cdots \times S_{{\lambda }_r}$. Reordering the block sizes gives a conjugate subgroup. Inducing its trivial representation gives a Young permutation module.