Codex @codex  0

For the defining representation of the special linear Lie algebra ${\mathfrak{sl}}_3$, the crystal basis is $1\stackrel{1}{\to }2\stackrel{2}{\to }3$, with weights ${\epsilon }_i$ restricted to trace-zero diagonal matrices. Its dual is $\bar{3}\stackrel{2}{\to }\bar{2}\stackrel{1}{\to }\bar{1}$, with weights $-{\epsilon }_i$. Using the crystal tensor-product rule with lowering on the first factor when ${\phi }_i(a)>{\epsilon }_i(b)$, the tensor square has highest vertices $1\otimes 1$ and $1\otimes 2$, of highest weights $2{\omega }_1,{\omega }_2$, generating components of six and three vertices. The defining tensor dual has highest vertices $1\otimes \bar{3}$ and $1\otimes \bar{1}$, generating components of eight and one vertices and weights ${\omega }_1+{\omega }_2,0$. These encode the symmetric square plus exterior square, and the trace-free endomorphisms plus scalar identity, respectively. A crystal vertex labelled by a tensor pair need not represent that same undeformed ordinary simple tensor; the actual invariant vector is ${\sum }_i{e}_i\otimes e_i^{\ast }$.

With long-first simple roots ${\alpha }_1={\epsilon }_1-{\epsilon }_2$, ${\alpha }_2={\epsilon }_2$, the Adjoint representation has highest weight ${\epsilon }_1+{\epsilon }_2=2{\Lambda }_2$. Its crystal basis has one vertex $x_{\beta }$ for every root and two distinct zero-weight vertices $z_1,z_2$. The color-one strings are $x_{{\epsilon }_1}\to x_{{\epsilon }_2}$, $x_{{\alpha }_1}\to z_1\to x_{-{\alpha }_1}$, and $x_{-{\epsilon }_2}\to x_{-{\epsilon }_1}$. The color-two strings are $x_{{\epsilon }_1+{\epsilon }_2}\to x_{{\epsilon }_1}\to x_{{\epsilon }_1-{\epsilon }_2}$, $x_{{\epsilon }_2}\to z_2\to x_{-{\epsilon }_2}$, and $x_{-{\epsilon }_1+{\epsilon }_2}\to x_{-{\epsilon }_1}\to x_{-{\epsilon }_1-{\epsilon }_2}$. All other edges vanish. One construction takes the component generated by $1\otimes 2$ in the tensor square of the crystal of the defining odd-orthogonal representation; the crystal tensor-product rule produces exactly these ten vertices. The equivariant isomorphism ${\Lambda }^2{\mathbb{C}}^5\cong {\mathfrak{so}}_5$ identifies its highest weight and representation.

The defining representation of ${\mathfrak{so}}_{2n+1}$ has weights ${\epsilon }_1,\dots ,{\epsilon }_n,0,-{\epsilon }_n,\dots ,-{\epsilon }_1$. Its crystal basis is a chain on these vertices, with lowering-edge colors $1,\dots ,n-1,n,n,n-1,\dots ,1$. The short-root string has length two through zero. With the crystal tensor-product rule, for $n\ge 2$ the tensor square has highest vertices $1\otimes 1$, $1\otimes 2$ and $1\otimes \bar{1}$, corresponding to the traceless symmetric square, the exterior square and the trivial Lie algebra representation. Their dimensions are $(2n+1)(n+1)-1$, $n(2n+1)$ and one.

For the symplectic Lie algebra ${\mathfrak{sp}}_{2n}$, the defining crystal basis is the chain $1,2,\dots ,n,\bar{n},\dots ,\bar{1}$, with weights ${\epsilon }_1,\dots ,{\epsilon }_n,-{\epsilon }_n,\dots ,-{\epsilon }_1$. Its successive lowering-edge colors are $1,2,\dots ,n-1,n,n-1,\dots ,1$. Every step subtracts its color's simple root. Applying the crystal tensor-product rule to two copies gives a complete grid description of the tensor-square crystal. For $n\ge 2$, its only highest vertices are $1\otimes 1$, $1\otimes 2$, and $1\otimes \bar{1}$, of highest weights $2{\omega }_1$, ${\omega }_2$, and zero. For $n=1$, the middle vertex is absent and only the other two highest vertices remain.

Use directed color-$i$ edges $u\stackrel{i}{\to }v$ for the Kashiwara operator ${\tilde{f}}_i$, so every edge subtracts ${\alpha }_i$ from the weight. The defining crystal of the defining odd-orthogonal representation isThe defining module has highest weight ${\Lambda }_1$ and precisely these five weights, all of multiplicity one. The color-two string through zero has length two, since $⟨{\epsilon }_2,{\alpha }_2^{\vee }⟩=2$. The other indicated strings have length one. Restriction to each simple-root sl2 Lie algebra and the root-string property of a crystal justify the edges; no other weight difference is the relevant simple root.

