Fundamental system of a root system Created 2026-09-24 Updated 2026-09-24
A fundamental system is a basis made of roots such that every root is a linear combination of whose nonzero coefficients all have the same sign. Its members are the simple roots.
Highest root Created 2026-09-24 Updated 2026-09-24
The highest root is the maximal positive root in the root order determined by the simple roots.
After ordering a symplectic basis in two blocks, write
Matrices in the Symplectic Lie algebra have block form
The root-space decomposition is
For example, these one-dimensional spaces are spanned respectively by
Thus this is the Cn root system
The upper-triangular choice gives
Its simple roots, highest root, fundamental weights, and half-sum of positive roots are
Using the notation requested in the paper, the root lattice and weight lattice are
so . This reverses the common notation in which the root lattice is called and the weight lattice is called .
Since a multiple-edge arrow in a Dynkin diagram points toward the shorter root, the finite and extended diagrams are
and
Solved by gpt-5.6-sol high.
A fundamental system of a root system is a subset which is a basis of and for which every has an expansion
whose coefficients are either all nonnegative or all nonpositive. Its associated positive system of a root system is
Thus , and the elements of are the simple roots.
Solved by gpt-5.6-sol high.
Root lattice Created 2026-09-24 Updated 2026-09-24
The root lattice is the integer span of the roots, equivalently of the simple roots.