Character orthogonality theorem

From Groupprops
(Redirected from Row orthogonality theorem)

This fact is related to: linear representation theory
View other facts related to linear representation theory | View terms related to linear representation theory

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

Name

This result is known as the first orthogonality theorem, character orthogonality theorem or row orthogonality theorem.

Statement

Statement over complex numbers

Let G be a finite group and C denote the field of complex numbers. Let z¯ denote the complex conjugate of z. Then, if φ1 and φ2 are two inequivalent irreducible linear representations, and χ1 and χ2 are their irreducible characters, we have:

gGχ1(g)χ2(g)¯=0

and:

gGχ1(g)χ1(g)¯=|G|

Statement over complex numbers in terms of inner product of class functions

For information on the Hermitian inner product, see Inner product of functions#Hermitian inner product over the complex numbers

Consider the space of complex-valued functions GC. This is a C-vector space in a natural way, with basis being the indicator functions of elements of G. Consider the Hermitian inner product on this vector space given by:

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

Then, the characters form an orthonormal set of functions with respect to this basis. In other words, if χ1,χ2 are the characters of inequivalent irreducible representations, we get:

χ1,χ1=1

and

χ1,χ2=0

Statement over general fields

Let G be a finite group and k a field whose characteristic does not divide the order of G. Let φ1 and φ2 be two inequivalent irreducible linear representations of G over k and let χ1 and χ2 denote their characters. Then, the following are true:

gGχ1(g)χ2(g1)=0

And:

gGχ1(g)χ1(g1)=d|G|

where d=1 if the field k is a splitting field for G (for instance, if k is sufficiently large for G, viz., contains all the mth roots of 1 where m is the exponent of G).

When k is not a splitting field, d is the number of irreducible constituents (with multiplicities) of χ1 when taken over a splitting field containing k.

Statement over general fields in terms of inner product of class functions

For more on this inner product definition, see Inner product of functions#Bilinear form

For functions f1,f2:Gk, define the following inner product:

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

Then, if χ1,χ2 are the characters of inequivalent irreducible representations, we get:

χ1,χ1=d

where d=1 if k is a splitting field for G. In general, d=d12+d22++dr2 where d1,d2,,dr are the multiplicites of pairwise distinct irreducible constituents of χ1. Also:

χ1,χ2=0

Interpretation in characteristic zero and prime characteristic

In characteristic zero, both sides are being viewed as elements in a field of characteristic zero.

In prime characteristic, however, the inner product is taking values modulo the prime characteristic, hence is not actually an integer, whereas the right side (1, 0, or d) is an integer, which needs to be reduced modulo the prime to be interpreted on the other side.

Relation between the Hermitian inner product and the bilinear inner product

See inner product of functions#Relation between the definitions. The upshot is that both inner products are different but it does not matter if the input functions are characters.

Related facts

Consequences

Similar facts

Facts used

  1. Schur's lemma
  2. Trace of inverse is complex conjugate of trace

Proof

The proof is somewhat hard to directly do in its most general case, so we proceed in steps:

  • Hard step: We first prove the orthogonality of distinct irreducible characters with the bilinear version.
  • Hard step: Next, we handle the normality in case of an algebraically closed field and the bilinear version.
  • We also note that for the complex numbers, the statement for the bilinear version implies the statement for the Hermitian version.
  • We then note that since any splitting field embeds inside an algebraically closed field, and the representations do not split further, the result remains valid in any splitting field.
  • Finally, we tackle the case of a non-splitting field.

Proof of orthogonality of distinct irreducible characters

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 characters of inequivalent irreducible representations φ1,φ2 of G over k. The degree of φ1 is m and the degree of φ2 is n.

To prove: χ1,χ2G=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. We allow 1im,1jn -- -- -- --
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 (ij)th entry of Fij is zero. Step (4)
6 The (ij)th entry of Fij equals 1|G|gGφ1(g)iiφ2(g1)jj. Step (2) Follows by simplifying the matrix multiplication.
7 1|G|gGφ1(g)iiφ2(g1)jj=0 for 1im,1jn. Steps (5), (6)
8 1|G|gGχ1(g)χ2(g1)=0 χ1,χ2 are the characters of φ1,φ2 respectively. Step (7) [SHOW MORE]

Proof of normality of characters when the field is algebraically closed

For simplicity, we drop the subscript 1 when referring to the character and simply call it χ.

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 the character of an irreducible linear representation φ of G over k. Suppose the degree of φ is n.

To prove: χ,χG=1.

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. We allow 1in,1jn -- -- -- --
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 (ij)th entry of Fij is zero if ij and equals 1/n if i=j. Step (6) [SHOW MORE]
8 The (ij)th entry of Fij equals 1|G|gGφ(g)iiφ(g1)jj. Step (2) Follows by simplifying the matrix multiplication.
9 We have 1|G|φ(g)iiφ(g1)jj=1/n if i=j and 1|G|φ(g)iiφ(g1)jj=0 if ij Steps (7), (8) Step-combination direct
10 1|G|gGχ(g)χ(g1)=1 χ is the character of φ. Step (9) [SHOW MORE]

For the Hermitian inner product over the complex numbers

The Hermitian inner product coincides with the bilinear form when both inputs are characters. See trace of inverse is complex conjugate of trace.

Case of a splitting field

Suppose k is a splitting field for G but is not necessarily algebraically closed. Consider the algebraic closure k¯. Because k is a splitting field for G, all the irreducible representations over k¯ are in fact realized inside k, and in particular any irreducible representation of k remains irreducible over k¯.

We can thus prove the statement about normality over k¯, and then note that the inner product remains the same when we restrict to a subfield.

Case of a non-splitting field

The orthogonality result continues to hold (because the proof does not use any assumptions about the field).

We need to show the analogue of normality. This basically just follows by writing the decomposition over a splitting field and then using the bilinearity of the bilinear form and simplifying. PLACEHOLDER FOR INFORMATION TO BE FILLED IN: [SHOW MORE]