Centralizer lower bound for a root vector 2026-10-05
In a complex semisimple Lie algebra whose rank of a semisimple Lie algebra is , a root vector satisfies . To see this, select roots whose images form a basis of the real root span modulo , where . Take the highest endpoints of the root strings through both signs of each selected root. Their distinct root spaces commute with . Together with and , these give independent vectors in the Lie algebra centralizer.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 302 2 Solution Created 2026-10-03 Updated 2026-10-05
For a complex finite-dimensional simple Lie algebra, a Cartan subalgebra is a maximal commuting subalgebra of elements whose adjoint maps are semisimple. Equivalently in this setting it is a nilpotent self-normalizing subalgebra. Its dimension is the rank of a semisimple Lie algebra. Simultaneous diagonalization of its Adjoint representation gives the root-space decompositionA root of a root system is a nonzero linear functional for which this root space is nonzero. For a complex semisimple algebra each root space is one-dimensional. A Cartan-Weyl basis consists of a basis of and one nonzero root vector for every root.
The general Lie brackets have the formFor the opposite-root bracket, use the Killing form to define by . Its invariant bilinear form on a Lie algebra property givesOne may normalize the root vectors so that the pairing is one. If instead one uses a coroot as the opposite-root bracket, the root-vector normalization changes accordingly. In particular, root evaluation coordinates cannot simply be used as coefficients in a nonorthonormal Cartan basis.
For the matrix calculation take . The complexification of a Lie algebra of the special unitary group Lie algebra is the special linear Lie algebra : traceless complex matrices. Its Cartan subalgebra consists of traceless diagonal matrices. Write for the matrix units. The given Cartan basis is , , and the other basis elements are with .
The matrix-unit identity givesThus all the roots, expressed as evaluation vectors in this precise Cartan basis, areThey are the functionals on traceless diagonal matrices; there are of them. The corresponding root vector is . Together with Cartan generators, they give basis elements. The simple roots can be chosen as , whose evaluation vectors are the rows of the type- Cartan matrix, with on the diagonal and on adjacent entries. These vectors are evaluations on , not coordinates in an orthonormal realization of the root system.
To express every bracket strictly in the chosen basis, introduce the abbreviationThen all pairs are covered byHere both input root vectors have distinct row and column indices. The first case is the only one producing diagonal matrix units, and the displayed sum of resolves them completely into the chosen Cartan basis. Reversing the order gives the negative bracket. This also shows explicitly that the two nonzero non-Cartan cases have structure constants and , and verifies the required root-addition rule.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 102 2 d Solution Created 2026-10-03 Updated 2026-10-05
Suppose first that , and let be the real span of the root system, of dimension equal to the rank of a semisimple Lie algebra . The images of the roots span , so select roots whose images form a basis of this quotient.
For each , take the highest endpoint of the root string through , and the highest endpoint of the root string through . By construction, is not a root. Moreover , since their images in are nonzero. The root-space decomposition and its bracket rule therefore giveThese roots are distinct: their quotient images are the two signs of a basis, which are distinct. Their one-dimensional root spaces consequently contribute independent vectors to the Lie algebra centralizer.
In addition, the dimensional subspace commutes with , because . The line also commutes with . These contributions are independent by the root-space decomposition; in particular none of the selected endpoint roots is . Thus the centralizer lower bound for a root vector isIf , then . The root system contains the distinct roots , so , which also proves the desired inequality. The argument includes rank one, where the list of is empty.