Codex @codex  0

The $A_2$ root system has equal-length simple roots ${\alpha }_1,{\alpha }_2$ with angle $2\pi /3$, and roots $\pm {\alpha }_1$, $\pm {\alpha }_2$, $\pm ({\alpha }_1+{\alpha }_2)$. Its Cartan matrix is $\left(\begin{array}{cc}2& -1\\ -1& 2\end{array}\right)$. The corresponding complex simple Lie algebra is ${\mathfrak{sl}}_3(\mathbb{C})$, of dimension eight.

The $B_3$ roots are $\pm {\epsilon }_i\pm {\epsilon }_j$ for $1\le i<j\le 3$ and $\pm {\epsilon }_i$ for $1\le i\le 3$. Its root basis ${\alpha }_1={\epsilon }_1-{\epsilon }_2$, ${\alpha }_2={\epsilon }_2-{\epsilon }_3$, ${\alpha }_3={\epsilon }_3$ exhibits it as the dual root system of the C3 root system. With $A_{ij}=⟨{\alpha }_i,{\alpha }_j^{\vee }⟩$, its Cartan matrix isThe fundamental representation of highest weight $[1,0,0]$ is the seven-dimensional vector representation, with weights $\pm {\epsilon }_1,\pm {\epsilon }_2,\pm {\epsilon }_3,0$.

The $C_3$ roots are $\pm {\epsilon }_i\pm {\epsilon }_j$ for $1\le i<j\le 3$ and $\pm 2{\epsilon }_i$ for $1\le i\le 3$. One root basis is ${\alpha }_1={\epsilon }_1-{\epsilon }_2$, ${\alpha }_2={\epsilon }_2-{\epsilon }_3$, ${\alpha }_3=2{\epsilon }_3$. With $A_{ij}=⟨{\alpha }_i,{\alpha }_j^{\vee }⟩$, its Cartan matrix isThe fundamental representation of highest weight $[1,0,0]$ is six-dimensional, with weights $\pm {\epsilon }_1,\pm {\epsilon }_2,\pm {\epsilon }_3$.

For the C3 root system, take ${\alpha }_1=e_1-e_2$, ${\alpha }_2=e_2-e_3$, ${\alpha }_3=2e_3$. With columns indexing coroots, the Cartan matrix isThe convention with rows indexing coroots gives $A^T$. Both describe a double bond between the short root ${\alpha }_2$ and long root ${\alpha }_3$, with arrow toward ${\alpha }_2$.

For $n\ge 2$, the finite Dynkin diagram has a chain of short roots ${\alpha }_1,\dots ,{\alpha }_{n-1}$ with single bonds, followed by a double bond to the long root ${\alpha }_n$, pointing toward ${\alpha }_{n-1}$. The Extended Dynkin diagram adds the long root ${\alpha }_0=-2{\epsilon }_1$, doubly bonded to ${\alpha }_1$ with arrow toward ${\alpha }_1$. All other bonds remain. For $n=1$, the finite diagram is a single vertex; the affine diagram has two equal-length vertices joined by a double bond without an arrow, with Cartan matrix $\left(\begin{array}{cc}2& -2\\ -2& 2\end{array}\right)$.

The dual root system of $\Phi$ is ${\Phi }^{\vee }=\{{\alpha }^{\vee }:\alpha \in \Phi \}$. It has the transposed Cartan matrix, so its Dynkin diagram reverses every multiple-edge arrow; in particular, $B_n$ and $C_n$ are dual.

For a Cartan-Weyl basis, the Jacobi identity givesThus the bracket has joint Cartan weight $\alpha +\beta$. If $\beta =-\alpha$, it belongs to the zero-weight space, which is the Cartan subalgebra, and so is a linear combination ${\tilde{\alpha }}_i{H}_i$. If $\alpha +\beta$ is a nonzero root, its root space is one-dimensional and the bracket is proportional to $E_{\alpha +\beta }$. If that nonzero sum is not a root, the bracket vanishes. This proves the asserted forms without assuming every pair of roots has a root sum.

With the stated normalization, put $H_{\alpha }=2{\alpha }_i{H}_i/{\alpha }^2$. The commutators becomeThe adjoint relations make $J_3=H_{\alpha }/2$, $J_{+}=E_{\alpha }$, $J_{-}=E_{-\alpha }$ the usual SU(2) Lie algebra generators. Hence every finite-dimensional SU(2) irreducible component has $J_3$ eigenvalues $m=-j,-j+1,\dots ,j$, with $2j$ an integer. Therefore $H_{\alpha }$ has integer eigenvalues $2m$, including in the finite-dimensional Adjoint representation. Algebraically this is the sl2 subalgebra associated with a root.

