Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 2 / 4

The appropriate abstract object is a finite reduced crystallographic root system $R$ in a real inner-product space $E$. Its axioms are: $R$ is finite, spans $E$, and does not contain zero; for $\alpha \in R$, $R\cap \mathbb{R}\alpha =\{\alpha ,-\alpha \}$; each root reflectionpermutes $R$; and every Cartan integer $n_{\alpha \beta }=2(\alpha ,\beta )/(\beta ,\beta )$ 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 givesIf 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 provesFor nonproportional roots the product is strictly less than four. In a reduced root system, proportional roots are just $\pm \alpha$ and have Cartan integers $\pm 2$, so the printed bound is intentionally looser than the resulting bound of three.

A fundamental system of a root system is a basis $\Delta$ of $E$ made of roots, such that each root is an integer combination of $\Delta$ with either all coefficients nonnegative or all nonpositive. Its members are the simple roots. Suppose distinct $\alpha ,\beta \in \Delta$ had $n_{\alpha \beta }>0$. Thenhas a positive coefficient of $\alpha$ and a negative coefficient of $\beta$, contradicting the defining sign condition. Thus $n_{\alpha \beta }\le 0$. Distinct simple roots are linearly independent, so their Cartan-integer product is strictly less than four. Combining integrality and the sign condition givesHere 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 $n_{\alpha \beta }{n}_{\beta \alpha }$ bonds, hence zero, one, two or three. A multiple bond has an arrow toward the short root. Indeed $n_{\alpha \beta }/n_{\beta \alpha }=(\alpha ,\alpha )/(\beta ,\beta )$ 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 $B_1=C_1=A_1$ and $D_3=A_3$; $D_2$ is disconnected, so introduces no further connected type. Affine diagrams are outside this finite classification.

Finally suppose the underlying graph contained a cycle on $m\ge 3$ distinct simple roots ${\alpha }_1,\dots ,{\alpha }_m$. Put $u_i={\alpha }_i/\Vert {\alpha }_i\Vert$. Any bonded pair hasand all other distinct pairs have nonpositive inner products. The cycle contributes at least $m$ bonded pairs, soBut 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.