Lably
Skip to content

Root datum

  • 2 min read
  • 2 chapters

Related on Lably

Through Rank (linear algebra)

Definition

A root datum consists of a quadruple

(X∗,Φ,X∗,Φ∨),

where

  • X∗ and X∗ are free abelian groups of finite rank together with a perfect pairing between them with values in Z which we denote by ( , ) (in other words, each is identified with the dual of the other).
  • Φ is a finite subset of X∗ and Φ∨ is a finite subset of X∗ and there is a bijection from Φ onto Φ∨, denoted by α↦α∨.
  • For each α, (α,α∨)=2.
  • For each α, the map x↦x−(x,α∨)α induces an automorphism of the root datum (in other words it maps Φ to Φ and the induced action on X∗ maps Φ∨ to Φ∨)

The elements of Φ are called the roots of the root datum, and the elements of Φ∨ are called the coroots.

If Φ does not contain 2α for any α∈Φ, then the root datum is called reduced.

Sign in to keep reading

One more chapter is free with a Lably account.

More in Topics in mathematics