Section 0 Introduction

Representation theory began with an observation by Dedekind. For a finite abelian group 𝐺 and formal variables π‘₯𝑔 for π‘”βˆˆπΊ, define a |𝐺|Γ—|𝐺| matrix 𝑋𝐺 by defining the entry at row 𝑔 column β„Ž to be π‘₯π‘”β‹…β„Ž. Dedekind computed its determinant det𝑋𝐺 for various abelian groups and observed that it can always be factored into linear factors.

He then wrote a letter to Frobenius to ask for a proof. Frobenius then studied this behaviour for abelian and non-abelian groups, and gave a proof as well as a generalization to non-abelian groups:

THM 0.1
  • Suppose 𝐺 is a finite abelian group. Then

    det𝑋𝐺=βˆπœ’:𝐺→ℂ×(βˆ‘π‘”βˆˆπΊπœ’(𝑔)π‘₯𝑔),

    where the product is over all group homomorphisms πœ’:𝐺→ℂ×. Such a homomorphism is called a group character.

  • Suppose 𝐺 is a finite group, not necessarily abelian. Then

    det𝑋𝐺=βˆπ‘—=1π‘Ÿπ‘π‘—(π‘₯)deg𝑝𝑗,

    where 𝑝𝑗 are pairwise non-proportional irreducible polynomials and π‘Ÿ is the number of conjugacy classes of 𝐺.

This marks the beginning of representation theory.

Section 1 Basic Notions of Representation Theory

Throughout this section π‘˜ will denote a general field as the base field.

1.1 Representation of Algebras

1.1.1 Associative Algebras

An (associative) algebra over π‘˜ is a vector space over π‘˜ equipped with a bilinear associative multiplication with unit. An associative algebra is called commutative if the multiplication is commutative. An (algebra) homomorphism is a linear map between algebras that preserves multiplication and unit.

EX 1.1
  • If 𝑉 is a vector space, then 𝐴=GL(𝑉) is an algebra, where multiplication is composition.

  • 𝐴=π‘˜βŸ¨π‘₯1,β‹―,π‘₯π‘›βŸ©, the free algebra over π‘˜, is generated by π‘₯1,β‹―,π‘₯𝑛 with no relations.

  • For a group 𝐺, the group algebra 𝐴=π‘˜[𝐺] has basis {π‘Žπ‘”:π‘”βˆˆπΊ} and multiplication defined by π‘Žπ‘”β‹…π‘Žβ„Ž=π‘Žπ‘”β‹…β„Ž.

A left / right ideal of an algebra is a vector subspace πΌβŠ†π΄ such that for every π‘Žβˆˆπ΄, π‘ŽπΌβŠ†πΌ / πΌπ‘ŽβŠ†πΌ. A (two-sided) ideal is a subspace that is both a left ideal and a right ideal. If 𝐼 is an ideal, we can form the quotient algebra 𝐴/𝐼={π‘Ž+𝐼:π‘Žβˆˆπ΄}, with the quotient (algebra) homomorphism πœ‹:𝐴→𝐴/𝐼,π‘Žβ†¦π‘Ž+𝐼. The ideal generated by a subset 𝑆 is denoted βŸ¨π‘†βŸ©.

An algebra can be generated by generators and relations. Let π‘˜βŸ¨π‘₯1,β‹―,π‘₯π‘›βŸ© be the free algebra, and 𝑓1,β‹―,π‘“π‘šβˆˆπ‘˜βŸ¨π‘₯1,β‹―,π‘₯π‘›βŸ© be the relations; then 𝐴=π‘˜βŸ¨π‘₯1,β‹―,π‘₯π‘›βŸ©/βŸ¨π‘“1,β‹―,π‘“π‘šβŸ© is called the algebra generated by π‘₯1,β‹―,π‘₯𝑛 subject to the relations 𝑓1,β‹―,π‘“π‘š.

1.1.2 Representations

DEF 1.2
A representation of an associative algebra 𝐴, also called a left 𝐴-module, is a vector space 𝑉 with an algebra homomorphism πœŒπ‘‰:𝐴→End(𝑉). We denote πœŒπ‘‰(π‘Ž)(𝑣) by π‘Žβ‹…π‘£.
EX 1.3
  • 𝑉=𝐴 itself can be made into a representation, by defining πœŒπ‘‰(π‘Ž) to be the left multiplication by π‘Ž. This is called the regular representation.

  • If 𝐴=π‘˜βŸ¨π‘₯1,β‹―,π‘₯π‘›βŸ©, then a representation of 𝐴 is equivalent to a vector space 𝑉 with 𝑛 linear operators (in correspondence to the variables π‘₯𝑖).

A representation is called faithful if πœŒπ‘‰ is injective.

A subrepresentation of 𝑉 is a subspace π‘ŠβŠ†π‘‰, such that πœŒπ‘‰(π‘Š)βŠ†π‘Š. A representation is called irreducible or simple if its only subrepresentations is 0 and itself.

If 𝑉1 and 𝑉2 are two representations, a (representation) homomorphism 𝑉1→𝑉2 is a linear map πœ‘:𝑉1→𝑉2 such that πœ‘(π‘Žβ‹…π‘£)=π‘Žβ‹…πœ‘(𝑣) for all π‘Žβˆˆπ΄ and π‘£βˆˆπ‘‰1. πœ‘ is called a isomorphism if it’s an isomorphism of vector spaces. In this case, 𝑉1 is isomorphic to 𝑉2.

If 𝑉1 and 𝑉2 are two representations, we can make their direct sum 𝑉1βŠ•π‘‰2 into a representation by π‘Žβ‹…(𝑣1βŠ•π‘£2)=(π‘Žβ‹…π‘£1)βŠ•(π‘Žβ‹…π‘£2). This is called the direct sum of representations. A representation 𝑉 is called indecomposable if it’s not isomorphic to a direct sum.

By definition irreducible representations are indecomposable; the converse is in general not true. The basic questions of representation theory is then the classification of irreducible and indecomposable representations.

PROP 1.4

Suppose 𝑉1 and 𝑉2 are two representations of 𝐴, πœ‘ is a non-zero representation homomorphism 𝑉1→𝑉2.

  • If 𝑉1 is irreducible, then πœ‘ is injective.
  • If 𝑉2 is irreducible, then πœ‘ is surjective.
  • If 𝑉1 and 𝑉2 are both irreducible, then πœ‘ is an isomorphism.
COR 1.5

If π‘˜ is additionally algebraically closed and 𝑉 is a finite dimensional irreducible representation of 𝐴, then all representation homomorphisms 𝑉→𝑉 are scalar multiplications.

If π‘˜ is algebraically closed and 𝐴 is additionally commutative, then every irreducible representation of 𝐴 is 1-dimensional.

EX 1.6
  • 𝐴=π‘˜βŸ¨π‘₯⟩ where π‘˜ is algebraically closed. Since 𝐴 is commutative, irreducible representations of 𝐴 are 𝑉=π‘˜ and πœŒπ‘‰(π‘₯)=πœ† for some πœ†βˆˆπ‘˜.

    A representation of 𝐴 is a vector space with a linear operator; therefore, indecomposable representations of 𝐴 are linear operators that has only one Jordan block.

  • 𝐴=π‘˜[𝐺] for some group 𝐺. A representation of 𝐴 is a vector space 𝑉 with a homomorphism 𝐺→GL(𝑉); such a homomorphism is called a representation of the group 𝐺.

1.2 Representation of Quivers

A quiver is a directed graph, possibly with self-loops and parallel edges. For an edge β„Ž pointing from β„Žβ€² to β„Žβ€³, β„Žβ€² is called the source and β„Žβ€³ is called the target. The source of β„Ž will always be denoted β„Žβ€², and the target will always be denoted β„Žβ€³.

A representation of a quiver 𝑄 is an assignment to every vertex 𝑔 a vector space π‘‰π‘˜ and to every edge β„Žβ€²β†’β„Žβ€³ a linear map π‘‰β„Žβ€²β†’π‘‰β„Žβ€³.

For a quiver 𝑄 with finitely many vertices, we can define its path algebra 𝑃𝑄, generated by the set of paths1 in 𝑄, and multiplication given by path concatenation, zero if two paths cannot be concatenated.

At each vertex 𝑖, there is a trivial path 𝑝𝑖, consisting of only one vertex, 𝑖 itself. If 𝑄 has finitely many vertices, then the unit of the path algebra 𝑃𝑄 is 1=βˆ‘vertex𝑖𝑝𝑖.

PROP 1.7
A representation of a quiver 𝑄 is the same as a representation of its path algebra 𝑃𝑄.

1.3 Representation of Lie Algebras

For introductory materials on Lie algebras and their representations, we refer to the Lie Groups and Lie Algebras course notes.

A representation of a Lie algebra 𝔀 is a Lie algebra homomorphism 𝜌:𝔀→𝔀𝔩(𝑉).

EX 1.8 adjoint representation
If 𝑉=𝔀, then 𝜌:𝔀→𝔀𝔩(𝑉), π‘₯↦[π‘₯,βˆ’] is a Lie algebra representation, called the adjoint representation. This 𝜌 is usually denoted ad, and adπ‘₯(𝑦)=[π‘₯,𝑦].

Let 𝔀 be a Lie algebra, with basis {π‘₯1,β‹―,π‘₯𝑛}. Suppose [π‘₯𝑖,π‘₯𝑗]=βˆ‘π‘π‘–π‘—π‘˜π‘₯π‘˜, where π‘π‘–π‘—π‘˜βˆˆπ‘˜ are called the structure constants. The universal enveloping algebra, 𝒰︀(𝑔), is the associative algebra generated by π‘₯1,β‹―,π‘₯𝑛 subject to relations π‘₯𝑖π‘₯π‘—βˆ’π‘₯𝑗π‘₯𝑖=βˆ‘π‘π‘–π‘—π‘˜π‘₯π‘˜. Representations of a Lie algebra are the same as representations of its universal enveloping algebra.

THM 1.9
The ordered monomials π‘₯1𝑑1β‹―π‘₯𝑛𝑑𝑛 with π‘‘π‘–βˆˆβ„€β©Ύ0 form a basis of 𝒰︀(𝑔).

If 𝑉 and π‘Š are representations of 𝔀, then we can form a Lie algebra representation on π‘‰βŠ—π‘Š, the tensor representation, by

πœŒπ‘‰βŠ—π‘Š:𝔀→𝔀𝔩(π‘‰βŠ—π‘Š),π‘₯β†¦πœŒπ‘‰(π‘₯)βŠ—idβˆ’idβŠ—πœŒπ‘Š(π‘₯),

and a representation on the dual space π‘‰βˆ—, the dual representation, by

πœŒπ‘‰βˆ—(π‘₯):𝔀→𝔀𝔩(π‘‰βˆ—),π‘₯β†¦βˆ’πœŒπ‘‰(π‘₯)⊀,

⊀ denoting adjoint. The form of these representations are deduced from the tensor and dual representation of its corresponding Lie group representation.

1.4 Example: Representations of 𝔰𝔩2

Suppose 𝔰𝔩2 is the special linear Lie algebra over β„‚. 𝔰𝔩2 has a basis

𝑒=(010), β„Ž=(1βˆ’1), 𝑓=(010),

with relations

[β„Ž,𝑒]=2𝑒, [β„Ž,𝑓]=βˆ’2𝑓, [𝑒,𝑓]=β„Ž.

Therefore, a representation of 𝔰𝔩2 is the same as a vector space 𝑉 over β„‚ with three linear operators 𝐸, 𝐹, 𝐻, satisfying π»πΈβˆ’πΈπ»=2𝐸, π»πΉβˆ’πΉπ»=βˆ’2𝐹, πΈπΉβˆ’πΉπΈ=𝐻. We now discuss its finite dimensional irreducible representations.

Step 1. Pick an eigenvalue of 𝐻 with largest real part, and denote 𝑉(πœ†) its generalized eigenspace, 𝑉(πœ†)={π‘£βˆˆπ‘‰:(π»βˆ’πœ†πΌ)𝑛𝑣=0for some𝑛⩾0}. Since (π»βˆ’(πœ†+2)𝐼)𝐸=𝐸(π»βˆ’πœ†πΌ), we have (π»βˆ’(πœ†+2)𝐼)𝑛𝐸=𝐸(π»βˆ’πœ†πΌ)𝑛; therefore, for every π‘£βˆˆπ‘‰(πœ†), πΈπ‘£βˆˆπ‘‰(πœ†+2). But πœ† has the largest real part, so 𝐸|𝑉(πœ†)=0.

Step 2. Let 𝑃𝑛(π‘₯)=𝑛!π‘₯(π‘₯βˆ’1)β‹―(π‘₯βˆ’π‘›+1). By induction, if π‘€βˆˆπ‘‰ such that 𝐸𝑀=0, then for any 𝑛>0, 𝐸𝑛𝐹𝑛𝑀=𝑃𝑛(𝐻)𝑀.

Step 3. If π‘£βˆˆπ‘‰(πœ†), then by a similar argument as Step 1, 𝐹𝑣=𝑉(πœ†βˆ’2), so πΉπ‘›π‘£βˆˆπ‘‰(πœ†βˆ’2𝑛). Since dim𝑉<∞, 𝐻 has only finitely many eigenvalues; therefore, for some 𝑁, 𝑉(πœ†βˆ’2𝑁)=0, so 𝐹𝑁𝑣=0 for π‘£βˆˆπ‘‰(πœ†).

Step 4. By Step 2, 𝐸𝑁𝐹𝑁|𝑉(πœ†)=0=𝑃𝑁(𝐻)|𝑉(πœ†). As 𝑃𝑁 has no multiple roots, this tells us that 𝐻 is diagonalizable on 𝑉(πœ†); therefore, 𝑉(πœ†) is the eigenspace of πœ†, 𝑉(πœ†)={π‘£βˆˆπ‘‰:𝐻𝑣=πœ†π‘£}.

Step 5. Suppose π‘£βˆˆπ‘‰(πœ†). Let 𝑁 be the smallest integer such that 𝐹𝑁𝑣=0. By induction πΈπΉπ‘˜π‘£=π‘˜πΉπ‘˜βˆ’1π»π‘£βˆ’(π‘˜βˆ’1)π‘˜πΉπ‘˜βˆ’1𝑣=π‘˜(πœ†βˆ’π‘˜+1)πΉπ‘˜βˆ’1𝑣; let π‘˜=𝑁, then 𝐸𝐹𝑁𝑣=0 but πΉπ‘βˆ’1𝑣≠0. Therefore, 𝑁(πœ†βˆ’π‘+1)=0, so πœ†=π‘βˆ’1.

Step 6. Therefore, for any positive integer 𝑁, there is an irreducible representation of 𝔰𝔩2 with basis

𝑣0=𝑣, 𝑣1=𝐹𝑣, 𝑣2=𝐹2𝑣2!, β‹―, π‘£π‘βˆ’1=πΉπ‘βˆ’1𝑣(π‘βˆ’1)!,

with actions

and this representation is denoted π‘‰πœ† where πœ†=π‘βˆ’1; moreover they are all irreducible representations of 𝔰𝔩2.

Section 2 General Results on Representation Theory

From here on we will assume that the base field π‘˜ is an algebraically closed field.

2.1 Semisimple Representations

DEF 2.1
A representation 𝑉 of 𝐴 is called semisimple if it is the direct sum of some irreducible representations.
EX 2.2
If 𝑉 is an irreducible representation of 𝐴 and πœŒπ‘‰:𝐴→End(𝑉), then the vector space End(𝑉) can be made into a representation of 𝐴 by π‘Žβ‹…π΄=πœŒπ‘£(π‘Ž)𝐴 for 𝐴∈End(𝑉). End(𝑉) is (representation) isomorphic to π‘‰βŠ•π‘› where 𝑛=dim𝑉, so End(𝑉) is a semisimple representation of 𝐴.

Let us denote π‘‰βŠ•π‘› by 𝑛𝑉. Every semisimple representation of 𝐴 has the form 𝑉=⨁𝑖=1𝑛𝑛𝑖𝑉𝑖, where 𝑉𝑖 are pairwise non-isomorphic finite dimensional irreducible representations of 𝐴. If π‘Šπ‘– is a vector space of dimension 𝑛𝑖, then π‘›π‘–π‘‰π‘–β‰…π‘‰π‘–βŠ—π‘Šπ‘–, where the action of 𝐴 on π‘Šπ‘– is trivial (π‘Šπ‘– only records the multiplicity of 𝑉𝑖). By Schur’s lemma, π‘Šπ‘– is isomorphic as a vector space to Hom𝐴(𝑉𝑖,𝑉); therefore,

𝑉=⨁𝑖=1π‘›π‘‰π‘–βŠ—Hom𝐴(𝑉𝑖,𝑉).

This is called the isotypical decomposition.

PROP 2.3
Suppose 𝑉𝑖 (1β©½π‘–β©½π‘š) are pairwise non-isomorphic finite dimensional irreducible representations of 𝐴, and 𝑉=⨁𝑖=1π‘šπ‘›π‘–π‘‰π‘–. Suppose π‘Š is a subrepresentation of 𝑉. Then π‘Šβ‰…β¨π‘–=1π‘šπ‘Ÿπ‘–π‘‰π‘– where π‘Ÿπ‘–β©½π‘›π‘–, and the inclusion πœ‘:π‘Šβ†ͺοΈŽπ‘‰ is of the form πœ‘=⨁𝑖=1π‘šπœ‘π‘–, where πœ‘π‘–:π‘Ÿπ‘–π‘‰π‘–β†’π‘›π‘–π‘‰π‘–, (𝑣1,β‹―,π‘£π‘Ÿπ‘–)↦(𝑣1,β‹―,π‘£π‘Ÿπ‘–)⋅𝑋𝑖 and 𝑋𝑖 is a π‘Ÿπ‘–Γ—π‘›π‘– matrix of full rank.
COR 2.4
If 𝑉 is a finite dimensional representation of 𝐴, 𝑣1,β‹―,𝑣𝑛 are linearly independent vectors in 𝑉. Then for any 𝑀1,β‹―,π‘€π‘›βˆˆπ‘‰, there is some π‘Žβˆˆπ΄ such that π‘Žπ‘£π‘–=𝑀𝑖 for all 𝑖.
COR 2.5
  1. Suppose 𝑉=⨁𝑖=1π‘šπ‘‰π‘– where (𝑉𝑖,πœŒπ‘–) are pairwise non-isomorphic finite dimensional irreducible representations of 𝐴.

    Then ⨁𝑖=1π‘šπœŒπ‘–:𝐴→⨁𝑖=1π‘šEnd(𝑉𝑖) is surjective.

  2. Suppose 𝑉 is a finite dimensional representation of 𝐴.

    Then 𝑉 is irreducible if and only if 𝜌:𝐴→End(𝑉) is surjective.

