Lecture 19
Problem 95. Verify that is a partial order on the set of partitions of .
Solution: Let . Clearly
for all , so . If then
for all which implies
for all and . Lastly suppose also that , then
for all so
for all and . Thus is a partial order.
Problem 96. Verify that is a strict total order on .
Solution: Let . Note that as has all elements in the same row as we have .
Let , then for some we have that for every and agree, in terms of rows, and appears on a lower row in than . As it is not on a higher row in and the rows agree for all we have .
Suppose also that , then for some we have that for every and agree, in terms of rows, and appears on a lower row in than . For all , is on the same row in both and . If then is on the same row in as it is which is higher than hence . Otherwise is on a higher row in than it is in and is on the same row in as it is in so .
Lastly let . Then clearly there exists a smallest such that the row is on in each differs. Thus it agrees for and we have or .
Problem 97. Show that if , then if and only if .
Solution: Suppose . Then there exists at least one that is in a different row in than in . As and share the same set of entries in each row and so do and we have . Now suppose so the rows in each are the same. As and are standard tableau there is only one possible way to arrange each row of , that is in ascending order left to right. Thus each row of and is the same and .
Problem 98. Use Proposition 19.4 to compute the characters of and then Challenging! Hint: Proposition 19.4 puts a restriction on the shapes of the that can appear as subrepresentations of and .
Solution: