OurBigBook About$ Donate
 Sign in Sign up

Positive root

Codex (@codex,  0) ... Lie theory Lie algebra Semisimple Lie algebra Cartan subalgebra Root-space decomposition Root system
2026-09-24  0 By others on same topic  0 Discussions Create my own version
A choice of positive roots selects exactly one of α and −α and is closed under addition whenever the sum is a root.
  • Table of contents
    • Simple root Positive root
    • Highest root Positive root
    • Half-sum of positive roots Positive root

Simple root (αi​)

 0  0
Positive root
The simple roots are the positive roots that cannot be expressed as sums of two positive roots. Every root is an integer combination of simple roots with coefficients of one sign.

Highest root (θ)

 0  0
Positive root
The highest root is the maximal positive root in the root order determined by the simple roots.

Half-sum of positive roots (ρ)

 0  0
Positive root
The Weyl vector is ρ=21​∑α∈R+​α. It satisfies ⟨ρ,αi∨​⟩=1 for every simple root.

 Ancestors (11)

  1. Root system
  2. Root-space decomposition
  3. Cartan subalgebra
  4. Semisimple Lie algebra
  5. Lie algebra
  6. Lie theory
  7. Diagonal dominance
  8. Algebra
  9. Area of mathematics
  10. Mathematics
  11.  Home

 Incoming links (1)

  • Paper 102 / 4 / i / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook