In the crystallographic convention for this course, an admissible Coxeter graph comes from linearly independent unit vectors in a Euclidean space, such that for ,The vertices have no connection when , and a single, double or triple connection when . Equivalently, the symmetric Gram matrixmust be positive-definite. This equivalence follows because a positive definite Gram matrix can be realized by linearly independent vectors, while such vectors necessarily have a positive definite Gram matrix. In the edge-labelled Coxeter graph convention, these connections have labels , since the corresponding inner products are , and .
Suppose the underlying graph has a cycle through distinct vertices, and let be their unit vectors from admissibility. Adjacent vertices have , and every other pair has nonpositive inner product. ThereforeBut linear independence makes the sum nonzero, whose squared norm in a Euclidean space must be positive. This contradiction proves that the underlying graph of an admissible Coxeter graph has no cycles. Double and triple lines record edge multiplicities; they are not cycles of length two. The argument also tolerates chords, which only make the bound smaller.
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 . The ordering divides 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 and form the Cartan matrixFor , these entries are nonpositive integers and . Construct one vertex per simple root and join distinct vertices by 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 . A general Lie algebra without the semisimple root-system hypotheses need not produce such a diagram.
Let be distinct simple roots. Their difference is not a root, since its simple-root coefficients have opposite signs. The root string through in the direction therefore starts at and has the formHere we use the root-string theorem: if the full string runs from through , then ; in this case . Thus is a root exactly when , equivalently when the corresponding Dynkin diagram nodes are connected.
The root-space bracket facts are , with a zero space when the sum is not a root, and when the sum is a root and . Applying these stated structural facts proves
If the two names denote the same simple root, its one-dimensional root space has zero bracket with itself, and a Dynkin diagram has no self-edge. Thus the equivalence also holds in that case.
If the three simple roots are distinct and every pair of root spaces had nonzero Lie bracket, part (iv) would put all three connections in the Dynkin diagram. Their underlying Coxeter graph would contain a triangle, contradicting part (ii). Hence at least one pair satisfies . If two of the listed roots coincide, their common root space is one-dimensional, so its bracket with itself is already zero. Thus the conclusion also covers that case.
Articles by others on the same topic
There are currently no matching articles.