${\boldsymbol\pi}$-systems of symmetrizable Kac-Moody algebras
Lisa Carbone, K. N. Raghavan, Biswajit Ransingh, Krishanu Roy and, Sankaran Viswanath

TL;DR
This paper develops a comprehensive theory of $$-systems for symmetrizable Kac-Moody algebras, analyzing their properties, Weyl group actions, and classifying specific cases relevant to physics.
Contribution
It generalizes the concept of $$-systems to all symmetrizable Kac-Moody algebras and determines the number of Weyl group orbits in key examples.
Findings
Unique $$-system of type $HA_1^{(1)}$ in $E_{10}$ up to Weyl group action.
Complete classification of $$-systems in many cases of interest in physics.
Fundamental properties of $$-systems established for symmetrizable Kac-Moody algebras.
Abstract
As part of his classification of regular semisimple subalgebras of semisimple Lie algebras, Dynkin introduced the notion of a -system. This is a subset of the roots such that pairwise differences of its elements are not roots. These arise as simple systems of regular semisimple subalgebras. Morita and Naito generalized this notion to all symmetrizable Kac-Moody algebras. In this work, we systematically develop the theory of -systems of symmetrizable Kac-Moody algebras and establish their fundamental properties. We study the orbits of the Weyl group on -systems, and completely determine the number of orbits in many cases of interest in physics. In particular, we show that there is a unique -system of type (the Feingold-Frenkel algebra) in (the rank 10 hyperbolic algebra) up to Weyl group action and negation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Combinatorial Mathematics · Advanced Topics in Algebra
-systems of symmetrizable Kac-Moody algebras
Lisa Carbone
Department of Mathematics, Rutgers, Piscataway, NJ 08854-8019, USA
,
K. N. Raghavan
The Institute of Mathematical Sciences, HBNI, Chennai 600113, India
,
Biswajit Ransingh
Harish-Chandra Research Institute, HBNI, Allahabad 211019, India
,
Krishanu Roy
The Institute of Mathematical Sciences, HBNI, Chennai 600113, India
and
Sankaran Viswanath
The Institute of Mathematical Sciences, HBNI, Chennai 600113, India
Abstract.
As part of his classification of regular semisimple subalgebras of semisimple Lie algebras, Dynkin introduced the notion of a -system. This is a subset of the set of roots such that pairwise differences of its elements are not roots. Such systems arise as simple systems of regular semisimple subalgebras. Morita and Naito generalized this notion to all symmetrizable Kac-Moody algebras. In this work, we systematically develop the theory of -systems of symmetrizable Kac-Moody algebras and establish their fundamental properties. For several Kac-Moody algebras with physical significance, we study the orbits of the Weyl group on -systems, and completely determine the number of orbits. In particular, we show that there is a unique -system of type (the Feingold-Frenkel rank 3 hyperbolic algebra) in (the rank 10 hyperbolic algebra) up to Weyl group action and negation.
Key words and phrases:
-system, regular subalgebra, Weyl group orbits, symmetrizable Kac-Moody algebras
2010 Mathematics Subject Classification:
17B22 (17B67)
The first author’s research is partially supported by the Simons Foundation, Mathematics and Physical Sciences-Collaboration Grants for Mathematicians, Award Number 422182. KNR and SV acknowledge support from DAE under a XII plan project. KR acknowledges SICI for an SRSF grant.
1. Introduction
1.1.
Let denote a finite dimensional semisimple Lie algebra over . A semisimple Lie subalgebra of is said to be regular if it is -invariant for some Cartan subalgebra of . The classical works of Borel-de Siebenthal [1] and Dynkin [7] contain a complete classification of the possible Cartan-Dynkin types of regular semisimple subalgebras of each simple Lie algebra.
Now let be a fixed Cartan subalgebra and the corresponding set of roots. A -system is a subset of satisfying the property that for all pairs of roots . Dynkin showed that linearly independent -systems arise precisely as simple systems of regular semisimple subalgebras of . The Weyl group acts naturally on -systems, and the number of orbits for each type of -system was tabulated by Dynkin in [7, Tables 9-11].
More generally, for a symmetrizable Kac-Moody algebra , a -system is a subset of its real roots such that pairwise differences of elements of are not roots of [20, 21]. -systems of affine Kac-Moody algebras were classified in [21, 24, 12]. Unsurprisingly, much less is known beyond the affine case. However, many -systems of the hyperbolic Lie algebra have been constructed and studied for their significance in physics [11, 13, 14]. Much of the current paper stems from an attempt at understanding the -orbits for the simplest -system of , namely that of type (the rank 3 hyperbolic Feingold-Frenkel algebra).
1.2.
We now describe our principal results. Let denote the Weyl group of the symmetrizable Kac-Moody algebra . We first establish (Theorem 3.1) that every indecomposable linearly independent -system of is -conjugate to one in which all roots have the same sign. When , this is a result of Naito [21, Prop. 2.1].
Consider the action of on -systems of , where acts by . If has a symmetric generalized Cartan matrix (GCM), we show that it admits a -system of type if and only if its Dynkin diagram has a subdiagram of overextended type, i.e., one obtained by overextending some finite type Dynkin diagram (figure 5.1). We establish a somewhat remarkable bijective correspondence between such subdiagrams of and -orbits of -systems of type (Theorem 6.2). It follows that that there is a unique -system (up to -equivalence) of type in . More generally, this uniqueness result holds when is replaced by any of the simply-laced overextended hyperbolic diagrams (corollary 6.6).
Strengthening these arguments, we prove a general counting theorem (Theorem 7.1) for -orbits of -systems of overextended type in . For a fixed overextended diagram , the problem of counting the number of inequivalent -systems of type in can be reduced to one in which is replaced by its underlying finite type diagram and is replaced by certain finite-dimensional simple Lie subalgebras of (equation (7.1)). Since the counting problem is completely solved when the ambient Lie algebra is finite-dimensional [7, Tables 9-11], this solves our original problem. In particular, the number of inequivalent -systems of type in is necessarily finite.
Instances of our theorems encompass many examples of interest in physics, such as -systems of types ), [14] and [18] in . We refer below to §1.3 for a brief discussion of this connection.
1.3. The physics of regular embeddings
We make some remarks on the motivations from physics that led to this work. It is known that symmetry appears in 11 dimensional supergravity in several ways. In dimensionally reduced supergravity theories, there is a Lie group and subgroup such that the coset space fibers over spacetime and the scalar fields are maps . Under dimensional reduction to dimension , and is the subgroup fixed by the Cartan involution [3, 15]. The real roots and the representations of have been shown to correspond to the fields of 11 dimensional supergravity at low levels [3].
There is a similar description of the symmetries of Einstein gravity in spacetime dimensions in terms of the rank 3 Feingold-Frenkel hyperbolic Kac-Moody algebra , also denoted in the physics literature. Under dimensional reduction to spacetime dimensions, is conjectured to be a symmetry of the dimensionally reduced Lagrangian [15]. The real roots and the representations of correspond to the fields of gravity at low levels [3].
The Lie algebra contains a regular subalgebra isomorphic to (by the results of [26] or Theorem 6.2). This reflects the inclusion of Einstein gravity into -dimensional supergravity. Theorem 6.2 states that all -systems of type in are conjugate (up to negation) under the Weyl group of , indicating that there is a ‘canonical’ inclusion of Einstein gravity into -dimensional supergravity. We remark that there is also a physics-suggested way to embed into via the ‘gravity truncation’ method of [4, §4].
Weyl orbits of -systems of affine type occur in [9, §3], where the authors describe a family of embeddings and give a brane interpretation of these.
1.4. Brief historical remarks
In Dynkin and Morita’s original definitions, a -system was required to be linearly independent (but see [7, Table 7], [22, Chap 4, §2, exercises 29-38]). Oshima [23] and Dynkin-Minchenko [8] obtained extensions and variations of the results of [7].
In the symmetrizable Kac-Moody context, Morita [20] and Naito [21] obtained the key initial results. A decade later, Feingold-Nicolai [11] rediscovered the definition of -systems, but imposed the restriction that all roots of a -system be positive. They did not require linear independence, but as was pointed out by Henneaux et al [13, §4.3], their main theorem on embeddings arising out of -systems is false unless this condition is imposed. Our Theorem 2.5 is the corrected statement, in the more general setting of -systems that are not necessarily subsets of the positive real roots. Our Theorem 3.1 serves as a link between the definitions of Morita and Feingold-Nicolai.
1.5. Acknowledgements
The authors are grateful to Thibault Damour for suggesting that we try to prove conjugacy of embeddings of into , and for many illuminating discussions. We also wish to thank Ling Bao, Paul Cook and Axel Kleinschmidt for helpful discussions.
2. -systems
2.1.
An integer matrix of size , where is a positive integer, is called a generalized Cartan matrix, GCM for short, if the following conditions are satisfied:
- (1)
for all 2. (2)
whenever 3. (3)
if for
Given a GCM of size , we let denote the Kac-Moody Lie algebra associated to [17, §1.3], with Cartan subalgebra and Chevalley generators for . We use terminology and notation as in the early chapters of [17] without any further comment.
Let denote the derived subalgebra of . Let denote the simple roots of and let be its root lattice, i.e., the free abelian group generated by the . Both and are -graded Lie algebras, with and for all [17, Chapter 1]. We let denote the sets of roots, real roots and imaginary roots respectively. For a root , we let denote the corresponding root space. Each real root defines a reflection of by where is the coroot corresponding to . The Weyl group is the subgroup of generated by the .
2.2. Multisets of real roots
Let be a GCM, and let be a finite sequence of real roots of (possibly with repetitions). We define the matrix
[TABLE]
We note that this is not a GCM in general. We let be the corresponding multiset of coroots. Viewing these as real roots of , we observe .
A reordering of the elements of corresponds to a simultaneous permutation of the rows and columns of the matrix: for some permutation matrix . We will most often identify two such matrices without explicit mention.
2.3. -systems
Definition 2.1**.**
Let be a GCM. A -system in is a finite collection of distinct real roots of such that is not a root for any .
This definition is essentially due to Dynkin [7] (for of finite type) and Morita [20] (in general), both of whom require that the be linearly independent; Morita calls such sets fundamental subsets of roots. The following proposition is stated in Morita (for the linearly independent case) without proof (see also Naito [21]). We supply the easy details.
Proposition 2.2**.**
Let be a GCM, and be a -system in . Then the matrix is a GCM.
Proof: For any real root we have . Indeed, letting for a simple root and an element of the Weyl group, we have , and . Suppose and are distinct real roots such that is not a root. Consider the “-string through ” ([17, Prop. 5.1]). Clearly and .
With and as in the previous paragraph, if , then , so that is not a root, so the -string through consists only of , and so .
Definition 2.3**.**
We call the type of , and refer to as a -system of type in .
2.4. Symmetrizable GCMs and -systems
An GCM is symmetrizable if there exists a diagonal matrix with positive rational diagonal entries such that is symmetric. Let be a -system of type in . We note that if is a symmetrizable GCM, then so is . Fix a choice of diagonal matrix which symmetrizes , and let denote the corresponding symmetric bilinear form on , defined by:
[TABLE]
Since the are real roots of , we know by [17, Chapter 5] that:
[TABLE]
Thus, is a diagonal matrix with positive rational entries that symmetrizes . This choice of symmetrization defines a symmetric bilinear form on . As in equation (2.1) above, this is given by . In other words, given the compatible choices of symmetrizations as above, the -linear map
[TABLE]
is form preserving.
Definition 2.4**.**
We denote by the map in equation (2.2)
Given with , the corresponding reflection is given by:
[TABLE]
We note that where and are their images under .
Theorem 2.5**.**
Let be an symmetrizable GCM and a -system of type in . For each , let , be non-zero elements in the root spaces and respectively, such that . Let be the Chevalley generators of and . Then there exists a unique Lie algebra homomorphism such that , , .
Proof: Since is symmetrizable, so is , and is generated by , , , subject to the relations [17, Theorem 9.11]:
[TABLE]
Any Lie algebra homomorphism from is thus determined by the images of and (). Thus there is at most one Lie algebra homomorphism with the requisite properties.
To show that there exists such a homomorphism, we need only verify that the relations in (2.3) through (2.6) are satisfied. Relations (2.3) and (2.4) are clearly satisfied. As for (2.5) we consider two cases: if , then it follows since ; if , then it follows since is not a root of by the definition of -system. As for (2.6), it follows from the fact [17, Prop. 5.1] that the -string through consists of , , …, , where .
The following proposition is equivalent to that of Naito [21, Theorem 3.6], though his proof is different (without using the Serre relations). In the interest of completeness, we give a (slightly simpler) argument.
Proposition 2.6**.**
With notation as in the above theorem, if is linearly independent (in ), one can extend the map to an injective map from to .
Proof.
Suppose that is a realization of [17, Chapter 1]. Let be any subspace of of smallest possible dimension such that (i) contains , …, , and (ii) the restrictions of , …, to are linearly independent as elements of (this is possible since we are given that the are linearly independent). Then
- (1)
is a realization of . 2. (2)
.
Assertion (1) follows easily from the definition of realization. As for assertion (2), observe that is in the span of : this follows from the definition of for a real root as where is an element of the Weyl group such that . We have , where is the matrix such that and is the matrix such that . The matrices and are both of rank . The assertion now follows easily from elementary linear algebra.
Now, is generated by , subject to the relations specified in the proof of Theorem 2.5 together with the following:
[TABLE]
We map to via the natural inclusion; are mapped to as before. We only need to check that the additional relations above hold. But these are obvious.
Finally, we show that the homomorphism is an embedding. The kernel of the homomorphism being an ideal of , it either contains the derived algebra or is contained in the center [17, §1.7(b)]. Since (and is contained in by (2.3)) the first possibility is ruled out. Thus the kernel is contained in the center. But the center is contained in the subspace ([17, Prop. 1.6]) and on the homomorphism is an inclusion. Thus the kernel is zero. ∎
Remark 2.7**.**
The following easy observations are often useful:
- (1)
If is linearly independent, then is an injection. 2. (2)
If , then is linearly independent.
Example 2.8**.**
- (i)
Let be a GCM of finite type. Dynkin [7] showed that if is a regular semisimple subalgebra of , then there exists a GCM of finite type and a -system of type in such that . 2. (ii)
Let us take , so that . Let . This is clearly a -system in , of type . The corresponding Kac-Moody algebra is the affine Lie algebra . We then have [17, Chapter 7], , the universal central extension of the loop algebra of . The generators of are , where and are the standard generators of . The map defined in Theorem 2.5 may be chosen to be:
[TABLE] 3. (iii)
More generally, let be any finite type GCM and the corresponding finite dimensional simple Lie algebra, with highest root . Consider the -system consisting of the simple roots of together with . This has type , the GCM of the untwisted affinization of . The map defined by Theorem 2.5 may be chosen to be the evaluation map at :
[TABLE]
Lemma 2.9**.**
Let A be an GCM. Let be an ideal of that does not contain any of the Chevalley generators i.e., for all . Then for all roots .
Proof.
Suppose is a positive, non-simple root. Assume for some nonzero . By [17, Lemma 1.5], there exists such that . If is not a simple root, we can find such that . Proceeding this way, after finitely many steps we get , which contradicts the hypothesis on . If were a negative root to begin with, the proof is analogous. ∎
Remark 2.10**.**
- (1)
Let be an ideal of . We observe that if contains one of , then it contains all three. 2. (2)
If is an indecomposable GCM, then any proper ideal of satisfies the hypothesis of lemma 2.9. To see this, suppose is in . Then, so are and . Since is indecomposable, for each fixed , there exist such that . Since, , we conclude contains , and hence also . Proceeding in this manner, we get . Since this holds for all , we obtain , a contradiction.
While the map of Theorem 2.5 need not be injective when is linearly dependent, we nevertheless have the following useful result which states that it is injective on each root space.
Corollary 2.11**.**
The map defined in Theorem 2.5 is injective when restricted to for . Further, the image of is contained in
Corollary 2.12**.**
- (1)
* and .* 2. (2)
If further is linearly independent, then .
Proof.
Corollary 2.11 implies that if is a root of , then is either 0 or a root of . Since and real roots are precisely the roots of positive norm [17, Proposition 5.2], we conclude that real roots map to real roots and imaginary roots to imaginary roots or 0. The second part is now obvious from Remark 2.7. ∎
The above corollary, for linearly independent was first obtained by Naito [21, Theorem 3.8]. Next, we have the converse to Theorem 2.5:
Proposition 2.13**.**
Let be symmetrizable GCMs. Let denote the Chevalley generators of . Suppose is a Lie algebra homomorphism satisfying , for all , for some real roots of . Then, the set is a -system of type in .
Proof.
Given a real root and any root of , it follows from elementary theory (applied to the -string through ) that
[TABLE]
Now, since for , we apply to conclude that . Hence is not a root of , and is thus a -system.
Next, we show that the type of this -system is exactly . Note that is the largest integer for which is a root of for . Let denote the simple roots of ; their images under are the . We have is the largest integer for which is a root of for . In fact , and by corollary 2.12, . Thus, .
By (2.7) above, , and since these two real root spaces map isomorphically to the corresponding real root spaces of , we conclude . By (2.7) again, is not a root of . Hence , and we obtain as required. ∎
Corollary 2.14**.**
Let be symmetrizable GCMs. If has a -system of type and has a -system of type , then has a -system of type .
Proof: Theorem 2.5 gives us Lie algebra morphisms . By corollary 2.11, both these maps are injective on real root spaces. The generators of map to real root vectors of . Thus, under the composition of these two morphisms, map to non-zero real root vectors of . The corresponding roots are clearly negatives of each other. Proposition 2.13 now completes the proof.
If denote the -systems of the above corollary, of types and respectively, then the -system of type in that one obtains from the proof above is just .
2.5.
As mentioned in the introduction, -systems were first defined by Dynkin in his study of regular semisimple subalgebras of semisimple Lie algebras. In this setting, any set of simple roots of a closed subroot system of the root system (of a semisimple Lie algebra) is a -system. The converse is also true, as can be seen from Theorem 2.5.
In the infinite dimensional setting, Naito [21] defined a regular subalgebra of a Kac-Moody algebra to be any subalgebra of the form where is a linearly independent -system of type in and denotes an extension of as in Proposition 2.6.
3. Weyl group action on -systems
3.1.
We freely use the notation of §2. Let be a symmetrizable GCM. Let denote the Weyl group of . It acts on the set of roots of , preserving each of the subsets of real and imaginary roots. Further this action preserves the symmetric bilinear form on . Thus, there is an induced action of on the set of all -systems in of a given type .
3.2.
When is of finite type, it is easy to see that every linearly independent -system in is -conjugate to a -system contained in the set of positive roots of . To see this, take an element such that for all elements of the -system. The element which maps into the dominant Weyl chamber will clearly also map the -system to a subset of the positive roots.
This proof fails in the general case; such does not exist unless is in the Tits cone. For instance, the negative simple roots of form a -system of type in . This set cannot be -conjugated to a subset of positive roots if is not of finite type; this can be seen using for instance [17, Theorem 3.12c]. The next theorem shows that this is essentially the only obstruction.
Theorem 3.1**.**
Let be symmetrizable GCMs and a linearly independent -system of type in . If is indecomposable, then:
- (1)
There exists such that or . 2. (2)
There exist such that and if and only if is of finite type.
The proof occupies the next two subsections.
3.3.
The proof of theorem 3.1 closely follows that of [17, Proposition 5.9]. The first part of this theorem, in the special case was proved by Naito in [21]. We first recall some relevant facts about the roots of a Kac-Moody algebra. Let be an indecomposable GCM, and let denote the corresponding Kac-Moody algebra. Let denote its root lattice. We use the notation introduced already for the sets of roots, real roots, positive roots etc. Let + denote the set of non-negative reals. Define:
[TABLE]
We then have the following result due to Kac [16, Proposition 1.8], [17, §5.8]:
Proposition 3.2**.**
(Kac) In the metric topology on the real span of is the convex hull of the set of limit points of . In particular, it is a convex cone.
Now suppose for some real vector space . Let be a basis of . Define to be the + span of the , and let .
Lemma 3.3**.**
If , then or .
Proof.
Consider the set ; it has the following properties: (i) It is convex, by Proposition 3.2. (ii) It is contained in , by the given hypothesis. (iii) It does not contain a line (i.e., for nonzero , both and cannot belong to this set), because .
It is easy to see that these properties imply that must be entirely contained either in or in . ∎
Under the same hypothesis as lemma 3.3, we have:
Lemma 3.4**.**
If , then all but finitely many real roots of lie in .
Proof.
First, we define an inner product on by requiring the to be an orthonormal basis. This defines the standard metric topology on , and thereby on the -span of .
Let , and . Here, the norm is that of the Euclidean space . Observe that is a subset of , where is the unit sphere in . If is an infinite set, then, it has a limit point, say . Now , and by Proposition 3.2, . But by hypothesis. This contradiction establishes the lemma. ∎
Proposition 3.5**.**
Let . There exists such that or .
Proof.
By lemma 3.3, the positive imaginary roots are all contained in or in ; we may suppose (replacing the with their negatives if need be) that . Consider ; this is finite by lemma 3.4. If this set is non-empty, it contains some simple root of . Since the simple reflection defines a bijective self-map of , it is clear that contains one fewer element than . Iterating this procedure, we can find , a product of simple reflections, such that is empty, as required. ∎
3.4.
Finally, we are in a position to prove theorem 3.1. With notation as in the theorem, observe that the linear independence of implies that is injective. By corollary 2.12, . We define to be the -span of and take to be the basis of simple roots of . Then, clearly, . Identifying with its image under , and appealing to proposition 3.5 completes the proof of part (1).
To prove part (2), since , we have . Consider the set . We have (i) , by corollary 2.12, and (ii) . Since the sets are both -invariant, this implies . Similarly, from , we conclude . This means is empty, or in other words, that is of finite type.
Conversely, if is of finite type, then is finite. Hence its intersections with and are both finite sets. The proof of Proposition 3.5 shows that there exist elements of which map to subsets of . ∎
3.5.
As is evident from Example 2.8(ii), the conclusion of Theorem 3.1 is false if is not assumed to be linearly independent, even when is of finite type.
3.6.
Let be symmetrizable GCMs. A -system of type in is said to be positive (resp. negative) if it is -conjugate to a -system all of whose elements are positive (respectively negative) roots. Theorem 3.1 implies that if is linearly independent and is indecomposable and not of finite type, then is either positive or negative, but not both. We record below a simple criterion to determine the sign that was obtained in the course of the proof of Theorem 3.1.
Proposition 3.6**.**
Let be symmetrizable GCMs, with indecomposable and not of finite type. Let be a linearly independent -system of type in . Then the following are equivalent:
- (1)
* is positive (resp. negative).* 2. (2)
* (resp. ) for every .* 3. (3)
* (resp. ) for some .*
∎
3.7.
Let denote the number of -orbits of -systems of type in (this could be infinity in general). When are of finite type, Borel-de Siebenthal and Dynkin determined the pairs for which . Dynkin went further, and also determined the values of ; these turn out to be 1 for almost all cases, except for a few where it is 2 [7, Tables 9-11]
4. -systems of affine type
4.1.
Let denote the Dynkin diagram associated to the GCM [17, §4.7]. Any subset of the vertices of together with the edges between them will be called a subdiagram of (and we will use to denote the relation of being a subdiagram). Given , we define to be the set and view it as a subset of the vertices of . Given a subdiagram of , we say is supported in if is contained in the set of vertices of . We also let denote the subset of vertices of that are not in and are not connected by an edge to any vertex of . If is supported in and in , then clearly .
Lemma 4.1**.**
Let be a symmetrizable GCM and a subdiagram of of affine type. Let denote the null root of . If is such that , then .
Proof.
We write , where the coefficients are all non-negative, or all non-positive. Let denote the set of for which is nonzero. Now, is 0 for , and when . Since all coefficients are of the same sign, every must be either in or in . ∎
Theorem 4.2**.**
Let be a symmetrizable GCM and be a GCM of affine type. Suppose is a linearly independent -system of type in . Then,
- (1)
There exists an affine subdiagram of and such that every element of is supported in . 2. (2)
Suppose is another such pair, i.e., with a subdiagram of affine type, such that is supported in . Then and . 3. (3)
.
Proof.
Let . Let denote the simple roots of and let denote its null root. Let . By corollary 2.12(2) and the fact that preserves forms, we obtain that is an isotropic root of . By [17, Proposition 5.7], there exists such that is supported on an affine subdiagram of and for some nonzero integer , where is the null root of .
Now, for all . We conclude , by lemma 4.1. Since is a root, its support is connected, and hence contained entirely in or entirely in . However, is a -system of type , an indecomposable GCM. So, cannot be written as a disjoint union of two mutually orthogonal subsets. This means that either for all , or for all . The latter is impossible since is a positive integral combination of the . This proves part (1).
Now, if is another such pair, then since the only isotropic roots of supported on subsets of are the multiples of , we obtain for . Define , so . Since is a positive imaginary root of , so is ; thus and have the same sign. We may suppose . Now and are antidominant weights (i.e., their negatives are dominant weights) of , which are -conjugate. By [17, Proposition 5.2b], we get . Thus, , and .
Since is antidominant, the simple reflections that fix generate the stabilizer of [17, Proposition 3.12a]. By lemma 4.1, this stabilizer is just . Thus , proving part (2).
Finally, let denote the -system of part (1). Now is of affine type, untwisted or twisted. In either case, from the description of the real roots of an affine Kac-Moody algebra [17, Chap 6], the following holds: for all . Consider
[TABLE]
Since is orthogonal to every root of , it is clear that is a linearly independent -system of type in , supported in . From the proof of part (1), we know for some nonzero integer . From the definition of , we obtain
[TABLE]
where is the Coxeter number of the affine Kac-Moody algebra . We claim that the are pairwise -inequivalent. Suppose and are in the same -orbit. Then, from part (2), we obtain for some . In particular, this means . Since fixes , equation (4.1) implies . This completes the proof of part (3). ∎
Corollary 4.3**.**
Let be a symmetrizable GCM such that has no subdiagrams of affine type. Then contains no linearly independent -systems of affine type.
This follows immediately from the proposition. We remark that Figure 5.2 contains examples of such .
Remark 4.4**.**
- (1)
The conclusion of theorem 4.2 is false without the linear independence assumption, as in Example 2.8 (ii), (iii). 2. (2)
Let be symmetrizable GCMs, with of affine type. Suppose contains a linearly independent -system of type . Theorem 4.2 implies that some affine type subdiagram of also contains a linearly independent -system of type . This allows us to determine the possible set of such in two steps: (i) find all affine subdiagrams of , and (ii) for each such , list out all the ’s which occur as GCMs of linearly independent -systems of . 3. (3)
We note that step (ii) above can in-principle be carried out using the results of [24] (see also [21, 12, 6]).
5. Hyperbolics and Overextensions
5.1.
Let be a symmetrizable GCM and be its Dynkin diagram [17, §4.7]. If is symmetric, we will call simply-laced.
Definition 5.1**.**
Let be a simply-laced Dynkin diagram. We say that is an overextension or of type if there exists a vertex in such that the subdiagram is of affine type and .
We let denote the set of overextensions. It is easy to see that the following is the complete list of overextensions, up to isomorphism:
[TABLE]
(see Figure 5.1). Here, has vertices. We remark that the corresponding GCMs are all nonsingular; hence a -system of type is necessarily linearly independent.
5.2.
From figure 5.1, one makes the important observation (via case-by-case check) that if is an overextension, then the vertex satisfying the condition in definition 5.1 is unique. This vertex is marked by a dashed circle in figure 5.1. We will call the overextended vertex of , and the affine part of .
We had . Let with for all . Observing that for all , it follows that: (i) There is a unique vertex of such that , (ii) For this vertex, we have and , (iii) In particular, this means is a special vertex of the affine diagram (in the terminology of Kac, Chapter 6). Let denote the finite type diagram obtained from by deleting . We will call it the finite part of . We note that:
[TABLE]
where denotes the highest root of . It will be convenient to denote by .
5.3.
The following trivial observation is useful: let be a simply-laced Dynkin diagram and a diagram of type. Suppose there exists , a -system of type in ; we let denote the subsets of corresponding to the finite and affine parts of respectively. For any , is a -system of type in and .
5.4. Hyperbolics
We recall that an indecomposable, symmetrizable GCM is said to be of Hyberbolic type if it is not of finite or affine type and every proper principal submatrix of is a direct sum of finite or affine type GCMs.
There are finitely many GCMs of hyperbolic type in ranks 3-10 and infinitely many in rank 2. The former were enumerated, to varying degrees of completeness and detail, in [25, 5, 19]. More recently, this list was organized and independently verified in [2]. We will use this latter reference as our primary source for the Dynkin diagrams of hyperbolic type. Note that [2] does not require symmetrizability in the definition of a hyperbolic type GCM: it contains 142 symmetrizable and 96 non-symmetrizable ones. We let denote the set of all symmetrizable GCMs of hyperbolic type of rank .
5.5.
We recall from §4.1 the subdiagram partial order on the set of symmetrizable GCMs. We write if the Dynkin diagram is a subdiagram of ; equivalently is a principal submatrix of , possibly after a simultaneous permutation of its rows and columns. This is clearly a partial order, once we identify the matrices with each other.
5.6.
We now isolate the symmetric GCMs of hyperbolic type. By checking the classification case-by-case (see for instance [26, Tables 1,2] or [2]), one finds that these are either (i) of type:
[TABLE]
or (ii) one of the diagrams in Figure 5.2, or (iii) one of the rank 2 symmetric GCMs for . We observe by inspection of figure 5.1 that the diagrams in (ii) and (iii) do not contain a subdiagram of type.
5.7.
The next lemma underscores the special role played by the hyperbolic overextensions. These are precisely the minimal elements of the set of overextensions relative to the partial order .
Lemma 5.2**.**
[TABLE]
Proof.
Observe that for and for . We are thus left with the diagrams of equation (5.1) as possible candidates for minimal elements. Now, each of these diagrams except contains a unique subdiagram of affine type, obtained by removing a single vertex. So these diagrams cannot contain a proper subdiagram of type. As for the diagram , it contains two subdiagrams of affine type, and , obtained by deleting appropriate vertices , but only the former satisfies (this is for the latter). Thus, is also minimal. ∎
6. Weyl group orbits of -systems of type
In this section, we focus on the diagram . The corresponding Kac-Moody algebra was first studied by Feingold and Frenkel [10].
6.1.
We consider the problem of determining for a simply-laced Dynkin diagram . This is an important special case of the more general result of the next section. The latter result will be obtained by arguments similar to the ones used here, albeit with more notational complexity.
6.2.
We begin with the following lemma which asserts that every Dynkin diagram of type has a “canonical” -system of type .
Lemma 6.1**.**
Given a Dynkin diagram of type, define:
[TABLE]
(notations are as defined in §5.2). Then is a linearly independent, positive -system of type .
Proof.
We only need to show that the type of is , the other assertions following from the observation that the three roots in are real, positive and have disjoint supports (cf. §5.2). Since is simply-laced, we normalize the form such that all real roots have norm 2. Thus
[TABLE]
It is clear from §5.2 that and . This completes the verification. ∎
Theorem 6.2**.**
Let be a simply-laced Dynkin diagram. Then:
- (1)
* has a -system of type if and only if it contains a subdiagram of type.* 2. (2)
The number of -orbits of -systems of type in is twice the number of such subdiagrams (and is, in particular, finite).
Proof.
In light of Theorem 3.1, any -system of type in is -equivalent to a positive or a negative -system, but not both. Thus, to prove the above theorem, it is sufficient to construct a bijection from the set of type subdiagrams of to -equivalence classes of positive -systems of type in . We claim that the following map defines such a bijection:
[TABLE]
We will first establish the injectivity. Suppose are type subdiagrams of , with affine parts and overextended vertices respectively. Suppose i.e., there exists such that . Consider the -systems:
[TABLE]
We note that:
- (1)
is of type . 2. (2)
is supported in the affine subdiagram of . 3. (3)
.
Now, it follows from part (2) of theorem 4.2 that and . Since , we can only have if . Thus, as required.
Next, we turn to the surjectivity of this map. Let be a positive -system of of type . Since form a -system of type , which is affine, it follows from theorem 4.2 that there is a unique affine type subdiagram of and an element such that is supported in for . Further (as in the proof of theorem 4.2), since is an isotropic root of , we must have for some nonzero integer . Since , we conclude . But by proposition 3.6, and since is a positive imaginary root. This implies .
Let ; thus are supported in , their sum equals and . We now need the following lemma:
Lemma 6.3**.**
Let be a simply-laced Dynkin diagram, an affine subdiagram of and a real root of satisfying . Then there exists such that is a simple root of .
We defer the proof of this lemma to the next subsection. Here, we use it to complete the proof of Theorem 6.2. We take in lemma 6.3. We obtain such that for some vertex of . Define . Since stabilizes , we have ; thus is of type.
Since are supported in , so are ; further . Now
[TABLE]
This implies that is supported in . Since is a simply-laced finite type diagram, all its real roots are conjugate under its Weyl group. Thus, there exists such that . Since stabilizes both and , we conclude that , as required. ∎
6.3.
We now turn to the proof of Lemma 6.3. We use the notations of the lemma. Since is an antidominant weight of , must be a positive root. Further it is clear from that must have the form:
[TABLE]
where is a vertex of such that , and are non-negative integers. Consider the -orbit of . Since the coefficient of remains the same, any element of this orbit is a positive root that has the same form as the right hand side of (6.1) for some non-negative coefficients . Let be a minimal height element of this orbit, i.e., one for which is minimal. Then, we have: (i) for all , since otherwise would have strictly smaller height, (ii) since all real roots have the same norm ( is simply-laced). We compute:
[TABLE]
Since , we conclude from (i) above that either or for each . If some , it would imply that has disconnected support, which is impossible since is a root. Thus, and the proof of the lemma is complete. ∎
6.4.
We note that the key step in the proof above was showing that the set of all real roots which have the form of equation (6.1) forms a single orbit under the standard parabolic subgroup of . In fact, those very same arguments prove a strengthened assertion. We formulate this below.
Given a Dynkin diagram with simple roots and given any in its root lattice, we define the coefficients by:
[TABLE]
If is a subdiagram of , we define and .
Proposition 6.4**.**
Let be a symmetrizable Dynkin diagram with invariant bilinear form and simple roots . Let be a subdiagram of , and fix a nonzero element of the root lattice of . Consider the set
[TABLE]
Then:
- (1)
If is a root of , then where is the standard parabolic subgroup of . 2. (2)
If is not a root of , then is empty.
Proof.
Suppose is non-empty, then or lies in . We may assume the former case holds, so in fact . Since is -stable, it decomposes into -orbits. Let denote one such orbit. let denote an element of minimal height in ; as in the proof of Lemma 6.3, this implies for all ; hence for all elements . We now have . But as observed already, ; further since these elements have disjoint supports. This implies . Suppose is nonzero, the latter implies that has disconnected support. Hence it cannot be a root. This contradiction shows , i.e., . In particular, is a root, and belongs to any orbit in . Hence . ∎
Remark 6.5**.**
- (1)
If is simply-laced and is a singleton, say , and , then consists precisely of those real roots of which have the form of equation (6.1). 2. (2)
If is of finite type and is a root of , then Proposition 6.4 is a consequence of Oshima’s lemma [23, Lemma 4.3], [6, Lemma 1.2].
6.5.
We now have the following corollary of Theorem 6.2.
Corollary 6.6**.**
Let be a Dynkin diagram of type. Then:
- (1)
If , then there are exactly two -systems of type in , up to -equivalence. In other words:
[TABLE] 2. (2)
, for . 3. (3)
, for .
Proof: The first part follows from Lemma 5.2 and Theorem 6.2. For parts (2), (3), we need to count the number of subdiagrams of the ambient diagram which are of type. We list these out in each case, leaving the easy verification to the reader.
- (1)
: one subdiagram of type and two of type . 2. (2)
: one subdiagram of type and two each of types and . 3. (3)
: one subdiagram of type and two of type . 4. (4)
: one subdiagram of type and one of type .
We also have the following result concerning the simply-laced hyperbolic diagrams not included in the previous corollary.
Corollary 6.7**.**
Let be a simply-laced hyperbolic Dynkin diagram. If , then does not contain a -system of type .
Proof: This follows from the observation made in §5.6 that such diagrams do not contain subdiagrams of type.
Finally, we remark that Theorem 6.2 can be applied just as easily even when is neither in nor . For example, the diagram , obtained by further extension of [14] contains a unique subdiagram of type, namely . Thus, .
7. The general case
Theorem 7.1**.**
Let be a simply-laced Dynkin diagram and let be a diagram of type. Then:
- (1)
There exists a -system in of type if and only if there exists an type subdiagram of such that has a -system of type . 2. (2)
The number of orbits of -systems of type in is given by:
[TABLE]
where denote their finite parts.
We remark that equation (7.1) reduces the computation of the multiplicity of in to a sum of multiplicities involving only finite type diagrams. The latter, as mentioned earlier, are completely known [7]. Observe also that for , is of type . Since any occurring on the right hand side of (7.1) is simply-laced, we have . So this reduces exactly to Theorem 6.2 in this case.
Corollary 7.2**.**
Let be a Dynkin diagram of type. Then,
- (1)
* is finite for all simply-laced diagrams .* 2. (2)
* for all .*
We now prove theorem 7.1.
Proof.
It is enough to prove the second part of the theorem. Now, by Theorem 3.1, any -system in of type is either positive or negative, but not both. Consider the sets:
- •
: the set of -orbits of positive -systems of type in ;
- •
: the set of all pairs where is an type subdiagram of and is a positive -system of type in .
- •
, the equivalence classes of under the equivalence relation defined by: if and only if and is in the -orbit of .
Since and are the two sides of equation (7.1), it is sufficient to construct a bijection from the set to . We first define a map from to . Let . Let and denote the finite and affine parts of , and let denote its overextended vertex. Since is a -system of type in , we identify with a subset of via corollary 2.12. Let denote the highest root in (identified with its image in ). Consider the set
[TABLE]
It is straighforward to see that this is a -system. Further, it is of type . We now claim that the map: factors through and defines a bijection between and .
Firstly, suppose , i.e., for some . Since clearly , and , we conclude that . So the map does indeed factor through . We will now show it is an injection.
Suppose , are such that , i.e., there exists such that . Let denote the overextended vertex of . Consider the -systems:
[TABLE]
We note that: (i) is of type , (ii) is supported in the affine subdiagram of , and (iii) .
Now, it follows from part (2) of theorem 4.2 that and . Since , we can only have if . Thus, . We write with and ). Since , we obtain (in fact, ) since fixes each element of pointwise. Further, implies that . In particular, . Hence we obtain , in other words, the map defined above is injective on . Next, we show surjectivity of the map. Let be a positive -system in of type ; we will show that is in the image of the map. Let be the subsets of corresponding to the finite and affine parts of respectively. Now, is a positive -system of type in . By theorem 4.2, there is an affine type subdiagram of , and an element such that every element of (the positive -system) is supported in . Since , let us replace with in what follows. Thus, is a positive -system of type such that is supported in . Let correspond to the overextended vertex of , and let denote the null root of , identified with its image in . Thus (i) is a positive imaginary root of (by corollary 2.12), (ii) is supported in , and (iii) satisfies . The first two conditions imply for some , while the third implies .
As in the proof of Theorem 6.2, we now appeal to Lemma 6.3 to find an element such that for some vertex of . Define ; this is clearly an type subdiagram of . Consider the positive -system of type . We have: (a) , (b) is supported in and (c) . Further, for all gives us , i.e., for all . This in turn implies that: (d) is supported in . From (a), (c) and (d) we conclude . Since and is of type , the proof is complete.
∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Borel and J . De Siebenthal. Les sous-groupes ferm s de rang maximum des groupes de Lie clos. Commentarii mathematici Helvetici , 23:200–221, 1949.
- 2[2] Lisa Carbone, Sjuvon Chung, Leigh Cobbs, Robert Mc Rae, Debajyoti Nandi, Yusra Naqvi, and Diego Penta. Classification of hyperbolic dynkin diagrams, root lengths and Weyl group orbits. Journal of Physics A: Mathematical and Theoretical , 43(15):155209, 2010.
- 3[3] T. Damour, M. Henneaux, and H. Nicolai. Cosmological billiards. Classical Quantum Gravity , 20(9):R 145–R 200, 2003.
- 4[4] Thibault Damour and Christian Hillmann. Fermionic Kac-Moody billiards and supergravity. J. High Energy Phys. , (8):100, 55, 2009.
- 5[5] Sophie de Buyl and Christiane Schomblond. Hyperbolic Kac Moody algebras and Einstein billiards. J. Math. Phys. , 45(12):4464–4492, 2004.
- 6[6] M. J. Dyer and G. I. Lehrer. Root subsystems of loop extensions. Transform. Groups , 16(3):767–781, 2011.
- 7[7] E. B. Dynkin. Semisimple subalgebras of semisimple Lie algebras. In Selected papers of E. B. Dynkin with commentary . American Mathematical Society, Providence, RI; International Press, Cambridge, MA, 2000. Edited by A. A. Yushkevich, G. M. Seitz and A. L. Onishchik.
- 8[8] E. B. Dynkin and A. N. Minchenko. Enhanced dynkin diagrams and Weyl orbits. Transformation Groups , 15(4):813–841, Dec 2010.
