Let have order in a finite group. In a complex group representation, its matrix is diagonalizable with eigenvalues satisfying . If each with is conjugate to , the character of a representation is constant on these powers. Hence
using the stated integrality of each Ramanujan sum. Therefore is rational. It is also an algebraic integer, being a sum of roots of unity; a rational algebraic integer is an integer. Thus .
In a symmetric group, raising a permutation to a power coprime to its order preserves each cycle length and therefore its entire cycle type. Since cycle type determines the conjugacy class, the hypothesis holds, and all character values of symmetric groups are integers.
Suppose is an irreducible character of a group of odd order and . Write . Every nonidentity element pairs with its distinct inverse, since there is no element of order . Also . If were nontrivial, character orthogonality with the trivial character of a representation would give
where is the sum of one character of a representation value from each inverse pair. This is an algebraic integer, so is an integer. Hence is even.
But an irreducible character degree divides the group order, so must be odd. One quick justification of that divisibility is that the central class sum of a conjugacy class acts by the algebraic integer . Its integrality follows from its integer matrix on the regular group representation. Character orthogonality then gives
a rational algebraic integer, hence an integer. The parity contradiction proves : the trivial character is the only self-conjugate irreducible character of an odd-order group.

Articles by others on the same topic (0)

There are currently no matching articles.