The connected Dynkin diagrams of finite reduced crystallographic root systems are , , , , , , , and . Bonds encode products of off-diagonal Cartan integers; multiple-bond arrows point toward shorter roots. The simply laced branching diagrams have arm lengths for and , , for the three exceptional types. The and chains have an end double bond, a middle double bond, and a triple bond. This edge weighting is distinct from the vertex labels used to classify nilpotent orbits.
Crystallographic root system Created 2026-10-06 Updated 2026-11-05
A finite root system in a real inner product space is crystallographic when every Cartan integer is an integer. The roots of a complex semisimple Lie algebra satisfy this because each number is a weight of its sl2 subalgebra associated with a root. Reducedness is a separate axiom; the root-space reducedness lemma establishes it for these Lie-algebra roots.
Finite sl2 lowest-weight ladder Created 2026-10-14 Updated 2026-11-05
Over a field of characteristic zero, in a finite-dimensional Lie algebra representation of an sl2 triple, start with a nonzero vector satisfying and , and set . The commutator identities give the displayed weight and lowering formulas by induction. If and , then forces , a nonnegative integer. The nonzero terminal vector is essential: choosing a later index after the ladder has already vanished gives no constraint. Applied to the Adjoint representation of a semisimple Lie algebra, this argument proves integrality of Cartan integers.
For nonproportional roots in a reduced root system which is a crystallographic root system, the negative Cartan integers and satisfy . At least one of equals , so reflecting one root in the other produces their sum. The exclusion of opposite roots is essential: their inner product is negative but their sum is zero, which is not a root.
For a Cartan-Weyl basis, the Jacobi identity gives
Thus the bracket has joint Cartan weight . If , it belongs to the zero-weight space, which is the Cartan subalgebra, and so is a linear combination . If is a nonzero root, its root space is one-dimensional and the bracket is proportional to . 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 . The commutators become
The adjoint relations make , , the usual SU(2) Lie algebra generators. Hence every finite-dimensional SU(2) irreducible component has eigenvalues , with an integer. Therefore has integer eigenvalues , including in the finite-dimensional Adjoint representation. Algebraically this is the sl2 subalgebra associated with a root.
If , another use of the Jacobi identity gives
The bracket is therefore zero or lies in the eigenvalue- space. Within one irreducible SU(2) ladder it is proportional to the next chosen vector . If the full eigenspace has multiplicity, the weight statement is the general one; proportionality to one named vector presupposes the ladder choice. Similarly lowers this eigenvalue by two, and the ladder weights run from to in steps of two.
For a root vector , its weight is
The adjoint SU(2) ladder therefore proves
For nonparallel , raising and lowering move its joint Cartan weight through the root string . The finite irreducible ladder has weights symmetric about zero. Starting at , reaching its partner requires . The corresponding nonzero vector lies in the root space of , proving the Weyl reflection property:
There is no zero joint root in this string when 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 , reflection simply interchanges the two opposite roots, which already exist by the adjoint relation.
For angle and length restrictions, set and . These Cartan integers have the same sign when nonzero and obey
For nonparallel, nonorthogonal roots, is an integer strictly between zero and four. The possibilities are consequently:
  • : , equal lengths, and or .
  • : , squared-length ratio or , and or .
  • : , squared-length ratio or , and or .
Orthogonal roots have and . Parallel roots have ; the integer pairs would allow only length multiples . The stated reducedness condition excludes the latter two, so parallel roots are equal or opposite, with angles zero or and equal lengths. Thus
Not every root system realizes every listed angle.
The orthogonal pair alone gives no ratio through . To finish the length restriction for a simple Lie algebra, use irreducibility of its root system. Let span the Weyl group orbit of . Both and are invariant under the orthogonal root reflections. If a root had nonzero projections in both, reflection of its projection in would have a nonzero component, violating invariance. Hence every root is entirely in one of these subspaces. A proper nonzero 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 is nonorthogonal to any chosen , and . Applying the previous integer-pair restriction to therefore also handles orthogonal :
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 , 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 , 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.
  • For A2 root system, take and . The positive roots are ; all have squared length one.
  • For B2 root system, take the long and short . The positive roots are . These give the four axis roots and four diagonal roots, with squared lengths one and two. The rank-two Lie algebra is isomorphic to this one; changing the long/short ordering changes its Cartan presentation.
  • For G2 root system, take short and long . The positive roots are . They give two hexagons rotated by , with squared lengths one and three.
