Character determines representation in characteristic zero: Difference between revisions

From Groupprops
(Created page with "==Statement== Suppose <math>G</math> is a finite group and <math>K</math> is a field of characteristic zero. Then, the character of any finite-dimensional representa...")
 
 
(4 intermediate revisions by the same user not shown)
Line 2: Line 2:


Suppose <math>G</math> is a [[finite group]] and <math>K</math> is a [[field]] of characteristic zero. Then, the [[character]] of any finite-dimensional representation of <math>G</math> over <math>K</math> completely determines the representation, i.e., no two inequivalent finite-dimensional representations can have the same character.
Suppose <math>G</math> is a [[finite group]] and <math>K</math> is a [[field]] of characteristic zero. Then, the [[character]] of any finite-dimensional representation of <math>G</math> over <math>K</math> completely determines the representation, i.e., no two inequivalent finite-dimensional representations can have the same character.
Note that <math>K</math> does not need to be a [[splitting field]].


==Related facts==
==Related facts==
===Opposite facts===


* [[Character does not determine representation in any prime characteristic]]: The problem is that we can construct representations whose character is identically zero simply by adding <math>p</math> copies of an irreducible representation to itself.
* [[Character does not determine representation in any prime characteristic]]: The problem is that we can construct representations whose character is identically zero simply by adding <math>p</math> copies of an irreducible representation to itself.
===Applications===
* [[Equivalent linear representations of finite group over field are equivalent over subfield in characteristic zero]]


==Facts used==
==Facts used==


# [[uses::Character orthogonality theorem]]
# [[uses::Maschke's averaging lemma]]
# [[uses::Orthogonal projection formula]]
# [[uses::Orthogonal projection formula]]
==Proof==
'''Given''': A group <math>G</math>, two linear representations <math>\rho_1, \rho_2</math> of <math>G</math> with the same character <math>\chi</math> over a field <math>K</math> of characteristic zero.
'''To prove''': <math>\rho_1</math> and <math>\rho_2</math> are equivalent as linear representations.
'''Proof''': By Fact (2), both <math>\rho_1</math> and <math>\rho_2</math> are completely reducible, and are expressible as sums of irreducible representations. Suppose <math>\varphi_1,\varphi_2,\dots,\varphi_s</math> is a collection of distinct irreducible representations obtained as the union of all the representations occurring in a decomposition of <math>\rho_1</math> into irreducible representations and a decomposition of <math>\rho_2</math> into irreducible representations. In other words, there are nonnegative integers <math>a_{11}, a_{12},\dots, a_{1s}, a_{21}, a_{22}, \dots, a_{2s}</math> such that:
<math>\rho_1 \cong a_{11}\varphi_1 \oplus a_{12}\varphi_2 \oplus \dots \oplus a_{1s}\varphi_s</math>
and
<math>\rho_2 \cong a_{21}\varphi_1 \oplus a_{22}\varphi_2 \oplus \dots \oplus a_{2s}\varphi_s</math>
Let <math>\chi_i</math> denote the character of <math>\varphi_i</math> and denote by <math>m_i</math> the value <math>\langle \chi_i, \chi_i\rangle_G</math> (note: this would be 1 if <math>K</math> were a splitting field, and in general it is the sum of squares of multiplicities of irreducible constituents over a splitting field).
{| class="sortable" border="1"
! Step no. !! Assertion/construction !! Facts used !! Given data used !! Previous steps used !! Explanation
|-
| 1 || <math>m_ia_{1i} = \langle \chi, \chi_i \rangle_G</math> and <math>m_1a_{2i} = \langle \chi, \chi_i \rangle_G</math> for each <math>1 \le i \le s</math> || Fact (3) || || || Direct application of fact
|-
| 2 ||<math>a_{1i} = \frac{1}{m}\langle \chi,\chi_i \rangle_G</math> and <math>a_{2i} = \frac{1}{m} \langle \chi, \chi_i \rangle_G</math> for each <math>1 \le i \le s</math> || || <math>K</math> has characteristic zero, so the manipulation makes sense || Step (1) ||
|-
| 3 || <math>a_{1i} = a_{2i}</math> for each <math>1 \le i \le s</math> || || <math>K</math> has characteristic zero || Step (2) || <toggledisplay>Note that if <math>K</math> had characteristic <math>p</math>, we could only conclude equality modulo <math>p</math>, and not equality as nonnegative integers.</toggledisplay>
|-
| 4 || <math>\rho_1</math> and <math>\rho_2</math> are equivalent || || || Step (3) ||
|}

Latest revision as of 14:07, 21 July 2011

Statement

Suppose is a finite group and is a field of characteristic zero. Then, the character of any finite-dimensional representation of over completely determines the representation, i.e., no two inequivalent finite-dimensional representations can have the same character.

Note that does not need to be a splitting field.

Related facts

Opposite facts

Applications

Facts used

  1. Character orthogonality theorem
  2. Maschke's averaging lemma
  3. Orthogonal projection formula

Proof

Given: A group , two linear representations of with the same character over a field of characteristic zero.

To prove: and are equivalent as linear representations.

Proof: By Fact (2), both and are completely reducible, and are expressible as sums of irreducible representations. Suppose is a collection of distinct irreducible representations obtained as the union of all the representations occurring in a decomposition of into irreducible representations and a decomposition of into irreducible representations. In other words, there are nonnegative integers such that:

and

Let denote the character of and denote by the value (note: this would be 1 if were a splitting field, and in general it is the sum of squares of multiplicities of irreducible constituents over a splitting field).

Step no. Assertion/construction Facts used Given data used Previous steps used Explanation
1 and for each Fact (3) Direct application of fact
2 and for each has characteristic zero, so the manipulation makes sense Step (1)
3 for each has characteristic zero Step (2) [SHOW MORE]
4 and are equivalent Step (3)