Character theory
691741
225947840
2008-07-16T04:02:21Z
RobHar
1520818
/* References */ replace fulton-harris ref with template ref
:''This article refers to the use of the term character theory in mathematics, for the media studies definition see [[Character theory (Media)]].''
In [[mathematics]], more specifically in [[group theory]], the '''character''' of a [[group representation]] is a [[function (mathematics)|function]] on the [[group (mathematics)|group]] which associates to each group element the [[trace (linear algebra)|trace]] of the corresponding matrix.
The character carries the essential information about the representation in a more condensed form. [[Georg Frobenius]] initially developed [[representation theory of finite groups]] entirely based on the characters, and without any explicit matrix realization of representations themselves. This is possible because a complex representation of a finite group is determined (up to isomorphism) by its character. The situation with representations over a field of positive [[characteristic (algebra)|characteristic]] is more delicate, but [[Richard Brauer]] developed a powerful theory of characters in this case as well. Many deep theorems on the structure of finite groups use characters of [[modular representation theory|modular representations]].
== Applications ==
Characters of irreducible representations encode many important properties of a group and can thus be used to study its structure. Character theory is an essential tool in the [[classification of finite simple groups]]. Close to half of the proof of the [[Feit–Thompson theorem]] involves intricate calculations with character values. Easier, but still essential, results relying on character theory include the [[Burnside theorem]], and a theorem of [[Richard Brauer]] and [[Michio Suzuki]] stating that a finite [[simple group]] cannot have a generalized [[quaternion|quaternion group]] as its [[Sylow theorems|Sylow 2 subgroup]].
==Definitions==
Let ''V'' be a [[finite-dimensional]] [[vector space]] over a [[field (mathematics)|field]] ''F'' and let ρ:''G'' → GL(''V'') be a [[group representation|representation]] of a group ''G'' on ''V''. The '''character''' of ρ is the function χ<sub>ρ</sub>: ''G'' → ''F'' given by
:<math>\chi_{\rho}(g) = \mathrm{Tr}(\rho(g))\,</math>
where <math>\mathrm{Tr}</math> is the [[trace of a matrix|trace]].
A character χ<sub>ρ</sub> is called '''irreducible''' if ρ is an [[irreducible representation]]. It is called '''linear''' if the [[dimension of a representation|dimension]] of ρ is 1. The '''kernel''' of a character χ<sub>ρ</sub> is the set:
:<math>\ker \chi_{\rho} := \left \lbrace g \in G \mid \chi_{\rho}(g) = \chi_{\rho}(1) \right \rbrace </math>
where χ<sub>ρ</sub>(1) is the value of χ<sub>ρ</sub> on the group identity. If ρ is a representation of ''G'' of dimension ''k'' and 1 is the identity of ''G'' then
:<math>\chi_{\rho}(1) = \operatorname{Tr}(\rho(1)) = \operatorname{Tr} \begin{bmatrix}1 & & 0\\ & \ddots & \\ 0 & & 1\end{bmatrix} = \sum_{i = 1}^k 1 = k = \dim \rho</math>
Unlike the situation with the [[character group]], the characters of a group do not, in general, form a group themselves.
==Properties==
* Characters are [[class function]]s, that is, they each take a constant value on a given [[conjugacy class]].
* [[Isomorphic representation]]s have the same characters. If [[characteristic of a ring|char(''F'')]]=0, then representations are isomorphic if and only if they have the same character.
* If a representation is the direct sum of subrepresentations, then the corresponding character is the sum of the characters of those subrepresentations.
* If a character of the finite group ''G'' is restricted to a subgroup ''H'', then the result is also a character of ''H''.
* Every character value <math>\chi\ (g) </math> is a sum of n ''m''<sup>th</sup> [[roots of unity]], where n is the degree (that is, the dimension of the associated vector space) of the representation with character χ and m is the [[order (group theory)|order]] of g. In particular, when ''F'' is the field of complex numbers, every such character value is an [[algebraic integer]].
* If ''F'' is the field of complex numbers, and <math>\chi</math> is irreducible, then <math>[G:C_G(x)]\frac{\chi(x)}{\chi(1)} </math> is an [[algebraic integer]] for each ''x'' in ''G''.
* If ''F'' is [[algebraically closed]] and char(''F'') does not divide |[[order of a group|''G'']]|, then the number of irreducible characters of ''G'' is equal to the number of [[class number (group theory)|conjugacy classes]] of ''G''. Furthermore, in this case, the degrees of the irreducible characters are divisors of the order of ''G''.
===Arithmetic properties===
Let ρ and σ be representations of ''G''. Then the following identities hold:
:<math>\chi_{\rho \oplus \sigma} = \chi_\rho + \chi_\sigma</math>
:<math>\chi_{\rho \otimes \sigma} = \chi_\rho \cdot \chi_\sigma</math>
:<math>\chi_{\rho^*} = \overline {\chi_\rho}</math>
:<math>\chi_{{\scriptscriptstyle \rm{Alt}^2} \rho}(g) = \frac{1}{2} \left[
\left(\chi_\rho (g) \right)^2 - \chi_\rho (g^2) \right]</math>
:<math>\chi_{{\scriptscriptstyle \rm{Sym}^2} \rho}(g) = \frac{1}{2} \left[
\left(\chi_\rho (g) \right)^2 + \chi_\rho (g^2) \right]</math>
where <math>\rho \oplus \sigma</math> is the [[direct sum]], <math>\rho \otimes \sigma</math> is the [[tensor product]], <math>\rho^*\ </math> denotes the [[conjugate transpose]] of ρ, and '''Alt'''<sup>2</sup> is the [[exterior algebra|alternating product]] '''Alt'''<sup>2</sup> (ρ) = <math>\rho \wedge \rho</math> and '''Sym'''<sup>2</sup> is the [[symmetric square]], which is determined by
:<math>\rho \otimes \rho = \left(\rho \wedge \rho \right) \oplus \textrm{Sym}^2 \rho</math>.
==Character tables==
The irreducible complex characters of a finite group form a '''character table''' which encodes much useful information about the group ''G'' in a compact form. Each row is labelled by an irreducible character and the entries in the row are the values of that character on the representatives of the respective conjugacy class of ''G''. The columns are labelled by (representatives of) the conjugacy classes of ''G''. It is customary to label the first row by the trivial character, and the first column by (the conjugacy class of) the identity. The entries of the first column are the values of the irreducible characters at the identity, the [[degree (mathematics)|degree]]s of the irreducible characters. Characters of degree ''1'' are known as '''linear characters'''.
Here is the character table of <math>C_3 = \langle u \rangle</math>, the cyclic group with three elements and generator u:
{| class="wikitable"
|-
|
|(1)
|(u)
|(u<sup>2</sup>)
|-
|'''1'''
|1
|1
|1
|-
|χ<sub>1</sub>
|1
|ω
|ω<sup>2</sup>
|-
|χ<sub>2</sub>
|1
|ω<sup>2</sup>
|ω
|-
|}
where ω is a primitive third root of unity.
The character table is always square, because the number of irreducible representations is equal to the number of conjugacy classes. The first row of the character table always consists of 1s, and corresponds to the '''[[trivial representation]]''' (the 1-dimensional representation consisting of 1×1 matrices containing the entry 1).
===Orthogonality relations===
{{main|Schur orthogonality relations}}
The space of complex-valued class functions of a finite group G has a natural inner-product:
:<math>\left \langle \alpha, \beta\right \rangle := \frac{1}{ \left | G \right | }\sum_{g \in G} \alpha(g) \overline{\beta(g)}</math>
where <math>\overline{\beta(g)}</math> means the complex conjugate of the value of <math>\beta</math> on ''g''. With respect to this inner product, the irreducible characters form an orthonormal basis
for the space of class-functions, and this yields the orthogonality relation for the rows of the character
table:
:<math>\left \langle \chi_i, \chi_j \right \rangle = \begin{cases} 0 & \mbox{ if } i \ne j, \\ 1 & \mbox{ if } i = j. \end{cases}</math>
For <math>g, h \in G</math> the orthogonality relation for columns is as follows:
:<math>\sum_{\chi_i} \chi_i(g) \overline{\chi_i(h)} = \begin{cases} \left | C_G(g) \right |, & \mbox{ if } g, h \mbox{ are conjugate } \\ 0 & \mbox{ otherwise.}\end{cases}</math>
where the sum is over all of the irreducible characters <math>\chi_i</math> of ''G'' and the symbol <math>\left | C_G(g) \right |</math> denotes the order of the centralizer of <math>g</math>.
The orthogonality relations can aid many computations including:
* Decomposing an unknown character as a linear combination of irreducible characters.
* Constructing the complete character table when only some of the irreducible characters are known.
* Finding the orders of the centralizers of representatives of the conjugacy classes of a group.
* Finding the order of the group.
===Character table properties===
Certain properties of the group ''G'' can be deduced from its character table:
* The order of ''G'' is given by the sum of the squares of the entries of the first column (the degrees of the irreducible characters). More generally, the sum of the squares of the absolute values of the entries in any column gives the order of the centralizer of an element of the corresponding conjugacy class.
*All normal subgroups of ''G'' (and thus whether or not ''G'' is simple) can be recognised from its character table. The [[kernel]] of a character χ is the set of elements ''g'' in ''G'' for which χ(g) = χ(1); this is a normal subgroup of ''G''. Each normal subgroup of ''G'' is the intersection of the kernels of some of the irreducible characters of ''G''.
*The derived subgroup of ''G'' is the intersection of the kernels of the linear characters of ''G''. In particular, ''G'' is Abelian if and only if all its irreducible characters are linear.
*It follows, using some results of [[Richard Brauer]] from [[modular representation theory]], that the prime divisors of the orders of the elements of each conjugacy class of a finite group can be deduced from its character table (an observation of [[Graham Higman]]).
The character table does not in general determine the group [[up to]] [[group isomorphism|isomorphism]]: for example, the [[quaternion group]] ''Q'' and the [[dihedral group]] of 8 elements (''D''<sub>4</sub>) have the same character table. Brauer asked whether the character table, together with the knowledge of how the powers of elements of its conjugacy classes are distributed, determines a finite group up to isomorphism. In 1964, this was answered in the negative by [[E. C. Dade]].
The linear characters form a [[character group]], which has important [[number theory|number theoretic]] connections
==Induced characters and Frobenius reciprocity==
Th characters discussed in this section are assumed to be complex-valued. Let ''H'' be a subgroup of the finite group ''G''. Given a character χ of ''G'', let <math>\chi_H</math> denote its restriction to ''H.''
Let θ be a character of ''H''. [[Ferdinand Georg Frobenius]] showed how to define construct a character of ''G'' from θ, using what is now known as ''[[Frobenius reciprocity]]''. Since the irreducible
characters of ''G'' form an orthonormal basis for the space of complex-valued class functions of ''G'',
there is a unique class function <math>\theta^{G}</math> of ''G'' with the property that
:<math> \langle \theta^{G}, \chi \rangle = \langle \theta,\chi_H \rangle </math>
for each irreducible character
χ of ''G'' ( the leftmost inner product is for class functions of ''G'' and the rightmost inner product
is for class functions of ''H''). Since the restriction of a character of ''G'' to the subgroup ''H''
is again a character of ''H'', this definition makes it clear that <math>\theta^{G}</math> is a
non-negative integer combination of irreducible characters of ''G'', so is indeed a character of ''G.''
It is known as ''the character of G induced from'' θ. The defining formula of Frobenius reciprocity
can be extended to general complex-valued class functions.
Given a matrix representation ρ of ''H,'' Frobenius later gave an explicit way to construct a matrix representation of ''G,'' known as the representation [[induced representation|induced from]] ρ, and written analogously as <math>\rho^{G}</math>. This led to an alternative description of the induced
character <math>\theta^{G}</math>. This induced character vanishes on all elements of ''G'' which are
not conjugate to any element of ''H.'' Since the induced character is a class function of ''G'', it is only now necessary to describe its values on elements of ''H.'' Writing ''G'' as a disjoint union of right cosets
of ''H,'' say
:<math>G = Ht_1 \cup \ldots \cup Ht_n,</math>
and given an element ''h'' of ''H,'' the value
<math>\theta^{G}(h)</math> is precisely the sum of those <math>\theta(t_iht_i^{-1})</math> for which
the conjugate <math>t_iht_i^{-1}</math> is also in ''H.'' Because θ is a class function of ''H,'' this value does not depend on the particular choice of coset representatives.
This alternative description of the induced character sometimes allows explicit computation from relatively
little information about the embedding of ''H'' in ''G'', and is often useful for calculation of
particular character tables. When θ is the trivial character of ''H'', the induced character
obtained is known as the '''permutation character''' of ''G'' (on the cosets of ''H'').
The general technique of character induction and later refinements found numerous applications in finite group theory and elsewhere in mathematics, in the hands of mathematicians such as [[Emil Artin]], [[Richard Brauer]], [[Walter Feit]] and [[Michio Suzuki]], as well as Frobenius himself.
==Mackey decomposition==
Mackey decomposition was defined and explored by [[G. Mackey|George Mackey]] in the context of [[Lie groups]], but is a powerful tool in the character theory and representation theory of finite groups. Its basic form concerns the way a character (or module) induced from a subgroup ''H'' of a finite group ''G'' behaves on restriction back to a (possibly different) subgroup ''K'' of ''G'', and makes use of the decomposition of ''G'' into (''H'',''K'')-double cosets.
If
:<math> G = \bigcup_{t \in T} HtK </math>
is a disjoint union, and <math> \theta </math> is a complex class function of ''H'', then Mackey's formula states that
:<math>\left( \theta^{G}\right)_K = \sum_{ t \in T} \left([\theta^{t}]_{t^{-1}Ht \cap K}\right)^{K},</math>
where <math>\theta^{t}</math> is the class function of <math> t^{-1}Ht</math> defined by <math>\theta^{t}(t^{-1}ht)= \theta(h)</math> for each ''h'' in ''H''. There is a similar formula for the restriction of an induced module to a subgroup, which holds for representations over any ring, and has applications in a wide variety of algebraic and topological contexts.
Mackey decomposition, in conjunction with Frobenius reciprocity, yields a well-known and useful formula for the inner product of two class functions θ and ψ induced from respective subgroups ''H'' and ''K'', whose utility lies in the fact that it only depends on how conjugates of ''H'' and ''K'' intersect each other. The formula ( with its derivation) is:
:<math> \langle \theta^{G},\psi^{G} \rangle </math>
:<math> = \langle \left(\theta^{G}\right)_{K},\psi \rangle =
\sum_{ t \in T} \langle \left([\theta^{t}]_{t^{-1}Ht \cap K}\right)^{K},
\psi \rangle </math>
: <math> = \sum_{t \in T} \langle \left(\theta^{t} \right)_{t^{-1}Ht \cap K},
\psi_{t^{-1}Ht \cap K} \rangle </math>,
(where ''T'' is a full set of (''H'',''K'')- double coset representatives, as before). This formula is often used when θ and ψ are linear characters, in which case all the inner products appearing in the right hand sum are either 1 or 0, depending on whether or not the linear characters θ<sup>''t''</sup> and ψ have the same restriction to <math> t^{-1}Ht \cap K</math>. If θ and ψ are both trivial characters, then the inner product simplifies to |''T''|.
==Clifford's theorem==
'''Clifford's theorem''', proved by [[A. H. Clifford]] in 1935, yields information about the restriction of a complex irreducible character of a finite group ''G'' to a normal subgroup ''N.'' If μ is a complex character of ''N'', then for a fixed element ''g'' of ''G'', another character, <math>\mu^{(g)}</math>, of ''N'' may be constructed by setting
:<math>\mu^{(g)}(n) = \mu(gng^{-1})</math>
for all ''n'' in ''N''. The character <math>\mu^{(g)}</math> is irreducible if and only if μ is. Clifford's theorem states that if χ is a complex irreducible character of ''G,'' and μ is an irreducible character of ''N'' with
:<math>\langle \chi_N,\mu \rangle \neq 0,</math> then
:<math>\chi_N = e\left(\sum_{i=1}^{t} \mu^{(g_i)}\right), </math>
where ''e'' and ''t'' are positive integers, and each <math>g_i</math> is an element of ''G.'' The integers ''e'' and ''t'' both divide the index [''G'':''N''] . The integer ''t'' is the index of a subgroup of ''G'', containing ''N'', known as the '''inertial subgroup''' of μ. This is
:<math> \{ g \in G: \mu^{(g)} = \mu \}</math>
and is often denoted by
:<math>I_G(\mu).</math>
The elements <math>g_i</math> may be taken to be representatives of all the right cosets of the subgroup <math>I_G(\mu)</math> in ''G''.
In fact, the integer ''e'' divides the index
:<math>[I_G(\mu):N],</math>
though the proof of this fact requires some use of [[Issai Schur|Schur's]] theory of [[projective representation]]s.
The proof of Clifford's theorem is best explained in terms of modules ( and the module-theoretic version works for irreducible [[Modular representation theory| modular representations]]). Let ''F'' be a field, ''V'' be an irreducible ''F''[''G'']-module, ''V''<sub>''N''</sub> be its restriction to ''N'' and ''U'' be an irreducible ''F''[N]-submodule of ''V''<sub>N</sub>. For each ''g'' in ''G'', ''U''.''g'' is an irreducible ''F''[''N'']-submodule of ''V''<sub>''N''</sub>, and <math>\sum_{g \in G} U.g </math> is an ''F''[''G'']-submodule of <math>V</math>, so must be all of ''V'' by irreducibility. Now <math>V_N</math> is expressed as a sum of irreducible submodules, and this expression may be refined to a direct sum. The proof of the character-theoretic statement of the theorem may now be completed in the case <math> F = \mathbb{C} </math>. Let χ be the character of ''G'' afforded by ''V'' and μ be the character of ''N'' afforded by ''U''. For each ''g'' in ''G'', the <math>\mathbb{C}N</math>-submodule ''U''.''g'' affords the character <math>\mu^{(g)}</math> and <math>\langle \chi_N,\mu^{(g)}\rangle = \langle \chi_N^{(g)},\mu^{(g)}\rangle = \langle \chi_N,\mu \rangle </math>. The respective equalities follow because χ is a class-function of ''G'' and ''N'' is a normal subgroup. The integer ''e'' appearing in the statement of the theorem is this common multiplicity.
A corollary of Clifford's theorem, which is often exploited, is that the irreducible character χ appearing in the theorem is induced from an irreducible character of the inertial subgroup <math>I_G(\mu)</math>. If, for example, the irreducible character χ is '''primitive''' (that is, χ is not induced from any proper subgroup of ''G''), then <math>G = I_G(\mu)</math> and χ<sub>N</sub> = ''e''μ. A case where this property of primitive characters is used particularly frequently is when ''N'' is Abelian and χ is '''faithful''' (that is, its kernel contains just the identity element). In that case, μ is linear, ''N'' is represented by scalar matrices in any representation affording character χ and ''N'' is thus contained in the '''center''' of ''G'' (that is, the subgroup of ''G'' consisting of those elements which themselves commute with every element of ''G''). For example, if ''G'' is the symmetric group ''S''<sub>4</sub>, then ''G'' has a faithful complex irreducible character χ of degree ''3.'' There is an Abelian normal subgroup ''N'' of order ''4'' (a Klein ''4''-subgroup) which is not contained in the center of ''G''. Hence χ is induced from a character of a proper subgroup of ''G'' containing ''N.'' The only possibility is that χ is induced from a linear character of a Sylow ''2''-subgroup of ''G''.
Clifford's theorem has led to a branch of representation theory in its own right, now known as '''Clifford theory'''. This is particularly relevant to the representation theory of finite solvable groups, where normal
subgroups usually abound. For more general finite groups, Clifford theory often allows representation-theoretic questions to be reduced to questions about groups which are close (in a sense which can be made precise) to being simple.
==References==
* Lecture 2 of {{Fulton-Harris}}
* {{cite book | author=Isaacs, I.M. | title=Character Theory of Finite Groups | publisher=Dover | year=1994 | id=ISBN 0-486-68014-2}} Corrected reprint of the 1976 original, published by Academic Press.
* {{cite book | author=James, Gordon; and Liebeck, Martin | title=Representations and Characters of Groups (2nd ed.) | year=2001 | publisher=Cambridge University Press | id=ISBN 0-521-00392-X}}
* {{cite book | author=Jean-Pierre, Serre | title=Linear Representations of Finite Groups | publisher=Springer-Verlag | year=1977 | id=ISBN 0-387-90190-6}}
* http://planetmath.org/encyclopedia/Character.html
* [http://www.mpip-mainz.mpg.de/~gelessus/group.html Character Tables for chemically important point groups] - Lists most of the [[point group]]s and gives their character tables in notation used in [[Chemistry]].
[[Category:Representation theory of groups]]
[[de:Charaktertafel]]
[[fr:Caractère d'une représentation d'un groupe fini]]
[[it:Teoria dei caratteri]]
[[zh:特徵理論]]