The nonnegative coefficients in each positive-root list verify the chosen simple roots explicitly. The orthogonal four-root system 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 gives
The alternative row-coroot convention transposes these matrices. Stating the convention and root ordering avoids a spurious disagreement in the unequal-length cases.
Figure 1.
The irreducible rank-two root systems A2, B2 and G2, with long and short roots and explicit ordered simple roots highlighted
. Details.
The drawn simple roots have , and . Their Cartan integers are therefore and , identifying a B2 root system. The corresponding root reflections act on coordinates by
In particular and , so both new positive roots are forced. Reflection in any root also forces its negative. Thus
These eight roots are drawn below, with the given simple pair highlighted.
Figure 1.
All roots forced by the given simple roots of the B2 root system
. Details.
For completeness, no further roots can occur. In a finite reduced root system, every root is a Weyl group translate of a simple root: reflect a nonsimple positive root in a simple root with positive inner product to decrease its height, and iterate. This standard simple-root descent may also be quoted here. The eight-vector set just listed is stable under both generating reflections, and the orbits of the two simple roots already fill it. Hence no simple-root orbit, and therefore no root, lies outside that set. This establishes both the necessity of every drawn root and exhaustion of the root system.
In the semisimple Lie algebra convention, an abstract root system is a finite subset of a finite-dimensional real Euclidean space with the following properties: it spans , does not contain zero, is reduced, is invariant under each of its root reflections, and satisfies crystallographic integrality. More explicitly, for every ,
Here is a positive-definite inner product. The first condition is reducedness, the second gives closure under root reflections, and the last number is a Cartan integer. The rank is . A simple root basis is a basis of consisting of roots such that each root has integral coordinates that are either all nonnegative or all nonpositive. The two signs distinguish positive and negative roots. The diagrams in this problem concern these reduced crystallographic root systems; broader definitions sometimes omit one of these conditions.
In the finite-dimensional complex semisimple Lie algebra setting, the rank of a semisimple Lie algebra is the dimension of a Cartan subalgebra , 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 gives the root-space decomposition
The nonzero linear functionals 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 form an sl2 triple. Start with a nonzero lowest-weight element and define . The Jacobi identity gives
Induction starting with consequently gives the finite sl2 lowest-weight ladder weights
Now commute the lowering equation with and again use the Jacobi identity:
The left side is . Whenever , coefficient comparison gives
The initial condition is , meaning ; directly , so . Summing the recurrence from to yields
In fact the vector identity follows inductively from the same Jacobi identity without needing a separately assumed lowering coefficient.
If is the last nonzero element and , apply to this zero next element. The lowering identity gives
so , a nonnegative integer. The nonzero endpoint is necessary. Literally allowing would make the printed conclusion false: take in the adjoint representation of . Then , , , . Choosing gives a vanishing next bracket but not . The intended endpoint is the first terminating bracket after the nonzero ladder.
For the plus-sign nested commutators, use , and . The cross relation gives , while . Thus the lowest-weight label is . If the -fold raised element is nonzero and the -fold element vanishes, the preceding endpoint argument gives and hence
For the minus-sign ladder, use the sl2 triple , , and start at . Its lowest-weight equation is again , 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 , choose the normalized sl2 subalgebra associated with a root , whose generators obey and . The coroot normalization gives
The normalization has a concrete construction. Use the nondegenerate Killing form , and define by . Invariance makes root spaces orthogonal unless their roots sum to zero, so there exist and with . Invariance then gives , hence . With , take , and . Their brackets have the required normalization and . Let be a nonzero root vector with weight . Repeatedly apply until reaching a last nonzero vector . Its weight is . This process terminates because different weights are linearly independent and the Lie algebra is finite-dimensional. Starting at , repeatedly raise; this also terminates for the same reason. The proven lowest-weight endpoint formula says for a nonnegative integer . Therefore
This 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: , , , . 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 give
For example , and the analogous second pair gives . The cross raising-lowering brackets vanish. A diagonal with entries has . Thus acts on with weights , and acts on them with weights . 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, whereas , so the nested ladder has and indeed . The negative ladder likewise terminates after one nonzero bracket.
If the roots are parallel, their Euclidean norms are equal by reducedness. For nonparallel, nonorthogonal roots, the Cartan integers above are nonzero integers of the same sign and have product or . Also
The absolute pairs are , , or . Hence
More precisely, angles require equal lengths; angles require a long-to-short ratio ; and angles require a ratio . The exclusion of orthogonality matters: orthogonal irreducible components can be scaled independently.
Use the course convention that a root system is finite and is a reduced root system satisfying the crystallographic root system condition. These hypotheses are essential for the angle restriction. For roots , the two Cartan integers
satisfy . If are not parallel, the strict Cauchy-Schwarz inequality and integrality give . These values give angles , or , or , and or , respectively. If the roots are parallel, reducedness implies , giving or . Therefore
Here are examples accounting for every angle. In the A1 root system, the pairs and give . Two roots from different summands of give . The six unit vectors at angles form an A2 root system: taking one root at angle zero and another at or gives those two angles. In the B2 root system , pair with or to obtain . In a G2 root system, take short unit roots at angles and long roots of length at angles . A short root at zero paired with long roots at gives the remaining angles.
A Dynkin diagram has one vertex for each simple root. Vertices are joined by bonds, where are the off-diagonal Cartan integers. No bond means orthogonality; one, two and three bonds mean angles . 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 gives
Here is already represented by , and by . 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.
Figure 1.
Finite irreducible crystallographic Dynkin diagrams, with every arrow pointing toward the shorter root
. Details.
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 . The En Dynkin diagram has arm lengths ; ; or . 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 . 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.
A reduced crystallographic abstract root system in a finite-dimensional real inner product space is a finite set such that: it spans and does not contain zero; the only scalar multiples of belonging to are ; every root reflection
permutes ; and each Cartan integer is integral. These are the crystallographic and reduced conventions appropriate to roots of a complex semisimple Lie algebra. Without crystallographic integrality, the numerical restrictions in the following subparts would not hold.
If , then both Cartan integers are . This opposite-root case satisfies the printed inner-product hypothesis and must be included.
Otherwise reducedness makes the roots nonproportional. Writing the angle as , strict Cauchy-Schwarz inequality gives
Both factors are negative integers, so their product is or . The full list is therefore
The nonproportional pairs correspond respectively to angles , and ; reversing the order of the roots reverses the unequal pairs.
The appropriate abstract object is a finite reduced crystallographic root system in a real inner product space . Its axioms are: is finite, spans , and does not contain zero; for , ; each root reflection
permutes ; and every Cartan integer is an integer. The restriction to a reduced root system and crystallographic integrality distinguishes roots of complex semisimple Lie algebras from more general reflection configurations.
For any two roots of a root system, the Cauchy-Schwarz inequality gives
If the inner product is zero, both Cartan integers vanish. Otherwise their signs agree, and the absolute value of each is a positive integer. Dividing their product by an integer of absolute value at least one proves
For nonproportional roots the product is strictly less than four. In a reduced root system, proportional roots are just and have Cartan integers , so the printed bound is intentionally looser than the resulting bound of three.
A fundamental system of a root system is a basis of made of roots, such that each root is an integer combination of with either all coefficients nonnegative or all nonpositive. Its members are the simple roots. Suppose distinct had . Then
has a positive coefficient of and a negative coefficient of , contradicting the defining sign condition. Thus . Distinct simple roots are linearly independent, so their Cartan-integer product is strictly less than four. Combining integrality and the sign condition gives
Here nonpositive is the intended sense of the printed convention that includes zero among “negative” numbers; orthogonal simple roots really do give zero.
To form a Dynkin diagram, place a vertex at each simple root. Join two vertices by bonds, hence zero, one, two or three. A multiple bond has an arrow toward the short root. Indeed determines the squared length ratio, and the diagram with the Cartan matrix reconstructs the angles and relative lengths. A single bond joins equal-length roots.
The connected finite Dynkin diagrams are the following. The descriptions include bond multiplicities and arrow directions, so distinguish dual diagrams:
There are no other connected finite Dynkin diagrams. Low-rank conventions also identify and ; is disconnected, so introduces no further connected type. Affine diagrams are outside this finite classification.
Finally suppose the underlying graph contained a cycle on distinct simple roots . Put . Any bonded pair has
and all other distinct pairs have nonpositive inner products. The cycle contributes at least bonded pairs, so
But the simple roots, and hence these normalized vectors, are linearly independent, making the displayed sum nonzero. Positive definiteness gives a contradiction. Thus the underlying graph of a finite Dynkin diagram has no cycle. This acyclicity of a finite Dynkin diagram argument also excludes cycles with extra chords or multiple bonds; multiple bonds themselves are not treated as two-edge cycles.
For a complex semisimple Lie algebra , a Cartan subalgebra is a maximal abelian subalgebra consisting of elements whose Adjoint representation matrices are diagonalizable. Equivalently it is a nilpotent self-normalizing Lie subalgebra. The root-space decomposition is
where the roots are the nonzero weights of that Adjoint representation.
We use these properties of the Killing form : it is nondegenerate on and on , it is invariant, distinct root spaces are orthogonal unless their roots sum to zero, and pairs nondegenerately with . Define by , and choose , with . Since weights add, , and invariance gives
The nonisotropic root lemma shows . Here is its short proof: if this number were zero, the span of would be a solvable Lie algebra with central. Apply the Lie theorem to its action on . The commutator would be strictly upper triangular and hence nilpotent. But makes it diagonalizable. It would therefore be zero, putting in the zero center of a Lie algebra of , contrary to its definition. Set
Then
so their span is the sl2 subalgebra associated with a root.
The abstract reduced crystallographic root system axioms are as follows. In a finite-dimensional real inner product space , the set is finite, consists of nonzero vectors and spans ; for every , one has ; the root reflection preserves ; and is an integer for every pair of roots. We verify the positive-definite real form as well as these axioms, rather than assuming the complex Killing form is already positive.
First is finite and has no zero element by its definition. The roots span over : any annihilated by all roots commutes with the whole root-space decomposition and is central, hence zero. Therefore the , and also the , span over . For every root , the classification of finite-dimensional sl2 representations applied to the Adjoint representation of the root subalgebra gives . Put . Every root takes real values on this space, and
The strict inequality follows because the roots span . This also shows that the complexification of injects into : an equality with real would contradict positivity of and . Since its complex span is all of , it is a real form. Moreover , so is a real scalar multiple of . The dual inner product thus makes a Euclidean space, as in the Euclidean subspace of a Cartan subalgebra.
To prove reducedness without assuming it, consider the root-subalgebra module
with absent root spaces understood to be zero. Its weights are even, so every nontrivial Irreducible Lie algebra representation in it has even positive highest weight and one-dimensional weight-zero space. The action of on its weight-zero space has image exactly , of dimension one. Therefore there is precisely one nontrivial irreducible summand, the already embedded adjoint module of highest weight . Thus and . If is any root on the same real line, the integral numbers and have product . Hence is one of ; the half and double cases are excluded by applying the preceding argument to the appropriate root. This proves the root-space reducedness lemma and .
For a root not parallel to , the sum of root spaces is stable under the root . Its integer weights are symmetric under sign in each irreducible summand. Therefore the weight also occurs, at the root . The Killing form normalization gives
so this root is exactly . For the reflection just swaps the two roots. This proves reflection invariance and the Cartan integer condition. All axioms of the reduced crystallographic root system have now been verified.
An abstract root system, in the reduced crystallographic convention, is a finite subset of a finite-dimensional real Euclidean space satisfying the following conditions:
  • and spans .
  • For each , ; this is the reduced condition.
  • The root reflection preserves .
  • Every Cartan integer is an integer.