2.2 Semisimple Algebras

DEF 2.6
An associative algebra 𝐴 is called semisimple if every finite dimensional representation of it is semisimple.

We will classify all semisimple algebras in this section. We first look at an important class of semisimple algebras, the matrix algebras.

2.2.1 The Matrix Algebra

Let 𝑑𝑖 (1β©½π‘–β©½π‘Ÿ) be distinct integers, 𝑉𝑖=π‘˜π‘‘π‘– and 𝑀𝑖=End(𝑉𝑖)=Mat𝑑𝑖×𝑑𝑖(π‘˜). Let 𝐴=⨁𝑖=1π‘Ÿπ‘€π‘–. We will discuss the representations of 𝐴.

Obviously, each 𝑉𝑖 itself is a representation of 𝐴 by the projection pr𝑖:𝐴→𝑀𝑖=End(𝑉𝑖), and this representation is irreducible since 𝐴 contains all operators on 𝑉𝑖.

Suppose now that 𝑋 is an 𝑛-dimensional representation of 𝐴. We can form the dual representation on the dual space π‘‹βˆ—; however this representation is for the opposite algebra 𝐴op, the same algebra but with the order of multiplication reversed. This representation is given by (π‘Žβ‹…π‘“)(𝑣)=𝑓(π‘Žβ‹…π‘£), for π‘Žβˆˆπ΄, π‘“βˆˆπ‘‹βˆ— and π‘£βˆˆπ‘‹. In the particular case of a matrix algebra, we actually have 𝐴op≅𝐴, by the isomorphism π΅β†¦π΅βŠ€; therefore, π‘‹βˆ— is a representation of 𝐴.

Pick a basis {𝑦1,β‹―,𝑦𝑛} of π‘‹βˆ— and let πœ‘:π΄βŠ•π‘›β†’π‘‹βˆ—, (π‘Ž1,β‹―,π‘Žπ‘›)β†¦βˆ‘π‘–=1π‘›π‘Žπ‘–π‘¦π‘–. Since 𝐴 contains all scalar multiplications, πœ‘ is surjective. Therefore, πœ‘βˆ— gives a injection 𝑋→(π΄βŠ•π‘›)βˆ—.

Through the map Mat𝑑×𝑑(π‘˜)β†’Mat𝑑×𝑑(π‘˜)βˆ—, 𝐡↦tr(π΅βŠ€β‹…βˆ’), (π΄βŠ•π‘›)βˆ— is isomorphic to π΄βŠ•π‘› as representations of 𝐴. Therefore,

πœ‘βˆ—:𝑋→(π΄βŠ•π‘›)βˆ—β‰…π΄βŠ•π‘›=(⨁𝑖=1π‘ŸEnd(𝑉𝑖))βŠ•π‘›β‰…(⨁𝑖=1π‘Ÿπ‘‘π‘–π‘‰π‘–)βŠ•π‘›.

Therefore, there is an injection 𝑋→⨁𝑖=1π‘Ÿπ‘›π‘‘π‘–π‘‰π‘–; by Proposition 2.3, 𝑋 is the direct sum of some 𝑉𝑖’s.

In corollary, all irreducible representations of 𝐴 are 𝑉𝑖, and all representations of 𝐴 are direct sums of 𝑉𝑖.

2.2.2 Classification of Semisimple Algebras

In this section, we will see that every semisimple algebra is isomorphic to a matrix algebra. Also, we will justify the name β€œsemisimple”: a semisimple algebra is equivalent to a direct sum of simple algebras (ones with no non-trivial ideals). We will use the concept of filtrations; a more detailed examination of filtrations will be postponed.

Suppose 𝑉 is a finite dimensional representation of 𝐴. A finite filtration of 𝑉 is a sequence of subrepresentations

0=𝑉0βŠ†π‘‰1βŠ†β‹―βŠ†π‘‰π‘›=𝑉.

Any finite dimensional representation 𝑉 admits a finite filtration 0=𝑉0βŠ†π‘‰1βŠ†β‹―βŠ†π‘‰π‘›=𝑉, such that each quotient 𝑉𝑖/π‘‰π‘–βˆ’1 is irreducible.

DEF 2.7
The radical of an algebra 𝐴, denoted rad𝐴, is the set of elements π‘Žβˆˆπ΄ that, for all irreducible representation (𝑉,𝜌) of 𝐴, 𝜌(π‘Ž)=0.
PROP 2.8
The radical of 𝐴 is a two-sided ideal. It is the largest nilpotent ideal in 𝐴; every nilpotent ideal is contained in rad𝐴.
THM 2.9

Any finite dimensional algebra 𝐴 has only a finite number o finite dimensional irreducible representations up to isomorphism. If we list them as 𝑉1,β‹―,π‘‰π‘Ÿ, then

𝐴/rad𝐴≅⨁𝑖=1π‘ŸEnd(𝑉𝑖).
COR 2.10

For any finite dimensional algebra 𝐴,

βˆ‘π‘‰finite dimensionalirreducible representation(dim𝑉)2β©½dim𝐴.
EX 2.11
Let 𝐴 be the algebra of all upper-triangular matrices. For 1⩽𝑖⩽𝑛 let (𝑉𝑖=π‘˜,πœŒπ‘–) be the representation given by πœŒπ‘–(𝑋)=𝑋𝑖𝑖. They are clearly irreducible and pairwise non-isomorphic. Let 𝐡 be the subalgebra of strictly upper-triangular matrices. Then 𝐡 is nilpotent and radπ΄βŠ‡π΅. But 𝐴/rad𝐴 is 𝑛 dimensional and βˆ‘π‘–=1𝑛(dim𝑉𝑖)2=𝑛, it turns out that rad𝐴=𝐡 and 𝑉𝑖 are all irreducible representations.
PROP 2.12
  • Finite dimensional simple algebras are exactly those isomorphic to Mat𝑑×𝑑(π‘˜) for some 𝑑.

  • For finite dimensional algebras, the following are equivalent:

    1. rad𝐴=0.
    2. βˆ‘π‘‰finite dimensional irreducible(dim𝑉)2=dim𝐴.
    3. Any finite dimensional representation of 𝐴 is semisimple, i.e. 𝐴 semisimple.
    4. The regular representation of 𝐴 is semisimple.
    5. 𝐴≅⨁𝑖=1π‘ŸMat𝑑𝑖×𝑑𝑖(π‘˜) for some 𝑑𝑖; i.e., 𝐴 is the direct sum of some simple algebras.

2.3 Characters

Throughout this section 𝐴 will be an arbitrary associative algebra.

DEF 2.13

Suppose (𝑉,𝜌) is a representation of 𝐴. The character of it is

πœ’π‘‰:π΄β†’π‘˜,π‘Žβ†¦tr𝜌(π‘Ž).

If 𝑉 is irreducible, call πœ’ irreducible.

If we let [𝐴,𝐴] be the commutator subalgebra, the subalgebra generated by elements of the form π‘₯π‘¦βˆ’π‘¦π‘₯, then characters actually factors through 𝐴/[𝐴,𝐴].

THM 2.14
  1. Characters of distinct irreducible representations of 𝐴 are linearly independent.
  2. If 𝐴 is finite dimensional and semisimple, then all irreducible characters of 𝐴 are distinct, and they form a basis for (𝐴/[𝐴,𝐴])βˆ—.

2.4 Jordan-HΓΆlder Theorem and Krull-Schmidt Theorem

THM 2.15

Suppose that 𝑉 is a finite dimensional representation of 𝐴. Then 𝑉 admits a finite filtration 0=𝑉0βŠ†π‘‰1βŠ†β‹―βŠ†π‘‰π‘›=𝑉 such that each 𝑉𝑖/π‘‰π‘–βˆ’1 is irreducible.

Moreover, every two such filtrations are equal in length, and the quotients 𝑉𝑖/π‘‰π‘–βˆ’1 are isomorphic up to a permutation. The number 𝑛 is called the length of 𝑉, and the quotients are called the Jordan-HΓΆlder series of 𝑉.

LEM 2.16

Suppose π‘Š is indecomposable and πœƒ,πœƒβ€²βˆˆEnd𝐴(π‘Š).

  1. πœƒ is either an isomorphism or nilpotent.
  2. If πœƒ and πœƒβ€² are both nilpotent, then so is πœƒ+πœƒβ€².
THM 2.17
Any finite dimensional representation of an algebra 𝐴 can be uniquely (up to isomorphisms and a permutation) decomposed into a direct sum of indecomposable representations.

2.5 Representations of Tensor Products

If 𝐴 and 𝐡 are algebras, then their tensor product π΄βŠ—π΅ is also an algebra, with multiplication (π‘ŽβŠ—π‘)β‹…(π‘Žβ€²βŠ—π‘β€²)=(π‘Žπ‘Žβ€²)βŠ—(𝑏𝑏′). If 𝑉 and π‘Š are representations of 𝐴 and 𝐡 respectively, then π‘‰βŠ—π‘Š is also a representation with componentwise action. Recall that End(π‘‰βŠ—π‘Š)=End(𝑉)βŠ—End(π‘Š).

THM 2.18
  1. If 𝑉 and π‘Š are irreducible, then π‘‰βŠ—π‘Š is an irreducible representation of π΄βŠ—π΅.

  2. Any finite dimensional representation of π΄βŠ—π΅ can be uniquely expressed in the form π‘‰βŠ—π‘Š.

  1. The density theorem says that 𝐴→End(𝑉) and 𝐡→End(π‘Š) are surjective. Therefore, π΄βŠ—π΅β†’End(π‘‰βŠ—π‘Š) is also surjective, hence the irreducibility.

  2. By taking 𝐴′=imπœŒπ‘‰ and 𝐡′=imπœŒπ‘Š, we may assume that 𝐴=𝐴′ and 𝐡=𝐡′ are finite dimensional.

    Claim. rad(π΄βŠ—π΅)=radπ΄βŠ—π΅+π΄βŠ—rad𝐡.

    If the Claim is true, then

    π΄βŠ—π΅/rad(π΄βŠ—π΅)=𝐴/radπ΄βŠ—π΅/rad𝐡=(⨁𝑉fin. diml. irr.End(𝑉))βŠ—(β¨π‘Šfin. diml. irrEnd(π‘Š))=⨁𝑉,π‘ŠEnd(π‘‰βŠ—π‘Š),

    therefore proving the result.

    Prove of the claim: let 𝐼=radπ΄βŠ—π΅+π΄βŠ—rad𝐡. 𝐼 is nilpotent, and π΄βŠ—π΅/𝐼=⨁𝑉,π‘ŠEnd(π‘‰βŠ—π‘Š) by the above calculation is semisimple. Therefore, 𝐼 is the largest nilpotent ideal, hence the radical.

Section 3 Representations of Finite Groups

Let 𝐺 be a finite group, π‘˜ algebraically closed and π‘˜[𝐺] the group algebra.

THM 3.1
π‘˜[𝐺] is semisimple if and only if |𝐺|βˆˆπ‘˜ is not zero (or equivalently charπ‘˜>0 and charπ‘˜βˆ£|𝐺|).

Therefore, our general results of semisimple algebras apply. In particular, π‘˜[𝐺]=⨁𝑉irrEnd(𝑉), so

|𝐺|=βˆ‘π‘‰irr(dim𝑉)2.

This is called the sum of squares formula.

3.1 Characters

Define the vector space of class functions

𝐹c(𝐺,π‘˜)={𝑓:πΊβ†’π‘˜:βˆ€π‘”,β„Ž,𝑓(π‘”β„Žπ‘”βˆ’1)=𝑓(β„Ž)}.

Suppose 𝐺 is a finite group and |𝐺|β‰ 0 in π‘˜. Recall that the character πœ’π‘‰ of a representation (𝑉,πœŒπ‘‰) is defined as πœ’π‘‰(𝑔)=trπœŒπ‘‰(𝑔).

THM 3.2

Characters of irreducible representations form a basis of 𝐹c(𝐺,π‘˜).

In particular, the number of irreducible representations of 𝐺 is equal to the conjugacy classes of 𝐺.

COR 3.3
If charπ‘˜=0, then two representations of 𝐺 are isomorphic if and only if their character are equal.

We are particularly interested in the case π‘˜=β„‚. We can define a 𝐺-invariant Hermitian inner product on 𝐹c(𝐺,β„‚) by (𝑓1,𝑓2)=1|𝐺|βˆ‘π‘”βˆˆπΊπ‘“1(𝑔)𝑓2(𝑔).

THM 3.4

If 𝑉 and π‘Š are representations, then (πœ’π‘‰,πœ’π‘Š)=dimHom𝐺(𝑉,π‘Š).

In particular, the characters of irreducible representations are orthogonal.

Let 𝑝=1|𝐺|βˆ‘π‘”βˆˆπΊπ‘”βˆˆπ‘˜[𝐺] be the symmetrizer. πœŒπ‘‰(𝑝) is a projection from 𝑉 to the stabilizer subspace 𝑉𝐺, so πœ’π‘ˆ(𝑝)=dim𝑉𝐺.

Therefore,

(πœ’π‘‰,πœ’π‘Š)=1|𝐺|βˆ‘π‘”βˆˆπΊπœ’π‘‰(𝑔)πœ’π‘Š(𝑔)=1|𝐺|βˆ‘π‘”βˆˆπΊπœ’π‘‰βŠ—π‘Šβˆ—(𝑔)=trπœŒπ‘‰βŠ—π‘Šβˆ—(𝑝)=dim(π‘‰βŠ—π‘Šβˆ—)𝐺=dimHom𝐺(π‘Š,𝑉).

Therefore, by the isotypical decomposition, the regular representation of 𝐺 can be decomposed as ⨁𝑉irrπ‘‰βŠ•(πœ’regular,πœ’π‘‰).

3.2 Complex Representations

A finite dimensional representation 𝑉 over β„‚ of a group 𝐺 is called unitary if there exists a 𝐺-invariant positive definition Hermitian form on 𝑉.

By taking the symmetrizer, any finite dimensional representation of a finite group 𝐺 has a unitary structure. If 𝑉 is moreover irreducible, then this structure is unique up to scaling by a positive real.

As a corollary, by taking orthogonal complements, every finite dimensional representation of a finite group 𝐺 is completely reducible.

Let 𝑉 over β„‚ be a irreducible representation of 𝐺 and {𝑣1,β‹―,𝑣𝑛} an orthonormal basis of 𝑉 with respect to the unitary structure. Let 𝑑𝑖𝑗𝑉(𝑔)=(πœŒπ‘‰(𝑔)𝑣𝑖,𝑣𝑗).

PROP 3.5

If 𝑉 and π‘Š are both irreducible representations of 𝐺, then

