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.
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 form
Here 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.
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 matrix
For , 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.
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. Therefore
But 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 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 matrix
must 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 .
The PDF's specified five-by-five diagonal matrix is , so and . In the root sum for the Killing form, the two short roots contribute , the two short roots contribute zero, and the four long roots each contribute one. Therefore
This computation uses the original PDF matrix; the converted TeX incorrectly gives its dimensions.
For a finite-dimensional Lie algebra, the Killing form is the symmetric bilinear form
In the root-space decomposition of this semisimple Lie algebra, acts as zero on the abelian Cartan subalgebra and as multiplication by on . For , their product thus acts as multiplication by on each root space. Every root space here is one-dimensional. Taking the trace over the two-dimensional Cartan subalgebra and the eight root spaces proves
For a general weight decomposition the trace would include the corresponding weight multiplicities; the root multiplicities are one in the semisimple setting here.
For the defining representation, the standard coordinate vectors are weight vectors of weights , respectively. Thus the weight diagram has four axial points and the origin, each of multiplicity one.
For the Adjoint representation, the eight nonzero weights of a representation are the roots from part (ii), each of multiplicity one, with the displayed as basis. The zero weight space is the Cartan subalgebra, with basis
The Adjoint representation diagram therefore has the four axial points, four diagonal points, and the origin of multiplicity two. The multiplicities sum to ten, as they must.
Figure 1.
Defining and adjoint so5 weight diagrams with multiplicities
. Details.
The diagonal Cartan subalgebra is
Put and ; then , and on . For the matrix unit , . Applying this to the general matrix in part (i) gives the following one-dimensional root spaces and chosen root vectors:
Each row satisfies and belongs to the Special orthogonal Lie algebra. The two diagonal parameters and eight root vectors span the ten-parameter matrix from part (i), giving the explicit root-space decomposition
This is the B2 root system, with short roots on the coordinate axes and long roots on the diagonals.
Preserving the symmetric bilinear form infinitesimally means . In blocks of sizes , write as a general block matrix and multiply by the given . The condition says that is skew-symmetric. It forces the lower-right entry to be zero, the middle diagonal block to be the negative transpose of the upper-left block, and the two off-diagonal two-by-two blocks to be skew-symmetric. Thus the general element of the Special orthogonal Lie algebra is
where is an arbitrary two-by-two matrix and are arbitrary two-component columns. More explicitly, using ten independent complex parameters,
Conversely, substituting this matrix into gives zero, so there are no further restrictions. In particular .
Use the weight of a representation convention from Question 1: , with simple roots and . This identification is necessary: the general preceding setup does not by itself specify which root system the symbols refer to.
The Weyl group is , acting by permutations of the . Let and , with composition read from right to left. Then
Hence
For direct verification, the diagonal coefficients of are , so its two Dynkin labels are and , both strictly positive. Thus is in the open Weyl chamber. The original three coefficients are distinct, so its stabilizer is trivial and this permutation is unique.
Let be a highest-weight vector of weight . For a simple root , choose its sl2 subalgebra associated with a root, with operators satisfying , , and . We have and .
Since decreases the weight by and there are only finitely many weights of a representation, let be maximal with . Induction using the two bracket relations gives the sl2 highest-weight lowering formula
Applying this at , the left side vanishes, and the nonzero vector on the right forces . This holds for every simple root, so
Thus the highest weight is a dominant integral weight, in particular an element of the Closed dominant Weyl chamber.
A highest-weight vector is a nonzero weight vector such that for every positive root . Its weight of a representation is a highest weight. For an irreducible finite-dimensional Lie algebra representation, this is the unique highest weight of a representation, and generates the module; a reducible module can have several highest weights of different summands.
Here is an existence argument for every nonzero finite-dimensional module . For each simple root, its root operators and coroot form an sl2 subalgebra associated with a root. The classification of finite-dimensional sl2 representations shows that this coroot acts diagonalizably with integral eigenvalues. These commuting coroots span the Cartan subalgebra, so simultaneous diagonalization gives a finite weight-space decomposition
Choose a real linear functional on the weight lattice span that is positive on every simple root, hence on every positive root, and choose a weight maximizing among the finitely many weights of . If and , then
so belongs to if nonzero. For positive , that would contradict maximality because . Thus every nonzero is a highest-weight vector. Every nonzero finite-dimensional module therefore has a highest weight. The zero module has no nonzero vector or weight, so it is the vacuous exception to the literal unrestricted wording.
Choose a positive system and its simple roots . The corresponding fundamental Weyl chamber is the open cone
Its Closed dominant Weyl chamber replaces all strict inequalities by weak inequalities. The facts used here are that every positive root is a nonnegative integral combination of the simple roots, and that the Weyl chambers are the connected components left after removing the root-orthogonal hyperplanes. Hence the displayed inequalities describe one such component. The Weyl group permutes these components simply transitively, and every orbit in meets the Closed dominant Weyl chamber in exactly one point. A point on a wall may have a nontrivial stabilizer, which is why uniqueness of the chamber point does not always mean uniqueness of the group element carrying it there.
Work with a complex semisimple Lie algebra and its root system in the real span of the roots of a root system. The Killing form induces a positive definite inner product on this real root space, after the usual identification with the dual of the real span of the coroots. For each root , its Weyl reflection is
The Weyl group is . The structural facts being used are that these reflections preserve the finite root system, that the roots span , and that the reflections in the simple roots already generate . Thus is finite: it acts faithfully as permutations of . Equivalently, it is the normalizer of the Cartan subalgebra modulo its centralizer in the associated adjoint group.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact