Young's Natural Representation of S - 4
Young's Natural Representation of S - 4
Young's Natural Representation of S - 4
Final Paper
MATH 6910
Representations of the
Symmetric Group
Dr. Rafal Ablamowicz
December 11, 2008
Contents
1 Introduction
2 The Group S4
3 The
3.1
3.2
3.3
3.4
S4 -Module S 1
Standard 1 -Tableaux
Matrix for (1 2) . . . .
Matrix for (2 3) . . . .
Matrix for (3 4) . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
3
3
4
4
4
4 The
4.1
4.2
4.3
4.4
S4 -Module S 2
Standard 2 -Tableaux
Matrix for (1 2) . . . .
Matrix for (2 3) . . . .
Matrix for (3 4) . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
4
4
5
6
6
5 The
5.1
5.2
5.3
5.4
S4 -Module S 3
Standard 3 -Tableaux
Matrix for (1 2) . . . .
Matrix for (2 3) . . . .
Matrix for (3 4) . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
7
7
7
8
8
6 The
6.1
6.2
6.3
6.4
S4 -Module S 4
Standard 4 -Tableaux
Matrix for (1 2) . . . .
Matrix for (2 3) . . . .
Matrix for (3 4) . . . .
.
.
.
.
9
9
9
10
11
7 The S4 -Module S 5
7.1 Standard 5 -Tableaux . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
7.2 Matrices for (1 2), (2 3), and (3 4) . . . . . . . . . . . . . . . . . . . . . . . .
11
11
12
8 Conclusion
12
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
Introduction
In this paper, we compute matrices of the adjacent transpositions (1 2), (2 3), (3 4) in S4 for
all of Youngs natural representations. These representations are irreducible and any other
irreducible representation is equivalent to one of Youngs natural representations. Moreover,
the adjacent transpositions generate all of S4 so that all the matrices of Youngs natural
representations are easily obtained by merely multiplying the appropriate generators.
There are two key ideas employed in these calculations. The first is that partitions of 4
correspond to irreducible representations of S4 . Each partition is represented graphically by
a Ferrers diagram.
1 = (1, 1, 1, 1) =
2 = (2, 1, 1) =
4 = (3, 1) =
3 = (2, 2) =
5 = (4) =
.
hij
(i,j)
Throughout this paper, we use the following convention in determining the representation
of (i i + 1)et in terms of the basis of standard -polytabloids.
The Group S4
There are 4! = 24 elements in S4 . These elements fall into five conjugacy classes, each corresponding to a partition of 4. The conjugacy classes of S4 , each labeled by its corresponding
partition of 4, are given below.
K(1,1,1,1)
K(2,1,1)
K(2,2)
K(3,1)
K(4)
= {}
= {(1 2), (1 3), (1 4), (2 3), (2 4), (3 4)}
= {(1 2)(3 4), (1 3)(2 4), (1 4)(2 3)}
= {(1 2 3), (1 3 2), (1 2 4), (1 4 2), (1 3 4), (1 4 3), (2 3 4), (2 4 3)}
= {(1 2 3 4), (1 4 3 2), (1 4 2 3), (1 3 2 4), (1 3 4 2), (1 2 4 3)}
|K(1,1,1,1) | = 1
|K(2,1,1) | = 6
|K(2,2) | = 3
|K(3,1) | = 8
|K(4) | = 6
(1 2)
(3 4)
(1 4) = (1 2)(2 3)(3 4)(2 3)(1 2)
(1 2)(3 4)
(1 4)(2 3) = (1 2)(2 3)(3 4)(2 3)(1 2)(2 3)
(1 3 2) = (2 3)(1 2)
(1 4 2) = (2 3)(3 4)(2 3)(1 2)
(1 4 3) = (1 2)(3 4)(2 3)(1 2)
(2 4 3) = (3 4)(2 3)
(1 4 3 2) = (3 4)(2 3)(1 2)
(1 3 4 2) = (2 3)(3 4)(1 3)
(1 2 4 3) = (1 2)(3 4)(2 3)
The homomorphism property of the representations then allows one to obtain the matrix for
any element of S4 by simply multiplying the appropriate matrices according to the above
computations.
3
3.1
The S4-Module S 1
Standard 1 -Tableaux
Recall that
1 = (1, 1, 1, 1) =
So
n!
f 1 = Y
=
hij
24
= 1.
4321
(i,j)
3.2
Matrix for (1 2)
3.3
Matrix for (2 3)
3.4
Matrix for (3 4)
4
4.1
The S4-Module S 2
Standard 2 -Tableaux
Recall that
2 = (2, 1, 1) =
So
n!
f 2 = Y
=
hij
24
= 3.
4121
(i,j)
1 3
t2 = 2
4
1 4
t3 = 2 .
3
1 0 0
X2 () = 0 1 0 .
0 0 1
4.2
Matrix for (1 2)
We have
1 2
(1 2)t1 = (1 2) 3
4
which is Case 2. We set A = {2, 3, 4} and B = {1}.
(A0 , B 0 ) : (2 3 4, 1) (1 3 4, 2) (2 1 4, 3) (2 3 1, 4)
(1 2)
(1 3)
(1 4)
2 1
1 2
2 3
2 4
3
3
1
3
4
4
4
1
(1 2)
(1 2 3)
1 3
1 4
2
2
4
3
So gA,B = (1 2) + (1 2)(1 3) = (1 2 3)(1 4) and therefore
(1 2)et1 = e(1 2)t1 = et1 et2 + et3 .
5
(1 2)et2 = et2
1 4
(1 2)t3 = (1 2) 2
3
(1 2)et3 = et3
1
0
0
X2 (1 2) = 1 1 0 .
1
0 1
4.3
Matrix for (2 3)
We have
1 2
1 3
= 2
= et2
(2 3)t1 = (2 3) 3
4
4
which is Case 3. Similarly,
1 3
1 2
= 3
= et1
(2 3)t2 = (2 3) 2
4
4
which is Case 3. Finally,
1 4
(2 3)t3 = (2 3) 2
3
which is Case 1. So
(2 3)et3 = et3 .
Therefore, the matrix for (2 3) is
0 1 0
X2 (2 3) = 1 0 0 .
0 0 1
4.4
Matrix for (3 4)
We have
1 2
(3 4)t1 = (3 4) 3
4
6
which is Case 1. So
(3 4)et1 = et1 .
Next,
1 3
1 4
= 2
= t3 ,
(3 4)t2 = (3 4) 2
4
3
which is Case 3. So
(3 4)et2 = et3 .
Finally,
1 4
1 3
= 2
= t2 ,
(3 4)t3 = (3 4) 2
3
4
which is Case 3. So
(3 4)et3 = et2 .
Therefore, the matrix for (3 4) is
1 0 0
X2 (3 4) = 0 0 1 .
0 1 0
5
5.1
The S4-Module S 3
Standard 3 -Tableaux
Recall that
3 = (2, 2) =
So
n!
f 3 = Y
=
hij
24
= 2.
3221
(i,j)
t2 = 1 3 .
2 4
5.2
Matrix for (1 2)
We have
(1 2)t1 = (1 2) 1 2
3 4
which is Case 2. Setting A = {2, 3} and B = {1} we obtain
(A0 , B 0 ) : (2 3, 1) (1 3, 2) (1 2, 3)
(1 2)
(1 3)
2 1
1 2
2 3
3 4
3 4
1 4
(1 2)
1 3
2 4
so that e(1 2)t1 = et1 et2 .
We have
(1 2)t2 = (1 2) 1 3
2 4
which is Case 1. So (1 2)et2 = et2 . Therefore, the matrix for (1 2) is
1
0
X3 (1 2) =
.
1 1
5.3
Matrix for (2 3)
and
(2 3)et2 = et1 .
5.4
Matrix for (3 4)
We have
(3 4)t1 = (3 4) 1 2 = 1 2
3 4
4 3
6
6.1
The S4-Module S 4
Standard 4 -Tableaux
Recall that
4 = (3, 1) =
So
n!
f 4 = Y
=
hij
24
= 3.
4211
(i,j)
t2 = 1 2 4
3
t3 = 1 2 3 .
4
1 0 0
X4 () = 0 1 0 .
0 0 1
6.2
Matrix for (1 2)
We have
(1 2)t1 = (1 2) 1 3 4
2
which is Case 1 so that (1 2)et1 = et1 .
Now
(1 2)t2 = (1 2) 1 2 4 = 2 1 4
3
3
which is Case 2. Set A = {2, 3} and B = {1}. Now
(A0 , B 0 ) :
(2 3, 1)
2 1 4
3
(1 3, 2)
(1 2)
1 2 4
3
(1 2, 3)
(1 3)
2 3 4
1
(1 2)
1 3 4
2
(2 4, 1)
2 1 3
4
(1 4, 2)
(1 2)
1 2 3
4
(1 2, 4)
(1 4)
2 4 3
1
(1 2)
1 4 3
2
= {3}.
We have to find the Garnir element for the last tableau too. Set A = {4} and B
Then
(A0 , B 0 ) : (4, 3)
(3, 4)
(3 4)
1 4 3 1 3 4
2
2
This provides
e1 4 3 = e1 3 4
2
as expected since the two tableaux are equivalent as tabloids. Altogether then
(1 2)et3 = et3 et1 .
10
1 1 1
1
0 .
X4 (1 2) = 0
0
0
1
6.3
Matrix for (2 3)
We have
(2 3)t1 = (2 3) 1 3 4 = 1 2 4 = t2
2
3
as per Case 3. Likewise,
(2 3)t2 = (2 3) 1 2 4 = 1 3 4 = t1
3
2
by Case 3. Thus,
(2 3)et1 = et2
and
(2 3)et2 = et1 .
Lastly,
(2 3)t3 = (2 3) 1 2 3
4
which calls for Case 2. Set A = {3} and B = {2}, giving
(A0 , B 0 ) :
(3, 2)
1 3 2
4
0 1
X4 (2 3) = 1 0
0 0
6.4
(2, 3)
(2 3)
1 2 3
4
t3 as a tabloid. Therefore
0
0 .
1
Matrix for (3 4)
We have
(3 4)t1 = (3 4) 1 3 4 = 1 4 3
2
2
which is Case 2. Set A = {4} and B = {3}. As for the cases above when A and B had one
element, we obtain e(3 4)t1 = et1 .
The last two polytabloids obey Case 3. Thus,
(3 4)t2 = (3 4) 1 2 4 = 1 2 3 = t3
3
4
11
(3 4)et2 = et3
and
(3 4)t3 = (3 4) 1 2 3 = 1 2 4 = t2
4
3
so that the matrix for (3 4) is
1 0 0
X4 (3 4) = 0 0 1 .
0 1 0
7
7.1
(3 4)et3 = et2
The S4-Module S 5
Standard 5 -Tableaux
Recall that
.
5 = (4) =
So
n!
f 5 = Y
=
hij
24
= 1.
4321
(i,j)
Therefore, dim S
7.2
In every case, we obtain Case 2 with A and B being singletons. As above, we obtain
(1 2)et = et
(2 3)et = et
and
(3 4)et = et .
(Again, this can be easily seen by viewing t as its corresponding tabloid {t}.) Therefore the
matrices are
X5 (1 2) = [1]
X5 (2 3) = [1]
and
X5 (3 4) = [1].
Conclusion
and 2 =
S4 K(1,1,1,1)
trivial
1
1
sign
3
sgn
K(2,1,1)
1
1
1
1
0
K(2,2)
1
1
1
1
2
K(3,1)
1
1
0
0
1
K(4)
1
1
1
1
0
To obtain the characters from Youngs natural representations, we notice that each row in
the table is completely characterized by its values in the first and second columns, which
correspond to the character on the identity and on an adjacent transposition. Therefore we
can conclude that
X 4
sgn X2
X 3
Using the lexicographic order on columns then, we have a standard presentation of the
character table of S4 .
S4
K(1,1,1,1)
K(2,1,1)
K(2,2)
K(3,1)
K(4)
X1
sign
X2
sgn
X3
X4
X5
trivial
13