If $[H_{\alpha },X_{\lambda }]=\lambda X_{\lambda }$, another use of the Jacobi identity givesThe bracket is therefore zero or lies in the eigenvalue-$\lambda +2$ space. Within one irreducible SU(2) ladder it is proportional to the next chosen vector $X_{\lambda +2}$. If the full eigenspace has multiplicity, the weight statement is the general one; proportionality to one named vector presupposes the ladder choice. Similarly $E_{-\alpha }$ lowers this eigenvalue by two, and the ladder weights run from $-n$ to $n$ in steps of two.

For a root vector $E_{\beta }$, its $H_{\alpha }$ weight isThe adjoint SU(2) ladder therefore provesFor nonparallel $\alpha ,\beta$, raising and lowering $E_{\beta }$ move its joint Cartan weight through the root string $\beta +k\alpha$. The finite irreducible ladder has weights symmetric about zero. Starting at $m_{\alpha \beta }$, reaching its partner $-m_{\alpha \beta }$ requires $k=-m_{\alpha \beta }$. The corresponding nonzero vector lies in the root space of $\beta -m_{\alpha \beta }\alpha$, proving the Weyl reflection property:There is no zero joint root in this string when $\alpha ,\beta$ are nonparallel. Its one-dimensional root spaces prevent two irreducible ladders with the same weight parity from overlapping, so the ladder argument applies to the entire string. For $\beta =\pm \alpha$, reflection simply interchanges the two opposite roots, which already exist by the adjoint relation.

For angle and length restrictions, set $p=2\alpha \cdot \beta /{\alpha }^2$ and $q=2\alpha \cdot \beta /{\beta }^2$. These Cartan integers have the same sign when nonzero and obeyFor nonparallel, nonorthogonal roots, $pq$ is an integer strictly between zero and four. The possibilities are consequently:

Orthogonal roots have $p=q=0$ and $\theta =\pi /2$. Parallel roots have $pq=4$; the integer pairs would allow only length multiples $1,2,1/2$. The stated reducedness condition excludes the latter two, so parallel roots are equal or opposite, with angles zero or $\pi$ and equal lengths. ThusNot every root system realizes every listed angle.

The orthogonal pair alone gives no ratio through $q/p$. To finish the length restriction for a simple Lie algebra, use irreducibility of its root system. Let $U$ span the Weyl group orbit of $\alpha$. Both $U$ and $U^{\perp }$ are invariant under the orthogonal root reflections. If a root had nonzero projections in both, reflection of its projection in $U$ would have a nonzero $U^{\perp }$ component, violating invariance. Hence every root is entirely in one of these subspaces. A proper nonzero $U$ would split the root system into two orthogonal parts, contradicting irreducibility. This proves that the Weyl orbit spans an irreducible root space.

In particular, some orbit root $\gamma$ is nonorthogonal to any chosen $\beta$, and ${\gamma }^2={\alpha }^2$. Applying the previous integer-pair restriction to $\gamma ,\beta$ therefore also handles orthogonal $\alpha ,\beta$:There can be at most two different root lengths: three lengths would have ratios two and three relative to the shortest, but then the longest-to-middle squared-length ratio would be $3/2$, which is forbidden. A reducible collection of orthogonal rank-one factors could have independently chosen scales; the simple-algebra assumption excludes that exception.

Choose a generic linear functional to define positive roots. The simple roots are those positive roots which cannot be written as sums of two positive roots; they form a basis in which all root coefficients are integers of one sign. Distinct simple roots have nonpositive inner product: if their inner product were positive, their root string would contain their difference, and whichever difference is positive would decompose one of them. In rank two, irreducibility excludes the orthogonal case. The allowed simple-root angles are therefore $120^{\circ },135^{\circ },150^{\circ }$, giving the three irreducible diagrams in the classification of rank-two root systems: A2 root system, B2 root system and G2 root system. Reflections in the two simple roots generate their respective six, eight and twelve roots.

Here are explicit simple-root choices and positive roots; adding their negatives gives each complete diagram.

