Character orthogonality theorem: Difference between revisions

From Groupprops
No edit summary
m (3 revisions)
(No difference)

Revision as of 23:14, 7 May 2008

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

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

Statement

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 sufficiently large field for G (viz contains all the mth roots of 1 where m is the exponent of G).

When k is not sufficiently large, d is the number of irreducible constituents of ϕ when taken over a sufficiently large field containing k.

In terms of inner product of class functions

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

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

Then, the character orthogonality theorem states that the characters of irreducible linear representations form an orthogonal set of elements, and further, if we are working over a sufficiently large field, they form an orthonormal set.

Note that by Maschke's lemma, the irreducible linear representations are precisely the indecomposable linear representations when the characteristic of k does not divide the order of G, so we can replace irreducible in the above statement with indecomposable.

Consequences