Grand orthogonality theorem

From Groupprops
(Redirected from Great 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

Statement over complex numbers

Suppose G is a finite group. Let C denote the field of complex numbers. For each equivalence class of irreducible linear representation of G over C, choose a basis such that the representation is unitary, i.e., the image lies inside U(n,C). 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 G to C obtained as the matrix entries for these representations. (There are n2 functions for each representation of degree n).

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

f1,f2=1|G|gGf1(g)f2(g)¯

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 1n where n is the degree of the representation from which it is picked.

Statement over general fields

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

Consider the bilinear form for functions on the group:

f1,f2G=1|G|gGf1(g)f2(g1)

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 1/n 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 G, a field k whose characteristic does not divide the order of G. For functions f1,f2:Gk define:

f1,f2G=1|G|f1(g)f2(g1)

φ1,φ2 are inequivalent irreducible representations of G over k of degrees m,n respectively.

Pick a,i{1,2,,m} and b,j{1,2,,n} (a,i are allowed to be equal to each other, b,j are allowed to be equal to each other).

Define:

f1(g):=φ1(g)ai,f2(g):=φ2(g)jb

To prove: f1,f2G=0

Proof:

Step no. Assertion/construction Facts used Given data used Previous steps used Explanation
1 Denote by Eij the m×n matrix with a 1 in the ijth entry and 0s elsewhere. -- -- -- --
2 Define Fij=1|G|gGφ1(g)Eijφ2(g1). Fij is a m×n matrix. φ1 has degree m, φ2 has degree n, so the matrix multiplication makes sense. Step (1) --
3 Fij is a homomorphism of representations from φ2 to φ1 Step (2) PLACEHOLDER FOR INFORMATION TO BE FILLED IN: [SHOW MORE]
4 Fij is the zero matrix. Fact (1) (note that the roles of φ1,φ2 are interchanged from the statement of Fact (1)) φ1,φ2 are inequivalent irreducible representations. Step (3)
5 The (ab)th entry of Fij is zero. Step (4)
6 The (ab)th entry of Fij equals 1|G|gGφ1(g)aiφ2(g1)jb. Step (2) Follows by simplifying the matrix multiplication.
7 1|G|gGφ1(g)aiφ2(g1)jb=0, so f1,f2G=0. Definitions of f1,f2, inner product Steps (5), (6) Step-combination direct for first version, use definitions of f1,f2 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 G, an algebraically closed field k whose characteristic does not divide the order of G. For functions f1,f2:Gk define:

f1,f2G=1|G|f1(g)f2(g1)

φ is an irreducible representation of degree n and a,i,j,b are all elements of {1,2,,n} (with the restriction that ).

Define:

f1(g):=φ(g)ai,f2(g):=φ(g)jb

To prove: If a=b and i=j (so f1 and f2 correspond to mutually transpose matrix entries), we have:

f1,f2G=1n

Otherwise, we have:

f1,f2G=0

Proof:

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

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 φ(g) is unitary, then:

φ(g)1=φ(g)T¯

In particular:

φ(g)jb1=φ(g)¯bj

Thus:

φ(g)aiφ(g1)jb=φ(g)aiφ(g)¯bj

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