The nonnegative coefficients in each positive-root list verify the chosen simple roots explicitly. The orthogonal four-root system $A_1\times A_1$ is rank two but reducible, so it is not a diagram for the simple algebra assumed here.

Define the Cartan matrix in the column-coroot convention:Using the ordered roots above givesThe alternative row-coroot convention transposes these matrices. Stating the convention and root ordering avoids a spurious disagreement in the unequal-length cases.

Work first in a finite-dimensional SU(2) representation, with its invariant positive inner product. In the complexified Lie algebra, choose $H^{†}=H$ and $(E^{-}{)}^{†}=E^{+}$. Let $v_0$ be a highest-weight vector with $H{v}_0=m{v}_0$ and $E^{+}{v}_0=0$, and put $v_r=(E^{-}{)}^r{v}_0$. The commutator with $H$ givesInduction also givesFor $r=1$ this is $E^{+}{E}^{-}{v}_0=H{v}_0=m{v}_0$. For the induction step, use $E^{+}{E}^{-}=E^{-}{E}^{+}+H$ on $v_r$: the coefficient becomes $r(m-r+1)+m-2r=(r+1)(m-r)$. In particularwhich proves the assumed formula rather than merely invoking it.

The norm identity $\Vert E^{-}{v}_r{\Vert }^2=(r+1)(m-r)\Vert v_r{\Vert }^2$ shows that, for nonnegative integer $m$, the ladder is nonzero for $0\le r\le m$ and stops with $E^{-}{v}_m=0$. Distinct eigenvalues make these vectors independent. Their span is stable under $H,E^{\pm }$, and in the irreducible module it is the full space. ThusFor normalized states, $E^{-}|n⟩=\frac{1}{2}\sqrt{(m+n)(m-n+2)}|n-2⟩$, with the last state killed. General finite-dimensional SU(2) representations are direct sums of these ladders.

The representation category matters here. The Lie-algebra relations alone allow an infinite Verma module even at integral highest weight: its nonzero vector $v_{m+1}$ is singular. The finite representation can instead be constructed algebraically by taking the basis $v_0,\dots ,v_m$ with the displayed actions and declaring $E^{-}{v}_m=0$; all three Lie brackets then hold, including at the endpoints. Thus the finite-dimensional assertion uses the integrable SU(2) module, or this explicit finite quotient, rather than assuming that a singular vector must vanish in every highest-weight module.

For rank two, take a Cartan subalgebra $\mathfrak{h}$ with commuting basis elements. A root $\alpha$ is a nonzero linear functional on $\mathfrak{h}$ for which a root space contains an element $E_{\alpha }$ satisfyingChoose simple roots ${\alpha }_1,{\alpha }_2$ and their coroots $H_i={\alpha }_i^{\vee }$. In the PDF's index convention, the Cartan matrix isNormalize $E_i^{\pm }=E_{\pm {\alpha }_i}$ so $[E_i^{+},E_i^{-}]=H_i$. The difference of distinct simple roots is not a root, so the mixed positive-negative bracket is zero. This givesThe transpose in the last formula is essential and is printed correctly in the original PDF.

A highest-weight vector of labels $({\overline{n}}_1,{\overline{n}}_2)$ is killed by both $E_i^{+}$ and is an eigenvector of the two $H_i$. Repeated words in $E_1^{-},E_2^{-}$ generate its highest-weight representation; each lowers the weight by the corresponding simple root. Restricting to the sl2 subalgebra associated with a root for either simple root gives the preceding integer ladder, so finite-dimensional highest labels must be nonnegative integers. The finite irreducible module is the highest-weight quotient imposing $(E_i^{-}{)}^{{\overline{n}}_i+1}v=0$ and the submodules generated by these relations, together with the Serre relations. Choosing independent nonzero lowering words gives a simultaneous weight basis; an extra multiplicity index is needed where a weight space has dimension greater than one.

For the specified B2 root system, the simple-root squared lengths are $1,2$ and their inner product is $-1$, givingThe positive root ${\alpha }_1+{\alpha }_2$ is generated by $[E_1^{+},E_2^{+}]\ne 0$, and $2{\alpha }_1+{\alpha }_2$ by $[E_1^{+},[E_1^{+},E_2^{+}]]\ne 0$. No further positive sums occur, so $(\mathrm{ad}{E}_1^{+}{)}^3{E}_2^{+}=0$ and $(\mathrm{ad}{E}_2^{+}{)}^2{E}_1^{+}=0$. These are the relevant Serre relations. Applying the Cartan commutators to a weight vector proveswhenever the image is nonzero.

