my-server
← Wiki

Affine root system

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 and (except that both these papers accidentally omitted the Dynkin diagram ).

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 , then it is well defined an element in V denoted as which is the only element w such that .

Now suppose we have a scalar product on V. This defines a metric on E as .

Consider the vector space F of affine-linear functions . Having fixed a , every element in F can be written as with a linear function on V that doesn't depend on the choice of .

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 . Set and for any and respectively. The identification let us define a reflection over E in the following way:

By transposition acts also on F as

An affine root system is a subset such that:

The elements of S are called affine roots. Denote with the group generated by the with . We also ask

This means that for any two compacts the elements of such that are a finite number.

Classification

The affine roots systems A<sub>1</sub> = B<sub>1</sub> = B = C<sub>1</sub> = C are the same, as are the pairs B<sub>2</sub> = C<sub>2</sub>, B = C, and A<sub>3</sub> = D<sub>3</sub>

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.

Irreducible affine root systems by rank

Rank 1: A<sub>1</sub>, BC<sub>1</sub>, (BC<sub>1</sub>, C<sub>1</sub>), (C, BC<sub>1</sub>), (C, C<sub>1</sub>).
Rank 2: A<sub>2</sub>, C<sub>2</sub>, C, BC<sub>2</sub>, (BC<sub>2</sub>, C<sub>2</sub>), (C, BC<sub>2</sub>), (B<sub>2</sub>, B), (C, C<sub>2</sub>), G<sub>2</sub>, G.
Rank 3: A<sub>3</sub>, B<sub>3</sub>, B, C<sub>3</sub>, C, BC<sub>3</sub>, (BC<sub>3</sub>, C<sub>3</sub>), (C, BC<sub>3</sub>), (B<sub>3</sub>, B), (C, C<sub>3</sub>).
Rank 4: A<sub>4</sub>, B<sub>4</sub>, B, C<sub>4</sub>, C, BC<sub>4</sub>, (BC<sub>4</sub>, C<sub>4</sub>), (C, BC<sub>4</sub>), (B<sub>4</sub>, B), (C, C<sub>4</sub>), D<sub>4</sub>, F<sub>4</sub>, F.
Rank 5: A<sub>5</sub>, B<sub>5</sub>, B, C<sub>5</sub>, C, BC<sub>5</sub>, (BC<sub>5</sub>, C<sub>5</sub>), (C, BC<sub>5</sub>), (B<sub>5</sub>, B), (C, C<sub>5</sub>), D<sub>5</sub>.
Rank 6: A<sub>6</sub>, B<sub>6</sub>, B, C<sub>6</sub>, C, BC<sub>6</sub>, (BC<sub>6</sub>, C<sub>6</sub>), (C, BC<sub>6</sub>), (B<sub>6</sub>, B), (C, C<sub>6</sub>), D<sub>6</sub>, E<sub>6</sub>,
Rank 7: A<sub>7</sub>, B<sub>7</sub>, B, C<sub>7</sub>, C, BC<sub>7</sub>, (BC<sub>7</sub>, C<sub>7</sub>), (C, BC<sub>7</sub>), (B<sub>7</sub>, B), (C, C<sub>7</sub>), D<sub>7</sub>, E<sub>7</sub>,
Rank 8: A<sub>8</sub>, B<sub>8</sub>, B, C<sub>8</sub>, C, BC<sub>8</sub>, (BC<sub>8</sub>, C<sub>8</sub>), (C, BC<sub>8</sub>), (B<sub>8</sub>, B), (C, C<sub>8</sub>), D<sub>8</sub>, E<sub>8</sub>,
Rank n (n>8): A<sub>n</sub>, B<sub>n</sub>, B, C<sub>n</sub>, C, BC<sub>n</sub>, (BC<sub>n</sub>, C<sub>n</sub>), (C, BC<sub>n</sub>), (B<sub>n</sub>, B), (C, C<sub>n</sub>), D<sub>n</sub>.

Applications

References