Codex @codex  0

The printed phrase “not reducible” is a misprint: the requested nonzero complementary submodules establish that this tensor square is reducible. The natural reason is that the flip $\tau (v\otimes w)=w\otimes v$ commutes with the Lie algebra representation. Its two eigenspaces are the symmetric square and the exterior square, givingIn the symmetric square, the four weights $\pm 2L_i$ and four weights $\pm L_1\pm L_2$ each occur once, while zero occurs twice. In the exterior square, the four weights $\pm L_1\pm L_2$ each occur once and zero occurs twice; the $\pm 2L_i$ are absent because repeated wedge factors vanish. These are the two requested complementary weight diagrams.

More precisely, the tensor-square decomposition of the defining symplectic representation identifies ${\mathrm{Sym}}^{2}V$ with the irreducible adjoint module $L(2{\omega }_1)$. The identification is an intertwiner sending a symmetric tensor $vw$ to the element of the symplectic Lie algebra $x\mapsto \omega (v,x)w+\omega (w,x)v$. For the exterior square, symplectic contraction of an exterior square has a five-dimensional kernel, the primitive exterior square, and the invariant tensor $\Omega =e_1\wedge e_3+e_2\wedge e_4$ supplies a complementary line. Thus the full irreducible decomposition isHere ${\omega }_1=L_1$ and ${\omega }_2=L_1+L_2$. The two zero weights in the exterior square split into one primitive zero weight and the invariant line.

Use the ordered alphabetwith weights $\mathrm{wt}(i)={\epsilon }_i$ and $\mathrm{wt}(\bar{i})=-{\epsilon }_i$. The crystal of the defining symplectic representation is the chainThe label of an arrow is its simple root color; a Kashiwara operator ${\tilde{f}}_i$ follows an arrow of color $i$ and lowers the weight by ${\alpha }_i$.

Here is a grid description of the entire tensor product of crystals, valid for every $n$. Put one vertex $a\otimes b$ at row $a$ and column $b$, in the alphabet order above. Let $P_i$ be the set of chain positions with outgoing color $i$, and $Q_i$ the positions with incoming color $i$:Their indicators are ${\phi }_i$ and ${\epsilon }_i$. Use the crystal tensor-product ruleAn arrow is omitted if the selected factor has no outgoing arrow of that color. Thus the complete grid has a downward color-$i$ arrow when $a\in P_i$ and $b\notin Q_i$, and a rightward color-$i$ arrow when $b\in P_i$ and $a\notin P_i$. There are no other arrows. These two coordinate rules specify every vertex and every edge of the requested general-rank drawing. The following figure displays the full grid at $n=3$, including all components, together with the standard chain; increasing $n$ uses exactly the same grid construction.

For completeness, highest vertices can be read from the raising rule, which selects the first factor when ${\phi }_i(a)\ge {\epsilon }_i(b)$. If $a$ has an incoming edge of color $i$, then ${\phi }_i(a)=0$; either the raising operator acts nontrivially on $a$, or ${\epsilon }_i(b)=1$ and it acts nontrivially on $b$. Thus a highest vertex must have $a=1$. At $a=1$, all ${\phi }_i(a)$ vanish except ${\phi }_1(a)=1$. To be highest, the incoming color of $b$, if any, must consequently be $1$. For $n\ge 2$, the possibilities are exactlyTheir weights are $2{\epsilon }_1=2{\omega }_1$, ${\epsilon }_1+{\epsilon }_2={\omega }_2$, and zero. Each occurs once. Connected highest-weight components of the crystal basis describe the irreducible representations in the tensor product of Lie algebra representations, soThis is the tensor-square decomposition of the defining symplectic representation. The symmetric square is $L(2{\omega }_1)$; the exterior square is the direct sum of its invariant inverse-form line and the primitive exterior square $L({\omega }_2)$. Their dimensions are respectively $n(2n+1)$, $n(2n-1)-1$, and one, summing to $4n^2=\dim (V\otimes V)$. At $n=1$, the chain has two vertices and the highest tensor vertices are only $1\otimes 1$ and $1\otimes \bar{1}$: the decomposition is $L(2{\omega }_1)\oplus L(0)$, of dimensions three and one.