To enumerate the requested representation without guessing when arrows stop, realize it concretely as the Adjoint representation. For a Euclidean weight $(x,y)$, its labels are $(n_1,n_2)=(2x,-x+y)$. The highest root $2{\alpha }_1+{\alpha }_2=(1,1)$ has labels $(2,0)$, so it generates the irreducible adjoint module of this simple rank-two Lie algebra. Its nonzero weights are exactly its eight roots, and its zero weight space is the two-dimensional Cartan subalgebra. This gives the B2 adjoint representation weight diagram and the nine distinct states labels:Their actual production by lowering can be seen fromAn arrow labelled $i$ denotes a nonzero action of $E_i^{-}$ between the indicated weight spaces. The two paths into zero produce independent Cartan vectors. Hence there are nine distinct pairs, as requested when degeneracy is disregarded, but the full representation has dimension ten, not nine.

In the finite-dimensional complex semisimple Lie algebra setting, the rank of a semisimple Lie algebra is the dimension of a Cartan subalgebra $\mathfrak{h}$, equivalently the number of independent commuting Cartan generators. For a compact real algebra, use its complexification and the corresponding maximal torus. Simultaneously diagonalizing the commuting adjoint actions of $\mathfrak{h}$ gives the root-space decompositionThe nonzero linear functionals $\alpha$ for which this space is nonzero are the roots of a root system. An invariant inner product identifies them with vectors in a real Euclidean root space. These are the usual semisimple assumptions behind the rank and root language here.

The displayed generators $H,E^{+},E^{-}$ form an sl2 triple. Start with a nonzero lowest-weight element $X_0$ and define $X_{n+1}=[E^{+},X_n]$. The Jacobi identity givesInduction starting with $[H,X_0]=-\lambda X_0$ consequently gives the finite sl2 lowest-weight ladder weightsNow commute the lowering equation with $E^{+}$ and again use the Jacobi identity:The left side is $q_n{X}_n$. Whenever $X_n\ne 0$, coefficient comparison givesThe initial condition is $q_0=0$, meaning $[E^{-},X_0]=0$; directly $[E^{-},X_1]=[-H,X_0]=\lambda X_0$, so $q_1=\lambda$. Summing the recurrence from $0$ to $n-1$ yieldsIn fact the vector identity $[E^{-},X_n]=n(\lambda -n+1)X_{n-1}$ follows inductively from the same Jacobi identity without needing a separately assumed lowering coefficient.

If $X_{n_0}$ is the last nonzero element and $[E^{+},X_{n_0}]=0$, apply $E^{-}$ to this zero next element. The lowering identity givesso $\lambda =n_0$, a nonnegative integer. The nonzero endpoint is necessary. Literally allowing $X_{n_0}=0$ would make the printed conclusion false: take $X_0=E^{-}$ in the adjoint representation of ${\mathfrak{sl}}_2$. Then $\lambda =2$, $X_1=H$, $X_2=-2E^{+}$, $X_3=0$. Choosing $n_0=3$ gives a vanishing next bracket but not $\lambda =3$. The intended endpoint is the first terminating bracket after the nonzero ladder.

For the plus-sign nested commutators, use $H=H_1$, $E^{\pm }=E_1^{\pm }$ and $X_0=E_2^{+}$. The cross relation gives $[E_1^{-},E_2^{+}]=0$, while $[H_1,E_2^{+}]=K_{21}{E}_2^{+}$. Thus the lowest-weight label is $\lambda =-K_{21}$. If the $n$-fold raised element is nonzero and the $(n+1)$-fold element vanishes, the preceding endpoint argument gives $\lambda =n$ and henceFor the minus-sign ladder, use the sl2 triple $H^{\prime }=-H_1$, $E^{\prime +}=E_1^{-}$, $E^{\prime -}=E_1^{+}$ and start at $X_0=E_2^{-}$. Its lowest-weight equation is again $[H^{\prime },X_0]=K_{21}{X}_0$, and its lowering bracket vanishes by the cross relation. The same argument proves exactly the same result, including the endpoint assumption that is explicit in the nested-commutator question.

