Affine root system

From HandWiki
The affine root system of type G2.

In mathematics, an affine root system is a root system of affine-linear functions on a Euclidean space. They are used in the classification of affine Lie algebras and superalgebras, and semisimple p-adic algebraic groups, and correspond to families of Macdonald polynomials. The reduced affine root systems were used by Kac and Moody in their work on Kac–Moody algebras. Possibly non-reduced affine root systems were introduced and classified by (Macdonald 1972) and (Bruhat Tits) (except that both these papers accidentally omitted the Dynkin diagram Script error: No such module "Dynkin".).

Definition

Let E be an affine space and V the vector space of its translations. Recall that V acts faithfully and transitively on E. In particular, if u,v∈E, then it is well defined an element in V denoted as u−v which is the only element w such that v+w=u.

Now suppose we have a scalar product (⋅,⋅) on V. This defines a metric on E as d(u,v)=|(u−v,u−v)|.

Consider the vector space F of affine-linear functions f:E⟶ℝ. Having fixed a x0∈E, every element in F can be written as f(x)=Df(x−x0)+f(x0) with Df a linear function on V that doesn't depend on the choice of x0.

Now the dual of V can be identified with V thanks to the chosen scalar product and we can define a product on F as (f,g)=(Df,Dg). Set f∨=2f(f,f) and v∨=2v(v,v) for any f∈F and v∈V respectively. The identification let us define a reflection wf over E in the following way:

wf(x)=x−f∨(x)Df

By transposition wf acts also on F as

wf(g)=g−(f∨,g)f

An affine root system is a subset S∈F such that:

  1. S spans F and its elements are non-constant.
  2. wa(S)=S for every a∈S.
  3. (a,b∨)∈ℤ for every a,b∈S.

The elements of S are called affine roots. Denote with w(S) the group generated by the wa with a∈S. We also ask

  1. w(S) as a discrete group acts properly on E.

This means that for any two compacts K,H⊆E the elements of w(S) such that w(K)∩H≠∅ are a finite number.

Classification

The affine roots systems A1 = B1 = B∨1 = C1 = C∨1 are the same, as are the pairs B2 = C2, B∨2 = C∨2, and A3 = D3

The number of orbits given in the table is the number of orbits of simple roots under the Weyl group. In the Dynkin diagrams, the non-reduced simple roots α (with 2α a root) are colored green. The first Dynkin diagram in a series sometimes does not follow the same rule as the others.

Affine root system Number of orbits Dynkin diagram
An (n ≥ 1) 2 if n=1, 1 if n≥2 Script error: No such module "Dynkin"., , , , ...
Bn (n ≥ 3) 2 Script error: No such module "Dynkin"., Script error: No such module "Dynkin".,Script error: No such module "Dynkin"., ...
B∨n (n ≥ 3) 2 Script error: No such module "Dynkin"., Script error: No such module "Dynkin".,Script error: No such module "Dynkin"., ...
Cn (n ≥ 2) 3 Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., ...
C∨n (n ≥ 2) 3 Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., ...
BCn (n ≥ 1) 2 if n=1, 3 if n ≥ 2 Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., ...
Dn (n ≥ 4) 1 Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., ...
E6 1 Script error: No such module "Dynkin".
E7 1
E8 1
F4 2 Script error: No such module "Dynkin".
F∨4 2 Script error: No such module "Dynkin".
G2 2 Script error: No such module "Dynkin".
G∨2 2 Script error: No such module "Dynkin".
(BCn, Cn) (n ≥ 1) 3 if n=1, 4 if n≥2 Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., ...
(C∨n, BCn) (n ≥ 1) 3 if n=1, 4 if n≥2 Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., ...
(Bn, B∨n) (n ≥ 2) 4 if n=2, 3 if n≥3 Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., Script error: No such module "Dynkin".,Script error: No such module "Dynkin"., ...
(C∨n, Cn) (n ≥ 1) 4 if n=1, 5 if n≥2 Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., Script error: No such module "Dynkin"., ...

Irreducible affine root systems by rank

Rank 1: A1, BC1, (BC1, C1), (C∨1, BC1), (C∨1, C1).
Rank 2: A2, C2, C∨2, BC2, (BC2, C2), (C∨2, BC2), (B2, B∨2), (C∨2, C2), G2, G∨2.
Rank 3: A3, B3, B∨3, C3, C∨3, BC3, (BC3, C3), (C∨3, BC3), (B3, B∨3), (C∨3, C3).
Rank 4: A4, B4, B∨4, C4, C∨4, BC4, (BC4, C4), (C∨4, BC4), (B4, B∨4), (C∨4, C4), D4, F4, F∨4.
Rank 5: A5, B5, B∨5, C5, C∨5, BC5, (BC5, C5), (C∨5, BC5), (B5, B∨5), (C∨5, C5), D5.
Rank 6: A6, B6, B∨6, C6, C∨6, BC6, (BC6, C6), (C∨6, BC6), (B6, B∨6), (C∨6, C6), D6, E6,
Rank 7: A7, B7, B∨7, C7, C∨7, BC7, (BC7, C7), (C∨7, BC7), (B7, B∨7), (C∨7, C7), D7, E7,
Rank 8: A8, B8, B∨8, C8, C∨8, BC8, (BC8, C8), (C∨8, BC8), (B8, B∨8), (C∨8, C8), D8, E8,
Rank n (n>8): An, Bn, B∨n, Cn, C∨n, BCn, (BCn, Cn), (C∨n, BCn), (Bn, B∨n), (C∨n, Cn), Dn.

Applications

  • (Macdonald 1972) showed that the affine root systems index Macdonald identities
  • (Bruhat Tits) used affine root systems to study p-adic algebraic groups.
  • Reduced affine root systems classify affine Kac–Moody algebras, while the non-reduced affine root systems correspond to affine Lie superalgebras.
  • (Macdonald 2003) showed that affine roots systems index families of Macdonald polynomials.

References