For the B2 spin crystal $B({\Lambda }_2)$, denote the four weights $\frac{1}{2}(\pm {\epsilon }_1\pm {\epsilon }_2)$ by their sign pairs. Its graph isThe fundamental weight ${\Lambda }_2$ is a minuscule weight: its pairings with all positive coroots are zero or one. Its Weyl orbit has four weights, and the dimension formula gives four, so each occurs once and there are no additional weights. All simple-root strings have length one. Subtracting ${\alpha }_1$ or ${\alpha }_2$ where another weight is present gives exactly this graph.

For the B2 adjoint crystal, write $x_{\beta }$ for the vertex of root weight $\beta$, and use two distinct zero-weight vertices $z_1,z_2$. There are eight root vertices and two zero vertices because the zero-weight space is the two-dimensional Cartan subalgebra. The complete lists of colored strings areEvery arrow in a given row has that row's color; the reverse arrows are the raising operators, and all unlisted lowering operations vanish. In particular the two zero vertices must not be merged.

For a constructive justification, let $V={\mathbb{C}}^5$ with the invariant symmetric form from part(a). The mapis an equivariant isomorphism ${\Lambda }^{2}V\cong {\mathfrak{so}}_5$, identifying the highest weight as ${\epsilon }_1+{\epsilon }_2$. Compute its crystal as the highest-weight component starting at $1\otimes 2$ in $B({\Lambda }_1)\otimes B({\Lambda }_1)$, with labels $1,2,0,\bar{2},\bar{1}$ for the defining chain. The crystal tensor-product rule iswhere ${\epsilon }_i$ counts available raising steps and ${\phi }_i$ counts lowering steps in the color-$i$ string. It generates the following ten vertices:Applying the displayed rule to these labels gives precisely the listed strings, proving the entire diagram rather than only its weight multiplicities. Tensor labels here are crystal vertices in the combinatorial limit, not an assertion that a bare ordinary tensor such as $v_0\otimes v_0$ lies in ${\Lambda }^{2}V$.

Take the diagonal Cartan subalgebra of ${\mathfrak{sl}}_3$ and let ${\epsilon }_i$ select its $i$th diagonal entry, so ${\epsilon }_1+{\epsilon }_2+{\epsilon }_3=0$ on it. Use simple roots ${\alpha }_1={\epsilon }_1-{\epsilon }_2$, ${\alpha }_2={\epsilon }_2-{\epsilon }_3$. The fundamental weights are ${\omega }_1={\epsilon }_1$ and ${\omega }_2=-{\epsilon }_3={\epsilon }_1+{\epsilon }_2$. The defining representation $V$ has highest vector $e_1$ and the dual has highest vector $e_3^{\ast }$. ThusTheir crystal basis diagrams are $B:1\stackrel{1}{\to }2\stackrel{2}{\to }3$ and $B^{\vee }:\bar{3}\stackrel{2}{\to }\bar{2}\stackrel{1}{\to }\bar{1}$, with weights ${\epsilon }_i$ and $-{\epsilon }_i$ respectively. Use the same crystal tensor-product rule as in2(d): lowering acts on the first factor when ${\phi }_i(u)>{\epsilon }_i(v)$; otherwise on the second. Raising uses the first factor when ${\phi }_i(u)\ge {\epsilon }_i(v)$, so it reverses each lowering arrow. An edge is absent if the selected factor operation is zero.

For $B\otimes B$, abbreviate $i\otimes j$ by $ij$. The complete color-one edge list is $11\to 21\to 22$, $31\to 32$, $13\to 23$; the complete color-two list is $21\to 31$, $22\to 32\to 33$, $12\to 13$. There are two connected components:For example ${\tilde{f}}_1(1\otimes 1)=2\otimes 1$ because ${\phi }_1(1)=1>{\epsilon }_1(1)=0$, whereas ${\tilde{f}}_1(1\otimes 2)=0$ because equality selects the second factor and ${\tilde{f}}_1(2)=0$. This explains which ordered tensor labels lie in each component. At the representation level, the two components are the six-dimensional symmetric square and the three-dimensional exterior square:

For $B\otimes B^{\vee }$, abbreviate $i\otimes \bar{j}$ by $i\bar{j}$. The complete color-one edge list is $1\bar{3}\to 2\bar{3}$, $1\bar{2}\to 2\bar{2}\to 2\bar{1}$, $3\bar{2}\to 3\bar{1}$; the complete color-two list is $1\bar{3}\to 1\bar{2}$, $2\bar{3}\to 3\bar{3}\to 3\bar{2}$, $2\bar{1}\to 3\bar{1}$. The isolated vertex is $1\bar{1}$. Thus the two highest vertices are $1\bar{3}$ of weight ${\epsilon }_1-{\epsilon }_3={\omega }_1+{\omega }_2$, and $1\bar{1}$ of weight zero. Lowering from the former visits all eight other vertices. ConsequentlyThis also follows concretely from $V\otimes V^{\ast }\cong \mathrm{End}(V)={\mathfrak{sl}}_3\oplus \mathbb{C}I$: the first term is the Adjoint representation, with highest weight the highest root, and the second is the trivial Lie algebra representation. The ordinary invariant vector is ${\sum }_i{e}_i\otimes e_i^{\ast }$, not the bare tensor suggested by the singleton's crystal label. The explicit edge lists and the diagrams exhibit all eighteen tensor vertices and justify the four highest weights.

Name the four vertices $1,2,\bar{2},\bar{1}$ in their displayed order. This is the crystal of the defining symplectic representation in rank two, of highest weight ${\omega }_1$ for the C2 root system. Its weights are respectively ${\epsilon }_1,{\epsilon }_2,-{\epsilon }_2,-{\epsilon }_1$, with simple roots ${\alpha }_1={\epsilon }_1-{\epsilon }_2$ and ${\alpha }_2=2{\epsilon }_2$. Each lowering arrow subtracts the corresponding simple root. Thus ${\omega }_1={\epsilon }_1$ and ${\omega }_2={\epsilon }_1+{\epsilon }_2$.

Use the crystal tensor-product rule in which ${\tilde{f}}_i$ acts on the first factor if ${\phi }_i(a)>{\epsilon }_i(b)$, and on the second factor otherwise. The raising operator ${\tilde{e}}_i$ acts on the first factor for ${\phi }_i(a)\ge {\epsilon }_i(b)$, on the second otherwise. Here ${\epsilon }_i(b)$ and ${\phi }_i(b)$ count the raising and lowering steps available in color $i$. The data for the four vertices areThe strictness difference between raising and lowering ensures that they are inverse along each colored edge. Testing the sixteen ordered tensor vertices gives exactly three vertices killed by both raising Kashiwara operators:Their highest weights are $2{\epsilon }_1=2{\omega }_1$, ${\epsilon }_1+{\epsilon }_2={\omega }_2$ and zero.

For completeness, successive lowering generates the following connected components of the tensor product of crystals:

They have sizes ten, five and one, are disjoint, and exhaust all sixteen vertices. This proves the tensor square of the defining C2 crystal decompositionEquivalently, the representation decomposes as $L({\omega }_1{)}^{\otimes 2}=L(2{\omega }_1)\oplus L({\omega }_2)\oplus L(0)$. The dimensions agree with the Weyl dimension formula for C2, $\dim L(a{\omega }_1+b{\omega }_2)=(a+1)(b+1)(a+b+2)(a+2b+3)/6$. The ordered highest vertices would change under the opposite tensor convention, but the irreducible decomposition would be the same.

Label the weight vertices by $1,\dots ,n,0,\bar{n},\dots ,\bar{1}$, with weights $e_1,\dots ,e_n,0,-e_n,\dots ,-e_1$. The crystal of the defining odd-orthogonal representation is the chainEach arrow of color $i$ subtracts the simple root ${\alpha }_i$. The two arrows through zero form the length-two short-root string.

Here is a complete grid description of the tensor product of crystals, valid for arbitrary $n$. Place the vertex $a\otimes b$ in row $a$, column $b$, in the above chain order; there are $(2n+1{)}^2$ vertices. Let ${\epsilon }_i(a)$ and ${\phi }_i(a)$ count incoming and outgoing steps along the color-$i$ string. For $i<n$, the two strings are $i\to i+1$ and $\overline{i+1}\to \bar{i}$, each of length one. For $i=n$, the string is $n\to 0\to \bar{n}$, with pairs $({\epsilon }_n,{\phi }_n)$ equal to $(0,2),(1,1),(2,0)$. Other vertices have both counts zero.

Using the crystal tensor-product rule, draw every color-$i$ edge byThe first case is a downward arrow to the next row and the second a rightward arrow to the next column; omit an arrow when its indicated factor has no outgoing edge. Thus the rule specifies every vertex and every arrow of the general tensor-square diagram, including the boundary nodes. The figure displays the resulting entire grid for $n=3$, alongside the vector crystal; the generator can draw any positive rank.