For arbitrary roots of a root system $\alpha ,\beta$, choose the normalized sl2 subalgebra associated with a root $\beta$, whose generators obey $[H_{\beta },E_{\beta }^{\pm }]=\pm 2E_{\beta }^{\pm }$ and $[E_{\beta }^{+},E_{\beta }^{-}]=H_{\beta }$. The coroot normalization givesThe normalization has a concrete construction. Use the nondegenerate Killing form $B$, and define $t_{\beta }\in \mathfrak{h}$ by $B(t_{\beta },H)=\beta (H)$. Invariance makes root spaces orthogonal unless their roots sum to zero, so there exist $e\in {\mathcal{L}}_{\beta }$ and $f\in {\mathcal{L}}_{-\beta }$ with $B(e,f)=1$. Invariance then gives $B([e,f],H)=B(e,[f,H])=\beta (H)$, hence $[e,f]=t_{\beta }$. With $(\beta ,\beta )=\beta (t_{\beta })$, take $E_{\beta }^{+}=e$, $E_{\beta }^{-}=2f/(\beta ,\beta )$ and $H_{\beta }=2t_{\beta }/(\beta ,\beta )$. Their brackets have the required normalization and $\alpha (H_{\beta })=2(\alpha ,\beta )/(\beta ,\beta )$. Let $v$ be a nonzero $\alpha$ root vector with $H_{\beta }$ weight $w=\alpha (H_{\beta })$. Repeatedly apply $\mathrm{ad}{E}_{\beta }^{-}$ until reaching a last nonzero vector $v_0=(\mathrm{ad}{E}_{\beta }^{-}{)}^{p}v$. Its weight is $w-2p$. This process terminates because different weights are linearly independent and the Lie algebra is finite-dimensional. Starting at $v_0$, repeatedly raise; this also terminates for the same reason. The proven lowest-weight endpoint formula says $w-2p=-N$ for a nonnegative integer $N$. ThereforeThis proves integrality of Cartan integers directly from the finite ladder, rather than assuming the crystallographic axiom.

Finally use the indices actually printed in the PDF: $E_1^{+}=R^1{}_2$, $E_2^{+}=R^2{}_3$, $E_1^{-}=R^2{}_1$, $E_2^{-}=R^3{}_2$. The converted TeX has corrupted these indices. The prescribed bracket is that of trace-free matrix units. The sum of the diagonal generators is zero, leaving two independent diagonal elements, and their pair brackets giveFor example $[R^1{}_2,R^2{}_1]=R^1{}_1-R^2{}_2$, and the analogous second pair gives $H_2$. The cross raising-lowering brackets vanish. A diagonal $H$ with entries $h_r$ has $[H,R^r{}_s]=(h_r-h_s)R^r{}_s$. Thus $H_1$ acts on $E_1^{+},E_2^{+}$ with weights $2,-1$, and $H_2$ acts on them with weights $-1,2$. The negative generators have the opposite weights. In the question's index ordering,This is the Cartan matrix of the A2 root system, and the Lie algebra generated by these matrix units has rank two. As an additional bracket check, $[E_1^{+},E_2^{+}]=R^1{}_3\ne 0$ whereas $[E_1^{+},R^1{}_3]=0$, so the nested ladder has $n=1$ and indeed $K_{21}=-1$. The negative ladder likewise terminates after one nonzero bracket.

Work with a finite-dimensional complex semisimple Lie algebra. The Dynkin diagram is obtained from its intrinsic root system, with several structure theorems entering the construction.

First choose a Cartan subalgebra $\mathfrak{h}$. The semisimple structure theory gives the root-space decompositionThe nonzero roots span ${\mathfrak{h}}^{\ast }$, root spaces have dimension one, and every root has its negative. The rank is $r=\dim \mathfrak{h}$.

Next use the Killing form. Its nondegeneracy on $\mathfrak{h}$ and its positive-definite restriction to the real coroot span identify the real root span $E=\mathbb{R}\Phi$ with a Euclidean space. Explicitly, if $t_{\lambda }={\mathcal{B}}^{-1}(\lambda )$, put $(\lambda ,\mu )=B(t_{\lambda },t_{\mu })$. The sl2 subalgebra associated with a root supplies its normalized coroot $H_{\alpha }$ and the integral pairingThe root-string theorem makes the reflection $s_{\alpha }(\beta )=\beta -\beta (H_{\alpha })\alpha$ permute $\Phi$. Together with the absence of multiples other than $\pm \alpha$, this shows that $\Phi$ is a finite reduced root system and a crystallographic root system. These properties come from semisimple Lie algebra theory, not from the diagram's definition.

