Past exam of the mathematics course of the University of Cambridge / 2009 / iii / Paper 6 / 3

Write $\bar{i}=2n+1-i$, and let $E_{ab}$ denote a matrix unit. The diagonal Cartan subalgebra consists ofFor a diagonal matrix, $[t,E_{ab}]=(t_a-t_b)E_{ab}$. Substituting into the symplectic relation shows that the following are root vectors:The zero weight space is spanned by $H_i=E_{ii}-E_{\bar{i}\bar{i}}$. The symplectic equation pairs the remaining entries exactly as in this table; the displayed vectors and the $H_i$ are independent and span the algebra. This proves the root-space decompositionThere are $2n^2$ roots of a root system, each with one-dimensional root space, giving $\dim \mathfrak{g}=n(2n+1)$.

The upper triangular root vectors select preciselyThe simple roots of this Cn root system areIndeed, the positive roots of a root system have expansionsThese expansions also identify the highest root:Normalize the coordinate inner product by $({\epsilon }_i,{\epsilon }_j)={\delta }_{ij}$. The simple coroots are ${\alpha }_i^{\vee }={\epsilon }_i-{\epsilon }_{i+1}$ for $i<n$ and ${\alpha }_n^{\vee }={\epsilon }_n$. Solving $⟨{\omega }_j,{\alpha }_i^{\vee }⟩={\delta }_{ij}$ gives the fundamental weightsIn the sum of the positive roots of a root system, the pair $({\epsilon }_i-{\epsilon }_j)+({\epsilon }_i+{\epsilon }_j)$ contributes $2{\epsilon }_i$, and the long root contributes another $2{\epsilon }_i$. Therefore the Weyl vector isThese are the Positive-root data for Cn.

For $n\ge 2$, the finite Dynkin diagram is a chain of $n$ vertices. The bonds between ${\alpha }_i$ and ${\alpha }_{i+1}$ for $i<n-1$ are single. The last bond is double, with its arrow pointing from the long root ${\alpha }_n$ toward the short root ${\alpha }_{n-1}$. For the Extended Dynkin diagram, add ${\alpha }_0=-\theta =-2{\epsilon }_1$ at the other end, doubly bonded to ${\alpha }_1$, with arrow toward ${\alpha }_1$. The following Cn Dynkin diagrams include both ends and the low-rank cases.

At $n=1$, there is just the root ${\alpha }_1=2{\epsilon }_1$ and one finite vertex. The affine Cartan matrix is $\left(\begin{array}{cc}2& -2\\ -2& 2\end{array}\right)$; its two vertices have equal root length, so the double bond has no arrow.

Let $U$ be a four-dimensional symplectic vector space, with a symplectic basis $e_1,f_1,e_2,f_2$. Its invariant inverse-form bivector may be chosen as $\eta =e_1\wedge f_1+e_2\wedge f_2$. Put $\mathrm{vol}=e_1\wedge f_1\wedge e_2\wedge f_2$, so $\eta \wedge \eta =2\mathrm{vol}$. Define a symmetric bilinear form on the six-dimensional exterior square byIt is symmetric because both factors have degree two. It is nondegenerate: in the six-element wedge basis, every $e_a\wedge e_b$ pairs nontrivially with the wedge of the complementary pair and with no other basis vector. Since $B(\eta ,\eta )=2$, the orthogonal complementhas dimension five and inherits a nondegenerate bilinear form. It is the primitive exterior square, equivalently the kernel of the symplectic contraction of an exterior square.

The symplectic Lie algebra preserves $\eta$. It also preserves $\mathrm{vol}$, since its elements have trace zero and the induced action on ${\Lambda }^{4}U$ is multiplication by that trace. The exterior-power Lie algebra representation therefore preserves $B$ and $W$, giving a Lie algebra homomorphismTo show injectivity, suppose $A$ acts as zero on $W$. It already acts as zero on the invariant line $\mathbb{C}\eta$, so it kills all of ${\Lambda }^{2}U=W\oplus \mathbb{C}\eta$. For any basis $u_1,\dots ,u_4$, this meansIf $k\ne i$, choose $j$ distinct from $i,k$; the coefficient of $u_k\wedge u_j$ forces $A_{ki}=0$. Thus $A$ is diagonal. The same identity gives $A_{ii}+A_{jj}=0$ for every pair. Applying this to three distinct indices forces each diagonal entry to vanish. Hence $A=0$ and $\Phi$ is injective.

Finally $\dim {\mathfrak{sp}}_4=2(2\cdot 2+1)=10$ and $\dim \mathfrak{so}(W,B)=5\cdot 4/2=10$. Injectivity between these equal-dimensional vector spaces gives surjectivity. Every nondegenerate complex symmetric bilinear form on a five-dimensional space is equivalent to the standard one. We have therefore constructed the exceptional isomorphism between sp4 and so5:

Identify the Cartan subalgebra with the coordinate space $(t_1,\dots ,t_n)$ used above. The root reflection in any root of a root system fixes the perpendicular hyperplane. For every root of the Cn root system, its complete coordinate action isEvery unlisted coordinate is fixed, and changing the sign of the root leaves its reflection unchanged. These formulas follow directly from $s_{\alpha }(t)=t-\alpha (t){\alpha }^{\vee }$, with the coroot regarded as a vector of the Cartan subalgebra.

The Cn Weyl group is the signed symmetric group: its elements permute the $n$ coordinates and independently change their signs. The Weyl reflections associated with the simple roots interchange consecutive coordinates for $i<n$ and negate the last coordinate for $i=n$. Thus

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.