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.
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 . The semisimple structure theory gives the root-space decomposition
The nonzero roots span , root spaces have dimension one, and every root has its negative. The rank is .
Next use the Killing form. Its nondegeneracy on and its positive-definite restriction to the real coroot span identify the real root span with a Euclidean space. Explicitly, if , put . The sl2 subalgebra associated with a root supplies its normalized coroot and the integral pairing
The root-string theorem makes the reflection permute . Together with the absence of multiples other than , this shows that 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 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 , 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 convention
There is one diagram vertex for each simple root. For , the integral off-diagonal entries are nonpositive and
Connect the two vertices with respectively zero, one, two or three edges. The corresponding angles are . A multiple edge carries an arrow toward the shorter root. For joined vertices, the length ratio is determined by ; hence the diagram records both angle and relative length.
For example, has simple roots and , giving two equal-length vertices joined by one edge: type . For , take and . Then
so the two vertices have a double edge directed toward , the shorter root: type .
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.
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.
Here a reduced root system is crystallographic, as appropriate to a semisimple Lie algebra. It is a finite spanning set in a real inner product space of dimension , invariant under each Weyl reflection
with for every pair of roots and . A base of a root system is a basis such that the coefficients of every root are integers that are either all nonnegative or all nonpositive. These define the positive system of a root system. We use the existing Cartan matrix convention
Using the alternative denominator transposes all the matrices below.
The classification of rank-two root systems gives , , , and . In orthonormal coordinates we may choose the following simple roots and Cartan matrices:
  • For , take , and . The positive roots are .
  • For , take , and . The positive roots are .
  • For , take the long root and short root , giving . The positive roots are . Interchanging the long and short convention gives type , which is the same rank-two classification up to the usual identification.
  • For , take the short root and long root , giving . The positive roots are .
Each complete root system consists of these positive roots and their negatives. To see why the list is exhaustive, the off-diagonal Cartan matrix entries of two distinct simple roots are nonpositive integers, and their product is . Thus the product is or , corresponding to simple-root angles or . These determine the four systems and their length ratios.
The Weyl group of a rank-two root system is generated by the two simple Weyl reflections. Their product is a rotation of order , respectively, so the groups are the dihedral groups of order . The first is also the Klein four-group and the second the symmetric group . The root-orthogonal lines cut the plane into Weyl chambers, each of angle . A chosen fundamental chamber of a root system is , ; its walls are the two root-orthogonal lines. The Weyl group acts simply transitively on these open chambers.
Figure 1.
Roots, reflecting lines and a fundamental chamber for the four crystallographic rank-two root systems
. Details.
The crystallographic hypothesis matters: if the integer-pairing condition is dropped, reduced noncrystallographic systems of type also occur. They are not additional Lie-algebra root systems.
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.
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.
A finite root system in a real Euclidean vector space is a finite spanning set such that, for every , the root reflection
preserves , and the Cartan integer is an integer for all . It is reduced when the only scalar multiples of in are and . Its Weyl group is the subgroup of the orthogonal group generated by the reflections . A base of a root system is a basis of such that every root is an integer combination of elements of whose nonzero coefficients all have the same sign.
The coroot of is
Let be the Weyl chamber determined by :
The roots and are positive scalar multiples, so their reflecting hyperplanes and their positive half-spaces are identical. The same chamber therefore defines positivity in the coroot system . Its walls correspond exactly to the rays for . Hence its simple roots are
which is therefore a base of .