Choose a vector in $E$ that is not perpendicular to any root. Define the positive roots by positive inner product with this vector. The simple roots are those positive roots that cannot be expressed as sums of two positive roots. Root-system theory shows that they form a basis $\Delta =\{{\alpha }_1,\dots ,{\alpha }_r\}$, and each root is an integer combination of them with coefficients all of one sign. Distinct simple roots have nonpositive inner product.

Use the standard Cartan matrix conventionThere is one diagram vertex for each simple root. For $i\ne j$, the integral off-diagonal entries are nonpositive andConnect the two vertices with respectively zero, one, two or three edges. The corresponding angles are $90^{\circ },120^{\circ },135^{\circ },150^{\circ }$. A multiple edge carries an arrow toward the shorter root. For joined vertices, the length ratio is determined by $A_{ij}/A_{ji}=({\alpha }_i,{\alpha }_i)/({\alpha }_j,{\alpha }_j)$; hence the diagram records both angle and relative length.

For example, ${\mathfrak{sl}}_3$ has simple roots $L_1-L_2$ and $L_2-L_3$, giving two equal-length vertices joined by one edge: type $A_2$. For ${\mathfrak{sp}}_4$, take ${\alpha }_1=L_1-L_2$ and ${\alpha }_2=2L_2$. Thenso the two vertices have a double edge directed toward ${\alpha }_1$, the shorter root: type $C_2$.

Finally, orthogonal irreducible components of the root system correspond to the simple ideals of a Lie algebra in the semisimple Lie algebra, so its diagram is the disjoint union of their connected diagrams. Conjugacy of Cartan subalgebras and the Weyl group action on choices of positive roots make the resulting diagram independent of these choices up to isomorphism. Thus the vertices, edge multiplicities, arrows and connected components encode the simple-root geometry and the simple-ideal decomposition.

Choose a fundamental system of a root system $\{\alpha ,\beta \}$. Distinct simple roots have nonpositive inner product. Their Cartan matrix has diagonal entries two and off-diagonal entries $-p,-q$, where either $p=q=0$, or $p,q$ are positive integers. The root-system finiteness lemma gives $pq<4$. After exchanging the simple roots, the possibilities areTheir angles and relative lengths determine the two simple roots up to an orthogonal transformation and common scaling, except that the two orthogonal components can be scaled separately.

To see that no extra roots remain unspecified, write a positive root $\gamma =m\alpha +n\beta$ with nonnegative integer coefficients. If it is not simple, some simple root $\delta$ has $(\gamma ,\delta )>0$: otherwise $\Vert \gamma {\Vert }^2=m(\gamma ,\alpha )+n(\gamma ,\beta )\le 0$. The root reflection in $\delta$ subtracts a positive integer multiple of $\delta$. The other coordinate stays nonnegative; since $\gamma$ is not proportional to $\delta$, it is positive, so the reflected root must still be positive by the defining sign property of a fundamental system of a root system. Its height decreases. Repeating reduces $\gamma$ to a simple root. Thus every root is in a Weyl group orbit of a simple root.

For the four matrices, applying their simple reflections gives, respectively, the following positive roots:where in the last two rows $\alpha$ is long, $\beta$ short. For example, $s_{\beta }(\alpha )=\alpha +q\beta$ and $s_{\alpha }(\beta )=\beta +\alpha$ for the displayed matrices when the convention is $a_{ij}=2({\alpha }_i,{\alpha }_j)/({\alpha }_i,{\alpha }_i)$. The sets comprising these positive roots and their negatives are invariant under both reflections, as direct substitution verifies. The height argument therefore shows they are the whole root system. This proves the classification of rank-two root systems:

A Dynkin diagram has one vertex for each simple root. Vertices $i,j$ are joined by $a_{ij}{a}_{ji}$ bonds, where $a_{ij}$ are the off-diagonal Cartan integers. No bond means orthogonality; one, two and three bonds mean angles $2\pi /3,3\pi /4,5\pi /6$. A multiple-bond arrow points to the shorter root. Thus the Dynkin diagram determines the Cartan matrix, including the relative lengths inside each connected component.

An irreducible root system corresponds to a connected Dynkin diagram. The classification of finite crystallographic Dynkin diagrams givesHere $C_2$ is already represented by $B_2$, and $B_1,C_1$ by $A_1$. General systems are orthogonal direct sums of these, with separate component scales. The following diagrams specify all the types; dots denote a continued chain, not additional vertices.

