Grand orthogonality theorem

From Groupprops

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

Statement over complex numbers

Suppose is a finite group. Let denote the field of complex numbers. For each equivalence class of irreducible linear representation of over , choose a basis such that the representation is unitary, i.e., the image lies inside . Note that this can be done, because linear representation of finite group over complex numbers has invariant Hermitian inner product.

Now, consider the functions from to obtained as the matrix entries for these representations. (There are functions for each representation of degree ).

Consider the usual Hermitian inner product on the space of complex-valued functions on :

Then:

  1. Any two matrix entry functions are orthogonal with respect to the inner product described above.
  2. The inner product of any matrix entry function with itself equals where is the degree of the representation from which it is picked.

Statement over general fields

Suppose is a finite group. Let be a splitting field for such that the characteristic of does not divide the order of . For every equivalence class of irreducible linear representation of over , choose a basis. Now consider the functions from to obtained as the matrix entries of these representations.

Consider the bilinear form for functions on the group:

Then:

  1. Matrix entries for distinct irreducible representations are orthogonal to each other, i.e., the inner product is zero.
  2. Matrix entries for the same irreducible representation have inner product iff the entries are transposes of each other, and have inner product zero otherwise.

Related facts

Related facts

Facts used

  1. Schur's lemma

Proof

We first provide the proof using the bilinear form for general splitting fields, then discuss how this can be used to deduce the proof for the Hermitian inner product if we use unitary matrices over the complex numbers.

Proof of orthogonality of matrix entries from inequivalent irreducible representations

This part of the proof does not require the field to be a splitting field.

Given: A finite group , a field whose characteristic does not divide the order of . For functions define:

are inequivalent irreducible representations of over of degrees respectively.

Pick and ( are allowed to be equal to each other, are allowed to be equal to each other).

Define:

To prove:

Proof:

Step no. Assertion/construction Facts used Given data used Previous steps used Explanation
1 Denote by the matrix with a 1 in the entry and 0s elsewhere. -- -- -- --
2 Define . is a matrix. has degree , has degree , so the matrix multiplication makes sense. Step (1) --
3 is a homomorphism of representations from to Step (2) PLACEHOLDER FOR INFORMATION TO BE FILLED IN: [SHOW MORE]
4 is the zero matrix. Fact (1) (note that the roles of are interchanged from the statement of Fact (1)) are inequivalent irreducible representations. Step (3)
5 The entry of is zero. Step (4)
6 The entry of equals . Step (2) Follows by simplifying the matrix multiplication.
7 , so . Definitions of , inner product Steps (5), (6) Step-combination direct for first version, use definitions of for second version.

Proof of orthogonality and norm of distinct matrix entries from the same representation when the field is algebraically closed

We assume the field to be algebraically closed. After that, we will discuss why the result holds for other splitting fields.

Given: A finite group , an algebraically closed field whose characteristic does not divide the order of . For functions define:

is an irreducible representation of degree and are all elements of (with the restriction that ).

Define:

To prove: If and (so and correspond to mutually transpose matrix entries), we have:

Otherwise, we have:

Proof:

Step no. Assertion/construction Facts used Given data used Previous steps used Explanation
1 Denote by the matrix with a 1 in the entry and 0s elsewhere. -- -- -- --
2 Define . is a matrix. Step (1) --
3 defines a homomorphism of linear representations from to itself. Step (2) PLACEHOLDER FOR INFORMATION TO BE FILLED IN: [SHOW MORE]
4 is a scalar matrix. Fact (1) is algebraically closed, is irreducible. Step (3) Step-fact combination direct
5 The trace of is the same as the trace of . Step (2) [SHOW MORE]
6 If , then is the scalar matrix with diagonal entries . Otherwise, it is the zero matrix. Steps (4), (5)
7 The entry of is if and , and is 0 otherwise. Step (6) If , then is the zero matrix, so all its entries are zero. If , then it is a diagonal matrix with diagonal entries and zero elsewhere. The entry is thus if and zero otherwise.</toggledisplay>
8 The entry of equals . Step (2) Follows by simplifying the matrix multiplication.
9 We have if and . Also, otherwise. Steps (7), (8)
10 We get the desired conclusion Step (9) Re-interpret Step (9) in terms of .

Proof for a splitting field

To prove the result for a splitting field, we embed the splitting field in an algebraically closed field, show the result there, and then note that all the inner product values remain the same upon restriction to a subfield containing the matrix entries.

Proof for unitary matrices

A unitary matrix is a matrix whose inverse is its conjugate-transpose. In particular, if is unitary, then:

In particular:

Thus:

This equality allows us to go back and forth between the two formulations.