# Column orthogonality theorem

This article gives the statement, and possibly proof, of a basic fact in linear representation theory.

View a complete list of basic facts in linear representation theory OR View all facts related to linear representation theory

This article describes an orthogonality theorem. View a list of orthogonality theorems

## Statement

Let be a finite group, and be a splitting field for .

Then, consider the character table of : this is a matrix whose rows are indexed by the irreducible linear representations of over , and whose columns are indicated by the conjugacy classes of , and where the entry in row and column is the trace of where .

Then, the columns of this table are *orthogonal*. More explicitly, for any conjugacy classes and , pick . We get:

where varies over the characters of irreducible linear representations of .

Further, for a single conjugacy class and :

Note that any sufficiently large field (i.e., any field that contains all the roots of unity where is the exponent of ) is a splitting field.

## Proof

We use the row orthogonality theorem for the sufficiently large field case. By the row orthogonality theorem, we know that the rows of the character table are pairwise orthogonal with respect to the inner product:

This, however, does not turn the character table into an orthogonal matrix. The following is true, though:

- Let be the matrix obtained from the character table, by multiplying each column by the square root of the size of the conjugacy class.
- Let be the matrix indexed by representations for rows and conjugacy classes for columns, where the entry in a given row and column is the trace of the representation of the
*inverse*element to that column. Thus, the entry in row and column is where .

Then is the identity matrix. Transposing it, we get that is the identity matrix, and this gives us the required column orthogonality.