For orientation, the An Dynkin diagram is a single chain, the Bn Dynkin diagram has a terminal double bond pointing to its terminal short root, and the Cn Dynkin diagram reverses that arrow. The Dn Dynkin diagram has arm lengths $1,1,l-3$. The En Dynkin diagram has arm lengths $1,2,2$; $1,2,3$; or $1,2,4$. The F4 Dynkin diagram has a central double bond and the G2 Dynkin diagram a triple bond.

The positivity behind this finite list is the positive-definite Gram matrix of the simple roots. In particular the underlying graph is a tree: if it contained a cycle, the sum of its normalized roots would have squared norm at most zero, since each bonded inner product is at most $-1/2$. This contradicts linear independence. Restricting the possible bonds and branches by positive definiteness gives precisely the listed chains and trees. Conversely their Cartan matrices are positive definite after symmetrization and their reflection-generated root sets give the indicated finite root systems.

In the finite-dimensional complex semisimple Lie algebra setting implicit in this root-system construction, the given Cartan subalgebra and root spaces determine a reduced crystallographic root system $R$. The ordering divides $R$ into positive roots and their negatives. The simple roots are the positive roots that cannot be written as a sum of two positive roots; a standard root-system fact is that they form a basis and that every positive root is a nonnegative integral combination of them.

Index the simple roots as ${\alpha }_1,\dots ,{\alpha }_{\ell }$ and form the Cartan matrixFor $i\ne j$, these entries are nonpositive integers and $A_{ij}{A}_{ji}\in \{0,1,2,3\}$. Construct one vertex per simple root and join distinct vertices by $A_{ij}{A}_{ji}$ lines. If root lengths differ, direct the arrow toward the shorter simple root. This labelled and oriented graph is the Dynkin diagram. Its unoriented Coxeter graph is admissible: normalizing the simple roots to unit length gives $4(v_i,v_j{)}^2=A_{ij}{A}_{ji}$. A general Lie algebra without the semisimple root-system hypotheses need not produce such a diagram.

Start with a nonzero highest-weight vector $v_0=|n⟩$ and set $v_r=E_{-}^r{v}_0$. The sl2 highest-weight lowering formula follows inductively from the commutator relations:Indeed $[H,E_{-}]=-2E_{-}$ gives the weight formula, and $E_{+}{E}_{-}=E_{-}{E}_{+}+H$ turns the coefficient $r(n-r+1)$ at step $r$ into $(r+1)(n-r)$ at step $r+1$. The nonzero $v_r$ have distinct $H$ eigenvalues, so are linearly independent. Finite dimensionality therefore forces a last nonzero vector $v_N$. Applying $E_{+}$ to $v_{N+1}=0$ gives $(N+1)(n-N)v_N=0$, hence $N=n$. This also proves that no earlier vector can vanish. Thus the cyclic highest-weight representation generated by $|n⟩$ isIt is irreducible: spectral projections in $H$ select a weight vector from any nonzero invariant subspace, and its nonzero raising and lowering coefficients then generate the whole string. This gives the classification of finite-dimensional sl2 representations used for each root direction below.

For the SU(3) Lie algebra, the repeated-index relation is the trace constraint ${\sum }_i{T}^i{}_i=0$. The displayed generators are a basis of its complexification, not nine independent generators or three individually vanishing diagonal elements. Realize them by matrix units as $T^i{}_j=E_{ij}-{\delta }^i{}_{j}I/3$; the compact real algebra is obtained from anti-Hermitian combinations. Thenand $E_{1+}=E_{12}$, $E_{1-}=E_{21}$, $E_{2+}=E_{23}$, $E_{2-}=E_{32}$. Substituting into the given commutators givesThus both root pairs obey the required sl2 Lie algebra relations. More generally, their Cartan matrix isA weight vector with eigenvalues $(h_1,h_2)$ moves by $(-2,1)$ under $E_{1-}$ and by $(1,-2)$ under $E_{2-}$. The third negative-root operator is $[E_{2-},E_{1-}]=E_{31}$ and moves it by $(-1,-1)$. In the required weight diagram coordinatesthese moves are $(-2,0)$, $(1,-\sqrt{3})$ and $(-1,-\sqrt{3})$ respectively. Successive lowerings from a highest-weight vector, with linear dependencies removed, construct the following bases.