Conjugation by partitions into orbits. Each non-singleton orbit has size divisible by , by the orbit-stabilizer theorem. The singleton orbits are exactly . Since is divisible by , . This set contains , so .
For the deduction we also give the representation-theoretic ingredient behind Burnside's theorem: a nonabelian finite simple group has no nontrivial conjugacy class of prime power size. Here is a proof, so no stronger theorem is being assumed without justification. Suppose has class size . For an irreducible character of degree coprime to , the class sum acts as the scalar , which is an algebraic integer: the class sum has an integer-entry matrix in the regular representation, which contains every irreducible representation, so this scalar is an eigenvalue of an integer-entry matrix. Also is an algebraic integer. Bezout's identity then makes an algebraic integer. All its algebraic conjugates have modulus at most , because character values of a representation are sums of roots of unity. An algebraic integer with this property is zero or a root of unity: the monic polynomials of all its powers have uniformly bounded integer coefficients, so two powers must coincide unless it is zero.
Every nontrivial irreducible representation of a simple group is faithful. If were a root of unity, equality in the triangle inequality would force its representing matrix to be scalar, hence central, impossible. Thus whenever , except for the trivial character of a representation. Orthogonality of the identity column and the column in the character table now gives
This would make an algebraic integer, contradicting the fact that rational algebraic integers are integers. The same proof covers class size directly through triviality of the center.
If an abelian subgroup had index , every would have , making its class size a divisor of , a contradiction. Such a exists: if , then is a nontrivial p-group, whose center is nontrivial by the first argument with . Therefore a nonabelian simple group has no abelian subgroup of prime power index.
We use the core-quotient bijection for partitions: an ordered -tuple and a fixed -core determine a unique partition of an integer, with
The irreducible characters in both and therefore correspond to the same ordered tuples of total size . Replacing the empty core of a partition by while keeping the quotient of a partition fixed gives a bijection from to . In particular .
For such a pair, all levels of the core tower of a partition above level zero agree. At level zero, their sizes are and , respectively. Put . When , the base-p digit sum satisfies
The P-adic valuation of a symmetric-group character degree from the core tower then gives
Thus the same bijection preserves degree coprimality to and restricts to a bijection between the indicated sets of irreducible characters of degree coprime to p. Consequently
For , take to be the empty partition; the construction becomes the identity.
By character orthogonality, the squared multiplicities are the character inner product norm of the restriction of a character:
Since is an irreducible character, its norm on is one, and hence
The omitted summands are nonnegative, so the character restriction norm bound is an equality precisely when
Work with the selected transitive orbit . By Maschke's theorem, decompose its permutation character as
where the are distinct nontrivial irreducible characters. Character orthogonality gives
Consequently the augmentation summand is irreducible exactly when this inner product equals .
The double cosets are the -orbits on . Because acts transitively on , these in turn correspond to the -orbits on : move the first coordinate to the base point , after which its stabilizer is . One orbit is the diagonal. There are exactly two orbits precisely when is transitive on , equivalently when the action is two-transitive. Part (ii) therefore proves
This is the irreducible augmentation criterion for a transitive group action.
Finally, transitivity implies that the fixed-vector space consists only of constant vectors and has dimension one. If the nonzero representation were a trivial representation, it would contribute another fixed vector, a contradiction. Thus is not the trivial representation.
Burnside lemma says that the number of orbits of a finite group on a finite set is
Indeed, double-count the set . Counting first by gives the numerator. Counting first by gives ; each orbit contributes by the orbit-stabilizer theorem, proving the formula.
Let be the character of the permutation representation. Then
is, by Burnside's lemma, the number of orbits on . A two-transitive group action has exactly two such orbits: the diagonal and the ordered pairs of distinct points. Hence . Transitivity also gives . If is its irreducible character decomposition, then , so exactly one nontrivial irreducible character occurs, with multiplicity one. Thus the permutation character has precisely two distinct irreducible summands.
Write the symmetry group of a square as , with a counterclockwise quarter-turn and reflection across the horizontal axis. The conjugacy classes of the symmetry group of a square are
Here is the half-turn and the clockwise quarter-turn. The two members of the fourth class reflect across the horizontal and vertical axes. Those of the fifth reflect across and . The identity and half-turn are central elements, giving singleton classes. The relations , , and show that each displayed pair consists of conjugate elements. More generally, conjugating by changes to , and conjugating by changes to ; parity is preserved, so the two reflection pairs cannot merge.
In a one-dimensional representation, the relation forces the image of to equal its inverse. Thus and can be assigned independent signs . These four choices give four irreducible characters. The ordinary two-dimensional action on the plane gives one more character: a rotation through has trace , and a reflection has trace zero. Therefore the character table of the symmetry group of a square is
For instance the last row has squared character norm , 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 , so they exhaust the irreducible representations of this order-eight group.
A group representation is a homomorphism . It is a reducible representation if there is a nonzero proper invariant subspace of preserved by every , and an irreducible representation otherwise. With invertible,
so changing basis gives another representation. Its character of a representation is , and cyclicity of the trace gives .
A conjugacy class consists of as varies. Since , a power equals the identity exactly when does. Thus conjugation preserves element order, including infinite order.
For the square, let be rotation by and reflection in a horizontal symmetry axis. The dihedral group has the eight elements
The conjugacy classes of a finite dihedral group specialize to
The two central rotations are singletons. Reflection conjugation reverses rotations, while conjugation by shifts a reflection exponent by two, giving the two reflection classes.
For finite groups over , 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 , supply the former; the ordinary action on the plane supplies the latter.
Write the virtual character as with integer coefficients and irreducible characters . Character orthogonality gives . Norm one forces exactly one coefficient to be or , and positive degree selects the positive sign.
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 an algebraic integer, impossible. This is the character-theoretic ingredient in Burnside's theorem.