Lecture notes for Introduction to Representation Theory
Lecture notes for Introduction to Representation Theory
Lecture notes for Introduction to Representation Theory
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
(where N ⊂ p).<br />
In this <strong>for</strong>mula, there are many cancelations. After making some of these cancelations, we<br />
obtain the hook length <strong>for</strong>mula. Namely, <strong>for</strong> a square (i, j) in a Young diagram ∂ (i, j ⊂ 1, i ∗ ∂ j ),<br />
define the hook of (i, j) <strong>to</strong> be the set of all squares (i , j ) in ∂ with i ⊂ i, j = j or i = i, j ⊂ j.<br />
Let h(i, j) be the length of the hook of i, j, i.e., the number of squares in it.<br />
Theorem 4.53. (The hook length <strong>for</strong>mula) One has<br />
dim V = ⎛<br />
i→ j<br />
n!<br />
h(i, j) .<br />
Proof. The <strong>for</strong>mula follows from <strong>for</strong>mula (5). Namely, note that<br />
⎛<br />
l 1 !<br />
=<br />
(l 1 − l j )<br />
<br />
1