Lecture 19

Problem 95. Verify that \unlhd is a partial order on the set of partitions of nn.

Solution: Let λ,μ,νn\lambda,\mu,\nu\vdash n. Clearly

i=1mλii=1mλi,\sum_{i=1}^{m}\lambda_{i}\leq\sum_{i=1}^{m}\lambda_{i},

for all 1m|λ|1\leq m\leq|\lambda|, so λλ\lambda\unlhd\lambda. If λμ\lambda\unlhd\mu then

i=1mλii=1mμi,\sum_{i=1}^{m}\lambda_{i}\leq\sum_{i=1}^{m}\mu_{i},

for all 1mmin{|λ|,|μ|}1\leq m\leq\min\{|\lambda|,|\mu|\} which implies

i=1mμii=1mλi,\sum_{i=1}^{m}\mu_{i}\geq\sum_{i=1}^{m}\lambda_{i},

for all 1mmin{|λ|,|μ|}1\leq m\leq\min\{|\lambda|,|\mu|\} and λμ\lambda\unrhd\mu. Lastly suppose also that μν\mu\unlhd\nu, then

i=1mλii=1mμii=1mνi,\sum_{i=1}^{m}\lambda_{i}\leq\sum_{i=1}^{m}\mu_{i}\leq\sum_{i=1}^{m}\nu_{i},

for all 1mmin{|λ|,|μ|,|ν|}1\leq m\leq\min\{|\lambda|,|\mu|,|\nu|\} so

i=1mλii=1mνi,\sum_{i=1}^{m}\lambda_{i}\leq\sum_{i=1}^{m}\nu_{i},

for all 1mmin{|λ|,|ν|}1\leq m\leq\min\{|\lambda|,|\nu|\} and λν\lambda\unlhd\nu. Thus \unlhd is a partial order.

Problem 96. Verify that \prec is a strict total order on 𝐘𝐓𝐃λ\mathbf{YTD}^{\lambda}.

Solution: Let [t],[s],[u]𝐘𝐓𝐃λ[t],[s],[u]\in\mathbf{YTD}^{\lambda}. Note that as [t][t] has all elements in the same row as [t][t] we have [t][t][t]\not\prec[t].

Let [t][s][t]\prec[s], then for some 1in1\leq i\leq n we have that for every j<ij<i [t][t] and [s][s] agree, in terms of rows, and ii appears on a lower row in [t][t] than [s][s]. As it is not on a higher row in [t][t] and the rows agree for all j<ij<i we have [s][t][s]\not\prec[t].

Suppose also that [s][u][s]\prec[u], then for some 1kn1\leq k\leq n we have that for every l<kl<k [s][s] and [u][u] agree, in terms of rows, and kk appears on a lower row in [s][s] than [u][u]. For all jmin{i,k}j\leq\min\{i,k\}, jj is on the same row in both [t][t] and [u][u]. If min{i,k}=i\min\{i,k\}=i then ii is on the same row in [u][u] as it is [s][s] which is higher than [t][t] hence [t][u][t]\prec[u]. Otherwise kk is on a higher row in [u][u] than it is in [s][s] and kk is on the same row in [t][t] as it is in [s][s] so [t][u][t]\prec[u].

Lastly let [t][s][t]\neq[s]. Then clearly there exists a smallest 1in1\leq i\leq n such that the row ii is on in each differs. Thus it agrees for j<ij<i and we have [t][s][t]\prec[s] or [s][t][s]\prec[t].

Problem 97. Show that if s,t𝐒𝐘𝐓λs,t\in\mathbf{SYT}^{\lambda}, then [s][t][s]\neq[t] if and only if sts\neq t.

Solution: Suppose [s][t][s]\neq[t]. Then there exists at least one ii that is in a different row in [s][s] than in [t][t]. As ss and [s][s] share the same set of entries in each row and so do tt and [t][t] we have sts\neq t. Now suppose [s]=[t][s]=[t] so the rows in each are the same. As ss and tt are standard tableau there is only one possible way to arrange each row of [s][s], that is in ascending order left to right. Thus each row of ss and tt is the same and s=ts=t.

Problem 98. Use Proposition 19.4 to compute the characters of (π,𝒮(4,2))(\pi,{\mathcal{S}}^{(4,2)}) and then (π,𝒮(3,3))(\pi,{\mathcal{S}}^{(3,3)}) Challenging! Hint: Proposition 19.4 puts a restriction on the shapes of the 𝒮λ{\mathcal{S}}^{\lambda} that can appear as subrepresentations of (4,2){\mathcal{M}}^{(4,2)} and (3,3){\mathcal{M}}^{(3,3)}.

Solution: