The irreducible
complex characters of a finite group form a
character table which encodes much useful information about the group in a compact form. Each row is labelled by an irreducible representation and the entries in the row are the characters of the representation on the respective conjugacy class of . The columns are labelled by (representatives of) the conjugacy classes of . It is customary to label the first row by the character of the
trivial representation, which is the trivial action of on a 1-dimensional vector space by \rho(g)=1 for all g\in G . Each entry in the first row is therefore 1. Similarly, it is customary to label the first column by the identity. Therefore, the first column contains the degree of each irreducible character. Here is the character table of :C_3 = \langle u \mid u^{3} = 1 \rangle, the
cyclic group with three elements and generator
u: where is a
primitive third root of unity. The character table is always square, because the number of irreducible representations is equal to the number of conjugacy classes.
Orthogonality relations The space of complex-valued
class functions of a finite group has a natural
inner product: :\langle \alpha, \beta\rangle := \frac{1}{\mathopen\vert G\mathclose\vert}\sum_{g \in G} \alpha(g) \overline{\beta(g)} where is the
complex conjugate of . With respect to this inner product, the irreducible characters form an
orthonormal basis for the space of class-functions, and this yields the orthogonality relation for the rows of the character table: :\langle \chi_i, \chi_j \rangle = \begin{cases} 0 & \mbox{ if } i \ne j, \\ 1 & \mbox{ if } i = j. \end{cases} For in , applying the same inner product to the columns of the character table yields: :\sum_{\chi_i} \chi_i(g) \overline{\chi_i(h)} = \begin{cases} \mathopen\vert C_G(g) \mathclose\vert, & \mbox{ if } g, h \mbox{ are conjugate } \\ 0 & \mbox{ otherwise.}\end{cases} where the sum is over all of the irreducible characters of and the symbol denotes the order of the
centralizer of . Note that since and are conjugate iff they are in the same column of the character table, this implies that the columns of the character table are orthogonal. The orthogonality relations can aid many computations including: • Decomposing an unknown character as a linear combination of irreducible characters. • Constructing the complete character table when only some of the irreducible characters are known. • Finding the orders of the centralizers of representatives of the conjugacy classes of a group. • Finding the order of the group.
Character table properties Certain properties of the group can be deduced from its character table: • The order of is given by the sum of the squares of the entries of the first column (the degrees of the irreducible characters). More generally, the sum of the squares of the
absolute values of the entries in any column gives the order of the centralizer of an element of the corresponding conjugacy class. • All normal subgroups of (and thus whether or not is simple) can be recognised from its character table. The
kernel of a character is the set of elements in for which ; this is a normal subgroup of . Each normal subgroup of is the intersection of the kernels of some of the irreducible characters of . • The
commutator subgroup of is the intersection of the kernels of the linear characters of . • If is finite, then since the character table is square and has as many rows as conjugacy classes, it follows that is
abelian iff each conjugacy class is a singleton iff the character table of is |G| \!\times\! |G| iff each irreducible character is linear. • It follows, using some results of
Richard Brauer from
modular representation theory, that the prime divisors of the orders of the elements of each conjugacy class of a finite group can be deduced from its character table (an observation of
Graham Higman). The character table does not in general determine the group
up to isomorphism: for example, the
quaternion group and the
dihedral group of elements, , have the same character table. Brauer asked whether the character table, together with the knowledge of how the powers of elements of its conjugacy classes are distributed, determines a finite group up to isomorphism. In 1964, this was answered in the negative by
E. C. Dade. The linear representations of are themselves a group under the
tensor product, since the tensor product of 1-dimensional vector spaces is again 1-dimensional. That is, if \rho_1:G\to V_1 and \rho_2:G\to V_2 are linear representations, then \rho_1\otimes\rho_2 (g)=(\rho_1(g)\otimes\rho_2(g)) defines a new linear representation. This gives rise to a group of linear characters, called the
character group under the operation [\chi_1*\chi_2](g)=\chi_1(g)\chi_2(g). This group is connected to
Dirichlet characters and
Fourier analysis. ==Induced characters and Frobenius reciprocity==