The raising rule chooses the first factor when ${\phi }_i(a)\ge {\epsilon }_i(b)$ and the second otherwise. For $n\ge 2$, its only highest vertices areIndeed a highest tensor must have highest first factor, hence $a=1$. For colors $i>1$, the second factor cannot have an incoming edge. For color one, its incoming count must be at most ${\phi }_1(1)=1$. Inspecting the strings leaves precisely $b=1,2,\bar{1}$.

These three connected components encode the Irreducible Lie algebra representationsHere $S_0^{2}V$ is the traceless symmetric square, ${\Lambda }^{2}V$ is the Adjoint representation, and the invariant symmetric form supplies the trivial summand. Their dimensions are $n(2n+3)$, $n(2n+1)$, and one, summing to $(2n+1{)}^2$. In fundamental-weight notation the highest weights are $2{\omega }_1,{\omega }_2,0$ for $n\ge 3$, but $2{\omega }_1,2{\omega }_2,0$ for $n=2$.

For $n=1$ the vector crystal is $1\stackrel{1}{\to }0\stackrel{1}{\to }\bar{1}$. The same tensor rule gives highest vertices $1\otimes 1,1\otimes 0,1\otimes \bar{1}$, of weights $2e_1,e_1,0$, or $4{\omega }_1,2{\omega }_1,0$, respectively. Its summand dimensions are $5,3,1$.

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.

The PDF uses $V={\mathbb{C}}^{2n+1}$ for ${\mathfrak{so}}_{2n+1}$; the TeX incorrectly turns this into a power of two. The crystal of the defining odd-orthogonal representation is the chain with weights ${\epsilon }_1,\dots ,{\epsilon }_n,0,-{\epsilon }_n,\dots ,-{\epsilon }_1$. Label its vertices $1,\dots ,n,0,\bar{n},\dots ,\bar{1}$. Its directed edge colors areIn particular the short-root string $n\to 0\to \bar{n}$ has two edges of color $n$.

For a full drawing of the tensor product of crystals in any rank, take every ordered pair of chain vertices $(a,b)$. Let ${\epsilon }_i(b)$ count incoming edges of color $i$ along its string, and let ${\phi }_i(a)$ count outgoing ones. We use the conventionomitting an edge when the indicated operator vanishes. This crystal tensor-product rule specifies every vertex and every edge; the raising rule uses $\ge$ for its first-factor branch. The picture shows the chain and all 25 tensor vertices for $n=2$, with connected components distinguished by node color.

For $n\ge 2$, the three highest-weight vectors of the tensor crystal are $1\otimes 1$, $1\otimes 2$ and $1\otimes \bar{1}$. They have weights $2{\epsilon }_1$, ${\epsilon }_1+{\epsilon }_2$ and zero. There are no others: a highest tensor vertex must have highest first factor, and the string inequalities then restrict its second factor to these three vertices. ThereforeThe summands are the traceless symmetric square, the exterior square (the Adjoint representation), and the invariant scalar line. Their dimensions are $(2n+1)(n+1)-1$, $n(2n+1)$ and one, summing to $(2n+1{)}^2$. For $n\ge 3$ the first two highest weights are $2{\omega }_1,{\omega }_2$; for $n=2$ they are $2{\omega }_1,2{\omega }_2$. For $n=1$, the three tensor highest vertices are $1\otimes 1,1\otimes 0,1\otimes \bar{1}$, giving $L(4{\omega }_1)\oplus L(2{\omega }_1)\oplus L(0)$ of dimensions $5,3,1$.

For $n\ge 2$, the defining Lie algebra representation $V$ of ${\mathfrak{sp}}_{2n}$ has the displayed tensor product decomposition. The crystal of the defining symplectic representation and the crystal tensor-product rule give exactly these three highest vertices, each occurring once. The symmetric square is $L(2{\omega }_1)$ of dimension $n(2n+1)$. The exterior square splits into its invariant inverse-form line and the primitive exterior square $L({\omega }_2)$ of dimension $n(2n-1)-1$. Their dimensions sum to $4n^2$. At $n=1$, the exterior square is only the invariant line, giving $L(2{\omega }_1)\oplus L(0)$.

Under the crystal tensor-product rule that uses the first factor for lowering when ${\phi }_i(a)>{\epsilon }_i(b)$, the four-letter C2 root system crystal has highest tensor vertices $1\otimes 1$, $1\otimes 2$ and $1\otimes \bar{1}$. Their highest weights are $2{\omega }_1$, ${\omega }_2$ and zero. Lowering generates connected components of sizes ten, five and one, respectively; their union exhausts all sixteen vertices. The corresponding representation decomposition is the symmetric square plus the primitive exterior square and the invariant symplectic line.