• Up
• Contents
• Index
• Search
• Next »

Introduction

This chapter describes Magma functions for computing with (extended) root data. Root data are fundamental to Lie theory: Lie algebras (Chapter LIE ALGEBRAS) and groups of Lie type (Chapter GROUPS OF LIE TYPE). Our description of split reduced root data follows [Dem70] and [Car93] except that reflections act on the right as in customary in magma. Our description of extended root data follows [Sat71], [Sch69], and [Hal05]. Our description of split non-reduced root data follows [Bou68].

The closely related concept of a root system is discussed in Chapter ROOT SYSTEMS. When working with Lie algebras or groups of Lie type, root data should be used. When working with Coxeter groups (Chapter COXETER GROUPS) or reflection groups (Chapter REFLECTION GROUPS), it is likely that only root systems are of interest.

Reflections

Let X and Y be free Z-modules with bilinear pairing < , >:X x Y -> Z that identifies Y with the dual of X. Given nonzero α∈X and α^star∈Y, we define the Z-linear map s_α:X -> X by

x s_α= x - < x, α^star >α

and the Z-linear map s_α^star:Y -> Y by

y s_α^star= y - < α, y >α^star.

These maps are called reflections if one of the following equivalent properties hold: < α, α^star >=2; (s_α)²=1; < xs_α, ys_α^star > = < x, y > for all x∈X and y∈Y; α s_α= - α. The map s_α^star is also called a coreflection: this just means it is a reflection defined on Y instead of X. magma functions for computing with reflections are described in Section Construction of Pseudo- reflections.

If X has an inner product, then we can take Y=X and use the inner product as our pairing. In magma, X and Y are usually standard Z-modules. However, it is sometimes useful to allow X and Y to be distinct sublattices of a standard lattice. The bilinear pairing is always given by the standard inner product: < x, y > = xy^T.

Definition of a Split Root Datum

Suppose Φ is a finite subset of X - {0}. For each α in Φ, suppose there is a corresponding α^star in Y - {0}; set Φ^star={α^star | α∈Φ}. The datum R=(X, Φ, Y, Φ^star) is said to be a (split) root datum if the following conditions are satisfied for every α in Φ

1.

s_α and s_α^star are reflections;

2.

Φ is closed under the action of s_α; and

3.

Φ^star is closed under the action of s_α^star.

The lattice X is called the full root lattice and Y the full coroot lattice. The vector space X⊗Q is called the root space and Y⊗Q the coroot space. The elements of Φ are called roots and the elements of Φ^star are called coroots. A root datum is reduced, if α, β∈Φ with β a scalar product of α implies α=∓β.

Simple and Positive Roots

A subset Δ of Φ is called a set of simple roots if

1.

Δ is a basis for the rational span of the roots QΦ≤Q⊗X; and

2.

Φ = Φ^ + ∪Φ^ -, where Φ^ + is the set of linear combinations of elements of Δ with nonnegative coefficients, and Φ^ - = - Φ^ +.

Every root datum has a set of simple roots. Simple roots are frequently called fundamental roots. The elements of Φ^ + are called positive roots and the elements of Φ^ - negative roots. The coroots corresponding to the simple (resp. positive, negative) roots are the simple (respectively, positive, negative) coroots.

The rank of the root datum is the size of Δ, i.e. the dimension of the subspace QΦ. The rank cannot be larger than the dimension of the root datum (i.e. the dimension of Q⊗X). If the rank and dimension are equal, the root datum is said to be semisimple.

Choose a basis e₁, ..., e_d for X and a dual basis f₁, ..., f_d for Y, so that < e_i, f_j >=δ_ij. A reduced root system is determined by a pair of integral matrices A and B where the rows of A are the simple roots and the rows of B are the corresponding coroots; i.e. A_ij=< α_i, f_j > and B_ij=< e_j, α_i^star >.

The Coxeter Group

The group W generated by the reflections s_α, for α a simple root, is a finite Coxeter group. The Cartan matrix of a root datum is

C = (< α_i, α_j^star >)_{i, j=1}ⁿ = AB^t.

As in Chapter COXETER SYSTEMS, the Cartan matrix is used to define the Coxeter matrix, Coxeter graph and Dynkin digraph of a root datum.

A Coxeter form is a W-invariant bilinear form on X. If R is reduced and irreducible, then the roots can have at most two different lengths with respect to this form. We call the roots long or short accordingly. The Coxeter form is normalised so that the short roots in each component have length one. Note that, even if X=Y, this form will generally not be the same as the pairing < , >; however it can often be arranged for them to be the same (see StandardRootSystem).

Nonreduced Root Data

A root datum is reduced, if α, β∈Φ with β a scalar product of α implies α=∓β. A root α with the property 2α∉Φ is called reduced. A root α with the property (1/2)α∈Φ is called divisible. If R is a root datum, then the set R₀ of indivisible roots in R form the indivisible subsystem.

Let R be a nonreduced irreducible root datum of rank n. It can be shown that R₀ is irreducible of type of type B_n and every root is either in R₀, or is two times a short root of R₀. The Cartan type of R in this case is BC_n.