(𝑑𝑖𝑗𝑉,π‘‘π‘˜π‘™π‘Š)={1dim𝑉ifπ‘‰β‰…π‘Šand𝑖=π‘˜,𝑗=𝑙0otherwise.

In particular {𝑑𝑖𝑗𝑉} form an orthogonal basis for 𝐹(𝐺,β„‚)={𝑓:𝐺→ℂ}.

3.2.1 The Character Table

Since the number of irreducible representations of a finite group is equal to the number of conjugacy classes, we can draw a table with columns the conjugacy classes, and rows the irreducible representations. On column 𝐢 row 𝑉, we fill in the character πœ’π‘‰(𝐢) (conjugate elements share the same character). This forms a square matrix on β„‚, called the character table of 𝐺.

There are several properties of this square matrix.

  1. The conjugacy class of 𝑒 is 𝑒 itself, and πœ’π‘‰(𝑒)=dim𝑉. Therefore, column 𝑒 are the dimensions of irreducible representations. By the sum of squares formula, the sum of squares of the first column is equal to |𝐺|.

  2. Irreducible characters are orthogonal. Therefore, for any two different rows 𝑉1, 𝑉2, βˆ‘πΆ|𝐢|β‹…πœ’π‘‰1(𝐢)πœ’π‘‰2(𝐢)=0. For any row 𝑉, βˆ‘πΆ|𝐢|β‹…|πœ’π‘‰(𝐢)|2=|𝐺|.

  3. Therefore, by properties of a orthogonal square matrix, the columns of a character table are also orthogonal.

EX 3.6

Character tables of 𝔖3, 𝔖4 and 𝔄4.

The character table of 𝔖3 can be constructed from the knowledge of

  • a trivial representation,
  • a 1-dimensional sign representation,
  • sum of squares formula, and
  • orthogonality of columns.
πœ’π‘’
#=1
(12)
#=3
(123)
#=2
trivial111
sign1βˆ’11
(β„‚2)20βˆ’1

The 2-dimensional representation can be generalized constructed as follows. 𝔖𝑛 acts by permutation of basis on ℂ𝑛, and there is an obvious invariant subspace 𝑣1+β‹―+𝑣𝑛=0. ℂ𝑛/(𝑣1+β‹―+𝑣+𝑛=0) is an irreducible representation of 𝔖𝑛.

The character table of 𝔖4 can be constructed from the knowledge of

  • a trivial representation and a sign representation,
  • a 3-dimensional representation, constructed as above,
  • the tensor of two representations,
  • orthogonality and sum of squares formula.
πœ’π‘’
#=1
(12)
#=3
(12)(34)
#=3
(123)
#=8
(1234)
#=6
trivial11111
sign1βˆ’111βˆ’1
β„‚331βˆ’10βˆ’1
β„‚3βŠ—sign3βˆ’1βˆ’10βˆ’1
(β„‚2)202βˆ’10

Now what is this last 2-dimensional representation? Recall the last row of the character table of 𝔖3: they coincide. Actually, this representation of 𝔖4 is a pullback of that representation of 𝔖3.

Consider finite groups 𝐺, 𝐻 and a surjective homomorphism πœ‘:𝐺→𝐻. Then for any irreducible representation 𝑉 of 𝐻, the composition 𝐺→𝐻→GL(𝑉) is a representation of 𝐺, and is irreducible by the density theorem. This representation is called the pullback representation.

Now consider 𝔄4. There is a surjective homomorphism 𝔄4β†’β„€3 by quotienting out (12)(34). Therefore we get the trivial representation and two pullback representations:

πœ’π‘’
#=1
(12)(34)
#=3
(123)
#=4
(132)
#=4
trivial1111
pullback11𝜁𝜁2
pullback11𝜁2𝜁
(β„‚3)300βˆ’1

The last row is by restriction: if 𝐻 is a subgroup of 𝐺, then 𝐻→𝐺→GL(𝑉) is a representation of 𝐻.

3.2.2 Frobenius Determinant

For a finite group 𝐺 and formal variables π‘₯𝑔 for π‘”βˆˆπΊ, define a |𝐺|Γ—|𝐺| matrix 𝑋𝐺 by defining the entry at row 𝑔 column β„Ž to be π‘₯π‘”βˆ’1β‹…β„Ž.

THM 3.7

Suppose 𝐺 is a finite group, not necessarily abelian. Then

det𝑋𝐺=βˆπ‘—=1π‘Ÿπ‘π‘—(π‘₯)deg𝑝𝑗,

where 𝑝𝑗 are pairwise non-proportional irreducible polynomials and π‘Ÿ is the number of conjugacy classes of 𝐺.

3.2.3 Frobenius-Schur Indicator

Let 𝐺 be a finite group and 𝑉 a finite dimensional complex representation.

Say 𝑉 is of

Every finite dimensional complex representation 𝑉 is either of complex type, or of real type (in which case 𝑉=π‘ˆβŠ—β„β„‚ for some real representation 𝑅), or of quaternionic type.

THM 3.8

For a representation 𝑉, let the Frobenius-Schur inducator be

FS(𝑉)=1|𝐺|βˆ‘π‘”βˆˆπΊπœ’π‘‰(𝑔2).

Then

FS(𝑉)={1if𝑉is ofℝ-type,βˆ’1if𝑉is ofℍ-type,1if𝑉is ofβ„‚-type.

For a matrix 𝐴, tr𝐴2=tr𝑆2𝑉(π΄βŠ—π΄)βˆ’trΞ›2𝑉(π΄βŠ—π΄). Therefore, letting 𝑝 be the symmetrizer,

FS(𝑉)=πœ’π‘†2𝑉(𝑝)βˆ’πœ’Ξ›2𝑉(𝑝)=dim(𝑆2𝑉)πΊβˆ’dim(Ξ›2𝑉)𝐺.

Now notice that Hom(π‘‰βˆ—,𝑉)β‰…(π‘‰βŠ—π‘‰)𝐺≅(𝑆2𝑉)πΊβŠ•(Ξ›2𝑉)𝐺. The dimensions of the direct summand could be 0,0, 1,0 or 0,1, depending on whether 𝑉 is of β„‚-type, ℝ-type or ℍ-type.

3.2.4 Frobenius Divisibility

Denote by 𝔸 the ring of algebraic integers.

THM 3.9 Frobenius divisibility theorem
If 𝐺 is a finite group, 𝑉 is a complex irreducible representation, then dimπ‘‰βˆ£|𝐺|.
LEM 3.10
Suppose 𝐢 is a conjugacy class in 𝐺. Then πœ†β‰”πœ’π‘‰(𝐢)β‹…|𝐢|dim𝑉 is an algebraic integer.

Let 𝑝𝐢=βˆ‘π‘”βˆˆπΆπ‘”. Schur’s lemma implies that 𝑝𝐢 acts on 𝑉 as a scalar πœ‡, so tr𝑝𝐢=πœ‡dim𝑉. Therefore, πœ‡=πœ’π‘‰(𝐢)β‹…|𝐢|dim𝑉=πœ†.

β„€[𝐺] is a finitely generated β„€-module, and β„€ is Noetherian; so any submodule of β„€[𝐺] is Noetherian. In particular, for any π‘₯βˆˆβ„€[𝐺], β„€[π‘₯] is finitely generated. Therefore, there is some 𝑛 such that β„€[π‘₯] is generated by 1,π‘₯,β‹―,π‘₯𝑛. Therefore π‘₯𝑛+1=π‘Žπ‘›π‘₯𝑛+β‹―+π‘Ž0. Taking π‘₯=𝑝𝐢 and evaluate on 𝑉, we obtain πœ†π‘›+1=π‘Žπ‘›πœ†π‘›+β‹―+π‘Ž0, so πœ† is an algebraic integer.

β„šβˆ‹|𝐺|dim𝑉=|𝐺|dimπ‘‰βŸ¨πœ’π‘‰,πœ’π‘‰βŸ©=1dimπ‘‰βˆ‘πΆ|πœ’π‘‰(𝐢)|2|𝐢|=βˆ‘πΆπœ†πΆπœ’π‘‰(𝐢), where πœ†πΆ defined as in the Lemma. The right hand side is an algebraic integer, so |𝐺|dimπ‘‰βˆˆβ„šβˆ©π”Έ=β„€.

COR 3.11
Actually, dim𝑉 divides |𝐺||𝑍(𝐺)|.

3.2.5 Burnside’s Theorem

THM 3.12
Let 𝐺 be a finite group. If a conjugacy class 𝐢 of 𝐺 has π‘π‘Ž elements (where 𝑝 is a prime and π‘Ž>0), then 𝐺 is not simple.

The irreducible representations of 𝐺 can be classified into three types: the trivial representation; non-trivial irreducible representations with dimension divisible by 𝑝, denoted by 𝐷; non-trivial irreducible representations with dimension not divisible by 𝑝, denoted by 𝑁. Then βˆ‘π‘‰irr.πœ’π‘‰(𝐢)dim𝑉=0, so 𝑏=βˆ‘π‘‰βˆˆπ·1π‘β‹…πœ’π‘‰(𝐢)dimπ‘‰βˆˆπ”Έ. So

0=1+𝑝𝑏+βˆ‘π‘‰βˆˆπ‘πœ’π‘‰(𝐢)dim𝑉.

However, π”Έβˆ©β„š=β„€ and π‘βˆˆπ”Έ, so πœ’π‘‰(𝐢) is a non-zero algebraic integer for some π‘‰βŠ†π‘. πœ’π‘‰(𝐢) is the sum of some roots of unity; if the average of some roots of unity is an algebraic integer, then either they sum to 0, or they are all equal. Therefore, πœŒπ‘‰(𝐢)=πœ†β‹…id, and kerπœŒπ‘‰ is a non-trivial normal subgroup of 𝐺.

COR 3.13 Burnside
If |𝐺|=π‘π‘Žπ‘žπ‘ for prime 𝑝 and π‘ž, then 𝐺 is solvable.

3.3 Virtual Representations

A virtual representation of a group 𝐺 is a formal linear combination of representations βˆ‘π‘–π‘›π‘–π‘‰π‘– where π‘›π‘–βˆˆβ„€. The character of a virtual representation is the linear combination of the corresponding characters. If the inner product of a virtual character is 1 and the total dimension is non-zero, then this virtual character is a single irreducible representation.

3.4 Restriction and Induction

If 𝐺 is a finite group, 𝑉 a representation of 𝐺 and 𝐻 is a subgroup of 𝐺, then the representation πœŒπ‘‰:𝐺→GL(𝑉) restricts to a representation of 𝐻: 𝐻β†ͺοΈŽπΊβ†’GL(𝑉). This representation is called the restriction, denoted Res𝐻𝐺(𝑉). Equivalently, Res𝐻𝐺(𝑉)β‰…Homπ‘˜[𝐺](π‘˜[𝐺],𝑉) where π‘˜[𝐺] is seen as a (π‘˜[𝐺],π‘˜[𝐻])-bimodule; or π‘˜[𝐺]βŠ—π‘˜[𝐺]𝑉, where π‘˜[𝐺] is seen as a (π‘˜[𝐻],π‘˜[𝐺])-bimodule.

The induced representation is the adjoint of the restricted representation. By the tensor-Hom adjoint pair, we have, for a left 𝐡-module 𝑁 and a left 𝐴-module 𝑀,

Hom𝐴(π΄βŠ—π΅π‘)β‰…Hom𝐡(𝑁,𝑀),Hom𝐴(𝑁,𝑀)β‰…Hom𝐡(𝑁,Hom𝐴(𝐡,𝑀)).

The module π΄βŠ—π΅π‘ is called the induced 𝐴-module from 𝑁, and Hom𝐴(𝐡,𝑀) is called the coinduced 𝐡-module from 𝑀.

Now suppose π‘ˆ is a representation of 𝐻. Then π‘ˆ is a left π‘˜[𝐻]-module; we let the induced representation of π‘ˆ be the induced π‘˜[𝐺]-module Ind𝐻𝐺(π‘ˆ)=π‘˜[𝐺]βŠ—π‘˜[𝐻]π‘ˆ, and the coinduced representation of be the coinduced π‘˜[𝐺]-module coInd𝐻𝐺(π‘ˆ)=Homπ‘˜[𝐻](π‘˜[𝐺],π‘ˆ). For finite groups, the induced representation is isomorphic to the coinduced representation.

PROP 3.14
  1. If πΎβŠ†π»βŠ†πΎ, then Ind𝐾𝐻Ind𝐻𝐺=Ind𝐾𝐺.

  2. If π‘ˆ is a representation of π»βŠ†πΊ, then

    Ind𝐻𝐺(π‘ˆ)β‰…{𝑓:πΊβ†’π‘ˆ:𝑓(β„Žπ‘”)=πœŒπ‘ˆ(β„Ž)𝑓(𝑔),βˆ€π‘”βˆˆπΊ,β„Žβˆˆπ»}.

    The action is given by (𝑔⋅𝑓)(𝑒)=𝑓(π‘₯𝑔) for π‘₯ and π‘”βˆˆπΊ.

  3. dimInd𝐻𝐺(π‘ˆ)=dimπ‘ˆβ‹…|𝐺||𝐻|.

As a vector space, Ind𝐻𝐺(𝑉) can be written as β¨π‘–π‘”π‘–βŠ—π‘ˆ, where 𝑔𝑖 are coset representatives of 𝐻.

THM 3.15 Frobenius reciprocity

Suppose 𝐻 is a subgroup of a finite group 𝐺, π‘Š and representation of 𝐻 and 𝑉 a representation of 𝐺. Then

Hom𝐺(Ind𝐻𝐺(π‘ˆ),𝑉)β‰…Hom𝐻(π‘ˆ,Res𝐻𝐺(𝑉));Hom𝐺(𝑉,Ind𝐻𝐺(π‘ˆ))β‰…Hom𝐻(Res𝐻𝐺(𝑉),π‘ˆ).

In other words, Res and Ind are adjoint functors.

For complex representations, if πœ’ and πœ“ are two characters (or in general class functions) of 𝐻 and 𝐺 respectively,

(πœ’,Resπ»πΊπœ“)𝐻=(Indπ»πΊπœ’,πœ“)𝐺.

We also have the formula

Ind𝐻𝐺(πœ‘β‹…Res𝐻𝐺(πœ“))=Ind𝐻𝐺(πœ‘)β‹…πœ“.
THM 3.16 Frobenius character formula

Suppose 𝐻 is a subgroup of 𝐺, charπ‘˜βˆ€|𝐻|, π‘ˆ is a representation of 𝐻 and 𝑉=Ind𝐻𝐺(π‘ˆ). Then

πœ’π‘‰(π‘₯)=βˆ‘π‘”π‘–π‘₯π‘”π‘–βˆ’1βˆˆπ»πœ’π‘ˆ(𝑔𝑖π‘₯π‘”π‘–βˆ’1)=1|𝐻|βˆ‘π‘”βˆˆπΊπ‘”π‘₯π‘”βˆ’1βˆˆπ»πœ’π‘ˆ(𝑔π‘₯π‘”βˆ’1),

where 𝑔𝑖 are coset representatives of 𝐻.

3.4.1 Mackey’s Irreducibility Criterion

Introduce the double cosets: if 𝐻 and 𝐾 are two subgroups of 𝐺, then 𝐺 is the disjoint union of some 𝐾𝑠𝐻 for some double coset representatives 𝑠. The set of double cosets (or a system of their representatives) may be denoted as 𝐾\𝐺/𝐻.

Suppose 𝐻 and 𝐾 are subgroups of 𝐺 and (π‘Š,𝜌) is a representation of 𝐻. We wish to study Res𝐾𝐺(Ind𝐺𝐻(π‘Š)).

𝑉=Ind𝐺𝐻(π‘Š) is the direct sum of images π‘₯π‘Š for π‘₯∈𝐺/𝐻. Let π‘ βˆˆπΎ\𝐺/𝐻 and let 𝑉(𝑠) be the subspace of 𝑉 generated by the images π‘¦π‘Š for π‘¦βˆˆπΎπ‘ π». Then Res𝐾𝐺𝑉≅𝑉 as a vector space is also a direct sum of the 𝑉(𝑠)β€˜s and 𝑉(𝑠) is stable under 𝐾, so they are also isomorphic as representations of 𝐾.

We can further decompose 𝑉(𝑠): the subgroup of 𝐾 consisting of elements π‘₯ such that π‘₯(π‘ π‘Š)=π‘ π‘Š is equal to 𝐻𝑠=πΎβˆ©π‘ π»π‘ βˆ’1, so 𝑉(𝑠) is a direct sum of the images π‘₯(π‘ π‘Š) for π‘₯∈𝐾/𝐻𝑠. This is to say 𝑉(𝑠)=Ind𝐻𝑠𝐾(π‘ π‘Š). The representation π‘ π‘Š is in turn isomorphic to (π‘Šπ‘ ,πœŒπ‘ ) where πœŒπ‘ (π‘₯)=𝜌(π‘ βˆ’1π‘₯𝑠). Therefore,

THM 3.17 Mackey’s formula
Res𝐾𝐺(Ind𝐻𝐺(π‘Š))β‰…β¨π‘ βˆˆπ‘†Ind𝐻𝑠𝐾(π‘Šπ‘ ) as representations of 𝐾.

Taking 𝐾=𝐻, we derive an irreducibility criterion for induced representations. Two representations π‘Š1, π‘Š2 of 𝐺 are called disjoint if Hom𝐺(π‘Š1,π‘Š2)=0.

COR 3.18 Mackey’s irreducibility criterion
The induced representation 𝑉=Indπ»πΊπ‘Š is irreducible, if and only if π‘Š is irreducible, and the two representations πœŒπ‘  and Res𝐻𝑠𝐻(𝜌) are disjoint. Here 𝐻𝑠=π»βˆ©π‘ π»π‘ βˆ’1 and πœŒπ‘ (π‘₯)=𝜌(π‘ βˆ’1π‘₯𝑠).
COR 3.19
If 𝐻⊲𝐺, then Ind𝐻𝐺(𝜌) is irreducible if and only if 𝜌 is irreducible and not isomorphic to any of its conjugates πœŒπ‘  for π‘ βˆ‰π».
EX 3.20 normal subgroups
Let 𝐴 be a normal subgroup of a group 𝐺 and let (𝑉,𝜌) be an irreducible representation of 𝐺. Let 𝑉=⨁𝑉𝑖 be the isotypical decomposition of Res𝐴𝐺(𝑉). For π‘ βˆˆπΊ, 𝜌(𝑠) permutes the 𝑉𝑖; since 𝑉 is irreducible it permutes transitively. Let 𝑉𝑖0 be one of these 𝑉𝑖’s; if 𝑉𝑖0=𝑉 then Res𝐴𝐺(𝑉) is isotypic, i.e. a direct sum of isomorphic irreducible representations. Otherwise let 𝐻 be the subgroup of 𝐺 consisting of π‘ βˆˆπΊ such that 𝜌(𝑠)𝑉𝑖0=𝑉𝑖0. Then 𝐴⩽𝐻<𝐺 and Res𝐴𝐺(𝑉) is induced by the natural representation of 𝐻 on 𝑉𝑖0. Therefore,
PROP 3.21

If 𝐴⊲𝐺, then

  • either there is a subgroup 𝐴⩽𝐻<𝐺 and an irreducible representation 𝜎 of 𝐻 such that 𝜌 is induced by 𝜎; or
  • Res𝐴𝐺(𝜌) is isotypic.
EX 3.22 semidirect products by an abelian group

Suppose 𝐺=π΄β‹Šπ» where 𝐴 is abelian. We wish to construct irreducible representations of 𝐺 from certain subgroups of 𝐻. (This is the method of little groups of Wigner and Mackey).

Since 𝐴 is abelian, its irreducible representations are of dimension 1 and they form a group 𝐴̂=Hom(𝐴,β„‚Γ—). 𝐺 acts on 𝐴̂ as (π‘ πœ’)(π‘Ž)=πœ’(π‘ βˆ’1π‘Žπ‘ ).

Let πœ’π‘– (π‘–βˆˆπ΄Μ‚/𝐻) be a system of representatives for the orbits of 𝐻 in 𝐴̂. For each π‘–βˆˆπ΄Μ‚/𝐻 let 𝐻𝑖 be the stabilizer subgroup of πœ’π‘–, and let 𝐺𝑖=π΄β‹Šπ»π‘– be the corresponding subgroup of 𝐺. Extend the functions πœ’π‘– to 𝐺𝑖 by πœ’π‘–(π‘Žβ„Ž)=πœ’π‘–(π‘Ž) for π‘Žβˆˆπ΄ and β„Žβˆˆπ»π‘–. Since β„Ž fixes πœ’π‘–, πœ’π‘– is a 1-dimensional character of 𝐺.

Now let 𝜌 be an irreducible representation of 𝐻𝑖. By composing 𝜌 with the projection 𝐺𝑖→𝐻𝑖 we obtain as irreducible representation πœŒΜƒ of 𝐺𝑖. Take the tensor product of πœ’π‘– and πœŒΜƒ; we thus obtain an irreducible representation πœ’π‘–βŠ—πœŒΜƒ of 𝐺𝑖. Let

πœƒπ‘–,𝜌=Ind𝐺𝑖𝐺(πœ’π‘–βŠ—πœŒΜƒ).
PROP 3.23
  1. πœƒπ‘–,𝜌 is irreducible.
  2. πœƒπ‘–,𝜌 and πœƒπ‘–β€²,πœŒβ€² are isomorphic, if and only if 𝑖=𝑖′ and 𝜌=πœŒβ€².
  3. Every irreducible representation of 𝐺 is isomorphic to some πœƒπ‘–,𝜌.

3.4.2 Artin’s Theorem

Recall the set of class functions 𝐹c(𝐺,β„‚) and the inner product on it. Induction gives a map

Ind𝐻𝐺:𝐹c(𝐻,β„‚)→𝐹c(𝐺,β„‚),𝑓↦(π‘₯↦1|𝐻|βˆ‘π‘”βˆˆπΊ,𝑔π‘₯π‘”βˆ’1βˆˆπ»π‘“(𝑔π‘₯π‘”βˆ’1)).

Let πœ’1,β‹―,πœ’π‘› be the set of irreducible characters of 𝐺 and let 𝑅(𝐺) be the ring of virtual characters,

𝑅(𝐺)=β„€πœ’1βŠ•β‹―βŠ•β„€πœ’π‘›.

Ind𝐻𝐺 and Res𝐻𝐺 induce ring homomorphisms Ind:𝑅(𝐻)→𝑅(𝐺) and Res:𝑅(𝐺)→𝑅(𝐻), respectively. They are adjoints with respect to the bilinear forms (β‹…,β‹…)𝐻 and (β‹…,β‹…)𝐺,; moreover because Ind(πœ‘β‹…Res(πœ“))=Ind(πœ‘)β‹…πœ“, the image of Ind is an ideal of 𝑅(𝐺).

THM 3.24 Artin’s theorem

Let 𝒳︀ be a family of subgroups of 𝐺 and Ind:β¨π»βˆˆπ’³οΈ€π‘…(𝐻)→𝑅(𝐺). Then 𝐺 is the union of all conjugates of the subgroups of 𝒳︀, if and only if the cokernel of Ind is finite.

Since 𝑅(𝐺) is finitely generated as an abelian group, the latter condition may be restated as, for every character πœ’ of 𝐺, there are virtual characters πœ’π»βˆˆπ‘…(𝐻) for π»βˆˆπ’³οΈ€ and π‘‘βˆˆβ„€+ such that π‘‘β‹…πœ’=βˆ‘π»βˆˆπ’³οΈ€Ind𝐻𝐺(πœ’π»).

Notice that the family of cyclic subgroups of 𝐺 satisfies the first condition; therefore, as a corollary,

COR 3.25
Every character of 𝐺 is a linear combination with rational coefficients of characters induced by characters of cyclic subgroups of 𝐺.

The first condition is equivalently stated as IndβŠ—β„€β„‚:β¨π»βˆˆπ’³οΈ€π‘…(𝐻)βŠ—β„€β„‚β†’π‘…(𝐺)βŠ—β„€β„‚ is surjective, or by adjointness, ResβŠ—β„€β„‚ is injective. If the first condition holds, then any class function on 𝐺 which restricts to zero on each subgroup in 𝒳︀ is itself zero because 𝐺 is covered by conjugates of subgroups in 𝒳︀, so injectivity holds.

Conversely if the second condition holds let 𝑆 be the union of conjugates of the subgroups in 𝒳︀. Every class function on 𝐺 is of the form βˆ‘π»βˆˆπ’³οΈ€Ind𝐻𝐺(𝑓𝐻), so it vanishes outside of 𝑆. Therefore the complement of 𝑆 must be empty, so 𝑆=𝐺 is the union of all conjugates of subgroups in 𝒳︀.

If 𝐢 is a cyclic group, let πœƒπ΄ be a class function on 𝐴 defined by

πœƒπ΄(π‘₯)={π‘Žifπ‘₯genereates𝐴0otherwise

Claim. If 𝐺 is a finite group, then |𝐺|=βˆ‘πΆβ©½πΊcyclicInd𝐢𝐺(πœƒπΆ).

The claim can be proved by Theorem 3.16. Also, this proves πœƒπΆ=|𝐢|βˆ’βˆ‘π΅<𝐢cyclicInd𝐡𝐴(πœƒπ΅), so by induction on |𝐢|, πœƒπΆβˆˆπ‘…(𝐢). Therefore, the constant function |𝐺| is in the image of Ind. Since the image of Ind is an ideal, imInd contains every element of the form π‘”πœ’, so cokerInd is finite (actually its order is a factor of |𝐺|).

Section 4 Representations of Symmetric Groups

4.1 Young Tableux and Symmetric Functions

For materials on Young tableux and symmetric functions we refer to the book Young Tableux with Applications to Representation Theory and Geometry, especially section 6 Symmetric Functions, and also the corresponding notes. We fix some notation here.

The graded ring of symmetric functions on 𝑛 variables is denoted by Λ𝑛=β¨π‘Ÿβ©Ύ0Ξ›π‘›π‘Ÿ, and Ξ›=lim←𝑛Λ𝑛.

The monomial symmetric function is π‘šπœ†(π‘₯1,β‹―,π‘₯𝑛)=βˆ‘π›Όπ‘₯π›ΌβˆˆΞ›π‘›π‘Ÿ where πœ†βŠ’π‘Ÿ and 𝛼 varies over all permutations of πœ†. π‘š(1π‘Ÿ) is called the elementary symmetric function π‘’π‘Ÿ, and π‘’πœ†=π‘’πœ†1β‹…π‘’πœ†2β‹…β‹―. The complete symmetric function is β„Žπ‘Ÿ(π‘₯1,β‹―,π‘₯𝑛)=βˆ‘πœ†βŠ’π‘Ÿπ‘šπœ† and β„Žπœ†=β„Žπœ†1β‹…β„Žπœ†2β‹…β‹―. The power sum is π‘π‘Ÿ=π‘š(π‘Ÿ), and π‘πœ†=π‘πœ†1β‹…π‘πœ†2β‹…β‹―. Let π‘ πœ† be the Schur polynomial. These are all β„€-bases for Ξ›.

An inner product on Ξ› is defined by βŸ¨π‘ πœ†,π‘ πœ‡βŸ©={1ifπœ†=πœ‡0otherwise. In this inner product, β„Žπœ† is dual to π‘šπœ†, and π‘πœ† is dual to π‘πœ†π‘§(πœ†), where 𝑧(πœ†)=βˆπ‘Ÿπ‘Ÿπ‘šπ‘Ÿβ‹…π‘šπ‘Ÿ!, and π‘šπ‘Ÿ is the number of times π‘Ÿ appears in πœ†. We obtain the following three identities:

βˆπ‘–=1π‘šβˆπ‘—=1𝑙11βˆ’π‘₯𝑖𝑦𝑗=βˆ‘πœ†β„Žπœ†(π‘₯)π‘šπœ†(𝑦)=βˆ‘πœ†1𝑧(πœ†)π‘πœ†(π‘₯)π‘πœ†(𝑦)=βˆ‘πœ†π‘ πœ†(π‘₯)π‘ πœ†(𝑦).

πœ”:π‘ πœ†β†¦π‘ πœ†βŠ€ is a ring automorphism, and also an involution and an isometry (i.e. preserving the inner product). Under this involution, πœ”(β„Žπœ†)=π‘’πœ†, πœ”(π‘πœ†)=(βˆ’1)βˆ‘(π‘π‘–βˆ’1)π‘πœ†.

The Jacobi-Trudy identity is

π‘ πœ†=det(β„Žπœ†π‘–βˆ’π‘–+𝑗)1⩽𝑖,𝑗⩽𝑛,

where β„Žπ‘Ÿ=0 for π‘Ÿ<0. The dual identity (by applying πœ”) is

π‘ πœ†=det(π‘’πœ†π‘–βŠ€βˆ’π‘–+𝑗)1⩽𝑖,𝑗⩽𝑛.

4.2 Specht Modules

Let 𝑇 denote a Young diagram of shape πœ†βŠ’π‘› numbered by integers 1 to 𝑛 with no repeats (not necessarily a Young tableau). The action of 𝔖𝑛 on 𝑇, πœŽβ‹…π‘‡, puts number 𝜎(𝑖) in the box in which 𝑇 puts 𝑖. The column / row group of 𝑇 is the subgroup of 𝔖𝑛 that permutes each column / row within themselves, denoted 𝐢𝑇 and 𝑅𝑇.

Define

𝑏𝑇=βˆ‘π‘”βˆˆπΆπ‘‡(βˆ’1)𝑔𝑔, π‘Žπ‘‡=βˆ‘π‘”βˆˆπ‘…π‘‡π‘”, 𝑐𝑇=π‘π‘‡π‘Žπ‘‡βˆˆβ„‚[𝔖𝑛].

Then for any π‘Ÿβˆˆπ‘…π‘‡ and π‘βˆˆπΆπ‘‡, π‘π‘‡π‘Ÿ=π‘Ÿπ‘π‘‡=(βˆ’1)π‘Ÿπ‘π‘‡ and π‘π‘Žπ‘‡=π‘Žπ‘‡π‘=π‘Žπ‘‡. In particular, π‘Žπ‘‡2=|𝑅𝑇|π‘Žπ‘‡ and 𝑏𝑇2=|𝐢𝑇|𝑏𝑇.

THM 4.1
π‘‰πœ†β‰”β„‚[𝔖𝑛]β‹…π‘π‘ˆ (where π‘ˆ is any numbered Young diagram of shape πœ†) is an irreducible representation of 𝔖𝑛, and every irreducible representation of 𝔖𝑛 is isomorphic to some π‘‰πœ†. These representations are called Specht modules.

As a corollary all (complex) representations of 𝔖𝑛 can be realized over β„š.

Define a tabloid {𝑇} as the orbit of a numbered Young diagram 𝑇 under the action of the row group, and let π‘€πœ† be the space with basis all tabloids. We can make the identification that πœŽβˆˆπ”–π‘› corresponds to πœŽβ‹…π‘ˆ; then π‘€πœ† is a left β„‚[𝔖𝑛]-module, and π‘‰πœ† is spanned by all πœŽβ‹…π‘π‘ˆβ‹…{π‘ˆ} where πœŽβˆˆπ”–π‘›. Denote 𝑣𝑇=𝑏𝑇⋅{𝑇}, then πœŽβ‹…π‘£π‘‡=π‘£πœŽβ‹…π‘‡; so π‘‰πœ† is stable under β„‚[𝔖𝑛], and in fact π‘‰πœ† is essentially the subspace of π‘€πœ† spanned by 𝑏𝑇⋅{𝑇} for all numbered Young diagrams 𝑇 of shape πœ†.

LEM 4.2
  1. Suppose π‘‡πœ† and π‘‡πœ†β€²β€² are two numbered Young diagrams and πœ† does not strictly dominate πœ†β€². Then either there are two distinct integers that occur in the same row of 𝑇′ and the same column of 𝑇, or πœ†=πœ†β€² and there is some π‘β€²βˆˆπ‘„πœ†β€² and π‘žβˆˆπ‘ƒπœ† such that 𝑝′⋅𝑇′=π‘žβ‹…π‘‡. (The two cannot happen at the same time.)

  2. If there is a pair of integers in the same row of 𝑇′ and in the same column of 𝑇, then 𝑏𝑇⋅{𝑇′}=0. Otherwise, 𝑏𝑇⋅{𝑇′}=±𝑣𝑇.

As a corollary,

π‘π‘‡β‹…π‘€πœ†=π‘π‘‡β‹…π‘‰πœ†=ℂ𝑣𝑇≠0,π‘π‘‡β‹…π‘€πœ†β€²=π‘π‘‡β‹…π‘‰πœ†β€²=0ifπœ†β€²>πœ†.

The πœ†β€²>πœ† (lexicographic order) condition can be relaxed to πœ†β‹­πœ†β€² (dominance order).

This proves irreducibility: any subrepresentation of π‘‰πœ† must contain 𝑣𝑇 under the action of 𝑏𝑇, and any subrepresentation containing 𝑣𝑇 generates π‘‰πœ† under the action of 𝔖𝑛. Moreover they are pairwise non-isomorphic by the second equation. Since the number of irreducible representations of 𝔖𝑛 is equal to the number of conjugacy classes, which is in turn equal to the number of partitions of 𝑛, we have thus produced all irreducible representations of 𝔖𝑛.

Since the exact π‘ˆ defining π‘‰πœ† does not matter, we choose any numbered diagram π‘ˆ and denote π‘π‘ˆ by π‘πœ†.

EquationΒ 38 has an important consequence that

PROP 4.3
For any π‘₯βˆˆβ„‚[𝔖𝑛], there is some scalar πœ‡βˆˆβ„‚ such that π‘πœ†π‘₯π‘Žπœ†=πœ‡π‘πœ†π‘Žπœ†. If πœ†β€²>πœ† (or, actually, πœ†β‹­πœ†β€²), then π‘πœ†π‘₯π‘Žπœ†β€²=0.

The proof is just by EquationΒ 38 and apply the identification πœŽβŸ·πœŽβ‹…π‘ˆ.

PROP 4.4
π‘πœ†2=𝑛!dimπ‘‰πœ†π‘πœ†.
By the previous proposition π‘πœ†2=π‘›πœ†π‘πœ†. Let πœ‘ be the right multiplication by π‘πœ†π‘›πœ†. Then trπœ‘=𝑛!π‘›πœ†. However, π‘πœ†π‘›πœ† is an idempotent, so πœ‘ is a projection onto imπœ‘. So trπœ‘=dimβ„‚[𝔖𝑛]π‘πœ†π‘›πœ†=dimπ‘‰πœ†. Therefore, π‘›πœ†=𝑛!dimπ‘‰πœ†.

Recall that π‘€πœ† is the space with basis all tabloids of shape πœ†. Again by EquationΒ 38,

PROP 4.5

Homβ„‚[𝔖𝑛](π‘€πœ†,π‘‰πœ‡)=0 if πœ‡β‹­πœ†. Homβ„‚[𝔖𝑛](π‘€πœ†,π‘‰πœ†)=1.

In particular π‘€πœ†=π‘‰πœ†βŠ•β¨πœ‡βŠ³πœ†π‘˜πœ‡πœ†π‘‰πœ‡.

We need an algebraic lemma:

LEM 4.6
If 𝐴 is an algebra with unit and an idempotent 𝑒, 𝑀 a left 𝐴-module, then Hom𝐴(𝐴𝑒,𝑀)≅𝑒𝑀.

Using this lemma, let 𝐴=β„‚[𝔖𝑛], 𝑒=π‘Žπœ† (not quite an idempotent but up to a scalar) and 𝑀=π‘‰πœ‡, we have Hom𝔖𝑛(π‘€πœ†,π‘‰πœ‡)=Hom𝐴(π΄π‘Žπœ†,π΄π‘πœ‡)β‰…π‘Žπœ†π΄π‘πœ‡π‘Žπœ‡. If πœ‡β‹­πœ†, then π‘Žπœ†π΄π‘πœ‡=0 (Proposition 4.3, inverse); therefore Hom𝔖𝑛(π‘€πœ†,π‘‰πœ‡)=0.

We will prove that the numbers π‘˜πœ‡πœ† are actually the Kostka numbers.

Denote πœ’π‘€πœ† the character of the representation of 𝔖𝑛 on π‘€πœ†, and πΆπœ‡ the conjugacy class of 𝔖𝑛 defined by the partition πœ‡. Then πœ’π‘€πœ†(πΆπœ‡) is the number of tabloids fixed by 𝜎. By a binomial expansion, we can show that

PROP 4.7

The character πœ’π‘€πœ† on the conjugacy class πΆπœ‡ is equal to the coefficient before π‘šπœ† in π‘πœ‡.

That is,

π‘πœ‡(π‘₯)=βˆ‘πœ†βŠ’π‘›πœ’π‘€πœ†(πΆπœ‡)β‹…π‘šπœ†(π‘₯),

or by dualizing,

β„Žπœ†(π‘₯)=βˆ‘πœ‡βŠ’π‘›1π‘§πœ‡πœ’π‘€πœ†(πΆπœ‡)π‘πœ‡(π‘₯).
REM 4.8
The convention in the class and Etingof’s book is different: they used π‘πœ†=π‘Žπœ†π‘πœ† instead of π‘πœ†π‘Žπœ† here. The resulting representations are isomorphic.

4.3 Ring of Representations

Let 𝑅𝑛 be the Grothendieck group of 𝔖𝑛, the free abelian group with basis given by isomorphism classes of finite dimensional representations of 𝔖𝑛, such that [𝑉]+[π‘Š]=[π‘ˆ] if π‘ˆβ‰…π‘‰βŠ•π‘Š. Let 𝑅=⨁𝑛⩾0𝑅𝑛.

π‘‰πœ† forms a basis of 𝑅. Since the relation between π‘€πœ† and π‘‰πœˆ is upper-triangular (Proposition 4.5), [π‘€πœ†] is also a basis of 𝑅.

We can define a multiplication on 𝑅 as follows. For [𝑉]βˆˆπ‘…π‘š and [π‘Š]βˆˆπ‘…π‘›, consider π”–π‘šΓ—π”–π‘› as a subgroup of π”–π‘š+𝑛, then [𝑉]∘[π‘Š]≔[Indπ”–π‘šΓ—π”–π‘›π”–π‘š+π‘›π‘‰βŠ—π‘Š]. This 𝑅 is called the representation ring of 𝔖𝑛.

This ring 𝑅 is a commutative, associative, graded ring with unit, with a bilinear form ([𝑉],[π‘Š])=1𝑛!βˆ‘πœŽβˆˆπ”–π‘›πœ’π‘‰(𝜎)πœ’π‘Š(𝜎), and an involution [𝑉]↦[π‘‰βŠ—sign].

We show that there is a nice correspondence πœ‘ between 𝑅 and the ring of symmetric functions Ξ›; β€œnice” in terms that πœ‘ is an isomorphism, an isometry (preserving the bilinear forms) and πœ‘ preserves the involution.

This πœ‘ is defined by πœ‘:Λ→𝑅, β„Žπœ†β†¦[π‘€πœ†].

PROP 4.9
  1. This πœ‘ is a ring isomorphism and an isometry.
  2. πœ‘(π‘ πœ†)=[π‘‰πœ†].
  3. If πœ”:Ξ›β†’Ξ› is the involution β„Žπœ†β†¦π‘’πœ† and πœ”:𝑅→𝑅 is the involution [𝑉]↦[π‘‰βŠ—sign], then πœ‘βˆ˜πœ”=πœ”βˆ˜πœ‘.

Ξ›=β„€[β„Ž1,β„Ž2,β‹―]. Therefore, to verify that πœ‘ is a ring homomorphism we only need to prove, for πœ†=(πœ†1β©Ύβ‹―β©Ύπœ†π‘˜), that [π‘€πœ†1]βˆ˜β‹―βˆ˜[π‘€πœ†π‘˜]=[π‘€πœ†]. This follows from the fact that [π‘€πœ†]=Indπ‘…πœ†π”–π‘›1. Since [π‘€πœ†] forms a basis of 𝑅, πœ‘ is a ring isomorphism.

Recall that β„Žπœ†=βˆ‘πœ‡1π‘§πœ‡πœ’π‘€πœ†(𝐢(πœ‡))π‘πœ‡. Construct an inverse πœ“:π‘…β†’Ξ›βŠ—β„š by [𝑉]β†¦βˆ‘πœ‡βŠ’π‘›1π‘§πœ‡πœ’π‘‰(𝐢(πœ‡))π‘πœ‡. Then the composition Ξ›β†’πœ‘π‘…β†’πœ“Ξ›βŠ—β„š is β„Žπœ†β†¦[π‘€πœ†]β†¦βˆ‘πœ‡1π‘§πœ‡πœ’π‘€πœ†(𝐢(πœ‡))π‘πœ‡=β„Žπœ† is the identity map. Therefore πœ“ is the inverse of πœ‘ and in particular the image of πœ“ lies in Ξ› itself.

We next show πœ‘ is an isometry. To do this it’s enough to show that πœ“ is an isometry, or ([𝑉],[π‘Š])=βŸ¨πœ“([𝑉]),πœ“([π‘Š])⟩. Recall that βŸ¨π‘πœ†,π‘πœ‡βŸ©={π‘§πœ†=π‘§πœ‡ifπœ†=πœ‡0ifπœ†β‰ πœ‡. So

βŸ¨πœ“([𝑉]),πœ“([π‘Š])⟩=βˆ‘πœ†βŠ’π‘›βˆ‘πœ‡βŠ’π‘›1π‘§πœ†π‘§πœ‡πœ’π‘‰(𝐢(πœ†))πœ’π‘Š(𝐢(πœ†))βŸ¨π‘πœ†,π‘πœ‡βŸ©=πœ†=πœ‡βˆ‘πœ‡βŠ’π‘›1π‘§πœ‡πœ’π‘‰(𝐢(πœ‡))πœ’π‘Š(𝐢(πœ‡))=π‘§πœ†=𝑛!|𝐢(πœ†)|1𝑛!βˆ‘π‘”βˆˆπ”–π‘›πœ’π‘‰(𝑔)πœ’π‘Š(𝑔)=𝑉andπ‘Šare real([𝑉],[π‘Š]).

Recall that β„Žπœ†=π‘ πœ†+βˆ‘πœˆ>πœ†πΎπœˆπœ†π‘†πœˆ, where πΎπœˆπœ† are the Kostka numbers. Since this is an upper-triangular relation, we can solve π‘ πœ† in terms of β„Žπœ†: π‘ πœ†=β„Žπœ†+βˆ‘πœˆ>πœ†π‘Žπœˆπœ†β„Žπœˆ. Apply πœ‘: πœ‘(π‘ πœ†)=[π‘€πœ†]+βˆ‘πœˆ>πœ†π‘Žπœˆπœ†[π‘€πœˆ]=[π‘‰πœ†]+βˆ‘πœˆ>πœ†π‘πœˆπœ†[π‘‰πœˆ]. Since πœ‘ is an isometry, it follows that 1=βŸ¨π‘ πœ†,π‘ πœ†βŸ©=(πœ‘(π‘ πœ†),πœ‘(π‘ πœ†))=1+βˆ‘π‘πœˆπœ†2. Therefore, π‘πœˆπœ†=0 and the right hand side must be [π‘‰πœ†] alone.

To prove the third part, we prove that πœ“βˆ˜πœ”=πœ”βˆ˜πœ“. For any representation 𝑉 of 𝔖𝑛,

πœ“(π‘‰βŠ—sign)=βˆ‘πœ‡βŠ’π‘›1π‘§πœ‡πœ’π‘‰(𝐢(πœ‡))(βˆ’1)βˆ‘π‘˜(πœ‡π‘˜βˆ’1)π‘πœ‡=βˆ‘πœ‡βŠ’π‘›1π‘§πœ‡πœ’π‘‰(𝐢(πœ‡))(βˆ’1)|πœ‡|βˆ’π‘™(πœ‡)π‘πœ‡=βˆ‘πœ‡βŠ’π‘›1π‘§πœ‡πœ’π‘‰(𝐢(πœ‡))πœ”(π‘πœ‡)=πœ”(πœ“(𝑉)).

In particular, π‘€πœ†=π‘‰πœ†βŠ•β¨πœ‡βŠ³πœ†πΎπœ‡πœ†π‘‰πœ‡.

With this result, we can transfer our knowledge about symmetric functions to representations of 𝔖𝑛, and vice versa. For example, π‘πœ‡(π‘₯)=βˆ‘πœ†βŠ’π‘›πœ’π‘‰πœ†(𝐢(πœ‡))π‘ πœ†(π‘₯). For another example, recall the Littlewood-Richardson coefficients π‘ πœ†π‘ πœ‡=βˆ‘πœˆβŠ’|πœ†|+|𝜈|π‘πœ†πœ‡πœˆπ‘ πœˆ. By interpreting π‘πœ†πœ‡πœˆ as a multiplicity of irreducible representation, we can proof they are non-negative integers.

If 𝑉 is a representation of 𝔖𝑛, define its Frobenius character by 𝐹𝑉(π‘₯)β‰”βˆ‘πœ‡βŠ’π‘›1π‘§πœ‡πœ’π‘‰(𝐢(πœ‡))π‘πœ‡(π‘₯)βˆˆΞ›. Then

COR 4.10
πΉπ‘€πœ†(π‘₯)=β„Žπœ†(π‘₯), πΉπ‘‰πœ†(π‘₯)=π‘ πœ†(π‘₯).
PROP 4.11 Frobenius character formula

If πœ†βŠ’π‘›, 𝑁⩾𝑙(πœ†) (𝑙(πœ†) denoting the length of πœ†), then

πœ’π‘‰πœ†(𝐢(πœ‡))=[βˆπ‘–=1𝑁π‘₯π‘–πœ†π‘–+π‘βˆ’π‘–](∏1⩽𝑖<𝑗⩽𝑁(π‘₯π‘–βˆ’π‘₯𝑗)π‘πœ‡(π‘₯1,β‹―,π‘₯𝑁)).

[π‘₯πœ†](𝑝(π‘₯)) denotes the coefficient in 𝑝(π‘₯) before π‘₯πœ†.

We first assume that 𝑁⩾𝑛 and let π‘₯𝑁+1=π‘₯𝑁+2=β‹―=0. Then

π‘πœ‡(π‘₯1,β‹―,π‘₯𝑁)=βˆ‘πœ†βŠ’π‘›πœ’π‘‰πœ†(𝐢(πœ‡))π‘ πœ†(π‘₯1,β‹―,π‘₯𝑁).

For π›Όβˆˆβ„€β©Ύ0𝑁, define π‘Žπ›Ό(π‘₯)=det(π‘₯𝑖𝛼𝑗)1⩽𝑖,𝑗⩽𝑁. Let 𝛿=(π‘βˆ’1,π‘βˆ’2,β‹―,0). Then π‘ πœ†(π‘₯1,β‹―,π‘₯𝑁)=π‘Žπœ†+𝛿(π‘₯)π‘Žπ›Ώ(π‘₯).

Since π‘Žπ›Ώ(π‘₯)=∏1⩽𝑖<𝑗⩽𝑁(π‘₯π‘–βˆ’π‘₯𝑗),

∏1⩽𝑖<𝑗⩽𝑁(π‘₯π‘–βˆ’π‘₯𝑗)β‹…π‘πœ‡(π‘₯1,β‹―,π‘₯𝑁)=βˆ‘πœ†βŠ’π‘›πœ’π‘‰πœ†(𝐢(πœ‡))π‘Žπœ†+𝛿(π‘₯).

To proof the proposition, we only need to observe that for πœ†,πœˆβŠ’π‘›,

[π‘₯πœ†+𝛿](π‘Žπœˆ+𝛿(π‘₯))={1if𝜈=πœ†0ifπœˆβ‰ πœ†,

which directly follows from the definition of π‘Žπ›Ό, and the fact that the numbers in πœ†+𝛿 (and 𝜈+𝛿) are strictly decreasing.

To prove the result for 𝑁⩾𝑙(πœ†), notice that the right hand side of the equation remains the same for all 𝑁⩾𝑙(πœ†), and we already proved the case 𝑁⩾𝑛.

For a box (𝑖,𝑗) in πœ†, define the hook length β„Ž(𝑖,𝑗) by the number of boxes in its row and to its right, or in its column and below it, including itself. Define π‘“πœ†=∏(𝑖,𝑗)βˆˆπœ†β„Ž(𝑖,𝑗).

THM 4.12 hook length formula
dimπ‘‰πœ†=𝑛!π‘“πœ†.

Let πœ‡=(1𝑛). By Proposition 4.11, denoting 𝑁=𝑙(πœ†),

dimπ‘‰πœ†=πœ’π‘‰πœ†πΆ(πœ‡)=[βˆπ‘–=1𝑁π‘₯π‘–πœ†π‘–+π‘βˆ’π‘–](∏1⩽𝑖<𝑗⩽𝑁(π‘₯π‘–βˆ’π‘₯𝑗)(π‘₯1+β‹―+π‘₯𝑁)𝑛)=[βˆπ‘–=1𝑁π‘₯π‘–πœ†π‘–+π‘βˆ’π‘–](βˆ‘πœŽβˆˆπ”–π‘(βˆ’1)πœŽβˆπ‘–=1𝑁π‘₯π‘–π‘βˆ’πœŽ(𝑖)(π‘₯1+β‹―+π‘₯𝑁)𝑛)=βˆ‘πœŽβˆˆπ”–π‘πœŽ(𝑖)β©Ύπ‘βˆ’π‘™π‘–(βˆ’1)πœŽπ‘›!βˆπ‘–=1𝑁(𝑙1βˆ’π‘+𝜎(𝑖))!where𝑙𝑖=πœ†π‘–+π‘βˆ’π‘–=𝑛!βˆπ‘–=1𝑁𝑙𝑖!βˆ‘πœŽβˆˆπ”–π‘(βˆ’1)πœŽπ‘™π‘–(π‘™π‘–βˆ’1)β‹―(π‘™π‘–βˆ’π‘+𝜎(𝑖)+1)=𝑛!βˆπ‘™π‘–!det(𝑙𝑖⋯(π‘™π‘–βˆ’π‘+𝑗+1))=𝑛!βˆπ‘™π‘–!det(π‘™π‘–π‘βˆ’π‘—)=𝑛!βˆπ‘™π‘–!∏1⩽𝑖<𝑗<𝑁(π‘™π‘–βˆ’π‘™π‘—).

On the other hand, by a combinatorial argument,

βˆπ‘—=1πœ†1β„Ž(1,𝑗)=∏1β©½π‘˜β©½πœ†π‘–+π‘βˆ’π‘–π‘˜β‰ πœ†π‘–βˆ’πœ†π‘—+π‘—βˆ’1,βˆ€π‘—π‘˜.

Therefore the two sides are equal.

We also give a result for representations of 𝔄𝑛.

THM 4.13

Suppose πœ†βŠ’π‘›. Then

  1. If πœ†β‰ πœ†βŠ€, then Resπ”„π‘›π”–π‘›π‘‰πœ† is irreducible.

  2. If πœ†=πœ†βŠ€, then Resπ”„π‘›π”–π‘›π‘‰πœ†=π‘Šπœ†βŠ•π‘Šπœ†β€², where π‘Šπœ†β‰‡π‘Šπœ†β€² and both are irreducible representations of 𝔄𝑛.

  3. Any irreducible complex representation of 𝔄𝑛 appears inside some π‘‰πœ† and this πœ† is unique up to a transposition.

LEM 4.14
Ind𝔄𝑛𝔖𝑛1β‰…1βŠ•sign.

By Frobenius reciprocity, Hom𝔄𝑛(Resπ”„π‘›π”–π‘›π‘‰πœ†,Resπ”„π‘›π”–π‘›π‘‰πœ†)=Homπ”–πœ†(π‘‰πœ†,Ind𝔄𝑛𝔖𝑛Resπ”„π‘›π”–π‘›π‘‰πœ†).

Ind𝔄𝑛𝔖𝑛Resπ”„π‘›π”–π‘›π‘‰πœ†β‰…π‘‰πœ†βŠ—Ind𝔄𝑛𝔖𝑛1β‰…π‘‰πœ†βŠ•(π‘‰πœ†βŠ—sign)β‰…π‘‰πœ†βŠ•π‘‰πœ†βŠ€.

Therefore, if πœ†β‰ πœ†βŠ€, then Hom𝔖𝑛(π‘‰πœ†,Ind𝔄𝑛𝔖𝑛Resπ”„π‘›π”–π‘›π‘‰πœ†)=β„‚, so Resπ”„π‘›π”–π‘›π‘‰πœ† is irreducible. If πœ†=πœ†βŠ€, then Hom𝔖𝑛(π‘‰πœ†,Ind𝔄𝑛𝔖𝑛Resπ”„π‘›π”–π‘›π‘‰πœ†)=β„‚2, so Resπ”„π‘›π”–π‘›π‘‰πœ† is the direct sum of two irreducible representations π‘Šπœ†βŠ•π‘Šπœ†β€², and π‘Šπœ†β€²β‰‡π‘Šπœ†.

4.4 Representations of GL(𝑉)

4.4.1 Schur-Weyl Duality

THM 4.15 double centralizer theorem

Let 𝐸 be a finite dimensional vector space over π‘˜, 𝐴,π΅βŠ†End(𝐸) are two subalgebras, where 𝐴 is semisimple and 𝐡=End𝐴(𝐸). Then

  1. 𝐴=End𝐡(𝐸);
  2. 𝐡 is semisimple; and
  3. as a representation of π΄βŠ—π΅, πΈβ‰…β¨π‘–π‘‰π‘–βŠ—π‘Šπ‘–, where 𝑉𝑖 and π‘Šπ‘– are enumerations of irreducible representations of 𝐴 and 𝐡 respectively. In particular, there is a bijection between irreducible representations of 𝐴 and irreducible representations of 𝐡.
Since 𝐴 is semisimple, 𝐴=⨁𝑖End(𝑉𝑖), and 𝐸=β¨π‘–π‘‰π‘–βŠ—π‘Šπ‘– where π‘Šπ‘–=Hom𝐴(𝑉𝑖,𝐸) by the isotypical decomposition. Then 𝐡=End𝐴(𝐸)=Hom𝐴(β¨π‘–π‘‰π‘–βŠ—π‘Šπ‘–,β¨π‘—π‘‰π‘—βŠ—π‘Šπ‘—)=⨁𝑖End(π‘Šπ‘–), so 𝐡 is semisimple, so similarly 𝐴=End𝐡(𝐸).

Consider the case where 𝑉 is a finite dimensional vector space over β„‚ and 𝐸=π‘‰βŠ—π‘›. Let 𝔖𝑛 act on 𝐸 by permutation of tensor components, and 𝐴 be the image of β„‚[𝔖𝑛]β†’End(𝐸) under this action. Let 𝔀𝔩(𝑉) be the Lie algebra (End(𝑉),[β‹…,β‹…]).

THM 4.16 Schur-Weyl duality for 𝔀𝔩(𝑉)

The algebra 𝐡=End𝐴(𝐸)=𝑆𝑛End(𝑉) is the image of the universal enveloping algebra 𝒰︀(𝔀𝔩(𝑉)) under the natural action on 𝐸. That is, 𝐡 is generated by

Δ𝑛(𝑏)=π‘βŠ—1βŠ—β‹―βŠ—1+1βŠ—π‘βŠ—β‹―βŠ—1+β‹―+1βŠ—1βŠ—β‹―βŠ—π‘

for π‘βˆˆπ”€π”©(𝑉) as an algebra.

THM 4.17 Schur-Weyl duality for GL(𝑉)
The image of GL(𝑉) in End(𝐸) spans 𝐡=𝑆𝑛End(𝑉) as a vector space.
COR 4.18 Schur-Weyl duality

As a representation of 𝔖𝑛×GL(𝑉),

π‘‰βŠ—π‘›β‰…β¨πœ†βŠ’π‘›π‘‰πœ†βŠ—πΏπœ†,

where πΏπœ†=Hom𝔖𝑛(π‘‰πœ†,π‘‰βŠ—π‘›) is either an irreducible representation of GL(𝑉) or zero, and the non-zero πΏπœ†β€™s are distinct.

For example, if πœ†=(𝑛), then π‘‰πœ†=1, and πΏπœ†=(π‘‰βŠ—π‘›)𝔖𝑛=𝑆𝑛𝑉; if πœ†=(1𝑛), then πΏπœ†=Λ𝑛𝑉.

We now want to calculate the character of πΏπœ†. Suppose 𝑁=dim𝑉, 𝑒1,β‹―,𝑒𝑁 is a basis of 𝑉, π‘”βˆˆGL(𝑉) and πœ‰1,β‹―,πœ‰π‘ are eigenvalues of 𝑔. Suppose π‘ βˆˆπΆ(πœ‡)βŠ†π”–π‘›, and πœ‡ has π‘š1 1β€²s, π‘š2 2β€²s, .., π‘šπ‘˜ π‘˜β€™s. Then we can decompose 𝑠 into cycles of length π‘š1,β‹―,π‘šπ‘˜. For a cycle 𝑠0=(12β‹―π‘š), (π‘”βŠ—π‘šπ‘ 0)(𝑒𝑖1βŠ—β‹―βŠ—π‘’π‘–π‘š)=π‘”π‘’π‘–π‘šβŠ—π‘”π‘’π‘–1βŠ—β‹―βŠ—π‘”π‘’π‘–π‘šβˆ’1; therefore, the trace of π‘”βŠ—π‘šπ‘ 0 on π‘‰βŠ—π‘š is

trπ‘‰βŠ—π‘š=βˆ‘1⩽𝑖1,β‹―,π‘–π‘šβ©½π‘π‘”π‘–π‘šπ‘–1𝑔𝑖1𝑖2β‹―π‘”π‘–π‘šβˆ’1π‘–π‘š=trπ‘‰π‘”π‘š=π‘π‘š(πœ‰1,β‹―,πœ‰π‘).

Therefore, for π‘ βˆˆπΆ(πœ‡), trπ‘‰βŠ—π‘›(π‘”βŠ—π‘›π‘ )=π‘πœ‡(πœ‰1,β‹―,πœ‰π‘). Applying the decomposition is Corollary 4.18,

π‘πœ‡(πœ‰1,β‹―πœ‰π‘)=βˆ‘πœ†βŠ’π‘›πœ’π‘‰πœ†(𝐢(πœ‡))πœ’πΏπœ†(𝑔).

On the other hand, because the Frobenius character of π‘‰πœ† is βˆ‘πœ‡βŠ’π‘›1π‘§πœ‡πœ’π‘‰πœ†(𝐢(πœ‡))π‘πœ‡=π‘ πœ†, we also have

π‘πœ‡=βˆ‘πœ†βŠ’π‘›πœ’π‘‰πœ†(𝐢(πœ‡))π‘ πœ†.

Therefore, πœ’πΏπœ†(𝑔)=π‘ πœ†(πœ‰1,β‹―,πœ‰π‘). We thus obtained

THM 4.19 Weyl character formula

If 𝑙(πœ†)>𝑁, then πΏπœ†=0.

If 𝑙(πœ†)<𝑁, then πœ’πΏπœ†(𝑔)=π‘ πœ†(πœ‰1,β‹―,πœ‰π‘).

Using the formula

π‘ πœ†(π‘₯1,β‹―,π‘₯𝑁)=det(π‘₯π‘–πœ†π‘—+π‘βˆ’π‘—)1⩽𝑖,𝑗⩽𝑁det(π‘₯π‘–π‘βˆ’π‘—)1⩽𝑖,𝑗⩽𝑁,

taking 𝑔=id, we obtain2

COR 4.20 Weyl dimension formula
dimπΏπœ†=∏1⩽𝑖<π‘—β©½π‘πœ†π‘–βˆ’πœ†π‘—+π‘—βˆ’π‘–π‘—βˆ’π‘–.
COR 4.21

Let πœ†+(1𝑁) denote the partition of 𝑛+𝑁 that adds to 1 to every πœ†π‘–.

Then πΏπœ†+(1𝑁)β‰…πΏπœ†βŠ—Ξ›π‘π‘‰.

This corollary allows us to generalize πΏπœ† to any πœ†βˆˆβ„€π‘ with πœ†1β©Ύβ‹―β©Ύπœ†π‘, not necessarily non-negative. Take π‘Ÿβ©Ύ0 such that πœ†+(π‘Ÿπ‘) is indeed a partition (of 𝑛+π‘Ÿπ‘). We then let

πΏπœ†β‰”πΏπœ†+(π‘Ÿπ‘)βŠ—(Ξ›π‘π‘‰βˆ—)π‘Ÿ.

The representation 𝐿1𝑁≅Λ𝑁𝑉 is called the determinant representation, denoted det. Its dual representation is Ξ›π‘π‘‰βˆ—=detβˆ’1, so Ξ›π‘π‘‰βŠ—Ξ›π‘π‘‰βˆ—β‰…β„‚. Therefore, together with the corollary, this definition is independent on the choice of π‘Ÿ.

4.4.2 Algebraic Representations of GL(𝑉)

Denote 𝐺=GL(𝑉). Define 𝑅 to be the ring of polynomial functions on 𝐺, i.e. 𝑅=β„‚[𝑔𝑖𝑗][1det]. Here 𝑔𝑖𝑗 are viewed as formal variables, and det is viewed as a polynomial in 𝑔𝑖𝑗. For example, if 𝑉≅ℂ, then 𝐺=β„‚Γ— and 𝑅=β„‚[π‘₯,π‘₯βˆ’1].

If we view 𝐺 as the subvariety of π‘ˆ=Mat𝑁×𝑁×ℂ defined by the equation 𝑦⋅det𝑔=1 (where (𝑔,𝑦)∈Mat𝑁×𝑁×ℂ), then the function ring on 𝐺 is exactly β„‚[Mat𝑁×𝑁][𝑦]/(𝑦detβˆ’1)=β„‚[𝑔𝑖𝑗][1det].

A finite dimensional representation π‘Œ of GL(𝑉) is called algebraic (or rational or polynomial), if the matrix coefficients of the action on π‘Œ belongs to 𝑅; i.e., for all π‘”βˆˆGL(𝑉), π‘£βˆˆπ‘Œ and π‘’βˆˆπ‘Œβˆ—, βŸ¨π‘’,π‘”π‘£βŸ©βˆˆπ‘….

By definition, any subrepresentation or quotient representation of an algebraic representation is also algebraic. 𝑉 itself is algebraic, and so are π‘‰βˆ— and π‘‰βŠ—π‘›. Therefore, πΏπœ† are algebraic.

Denote Ξ›+={(πœ†1β©Ύβ‹―β©Ύπœ†π‘)βˆˆβ„€π‘}.3

THM 4.22 Peter-Weyl
  1. Let 𝐺×𝐺 acts on 𝑅 as ((𝑔,β„Ž)(πœ‘))(π‘₯)=πœ‘(π‘”βˆ’1π‘₯β„Ž). Then as a 𝐺×𝐺-representation, π‘…β‰…β¨πœ†βˆˆΞ›+πΏπœ†βˆ—βŠ—πΏπœ†.

  2. Any algebraic representation of 𝐺 is completely reducible.

𝐺×𝐺 acts on Mat𝑁×𝑁 by (𝑔,β„Ž)πœ‘=π‘”πœ‘β„Žβˆ’1. Then as a 𝐺×𝐺-representation, Matπ‘Γ—π‘β‰…π‘‰βŠ—π‘‰βˆ—, where the first 𝐺 acts on 𝑉 and the second 𝐺 acts on π‘‰βˆ—. β„‚[Mat𝑁×𝑁]=Sym(π‘‰βˆ—βŠ—π‘‰)=⨁𝑛⩾0𝑆𝑛(π‘‰βˆ—βŠ—π‘‰), and

(π‘‰βˆ—βŠ—π‘‰)βŠ—π‘›=(β¨πœ†βŠ’π‘›π‘™(πœ†)β©½π‘πΏπœ†βˆ—βŠ—π‘‰πœ†βˆ—)βŠ—(β¨πœ‡βŠ’π‘›π‘™(πœ‡)β©½π‘πΏπœ‡βŠ—π‘‰πœ‡),

so

𝑆𝑛(π‘‰βˆ—βŠ—π‘‰)=Hom𝔖𝑛(β„‚,(π‘‰βˆ—βŠ—π‘‰)βŠ—π‘›)=β¨πœ†βŠ’π‘›π‘™(πœ†)β©½π‘πΏπœ†βˆ—βŠ—πΏπœ†

by Schur’s lemma.

Let 𝜌 be the representation of 𝐺×𝐺 on β„‚Γ— by (𝑔,β„Ž)↦(det𝑔)βˆ’1(detβ„Ž), or as a 𝐺×𝐺-representation, πœŒβ‰…Ξ›π‘π‘‰βˆ—βŠ—Ξ›π‘π‘‰. Extend the 𝐺×𝐺-action on β„‚[Mat𝑁×𝑁] to β„‚[Mat𝑁×𝑁][𝑦] by requiring that 𝐺×𝐺 acts on 𝑦 via πœŒβˆ’1. Then

(𝑔,β„Ž)β‹…(𝑦detβˆ’1)=((𝑔,β„Ž)⋅𝑦)((det𝑔)βˆ’1(detβ„Ž)β‹…det)βˆ’1=𝑦detβˆ’1,

so

β„‚[Mat𝑁×𝑁][𝑦]=⨁𝑑⩾0β¨πœ†βŠ’π‘›π‘™(πœ†)⩽𝑁(πΏπœ†βˆ—βŠ—πΏπœ†)𝑦𝑑=⨁𝑑⩾0β¨πœ†βŠ’π‘›π‘™(πœ†)⩽𝑁(πΏπœ†βˆ—βŠ—πΏπœ†)βŠ—πœŒβˆ’π‘‘=⨁𝑑⩾0β¨πœ†βŠ’π‘›π‘™(πœ†)⩽𝑁(πΏπœ†βˆ—βŠ—πΏπœ†)βŠ—(Ξ›π‘π‘‰βŠ—Ξ›π‘π‘‰βˆ—)βŠ—π‘‘=⨁𝑑⩾0β¨πœ†βŠ’π‘›π‘™(πœ†)β©½π‘πΏπœ†βˆ’(𝑑𝑁)βˆ—βŠ—πΏπœ†βˆ’(𝑑𝑁)

So far we have copies of the same πΏπœ†βˆ— appearing from various 𝑑. Recall that 𝑅 is the quotient of β„‚[Mat𝑁×𝑁][𝑦] by (𝑦detβˆ’1). In this quotient, (πΏπœ†βˆ—βŠ—πΏπœ†)𝑦𝑑 is identified with (πΏπœ†+(1𝑁)βˆ—βŠ—πΏπœ†+(1𝑁))𝑦𝑑+1. Therefore, as 𝐺×𝐺-representations,

π‘…β‰…β¨πœ†βˆˆΞ›+πΏπœ†βˆ—βŠ—πΏπœ†.
COR 4.23
{πΏπœ‡:πœ‡βˆˆΞ›+} is a complete list of pairwise non-isomorphic irreducible algebraic representations of GL(𝑉).

4.5 The Okounkov-Vershik Approach

We treat π”–π‘˜ as the subgroup of π”–π‘˜+1 fixing π‘˜+1.

Suppose 𝐴 and 𝐡 are semisimple algebras, 𝜏:𝐡→𝐴 an algebra homomorphism. Since 𝐴 and 𝐡 are semisimple, we can write them as 𝐴=β¨π‘‰βˆˆIrr(𝐴)End(𝑉), 𝐡=β¨π‘ˆβˆˆIrr(𝐡)End(π‘ˆ). For π‘ˆβˆˆIrr(𝐡) and π‘‰βˆˆIrr(𝐴), let 𝑀𝑉,π‘ˆ=Hom𝐡(π‘ˆ,𝑉), where 𝑉 is seen as an representation of 𝐡 by composition π΅β†’πœπ΄β†’πœŒπ‘‰End(𝑉). Then π‘‰β‰…β¨π‘ˆβˆˆIrr(𝐡)π‘ˆβŠ—π‘€π‘‰,π‘ˆ as representations of 𝐡 (𝑀𝑉,π‘ˆ records the multiplicity of π‘ˆ and does not have a 𝐡-action).

Define the centralizer 𝑍𝐡(𝐴)={π‘Žβˆˆπ΄:π‘Žπœ(𝑏)=𝜏(𝑏)π‘Ž,βˆ€π‘βˆˆπ΅}. The centralizer is a subalgebra of 𝐴, and acts on 𝑀𝑉,π‘ˆ by (π‘Žβ‹…πœ‘)(𝑒)=π‘Ž(πœ‘(𝑒)).

Since 𝐴 can be written as β¨π‘‰βˆˆIrr(𝐴)End(𝑉), we can write 𝑍𝐡(𝐴) as

𝑍𝐡(𝐴)=𝑍𝐡(β¨π‘‰βˆˆIrr(𝐴)End(𝑉))=β¨π‘‰βˆˆIrr(𝐴)Hom𝐡(𝑉,𝑉)=β¨π‘‰βˆˆIrr(𝐴)Hom𝐡(β¨π‘ˆβˆˆIrr(𝐡)π‘ˆβŠ—π‘€π‘‰,π‘ˆ,β¨π‘ˆβ€²βˆˆIrr(𝐡)π‘ˆβŠ—π‘€π‘‰,π‘ˆβ€²)=Schur lemmaβ¨π‘‰βˆˆIrr(𝐴)π‘ˆβˆˆIrr(𝐡)𝑀𝑉,π‘ˆβ‰ 0End(𝑀𝑉,π‘ˆ).

As a corollary, 𝑍𝐡(𝐴) is commutative if and only if for all π‘ˆβˆˆIrr(𝐡) and π‘‰βˆˆIrr(𝐴), dimHom𝐡(π‘ˆ,𝑉)β©½1.

Suppose π»βŠ†πΊ are finite groups. If 𝜏:𝐡→𝐴 is an inclusion of group algebras β„‚[𝐻]β†ͺοΈŽβ„‚[𝐺], then 𝑍ℂ[𝐻](β„‚[𝐺]) consists of elements βˆ‘π‘”βˆˆπΊπ‘Žπ‘”π‘” where π‘Žπ‘”=π‘Žβ„Žπ‘”β„Žβˆ’1 for all β„Žβˆˆπ». Hence, 𝑍ℂ[𝐻](β„‚[𝐺]) has a basis 𝑏𝐢=βˆ‘π‘”βˆˆπΆπ‘” where 𝐢 is an 𝐻-conjugacy class in 𝐺.

We now take 𝜏:𝐡→𝐴 to be the inclusion β„‚[π”–π‘š]β†ͺοΈŽβ„‚[𝔖𝑛] for 0β©½π‘šβ©½π‘› and denote π‘π‘š(𝑛)=𝑍ℂ[π”–π‘š](β„‚[𝔖𝑛]). The π”–π‘š-conjugacy classes in 𝔖𝑛 are cycles with marked elements π‘š+1,π‘š+2,β‹―,𝑛. For example, when π‘š=3, 𝑛=6, some marked cycles are

(βˆ—βˆ—4)(5)(6),(βˆ—βˆ—5)(4 6),(βˆ—βˆ—5)(βˆ—4)(6),β‹―

For another example, if π‘š=π‘›βˆ’1, then (βˆ—π‘›) is a conjugacy class, and the corresponding basis element 𝑏(βˆ—π‘›)=βˆ‘π‘—=1π‘›βˆ’1(𝑗 𝑛) is called the 𝑛-th Jucys-Murphy element.

Let 𝔖[π‘š+1,𝑛]={π‘”βˆˆπ”–π‘›:𝑔(𝑖)=𝑖,βˆ€1β©½π‘–β©½π‘š}. π‘π‘š(𝑛) contains the following elements:

THM 4.24
The algebra π‘π‘š(𝑛) is generated by the above elements.

As a corollary, π‘π‘›βˆ’1(𝑛) is commutative, so any irreducible representation of π”–π‘›βˆ’1 appears at most once in the restriction of any irreducible representation of 𝔖𝑛 to π”–π‘›βˆ’1, and according to Schur lemma, 𝐽𝑛 acts by scalar multiplication on each irreducible π”–π‘›βˆ’1-subrepresentation of any irreducible 𝔖𝑛-representation. (This is a consequence of the branching law: the restriction of π‘‰πœ† from 𝔖𝑛 to π”–π‘›βˆ’1 decomposes into π‘‰πœ†βˆ–β–‘ where β–‘ ranges through all removable box of πœ†.)

Based on this, we define the branching graph as an infinite directed tree with vertices isomorphism classes of irreducible representations of symmetric groups, and edges π‘ˆβ†’π‘‰ where π‘‰βˆˆIrr(𝔖𝑛), π‘ˆβˆˆIrr(π”–π‘›βˆ’1) for some 𝑛, such that π‘ˆ appears in Resπ”–π‘›βˆ’1𝔖𝑛(𝑉). This graph remains invariant if we tensor every representation with the sign representation, replacing π‘ˆ by π‘ˆβŠ—sign𝑛; this makes it β€œsymmetric”.

Suppose π‘‰π‘›βˆˆIrr(𝔖𝑛) for π‘›βˆˆβ„€+, and denote Path(π‘‰π‘š,𝑉𝑛) the set of all paths from π‘‰π‘š to 𝑉𝑛 in the branching graph. Let Path(𝑉𝑛)=Path(triv1,𝑉𝑛) and Path𝑛=β¨†π‘‰π‘›βˆˆIrr(𝔖𝑛)Path(𝑉𝑛). For 𝑃=(π‘‰π‘šβ†’β‹―β†’π‘‰π‘›)∈Path(π‘‰π‘š,𝑉𝑛), write π‘‰π‘š(𝑃) for the copy of π‘‰π‘š inside 𝑉𝑛 by the composition of inclusions corresponding to 𝑃. Then, as π”–π‘š-representations,

𝑉𝑛=β¨π‘‰π‘šβˆˆIrr(π”–π‘š)β¨π‘ƒβˆˆPath(π‘‰π‘š,𝑉𝑛)π‘‰π‘š(𝑃).

Let πœ‘π‘ƒ:π‘‰π‘šβ†ͺοΈŽπ‘‰π‘› be the embedding corresponding to path 𝑃; they form a basis for Homπ”–π‘š(π‘‰π‘š,𝑉𝑛).

π‘π‘š(𝑛) acts on Homπ”–π‘š(π‘‰π‘š,𝑉𝑛) by (π‘Žβ‹…πœ‘)(𝑒)=π‘Žβ‹…πœ‘(𝑒). Since π½π‘˜βˆˆπ‘π‘š(𝑛), π½π‘˜ also acts on Homπ”–π‘š(π‘‰π‘š,𝑉𝑛). For every edge π‘‰π‘˜βˆ’1β†’π‘‰π‘˜ in the path, assign a number π‘€π‘˜ to it, defined as the scalar by which π½π‘˜ acts on π‘‰π‘˜βˆ’1: π½π‘˜|π‘‰π‘˜βˆ’1=π‘€π‘˜idπ‘‰π‘˜βˆ’1. Then π½π‘˜ acts on πœ‘π‘ƒ as π½π‘˜β‹…πœ‘π‘ƒ=π‘€π‘˜πœ‘π‘ƒ. The weight vector (π‘€π‘š+1,β‹―,𝑀𝑛) is denoted by 𝑀𝑃.

LEM 4.25
{πœ‘π‘ƒ:π‘ƒβˆˆPath(π‘‰π‘š,𝑉𝑛)} is a basis for Homπ”–π‘š(π‘‰π‘š,𝑉𝑛).

Since 𝑉1=triv1, Hom𝔖𝑛(𝑉1,𝑉𝑛)=𝑉𝑛. Let 𝑣𝑃=πœ‘π‘ƒ for π‘ƒβˆˆPath(𝑉𝑛). As a corollary, {𝑣𝑃:π‘ƒβˆˆPath(𝑉𝑛)} is a basis for 𝑉𝑛, and for any 1β©½π‘˜β©½π‘›, π½π‘˜π‘£π‘ƒ=π‘€π‘˜π‘£π‘ƒ.

As another corollary, if π‘ƒβˆˆPath(π‘‰π‘š) and π‘„βˆˆPath(π‘‰π‘š,𝑉𝑛), then 𝑣𝑃𝑄 is proportional to πœ‘π‘„(𝑣𝑃).

THM 4.26
Suppose 𝑃,π‘ƒβ€²βˆˆPath𝑛. Then 𝑀𝑃=𝑀𝑃′ if and only if 𝑃=𝑃′.

Denote wt𝑛={𝑀𝑃:π‘ƒβˆˆPath𝑛}. We say 𝑀𝑃 and 𝑀𝑃′ are r-equivalent if they are the weights of two paths leading to the same irreducible representation. This is an equivalence relation, therefore the study of Irr(𝔖𝑛) reduces to the study of equivalence classes of r-equivalence.

Let Path(𝑃,𝑖) be the set of paths that differs from 𝑃 only at level 𝑖. Denote 𝑉𝑃,𝑖=Spanβ„‚{𝑣𝑃:π‘ƒβˆˆPath(𝑃,𝑖)}βŠ†π‘‰π‘›.

PROP 4.27
𝑉𝑃,π‘–βŠ†π‘‰π‘› is a π‘π‘–βˆ’1(𝑖+1)-submodule, and it’s an irreducible π‘π‘–βˆ’1(𝑖+1)-module.

Recall that π‘π‘–βˆ’1(𝑖+1) is generated by π‘π‘–βˆ’1(π‘–βˆ’1), 𝑋1=𝐽𝑖, 𝑋2=𝐽𝑖+1 and 𝑇=(𝑖 𝑖+1). Observe that 𝑋1, 𝑋2 and 𝑇 has the following relations:

𝑋1𝑋2=𝑋2𝑋1, 𝑇2=1, 𝑇𝑋1=𝑋2π‘‡βˆ’1.

The algebra generated by the above three relations is called a degenerate affine Hecke algebra β„‹οΈ€(2). Then there is an algebra homomorphism β„‹οΈ€(2)β†’π‘π‘–βˆ’1(𝑖+1).

PROP 4.28
If 𝑀 is an irreducible π‘π‘–βˆ’1(𝑖+1)-module, then 𝑀 is also irreducible as an β„‹οΈ€(2)-module.
THM 4.29

The finite-dimensional irreducible representations of β„‹οΈ€(2) are classified by (π‘Ž,𝑏)βˆˆβ„‚2↦𝐿(π‘Ž,𝑏), where (π‘Ž,𝑏) are simultaneous eigenvalues of 𝑋1 and 𝑋2 in 𝐿(π‘Ž,𝑏):

  1. If 𝑏=π‘Ž+1, then 𝐿(π‘Ž,𝑏)=β„‚, 𝑇↦1, 𝑋1β†¦π‘Ž and 𝑋2↦𝑏.

  2. If 𝑏=π‘Žβˆ’1, then 𝐿(π‘Ž,𝑏)=β„‚, π‘‡β†¦βˆ’1, 𝑋1β†¦π‘Ž and 𝑋2↦𝑏.

  3. If π‘β‰ π‘ŽΒ±1, then 𝐿(π‘Ž,𝑏)=β„‚2, 𝑇↦(11), 𝑋1↦(π‘Žβˆ’1𝑏) and 𝑋2↦(𝑏1π‘Ž).

  4. 𝑋1 and 𝑋2 are diagonalizable in 𝐿(π‘Ž,𝑏) if and only if π‘Žβ‰ π‘.

𝑉𝑃,𝑖 is isomorphic to Homπ”–π‘–βˆ’1(π‘‰π‘–βˆ’1,𝑉𝑖+1) as a π‘π‘–βˆ’1(𝑖+1)-module, and this is an irreducible representation for π‘π‘–βˆ’1(𝑖+1). Since there is an algebra homomorphism from β„‹οΈ€(2) to π‘π‘–βˆ’1(𝑖+1), 𝑉𝑃,𝑖 is also an irreducible β„‹οΈ€(2)-module. Therefore, 𝑉𝑃,𝑖 is isomorphic to one of the 𝐿 defined above. By the classification, we obtain

THM 4.30 Path(𝑃,𝑖) theorem

Let 𝑀𝑃=(𝑀1,β‹―,𝑀𝑛)∈wt𝑛. Then

  1. 𝑀𝑖≠𝑀𝑖+1;

  2. If 𝑀𝑖+1=𝑀𝑖±1, then Path(𝑃,𝑖)={𝑃};

  3. If 𝑀𝑖+1≠𝑀𝑖±1, then Path(𝑃,𝑖)={𝑃,𝑃′} and

    𝑀𝑃′=(𝑀1,β‹―,π‘€π‘–βˆ’1,𝑀𝑖+1,𝑀𝑖,𝑀𝑖+2,β‹―,𝑀𝑛);
  4. If 𝑖<π‘›βˆ’1, 𝑀𝑖=𝑀𝑖+1Β±1 implies that 𝑀𝑖+2≠𝑀𝑖.

According to this theorem, we define an admissible transposition on ℂ𝑛 as a transposition (𝑀1,β‹―,𝑀𝑛)↦(β‹―,π‘€π‘–βˆ’1,𝑀𝑖+1,𝑀𝑖,𝑀𝑖+2,β‹―) where 𝑀𝑖+1≠𝑀𝑖±1. We say two elements of ℂ𝑛 are c-equivalent, denoted by ∼c, if one is obtained from the other by a sequence of admissible transpositions. A combinatorial weight is an element in ℂ𝑛 such that every element 𝑀 c-equivlent to it satisfies 𝑀1=0, 𝑀𝑖≠𝑀𝑖+1 for all 1β©½π‘–β©½π‘›βˆ’1, and 𝑀𝑖+1=𝑀𝑖±1 implies 𝑀𝑖+2≠𝑀𝑖 for all 1β©½π‘–β©½π‘›βˆ’2. Let cwt𝑛 be the set of combinatorial weights.

COR 4.31
  1. wtπ‘›βŠ†cwt𝑛, and wt𝑛 is a union of c-equivalence classes;
  2. c-equivalence implies r-equivalence in wt𝑛.

Therefore, the number of r-equivalence classes is no larger than the number of c-equivalence classes in wt𝑛, and is in turn no larger the that in cwt𝑛. On the other hand, the number of r-equivalence classes is equal to the number of irreducible representations of 𝔖𝑛, which is 𝑝(𝑛), the partition number of 𝑛. We now prove the final combinatorial lemma, that

LEM 4.32

Every c-equivalence class in cwt𝑛 contains an element of the form

(0,1,2,β‹―,𝑛1βˆ’1,βˆ’1,0,1β‹―,𝑛2βˆ’2,βˆ’2,βˆ’1,0,β‹―,𝑛3βˆ’3,β‹―,1βˆ’π‘˜,2βˆ’π‘˜,3βˆ’π‘˜,β‹―,π‘›π‘˜βˆ’π‘˜)

for some positive integers 𝑛1⩾𝑛2β©Ύβ‹―β©Ύπ‘›π‘˜β©Ύ1 such that βˆ‘π‘–π‘›π‘–=𝑛.

In particular, the number of c-equivalence classes in cwt𝑛 is no larger than 𝑝(𝑛), completing the cycle of inequalities.

Consider the lexicographic order on an equivalence class in cwt𝑛. Let (𝑀1,β‹―,𝑀𝑛) be the maximal element in its equivalence classes. This element has the desired form.

This implies cwt𝑛=wt𝑛, c-equivalence is r-equivalence, and the (𝑛1,β‹―,π‘›π‘˜) in the lemma is unique; this establishes a bijection between irreducible representations of 𝔖𝑛 with a partition (𝑛1,β‹―,π‘›π‘˜) of 𝑛.

To see the relation with Young diagrams, suppose πœ† be a partition of 𝑛 and 𝑇 is a standard Young tableaux of of shape πœ†. Its content is defined by 𝑐(𝑇)=(π‘₯1βˆ’π‘¦1,β‹―,π‘₯π‘›βˆ’π‘¦π‘›)βˆˆβ„€π‘›, where (π‘₯𝑖,𝑦𝑖) is the coordinate of the box labelled by 𝑖. The content 𝑇↦𝑐(𝑇) gives a bijection between standard Young tableaux with 𝑛 boxes and cwt𝑛, and the shape of the tableaux is equal to the partition defined in Lemma 4.32. As a corollary, π‘‰πœ† has a basis given by 𝑣𝑇, where 𝑇 iterates over all standard Young tableaux of shape πœ†, and the Jucys-Murphy elements act on this basis as 𝐽𝑖𝑣𝑇=(π‘₯π‘–βˆ’π‘¦π‘–)𝑣𝑇, where (π‘₯𝑖,𝑦𝑖) is the coordinate of the box labelled 𝑖 in 𝑇. As another corollary, we obtain the branching rule Resπ”–π‘›βˆ’1𝔖𝑛(π‘‰πœ†)=β¨πœ‡=πœ†βˆ–β–‘π‘‰πœ‡, and 𝐽𝑛 acts on π‘‰πœ‡ by scalar multiplication by the content of the removed box.

Section 5 Representations of GL2(π”½π‘ž)

Let 𝐺=GL2(π”½π‘ž), with |𝐺|=(π‘ž2βˆ’1)(π‘ž2βˆ’π‘ž). Suppose 𝐴∈𝐺 with eigenvalues πœ†1, πœ†2. Let 𝐢𝐴 be the conjugacy class of 𝐴.

Case a: parabolic, πœ†1=πœ†2=π‘₯βˆˆπ”½π‘žΓ—. If 𝐴 is diagonalizable, then |𝐢𝐴|=1. If not, then 𝐴∼(π‘₯1π‘₯), and |𝐢𝐴|=|𝐺|(π‘žβˆ’1)π‘ž=π‘ž2βˆ’1.

Case b: hyperbolic, πœ†1β‰ πœ†2βˆˆπ”½π‘žΓ—. Then |𝐢𝐴|=|𝐺|(π‘žβˆ’1)2=π‘ž2+π‘ž.

Case c: elliptic, πœ†1β‰ πœ†2βˆ‰π”½π‘ž. Consider a quadratic extension of π”½π‘ž, π”½π‘ž2=π”½π‘ž[πœ€]. Then πœ†1=𝛼1+𝛼2πœ€, πœ†2=𝛼1βˆ’π›Ό2πœ€=πœ†1, where π›Όπ‘–βˆˆπ”½π‘žβˆ—, and 𝐴∼(π‘₯πœ€π‘¦π‘¦π‘₯). |𝐢𝐴|=π‘ž2βˆ’π‘ž.

Represen-
tatives 𝐴
|𝐢𝐴|number of
classes
(π‘₯π‘₯)1π‘žβˆ’1
(π‘₯1π‘₯)π‘ž2βˆ’1π‘žβˆ’1
(π‘₯𝑦),π‘₯β‰ π‘¦π‘ž2+π‘ž12(π‘žβˆ’1)(π‘žβˆ’2)
(π‘₯πœ€π‘¦π‘¦π‘₯)π‘ž2βˆ’π‘ž12π‘ž(π‘žβˆ’1)

We start with 1-dimensional representations. Any 1-dimensional representation factors through 𝐺/[𝐺,𝐺].

LEM 5.1
[𝐺,𝐺]=SL2(π”½π‘ž); the quotient map 𝐺→𝐺/[𝐺,𝐺] is given by 𝑔↦det𝑔.

Therefore, 𝐺/[𝐺,𝐺]β‰…π”½π‘žβˆ—β‰…πΆπ‘žβˆ’1. Therefore, any 1-dimensional representation of 𝐺 is of the form 𝜌(𝑔)=πœ‰(det𝑔), where πœ‰ is a 1-dimensional representation of π”½π‘žβˆ—. This representation will be denoted β„‚πœ†. This gives us π‘žβˆ’1 1-dimensional representations.

We can also construct the principal series representations. Let 𝐡 be the subgroup of upper diagonal matrices (the Borel subgroup), π‘ˆ the subgroup of upper diagonal matrices with diagonals equal to 1, and 𝑇 the subgroup of diagonal matrices. Then 𝐡/[𝐡,𝐡]=𝐡/π‘ˆ=𝑇, and if πœ†π‘– are representations of π”½π‘žΓ—, then (π‘Žπ‘‘)β†¦πœ†1(π‘Ž)πœ†2(𝑏) gives a representation of 𝑇. The composition πœŒπœ†1πœ†2:𝐡→𝑇→ℂ× gives a representation of 𝐡, denoted β„‚πœ†1πœ†2, and its induces a representation of 𝐺, denoted π‘‰πœ†1πœ†2=Indπ΅πΊβ„‚πœ†1πœ†2.

THM 5.2
  • If πœ†1β‰ πœ†2, then π‘‰πœ†1πœ†2 is irreducible. Moreover, π‘‰πœ†1πœ†2 are distinct for different unordered pairs {πœ†1,πœ†2} (πœ†1β‰ πœ†2).

  • If πœ†1=πœ†2=πœ‡, then π‘‰πœ‡πœ‡β‰…β„‚πœ‡βŠ•π‘Šπœ‡, where π‘Šπœ‡ is an irreducible representation of 𝐺. Moreover, π‘Šπœ‡ are distinct for different πœ‡β€™s.

By 𝐺=𝐡βˆͺ𝐡𝑠𝐡 where 𝑠=(11), and π‘ π΅π‘ βˆ’1∩𝐡=𝑇. By Theorem 3.17, Res𝐡𝐺(π‘‰πœ†1πœ†2)=πœŒπœ†1πœ†2βŠ•Ind𝑇𝐡(πœŒπœ†1πœ†2𝑠), where πœŒπœ†1πœ†2𝑠:(π‘Žπ‘‘)β†¦πœŒπœ†1πœ†2(π‘ βˆ’1(π‘Žπ‘‘)𝑠)=πœ†2(π‘Ž)πœ†1(𝑑). When πœ†1β‰ πœ†2, πœŒπœ†1,πœ†2𝑠 and Res𝑇𝐡(πœŒπœ†1πœ†2) are then disjoint, so π‘‰πœ†1πœ†2 are irreducible. Moreover, if πœ†1β‰ πœ†2, πœ†1β€²β‰ πœ†2β€²,

Hom𝐺(π‘‰πœ†1πœ†2,π‘‰πœ†1β€²,πœ†2β€²)β‰…Hom𝐡(πœŒπœ†1πœ†2βŠ•Ind𝑇𝐡(πœŒπœ†1πœ†2𝑠),πœŒπœ†1β€²πœ†2β€²)=Hom𝐡(πœŒπœ†1πœ†2,πœŒπœ†1β€²πœ†2β€²)βŠ•Hom𝑇(πœŒπœ†1πœ†2𝑠,ResπœŒπœ†1β€²πœ†2β€²)=Hom𝐡(πœŒπœ†1πœ†2,πœŒπœ†1β€²πœ†2β€²)βŠ•Hom𝑇(ResπœŒπœ†2πœ†1,ResπœŒπœ†1β€²πœ†2β€²)=β„‚iff{πœ†1,πœ†2}={πœ†1β€²,πœ†2β€²}.

When πœ†1=πœ†2=πœ‡, Res𝐡𝐺(β„‚πœ‡)=πœŒπœ‡πœ‡, so Hom𝐺(πΆπœ‡,π‘‰πœ‡πœ‡)β‰…Hom𝐡(Res𝐡𝐺(β„‚πœ‡),πœŒπœ‡πœ‡)β‰…β„‚, so β„‚πœ‡βŠ†π‘‰πœ‡πœ‡. Therefore, π‘‰πœ‡πœ‡=πΆπœ‡βŠ•π‘Šπœ‡. Since Hom𝐺(π‘‰πœ‡πœ‡,π‘‰πœ‡πœ‡)=β„‚2 by the same calculation as EquationΒ 70, we deduce Hom𝐺(π‘Šπœ‡,π‘Šπœ‡)=β„‚, so π‘Šπœ‡ is irreducible of dimension π‘ž. Moreover, Hom𝐺(π‘‰πœ‡πœ‡,π‘‰πœˆπœˆ)=Hom𝐡(πœŒπœ‡πœ‡,𝜌𝜈𝜈)βŠ•Hom𝑇(ResπœŒπœ‡πœ‡,Res𝜌𝜈𝜈)=β„‚2 iff πœ‡=𝜈, so π‘Šπœ‡β‰…π‘Šπœˆ iff πœ‡=𝜈.

Therefore π‘‰πœ†1πœ†2 gives us 12(π‘žβˆ’1)(π‘žβˆ’2) many (π‘ž+1)-dimensional irreducible representations, and π‘Šπœ‡ gives us π‘žβˆ’1 many π‘ž-dimensional irreducible representations. By Proposition 4.11,

Conjugacy classπœ’π‘‰πœ†1πœ†2(𝑔)
(π‘₯π‘₯)(π‘ž+1)πœ†1(π‘₯)πœ†2(π‘₯)
(π‘₯1π‘₯)πœ†1(π‘₯)πœ†2(π‘₯)
(π‘₯𝑦),π‘₯β‰ π‘¦πœ†1(π‘₯)πœ†2(𝑦)+πœ†2(π‘₯)πœ†1(𝑦)
(π‘₯πœ€π‘¦π‘¦π‘₯)0

Another family of representations are the complementary series representations. We can identify 𝐺 with the group of invertible π”½π‘ž-linear automorphisms of π”½π‘ž2. This way, 𝐺 contains the cyclic subgroup π”½π‘ž2Γ—={π‘₯+π‘¦πœ€:π‘₯,π‘¦βˆˆπ”½π‘ž,(π‘₯,𝑦)β‰ (0,0)}, or in GL2(π”½π‘ž), {(π‘₯πœ€π‘¦π‘¦π‘₯):(π‘₯,𝑦)β‰ (0,0)}. Denote the subgroup by 𝐾. Then every character 𝜈 of 𝐾 can be induced to a representation of 𝐺, denoted π‘Œπœˆ. By Proposition 4.11,

Conjugacy classπœ’π‘Œπœˆ(𝑔)
(π‘₯π‘₯)π‘ž(π‘žβˆ’1)𝜈(π‘₯)
(π‘₯1π‘₯)0
(π‘₯𝑦),π‘₯≠𝑦0
(π‘₯πœ€π‘¦π‘¦π‘₯)𝜈(π‘₯+π‘¦πœ€)+𝜈(π‘₯βˆ’π‘¦πœ€)

Notice that 𝜈(π‘₯βˆ’π‘¦πœ€)=𝜈(π‘₯+π‘¦πœ€)π‘ž via the Frobenius automorphism π‘₯↦π‘₯π‘ž. Also via the Frobenius automorphism, π‘Œπœˆβ‰…π‘Œπœˆπ‘ž.

Consider the virtual representation π‘‹πœˆ=π‘Š1βŠ—π‘‰π›Ό1βˆ’π‘‰π›Ό1βˆ’π‘Œπœˆ, where 𝛼=𝜈|π”½π‘žΓ—.

Conjugacy classπœ’π‘‹πœˆ(𝑔)
(π‘₯π‘₯)(π‘žβˆ’1)𝛼(π‘₯)
(π‘₯1π‘₯)βˆ’π›Ό(π‘₯)
(π‘₯𝑦),π‘₯≠𝑦0
(π‘₯πœ€π‘¦π‘¦π‘₯)βˆ’πœˆ(π‘₯+π‘¦πœ€)βˆ’πœˆ(π‘₯+π‘¦πœ€)π‘ž
LEM 5.3
Assume πœˆπ‘žβ‰ πœˆ. Then (πœ’π‘‹πœˆ,πœ’π‘‹πœˆ)=1 and πœ’π‘‹πœˆ(1)=π‘žβˆ’1>0, so π‘‹πœˆ is an irreducible representation. π‘‹πœˆβ‰…π‘‹πœˆβ€² iff πœˆβ€²β‰ πœˆ,πœˆπ‘ž.

π‘‹πœˆ thus gives us 12π‘ž(π‘žβˆ’1) many (π‘žβˆ’1)-dimensional irreducible representations.

π‘‰πœ†1πœ†2 (πœ†1β‰ πœ†2), π‘Šπœ‡, β„‚πœ‡ and π‘‹πœˆ (πœˆπ‘žβ‰ πœˆ) thus gives all irreducible representations of GL2(π”½π‘ž).

Section 6 Representations of Quivers

Suppose Ξ“=(𝐼,𝐸) is a connected graph with no self loops. Denote its adjacency matrix by 𝑅Γ. Ξ“ is called a Dynkin diagram if the quadratic form on ℝ𝑁 defined by 𝐴Γ=2πΌβˆ’π‘…Ξ“ is positive definite.

THM 6.1

All Dynkin diagrams are classified by three families:

𝐴𝑁 (shown here 𝐴5)
𝐷𝑁 (shown here 𝐷6)
𝐸6
𝐸7
𝐸8

Suppose Ξ“ is a Dynkin diagram, define the bilinear form 𝐡(π‘₯,𝑦)=π‘₯βŠ€π΄Ξ“π‘¦ on ℀𝑛. Then 𝐡 is positive definite, and 𝐡(π‘₯,π‘₯)=2βˆ‘π‘₯𝑖2βˆ’βˆ‘π‘–β‰ π‘—π‘Ÿπ‘–π‘—π‘₯𝑖π‘₯𝑗, where π‘Ÿπ‘–π‘— is 1 or 0 determined by whether 𝑖 and 𝑗 are connected or not. In particular, 𝐡(π‘₯,π‘₯) is always even. A root with respect to a certain positive definite inner product 𝐡 is a shortest non-zero vector in ℀𝑛, and in this case, π‘£βˆˆβ„€π‘› such that 𝐡(𝑣,𝑣)=2. Obviously there are only finitely many roots. Define the simple roots 𝛼𝑖=(0,β‹―,0,1,0,β‹―,0) with 1 on the 𝑖-th component.

LEM 6.2
If 𝛼 is a root, 𝛼=βˆ‘π‘–π‘˜π‘–π›Όπ‘–, then either all π‘˜π‘– are non-negative, or all π‘˜π‘– are non-positive. 𝛼 is called a positive root or a negative root correspondingly.
Argue by contradiction. Assume that π‘˜π‘–>0, π‘˜π‘—<0 and π‘˜π‘ =0 for all 𝑠 in between 𝑖 and 𝑗. Let πœ€ be the edge connecting 𝑖 with the other vertex 𝑖′ towards 𝑗. Delete πœ€ and Ξ“ breaks into two parts, Ξ“1 containing 𝑖 and Ξ“2 containing 𝑗. Suppose 𝛽 and 𝛾 are vectors obtained by restricting the indices of 𝛼 to vertices of Ξ“1 and Ξ“2, respectively, then 𝛼=𝛽+𝛾, 𝐡(𝛽,𝛽)β©Ύ2, 𝐡(𝛾,𝛾)β©Ύ2, and 2=𝐡(𝛼,𝛼)=𝐡(𝛽,𝛽)+𝐡(𝛾,𝛾)+2𝐡(𝛽,𝛾). However, 𝐡(𝛽,𝛾)=βˆ’π‘˜π‘–π‘˜π‘–β€²β©Ύ0, contradiction.

Let 𝑅 be the set of roots, 𝑅+ the set of positive roots, and π‘…βˆ’ the set of negative roots (π‘…βˆ’=βˆ’π‘…+).

If 𝛼 is a root, the reflection 𝑠𝛼 on ℝ𝑛 is 𝑠𝛼(𝑣)=π‘£βˆ’π΅(𝑣,𝛼)𝛼. It is equivalent as the reflection along the hyperplain 𝐻𝛼 orthogonal to 𝛼. If 𝛼=𝛼𝑖 is a simple root, 𝑠𝛼=𝑠𝑖 is called a simple reflection, and the subgroup of O(ℝ𝑛) generated by 𝑠𝑖 is called the Weyl group π‘Š. If the number of roots is finite, then π‘Š is finite. If we fix a labelling 1,2,β‹―,𝑛 of the vertices of 𝑄, then 𝑐=𝑠1𝑠2β‹―π‘ π‘›βˆˆπ‘Š is called the Coxeter element.

LEM 6.3
Let 𝛽=βˆ‘π‘˜π‘–π›Όπ‘–β‰ 0 with π‘˜π‘–β©Ύ0 for all 𝑖. Then there is some 𝑁>0, such that 𝑐𝑁𝛽 has at least one strictly negative coefficient.

Suppose 𝑄 is a quiver, or equivalently a directed graph. For any π‘–βˆˆπΌ, define the representation 𝑆(𝑖) by assigning to each vertex 𝑗 the vector space 𝑆(𝑖)𝑗=0 if 𝑗≠𝑖 and β„‚ if 𝑗=𝑖, and for any β„ŽβˆˆπΈ, the linear map assigned to β„Ž is π‘₯β„Ž=0. 𝑆(𝑖) is an irreducible representation, and are non-isomorphic for different 𝑖.

THM 6.4
Assume 𝑄 has no oriented cycles. Then 𝑆(𝑖) are all irreducible representations of 𝑄.
Suppose 𝑉 is a irreducible representation of 𝑄, let 𝐼′={π‘–βˆˆπΌ:𝑉𝑖≠0}. We want to find an π‘–βˆˆπΌβ€² such that dim𝑉𝑖⋅𝑆(𝑖) is a subrepresentation of 𝑉. A sufficient condition for such an 𝑖 if that for any π‘—βˆˆπΌβ€², there is no edge from 𝑖 to 𝑗. This is ensured by the assumption that 𝑄 has no oriented cycles.

For a representation 𝑉 of 𝑄, define its dimension vector by

dim𝑉=(dim𝑉1,β‹―,dim𝑉𝑛)βˆˆβ„€β©Ύ0𝑁.

For π‘£βˆˆβ„€β©Ύ0𝐼, let the representation space be Rep(𝑄,𝑣) be the space of representations 𝑉 of 𝑄 such that dim𝑉=𝑣, Equivalently,

Rep(𝑄,𝑣)=β¨β„ŽβˆˆπΈHomβ„‚(β„‚π‘£β„Žβ€²,β„‚π‘£β„Žβ€³).

GL(𝑣)β‰”βˆπ‘–βˆˆπΌGL(𝑣𝑖) acts on Rep(𝑄,𝑣) by conjugation: π‘₯β„Žβ†¦π‘”β„Žβ€³π‘₯β„Žπ‘”β„Žβ€²βˆ’1. Two representations in Rep(𝑄,𝑣) are isomorphic if and only if they are in the same GL(𝑣)-orbit.

A quiver 𝑄 is of finite type if the number of indecomposable representations is finite up to isomorphisms. A non-example is the Jordan quiver consisting of one vertex and one self-loop.

THM 6.5 Gabriel

A connected quiver 𝑄 is of finite type, if and only if the underlying unoriented graph Ξ“ is a Dynkin diagram.

Moreover, isomorphism classes of indecomposable representations of 𝑄 are in one-to-one correspondence with the positive roots associated to Ξ“, by π‘‰βŸ·dim𝑉.

For the only if part we refer to the homework (it requires a bit algebraic geometry). We now prove the if part.

If 𝑄 is a quiver, call π‘–βˆˆπΌ a sink or source if all edges connected to 𝑖 points towards / away from 𝑖. If 𝑖 is a sink or a source, let 𝑄𝑖 be the quiver obtained from 𝑄 by reversing all arrows connected to 𝑖.

We define the reflection functor, as follows. If 𝑖 is a sink, define 𝐹𝑖+:Rep(𝑄)β†’Rep(𝑄𝑖) by

(𝐹𝑖+(𝑉))𝑗={𝑉𝑗𝑗≠𝑖ker(β¨π‘˜β†’π‘–π‘‰π‘˜β†’π‘‰π‘–)𝑗=𝑖

and for an edge π‘—β†’β„Žπ‘˜, if π‘˜β‰ π‘–, π‘₯β„Ž stays the same, and if π‘˜=𝑖, then 𝑗→𝑖 becomes 𝑗←𝑖 and the map is the composition

ker(⨁𝑙→𝑖𝑉𝑙→𝑉𝑖)β†ͺοΈŽβ¨π‘™β†’π‘–π‘‰π‘™β† π‘‰π‘—.

Similarly, if 𝑖 is a source, define πΉπ‘–βˆ’:Rep(𝑄)β†’Rep(𝑄𝑖) by

(πΉπ‘–βˆ’(𝑉))𝑗={𝑉𝑗𝑗≠𝑖coker(π‘‰π‘–β†’β¨π‘–β†’π‘˜π‘‰π‘˜)𝑗=𝑖

and for an edge π‘—β†’β„Žπ‘˜, if 𝑗≠𝑖, π‘₯β„Ž stays the same, and if 𝑗=𝑖, then π‘–β†’π‘˜ becomes π‘–β†π‘˜ and the map is the composition

π‘‰π‘˜β†ͺοΈŽβ¨π‘–β†’π‘™π‘‰π‘™β† coker(𝑉𝑖→⨁𝑖→𝑙𝑉𝑙)
PROP 6.6

Suppose 𝑉 is an indecomposable representation of 𝑄.

  • If 𝑖 is a sink, then either 𝑉≅𝑆(𝑖), or ⨁𝑙→𝑖𝑉𝑙→𝑉𝑖 is surjective.
  • If 𝑖 is a source, then either 𝑉≅𝑆(𝑖), or 𝑉𝑖→⨁𝑖→𝑙𝑉𝑙 is injective.
COR 6.7
Let 𝑉 be an indecomposable representation of 𝑄. If 𝑖 is a sink or a source, then 𝐹𝑖+(𝑉) or πΉπ‘–βˆ’(𝑉) is either zero or indecomposable. If it is zero, then 𝑉 is 𝑆(𝑖). If it is indecomposable, dim𝐹𝑖±(𝑉)=𝑠𝑖⋅dim𝑉.

Suppose 𝑄 is a Dynkin diagram. Fix a labelling by 1,2,β‹―,𝑛 of 𝑄 wuch that 𝑖<𝑗 if one can reach 𝑗 from 𝑖. This labelling has the property that if 𝑛 is a sink of 𝑄, then π‘›βˆ’1 is a sink of 𝑄𝑛. Therefore, we can consider a sequence of representations

𝑉(0)=𝑉,𝑉(1)=𝐹𝑛+(𝑉(0)),𝑉(2)=πΉπ‘›βˆ’1+(𝑉(1)),β‹―,𝑉(𝑛)=𝐹1+(𝑉(π‘›βˆ’1)).

Notice, however, that 𝑉(𝑛) is again a representation of 𝑄 because every arrow is reversed twice. We have dim𝑉(𝑛)=𝑐⋅dim𝑉, where 𝑐 is the Coxeter element. Therefore we can repeat the above process, replacing 𝑉(0) by 𝑉(𝑛). This produces an infinite list of representations

𝑉(0),𝑉(1),β‹―,𝑉(π‘›βˆ’1);𝑉(𝑛),𝑉(𝑛+1),β‹―,𝑉(2π‘›βˆ’1);β‹―

This list of indecomposable representations must have a zero somewhere, since otherwise dim𝑉(𝑀𝑛)=𝑐𝑀⋅dim𝑉 will have a strictly negative component for some 𝑀. So there must be some π‘š such that 𝑉(π‘š)=𝑆(𝑝) (Lemma 6.3); take the smallest such π‘š. Suppose 𝐹𝑖1+β‹―πΉπ‘–π‘š+(𝑉)=𝑆(𝑝), then 𝑉=πΉπ‘–π‘šβˆ’β‹―πΉπ‘–1βˆ’(𝑆(𝑝)), so dim𝑉=π‘ π‘–π‘šβ‹―π‘ π‘–1(𝛼𝑝)βˆˆπ‘…+. We have then produced a map from the indecomposable representations of 𝑄 to the positive roots, mapping 𝑉 to dimπ‘‰βˆˆπ‘…+. This map is injective since it only depends on the initial dimension vector. To prove surjectivity suppose π›Όβˆˆπ‘…+. Analogously we apply simple reflections to 𝛼:

𝛼,𝑠𝑛𝛼,π‘ π‘›βˆ’1𝑠𝑛𝛼,β‹―,𝑠2⋯𝑠𝑛𝛼;𝑐𝛼,𝑠𝑛𝑐𝛼,π‘ π‘›βˆ’1𝑠𝑛𝑐𝛼,β‹―,𝑠2⋯𝑠𝑛𝑐𝛼;β‹―

This list of roots must have a negative root somewhere, since the first column contains an element with a negative component. Therefore, the last term to the first negative root in this list must be a simple root, since simple reflections 𝑠𝑖 permute positive roots except for 𝛼𝑖 itself. Suppose 𝑠𝑖1⋯𝑠𝑖𝑙𝛼=𝛼𝑝. Let 𝑉=πΉπ‘–π‘™βˆ’β‹―πΉπ‘–1βˆ’(𝑆(𝑝)), then dim𝑉=𝛼 and 𝑉 is an indecomposable representation.

Mathematical NotesRepresentation TheoryPDF
  1. 1actually, walks, as we allow repeated vertices and edges; we will still use the word paths however.
  2. 2The denominator is zero in this case, so you need to approximate it by π‘ πœ†(1,𝑧,…,π‘§π‘βˆ’1) and take the limit as 𝑧→1.
  3. 3the dominant integral weights