Affine root system

Uses your system voice; voice and rate in settings.

Snapshot

≈ 5 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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 semi-simple 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 ).

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 semi-simple 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 u,v \in 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 (\cdot,\cdot) on V. This defines a metric on E as d(u,v)=\vert(u-v,u-v)\vert . Consider the vector space F of affine-linear functions f\colon E\longrightarrow \mathbb{R} . Having fixed a x_0\in E , every element in F can be written as f(x)=Df(x-x_0)+f(x_0) with Df a linear function on V that doesn't depend on the choice of x_0 . 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^\vee =\frac{2f}{(f,f)} and v^\vee =\frac{2v}{(v,v)} for any f\in F and v\in V respectively. The identification let us define a reflection w_f over E in the following way: w_f(x)=x-f^\vee(x)Df. By transposition w_f acts also on F as w_f(g)=g-(f^\vee,g)f. An affine root system is a subset S\subset F such that: The elements of S are called affine roots. Denote with w(S) the group generated by the w_a with a\in S . We also ask This means that for any two compacts K,H\subseteq E the elements of w(S) such that w(K)\cap H\neq \varnothing are a finite number.

Classification

The affine roots systems A 1 = B 1 = B = C 1 = C are the same, as are the pairs B 2 = C 2 , B = C , and A 3 = D 3 . 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 1 , BC 1 , (BC 1 , C 1 ), (C , BC 1 ), (C , C 1 ). Rank 2: A 2 , C 2 , C , BC 2 , (BC 2 , C 2 ), (C , BC 2 ), (B 2 , B ), (C , C 2 ), G 2 , G . Rank 3: A 3 , B 3 , B , C 3 , C , BC 3 , (BC 3 , C 3 ), (C , BC 3 ), (B 3 , B ), (C , C 3 ). Rank 4: A 4 , B 4 , B , C 4 , C , BC 4 , (BC 4 , C 4 ), (C , BC 4 ), (B 4 , B ), (C , C 4 ), D 4 , F 4 , F . Rank 5: A 5 , B 5 , B , C 5 , C , BC 5 , (BC 5 , C 5 ), (C , BC 5 ), (B 5 , B ), (C , C 5 ), D 5 . Rank 6: A 6 , B 6 , B , C 6 , C , BC 6 , (BC 6 , C 6 ), (C , BC 6 ), (B 6 , B ), (C , C 6 ), D 6 , E 6 , Rank 7: A 7 , B 7 , B , C 7 , C , BC 7 , (BC 7 , C 7 ), (C , BC 7 ), (B 7 , B ), (C , C 7 ), D 7 , E 7 , Rank 8: A 8 , B 8 , B , C 8 , C , BC 8 , (BC 8 , C 8 ), (C , BC 8 ), (B 8 , B ), (C , C 8 ), D 8 , E 8 , Rank n (n>8): A n , B n , B , C n , C , BC n , (BC n , C n ), (C , BC n ), (B n , B ), (C , C n ), D n .

Applications

showed that the affine root systems index Macdonald identities 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. showed that affine roots systems index families of Macdonald polynomials.

References

Text derived from https://en.wikipedia.org/w/index.php?oldid=1374935801 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001374935801 · captured 1789419781.0 · version history

Cite this page as: encyclopegia.org, “Affine root system”, snapshot enwiki-001374935801. https://encyclopegia.org/a/affine-root-system

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.