Note that the Cartan matrix, Coxeter matrix, Coxeter diagram, Coxeter group and Dynkin diagram are the same for R and R₀. Thus, when creating a non-reduced root datum for a given Cartan matrix, Coxeter matrix, Coxeter diagram, Coxeter group or Dynkin diagram, one must specify the set of non-reduced fundamental roots. E.g., let C be a cartan matrix of type B₂ x B₃. Then the set of nonreduced fundamental roots can be one of emptyset, {2}, {5} or {2, 5}, in which cases the root datum will be of types B₂ x B₃, BC₂ x B₃, B₂ x BC₃ or BC₂ x BC₃ respectively.

Isogeny of Split Reduced Root Data

The Dynkin digraph and dimension do not completely determine the isomorphism type of a split root datum, as the Coxeter graph and dimension do for a root system. Two root data with isomorphic Dynkin digraphs are said to be Cartan equivalent. We now describe the isomorphism classes within each Cartan equivalence class of split reduced irreducible root data. Since every semisimple reduced root datum is isogenous to a direct sum of irreducible root data, this immediately gives a classification of the split semisimple root data. Classifying nonsemisimple root data would be more complicated.

The weights of a root datum are the λ in QΦ≤X⊗Q such that < λ, α^star >∈Z for every coroot α^star. The weights form a lattice Λ called the weight lattice. We now have lattices ZΦ≤X ≤Λ (note that the second inclusion holds only for semisimple root data). The isomorphism class of a root datum in a fixed Cartan equivalence class is determined by the position of X between the root lattice ZΦ and the weight lattice Λ. Alternatively, the isomorphism class is determined by the isogeny group X/ZΦ within the fundamental group Λ/ZΦ. The fundamental group is determined by the Cartan matrix C: it is isometric to Zⁿ/Θ where Θ is the lattice generated by the rows of C. The fundamental groups of the irreducible Cartan equivalence classes are

A_n: Z/(n + 1);

B_n, C_n, E₇: Z/2;

D_n: Z/4 for n odd, Z/2 x Z/2 for n even;

E₆: Z/3;

E₈, F₄, G₂: trivial.

If X=ZΦ the root datum is said to be adjoint; if X=Λ it is said to be simply connected. The quotient Y/ZΦ^star is called the coisogeny group; in the semisimple case it is isomorphic to Λ/ZΦ.

Extended Root Data

An extended root datum is a split root datum R=(X, Φ, Y, Φ^star) and a permutation group Γ with actions on X and Y that respect the pairing < , >.

Fix a set of simple roots Δ. Let O(χ) denote the orbit of χ∈X under the Γ-action. Then, for α∈Φ either O(α) is contained in Φ^ +, or it is contained in Φ^ -, or the sum of the roots of O(α) is zero. We call O(α) a positive, negative or zero orbit, respectively. Put

X₀ := { χ ∈X | ∑_γ∈Γ χ^γ = 0 }.

Let Φ₀ := Φ ∩X₀ and Δ₀ := Δ ∩X₀. Then X₀ is a submodule of X, Φ₀ is a subsystem of Φ, and Δ₀ is a fundamental system of Φ₀. Note that Δ₀ is not necessarily a basis of X₀. Analogously, we define Y₀ and Φ^star₀. The subdatum R₀ = (X₀, Φ₀, Y₀, Φ^star₀) is called the anisotropic subdatum of R.

Set bar(X) := X/X₀ and let π:X to bar(X) be the standard projection. Then bar(X) is a free Z-module and π is a homomorphism of modules. Let bar(Φ) and bar(Δ) be the images under π of Φ - Φ₀ and Δ - Δ₀, respectively. Then bar(Φ) is a root system and bar(Δ) is a fundamental system of it. We call bar(Φ) the relative root system and bar(Δ) the relative fundamental system. Note that bar(Φ) need not be irreducible nor reduced even if Φ is. The rank of the relative system is |bar(Δ)| and is called the relative rank , whereas the rank |Δ| of Φ is called the absolute rank. Let bar(Φ)^ + and bar(Φ)^ - denote the images under π of Φ^ + - Φ₀ and Φ^ - - Φ₀. When X₀=X, the relative root system is an empty set and the form is called anisotropic.

Each γ∈Γ acts on X by χ |-> χ^{σ w} for some unique w∈W and σ a Dynkin diagram symmetry. By α |-> α^σ for α∈Δ we define the [Γ]-action on Δ. The extended root datum is called inner if the [Γ]-action is trivial and outer otherwise. The orbits of the [Γ]-action, that are not contained in X₀ are called distinguished.

An extended root datum is called twisted if the Γ-action is not trivial.

The (split) Cartan name of an extended root datum is the name of the corresponding split root datum. An extended root datum is absolutely irreducible if the corresponding split datum is irreducible. It is irreducible if there is no direct sum decomposition of the split datum which is preserved under the action of Γ. The twisted Cartan name of a root datum is the Cartan name, with extra information describing the twist. The name ()^mX_{n, e} indicates a root datum with split Cartan name X_n, where the kernel of the [Γ]-action has index m in Γ, and e is the rank of the relative root system. The twisted Cartan name describes absolutely irreducible root data up to isomorphism. This is not true for simple root data however.

• Up
• Contents
• Index
• Search
• Next »