Character orthogonality theorem: Difference between revisions
No edit summary |
|||
| Line 77: | Line 77: | ||
* [[Column orthogonality theorem]] | * [[Column orthogonality theorem]] | ||
* [[Character determines representation in characteristic zero]] | * [[Character determines representation in characteristic zero]] | ||
==Facts used== | |||
# [[uses::Schur's lemma]] | |||
==Proof== | |||
The proof is somewhat hard to directly do in its most general case, so we proceed in steps: | |||
* We first handle the case of an [[algebraically closed field]] and the ''bilinear'' version. (''This is where most of the hard work happens'') | |||
* 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 over an algebraically closed field=== | |||
'''Given''': A finite group <math>G</math>, an algebraically closed field <math>k</math> whose characteristic does not divide the order of <math>G</math>. For functions <math>f_1,f_2: G \to k</math> define: | |||
<math>\langle f_1, f_2 \rangle_G = \frac{1}{|G|} f_1(g)f_2(g^{-1})</math> | |||
<math>\chi_1,\chi_2</math> are characters of inequivalent irreducible representations of <math>G</math> over <math>k</math>. | |||
'''To prove''': <math>\langle \chi_1, \chi_1 \rangle_G = 1</math> and <math>\langle \chi_1, \chi_2 \rangle_G = 0</math>. | |||
'''Proof''': Let <math>\varphi_1</math> be an irreducible representation with character <math>\chi_1</math> and <math>\varphi_2</math> be an irreducible representation with character <math>\chi_2</math>. Suppose the degree of <math>\varphi_1</math> is <math>m</math> and the degree of <math>\varphi_2</math> is <math>n</math>. | |||
We first tackle the case of <math>\langle \chi_1,\chi_2\rangle_G</math>. | |||
{| class="sortable" border="1" | |||
! Step no. !! Assertion/construction !! Facts used !! Given data used !! Previous steps used !! Explanation | |||
|- | |||
| 1 || Denote by <math>E_{ij}</math> the <math>m \times n</math> matrix with a 1 in the <math>ij^{th}</math> entry and 0s elsewhere. We allow <math>1 \le i \le m, 1 \le j \le n</math> || -- || -- || -- || -- | |||
|- | |||
| 2 || Define <math>F_{ij} = \frac{1}{|G|} \sum_{g \in G} \varphi_1(g)E_{ij}\varphi_2(g^{-1})</math>. <math>F_{ij}</math> is a <math>m \times n</math> matrix. || || <math>\varphi_1</math> has degree <math>m</math>, <math>\varphi_2</math> has degree <math>n</math>, so the matrix multiplication makes sense. || Step (1) || -- | |||
|- | |||
| 3 || <math>F_{ij}</math> is a [[homomorphism of representations]] from <math>\varphi_2</math> to <math>\varphi_1</math> || || || Step (2) || {{fillin}} | |||
|- | |||
| 4 || <math>F_{ij}</math> is the zero matrix. || Fact (1) (note that the roles of <math>\varphi_1, \varphi_2</math> are interchanged from the statement of Fact (1))|| <math>\varphi_1, \varphi_2</math> are inequivalent irreducible representations. || Step (3) || | |||
|- | |||
| 5 || The <math>(ij)^{th}</math> entry of <math>F_{ij}</math> is zero. || || || Step (4) || | |||
|- | |||
| 6 || The <math>(ij)^{th}</math> entry of <math>F_{ij}</math> equals <math>\frac{1}{|G|} \sum_{g \in G} \varphi_1(g)_{ii}\varphi_2(g^{-1})_{jj}</math>. || || || Step (2) || Follows by simplifying the matrix multiplication. | |||
|- | |||
| 7 || <math>\frac{1}{|G|} \sum_{g \in G} \varphi_1(g)_{ii}\varphi_2(g^{-1})_{jj} = 0</math> for <math>1 \le i \le m, 1 \le j \le n</math>. || || || Steps (5), (6) || | |||
|- | |||
| 8 || <math>\frac{1}{|G|} \sum_{g \in G} \chi_1(g)\chi_2(g^{-1}) = 0</math> || || <math>\chi_1, \chi_2</math> are the characters of <math>\varphi_1,\varphi_2</math> respectively. || Step (7) || Double sum Step (7) for <math>1 \le i \le m</math> and <math>1 \le j \le n</math>. Now use that <math>\chi_1(g) = \sum_{i=1}^m \varphi_1(g)_{ii}</math> and <math>\chi_2(g^{-1}) = \sum_{j=1}^n \varphi_2(g^{-1})_{jj}</math>. | |||
|} | |||
Revision as of 16:18, 13 July 2011
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 be a finite group and denote the field of complex numbers. Let denote the complex conjugate of . Then, if and are two inequivalent irreducible linear representations, and and are their characters, we have:
and:
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 . This is a -vector space in a natural way, with basis being the indicator functions of elements of . Consider the Hermitian inner product on this vector space given by:
Then, the characters form an orthonormal set of functions with respect to this basis. In other words, if are the characters of inequivalent irreducible representations, we get:
and
Statement over general fields
Let be a finite group and a field whose characteristic does not divide the order of . Let and be two inequivalent irreducible linear representations of over and let and denote their characters. Then, the following are true:
And:
where if the field is a splitting field for (for instance, if is sufficiently large for , viz., contains all the roots of where is the exponent of ).
When is not a splitting field, is the number of irreducible constituents (with multiplicities) of when taken over a splitting field containing .
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 , define the following inner product:
Then, if are the characters of inequivalent irreducible representations, we get:
where if is a splitting field for . In general, where are the multiplicites of pairwise distinct irreducible constituents of . Also:
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 ) 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.
Consequences
- Orthogonal projection formula: This is a formula that uses the character of a finite-dimensional representation to determine the irreducible constituents of the representation and their multiplicities.
- Column orthogonality theorem
- Character determines representation in characteristic zero
Facts used
Proof
The proof is somewhat hard to directly do in its most general case, so we proceed in steps:
- We first handle the case of an algebraically closed field and the bilinear version. (This is where most of the hard work happens)
- 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 over an algebraically closed field
Given: A finite group , an algebraically closed field whose characteristic does not divide the order of . For functions define:
are characters of inequivalent irreducible representations of over .
To prove: and .
Proof: Let be an irreducible representation with character and be an irreducible representation with character . Suppose the degree of is and the degree of is .
We first tackle the case of .
| 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. We allow | -- | -- | -- | -- |
| 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 | for . | Steps (5), (6) | |||
| 8 | are the characters of respectively. | Step (7) | Double sum Step (7) for and . Now use that and . |