The root system is irreducible if it is not a union of two nonempty mutually orthogonal root systems. The integrality condition is essential for the finite angle list below; arbitrary finite reflection systems need not satisfy it.
The possible angles are , , , , , , , , and . For roots , put
Both are integers, they have the same sign when nonzero, and
If the roots are linearly independent, strict Cauchy-Schwarz inequality gives . Hence . These values give, respectively,
For the last column, the possible absolute pairs are , , and , up to interchange, and . Parallel roots are equal or opposite by reducedness, giving or . Thus the list is exhaustive, and the rank-two root systems realize each nonparallel possibility.
Now suppose two simple roots have angle . Distinct simple roots have nonpositive inner product. Here is a proof from their defining sign property: if , then with a positive Cartan integer . This would be a root whose coefficients in the root basis include both a positive and a negative coefficient, which is impossible. Therefore, after normalizing the simple roots to unit length, any nonzero off-diagonal inner product is at most , by the angle list.
Let , , so . If there were a third simple root with unit vector , write and . Independence of the simple roots makes their Gram matrix positive definite, so
If either or were nonzero, its absolute value would be at least . Since , the displayed determinant would then be nonpositive. Thus . Every other simple root is orthogonal to both and : a triple bond isolates a G2 component.
Indeed, the root reflections in preserve their plane and fix its orthogonal complement; the root reflections in the other simple roots preserve that complement and fix the plane. The given facts that these reflections generate the Weyl group and that every root is Weyl group-conjugate to a simple root imply that every root lies entirely in one of those two orthogonal subspaces. If there were any other simple root, this would make reducible. Therefore irreducibility forces rank two.
Up to interchanging the simple roots, take short and long. The squared-length ratio is . Choose a scale and orthonormal coordinates so that
The Cartan integers are and . In coefficient coordinates , the two root reflections are
Their orbits of and are, respectively,
These sets are closed under both displayed reflections; for example , , , and . The assumption that every root is conjugate to a simple root now determines all twelve roots, with no further ones possible.
Figure 1.
The twelve G2 roots, with the six positive roots labelled and the simple roots emphasized
. Details.
For completeness, this twelve-element set really is a root system. It is finite, spans the plane, and is reduced. The six short roots have length and directions spaced by ; the six long roots have length and interleaved directions, also spaced by . Their mutual Cartan integers are integral: within either length class they are , , or as applicable, and between the two length classes they are , , or . Closure under all root reflections follows by conjugating the two simple reflections, since every listed root lies in a simple-root orbit. The nonorthogonal simple roots make it irreducible. We have therefore proved existence as well as uniqueness, up to isometry and overall scale:
The triple bond in the original Dynkin diagram gives the Cartan integers
where is the long root and the short root. Their product is , and the inner product of distinct simple roots is nonpositive. The ratio of the two integers gives the squared-length ratio. Therefore
It is convenient to normalize , and . Scaling the inner product does not affect the root system or the fundamental-weight relations.
For nonproportional roots , the root-string theorem states that the root string is consecutive:
The endpoints are maximal, and reflection in reverses the string. The Cartan integer determines , not in general the total by itself. This result follows by restricting the Adjoint representation to the sl2 subalgebra associated with a root. If the roots are distinct simple roots, cannot be a root: its simple-root coefficients have opposite signs. Thus and
Here length means number of roots; the number of intervals between them is one less. Distinctness matters. If , a reduced root system gives the set , with a missing zero between them, so the consecutive-string theorem and the displayed simple-root formula do not apply.
In the G2 root system, the initial strings are
For , . Since is not a root in a reduced root system, and : this generates . The remaining strings explain why the construction stops. The -strings through and are the same two-element string; the one through is a singleton since subtracting gives , and its Cartan integer is zero; the one through is the string . The -strings through , , and are the initial four-element string. Finally, is orthogonal to ; its -string is a singleton because is not a root. Apply the same reasoning to negatives. Using the permitted completeness of this procedure gives
The short positive roots are , of squared length two; the other three are long, of squared length six. Each root space is one-dimensional and the Cartan subalgebra has dimension two, so
Here the dimension refers to the Lie algebra, with one Cartan generator per rank, not just the number of roots.
Write a prospective weight as . The pairings with simple coroots are
The fundamental weights are dual to those coroots. Solving the two linear systems gives, in the long-root-first numbering of this paper,
The representation with Dynkin labels has highest weight , a short root. Numbering the short root first, as some references do, would call this the representation instead; the representation itself is unchanged.
The weight set of a finite-dimensional irreducible highest-weight representation is invariant under the Weyl group and lies in the convex hull of the orbit of its highest weight. All weights also differ from the highest weight by an element of the root lattice. The orbit of comprises the six short roots, so all six are weights. The lowering operators give the chain
In particular zero occurs: at weight , its pairing with is two, so the lowering operator is nonzero by the finite-dimensional sl2 Lie algebra representation theory. The -string through it is the usual three-weight string ; higher weight would lie outside the highest-weight convex hull.
There can be no further weights. Every point of that convex hull has squared norm at most , while a root-lattice point has
The integer solutions of the bound are precisely zero and the six short roots: gives ; gives ; and gives . Thus
The final dimension uses the stipulated nondegeneracy of the weights. It also agrees with the Weyl dimension formula without that stipulation. The zero weight is not in the Weyl orbit of the nonzero weights, so this is not a minuscule representation.
Figure 1.
G2 roots and weights of its seven-dimensional representation
. The twelve roots of a root system and seven weights in the long-root-first convention. Details.
In the diagram above, a coordinate label means . The left panel contains all twelve roots of a root system; the right panel contains the six short-root weights and the zero weight. The long-root-first convention is the same as in the calculations.
Choose the given short root as a simple root, and let be the long simple root. This entails no loss of generality: the Weyl group is transitive on the short roots of the G2 root system. The relevant Cartan integers are and . The positive roots are
Under , the root space for has eigenvalue . The subalgebra itself is the three-dimensional irreducible in the Adjoint representation.
The four root spaces along the root string have eigenvalues . Consecutive spaces are connected by nonzero raising operators and lowering operators, so their sum is . The negative root string supplies another . The root spaces for have eigenvalue zero, and neither adding nor subtracting gives a root; they are two copies of . Finally, the one-dimensional space commutes with , giving one more . We have accounted for all dimensions, and therefore the G2 adjoint branching to a short-root sl2 subalgebra is
For a nonzero root vector , its Adjoint representation action is a nonzero scalar multiple of the raising operator on each summand. On each irreducible this operator has a one-dimensional kernel, including . Since the Lie algebra centralizer is that kernel,
Let . The root reflection formula is . Applying the Cartan integers from part (b), the images of the chosen simple roots are
In particular, the two end-node Weyl reflections fix the opposite end node.
Work over or , in finite dimension and characteristic zero. The Killing form of a Lie algebra is the trace form of its Adjoint representation:
It is bilinear and symmetric by the cyclic property of the trace. It is an invariant bilinear form on a Lie algebra, since the Jacobi identity gives and hence
Equivalently, . A Lie algebra automorphism preserves the form, because it conjugates the adjoint matrices. Its radical of a bilinear form is an ideal of a Lie algebra by invariance. The center of a Lie algebra lies in this radical, so the form vanishes for an abelian algebra. On a direct sum of ideals the summands are orthogonal and the form restricts to their own Killing forms.
A short argument proves the requested implication without assuming the Cartan criterion for semisimplicity. Let be an abelian ideal of a Lie algebra, , and . The map takes into and vanishes on , while preserves . Therefore has image in and is zero on . In a basis extending a basis of , both diagonal blocks are zero, so its trace vanishes. This proves that abelian ideals lie in the radical of the Killing form.
If the solvable radical were nonzero, its derived series of a Lie algebra would have a last nonzero term . The Jacobi identity makes every derived term an ideal of , and the last one is abelian. Thus , contradicting nondegeneracy. We obtain
The converse holds as well in characteristic zero; together these implications are the Cartan criterion for semisimplicity.
For a complex simple Lie algebra, that criterion gives nondegeneracy on . Let be a Cartan subalgebra. Use the standard root-space decomposition
For and a root vector , choose with . Invariance gives
Thus is orthogonal to every nonzero root space. If is also orthogonal to , it is orthogonal to all of and hence is zero. This establishes nondegeneracy of the Killing form on a Cartan subalgebra:
The same invariance calculation shows that unless . Opposite root spaces are therefore paired nondegenerately. Tracing the adjoint action on the root-space decomposition yields
since the root spaces of a complex semisimple algebra are one-dimensional and its adjoint action on is zero.
The relevant Euclidean subspace of a Cartan subalgebra is
where the are the simple coroots, normalized by . The standard Euclidean property is that is real and positive definite on this space. The displayed trace formula explains it: is a sum of real squares, and the roots span , so all squares vanish only for . Via the nondegenerate form, the roots can consequently be regarded as vectors in a real Euclidean normed vector space. The induced dual inner product makes root reflections orthogonal and allows root lengths and angles to be encoded by Cartan integers and the Dynkin diagram.
This positivity is on a specified real subspace; the complex Killing form is a bilinear form, not a positive Hermitian inner product. On a compact real form the Killing form is instead negative definite. For example the Killing form of the special linear Lie algebra gives for , so but .