On seaweed subalgebras and meander graphs in type D
Dmitri Panyushev, Oksana Yakimova

TL;DR
This paper extends the meander graph method for computing the index of seaweed subalgebras to type D Lie algebras, addressing complexities introduced by the branching Dynkin diagram.
Contribution
It develops a new approach for type D seaweed subalgebras using meander graphs, expanding previous methods from types A, B, and C.
Findings
New phenomena due to the branching Dynkin diagram
Extension of meander graph approach to type D
Insights into the structure of seaweed subalgebras in type D
Abstract
In 2000, Dergachev and Kirillov introduced subalgebras of "seaweed type" in and computed their index using certain graphs, which we call type- meander graphs. Then the subalgebras of seaweed type, or just "seaweeds", have been defined by Panyushev (2001) for arbitrary reductive Lie algebras. Recently, a meander graph approach to computing the index in types and has been developed by the authors. In this article, we consider the most difficult and interesting case of type . Some new phenomena occurring here are related to the fact that the Dynkin diagram has a branching node.
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.
February 24, 2017
On seaweed subalgebras and meander graphs in type D
Dmitri I. Panyushev
Institute for Information Transmission Problems of the Russian Academy of Sciences, Bolshoi Karetnyi per. 19, Moscow 127051, Russia
and
Oksana S. Yakimova
Institut für Mathematik, Friedrich-Schiller-Universität Jena, D-07737 Jena, Deutschland
Abstract.
In 2000, Dergachev and Kirillov introduced subalgebras of ”seaweed type” in and computed their index using certain graphs, which we call type-A meander graphs. Then the subalgebras of seaweed type, or just ”seaweeds”, have been defined by Panyushev (2001) for arbitrary reductive Lie algebras. Recently, a meander graph approach to computing the index in types B and C has been developed by the authors. In this article, we consider the most difficult and interesting case of type . Some new phenomena occurring here are related to the fact that the Dynkin diagram has a branching node.
2010 Mathematics Subject Classification:
17B08, 17B20
The research of the first author was carried out at the IITP RAS at the expense of the Russian Foundation for Sciences (project N0 14-50-00150). The second author is partially supported by the Graduiertenkolleg GRK 1523 “Quanten- und Gravitationsfelder”.
1. Introduction
A general philosophy of Representation Theory proclaims that the coadjoint action of an algebraic group encodes information on many other actions. An important numerical characterisation of the coadjoint action is the index.
The index of an algebraic Lie algebra , , is the minimal dimension of the stabilisers for the coadjoint representation of . If is reductive, then . Hence the index can be thought of as a generalisation of rank. But for non-reductive Lie algebras, it is often hard to evaluate. In this paper, we elaborate on the meander graph approach to computing the index of the seaweed subalgebras in . As similar method have previously been developed in types A,B, and C [1, 11], our present results complete a meander graph approach to the index of seaweed subalgebras for the classical Lie algebras.
For , the seaweed subalgebras (or just seaweeds) have been introduced by Dergachev and Kirillov [1]. These are subalgebras of specific matrix shape (see Figure 1 below) that resembles seaweeds, hence the term. A general definition suited for arbitrary reductive Lie algebras appears in [9]. Namely, if are parabolic subalgebras such that , then is called a seaweed in . (For this reason, some people began to use later the term ”biparabolic subalgebra” for such .) The seaweed subalgebras form a wide class of Lie algebras which include all parabolics and their Levi subalgebras.
Without loss of generality, one may assume that and are “adapted” to a fixed triangular decomposition of , see Section 2 for details. Then is said to be standard. The standard seaweeds are in a one-to-one correspondence with the pairs of subsets of the set of simple roots of [9]. An inductive procedure for computing the index of standard seaweeds in the classical Lie algebras is presented in [9]. The procedure helps to answer several subtle questions on the coadjoint action [10, 7]. In that procedure, seaweeds naturally appear when one is trying to compute the index of a parabolic subalgebra in type A. In the other classical types, a parabolic cannot be reduced any further and therefore the parabolic subalgebras have to be included into the induction base. In types B and C, any seaweed can be reduced to a parabolic. However, this is not always the case in type D, and this phenomenon was overlooked in [9, Sect. 5]. This is also one of the sources of many difficulties in developing the theory of meander graphs in type D.
In [1], the index of the seaweed subalgebras of has been computed using certain graphs, which are said to be type-A meander graphs. Recently, the authors introduced meander graphs in types C and B, and gave a formula for the index of seaweeds in terms of these graphs [11]. In this paper, we introduce type-D meander graphs and compute the index of the seaweeds in via these graphs, see Theorem 4.1. Unlike the other classical cases, the present situation is more involved, and the reason is that the Dynkin diagram of Dn has a branching node. Thanks to the presence of the branching node, we get two new phenomena. First, there is no natural bijection between the standard parabolics in and the compositions with sum at most (as it happens in and ). Second, there are certain seaweeds in that do not admit a matrix realisation of “seaweed shape”. The definition of a meander graph for them requires a trick, and their meander graphs acquire two arcs crossing each other. This is a completely new phenomenon that does not occur in the other classical types. The corresponding subalgebras are said to be seaweeds with crossing. The seaweeds that cannot be reduced to a parabolic occur only among seaweeds with crossing.
A general algebraic formula for the index of the seaweeds has been proposed in [13, Conj. 4.7] and then proved in [5, Section 8]. An advantage of the meander graph approach is that it allows us to detect new interesting classes of Frobenius seaweeds. Recall that is called Frobenius if . These are curious Lie algebras that gained popularity owing to their connection with the classical Yang-Baxter equation. For more on Frobenius Lie algebras and their rôle in Invariant Theory, see e.g. [8].
Further properties of the coadjoint action have been studied for the seaweed algebras. For instance, articles [6, 7] show that there are many interesting phenomena arising here.
The structure of the article is as follows. In Section 2, we provide generalities on the arbitrary seaweeds and recall known results in types A,B, and C. Section 3 is devoted to the detailed construction of meander graphs for the seaweeds in . Our main result—a formula for in terms of the meander graph —is stated and proved in Section 4. As in [11], our proof heavily relies on the inductive procedure of [9]. In Section 5, we gather some further results concerning generic stabilisers, maximal reductive stabilisers, and Frobenius cases for seaweeds in .
Throughout the paper, the ground field is .
2. Generalities on seaweed subalgebras and meander graphs
We assume that a reductive algebraic Lie algebra is equipped with a fixed triangular decomposition, so that there are two opposite Borel subalgebras and , and a Cartan subalgebra . Let be the set of roots of and the set of simple roots in . If , then is the corresponding root space.
Let and be two parabolic subalgebras of . If , then is called a seaweed subalgebra or just seaweed in (see [9]). The set of seaweeds includes all parabolics (if ), all Levi subalgebras (if and are opposite), and many interesting non-reductive subalgebras. Without loss of generality, we may also assume that (i.e., is standard) and (i.e., is opposite-standard). Then the seaweed is said to be standard, too. Either of these parabolics is determined by a subset of . If is standard, is a standard Levi subalgebra (i.e. ), and is the set of simple roots of , then we write and ; and likewise for . In particular, , , and . Then . Thus, a standard seaweed is determined by two arbitrary subsets , and we set , cf. also [9, Sect. 2]. Clearly, is reductive if and only if , is parabolic if and only if or , and .
Remark 2.1*.*
If , then is contained in the Levi subalgebra . Therefore, does not belong to a proper Levi if and only if .
2.1. Compositions and meander graphs in type A
Let us recall the construction of meander graphs in type A. It is more convenient here to work with in place of . A composition is a finite sequence of positive integers, say . Set and . We say that is a composition of , if .
We work with the obvious triangular decomposition of , where consists of the upper-triangular matrices. If and , then has the consecutive diagonal blocks , , …,, where with , and . Then we write and , where . In particular, and . Note that all and . Likewise, if is similarly represented by the composition with , then and the standard seaweed is denoted by . A sample picture is given in Fig. 1.
The corresponding type-A meander graph is defined by the following rules:
• has consecutive vertices on a horizontal line numbered from up to .
• The parts of determine the set of pairwise disjoint arcs (edges) that are drawn below the horizontal line. Namely, part determines consecutively embedded arcs below the nodes , where the widest arc joins vertices 1 and , the following joins and , etc. If is odd, then the middle vertex acquires no arc at all. Next, part determines embedded arcs below the nodes , etc.
• The arcs corresponding to are drawn by the same rules, but above the horizontal line.
It follows that the degree of each vertex in is at most and each connected component of is homeomorphic to either a circle or a segment. (An isolated vertex is also a segment!) By [1], the index of is determined via as follows:
[TABLE]
Clearly, and the corresponding graphs are also isomorphic. For , we obtain the meander graph for the parabolic ; whereas for , we get the meander graph for the parabolic .
Remark 2.2*.*
Formula (21) gives the index of a seaweed in , not in . However, if is a seaweed, then is a seaweed in and the mapping is a bijection. Here {\mathfrak{q}}=({\mathfrak{q}}\cap{\mathfrak{sl}}_{n})\oplus(\text{1-dim centre of {\mathfrak{gl}}_{n}}), hence . Since and the minimal value ‘1’ is achieved if and only if is a sole segment, we also obtain a characterisation of the Frobenius seaweeds in via meander graphs.
Example 2.3**.**
=
and the index of the corresponding seaweed in (resp. ) equals (resp. ).
2.2. Compositions and meander graphs in types B and C
For or , any standard parabolic has the standard Levi in the block-diagonal form, in the appropriate matrix realisation of . This associates a certain composition with to , and this correspondence appears to be a bijection.
The idea that works fine for is that, for a standard parabolic , one considers the “symmetric” composition of and the “symmetric” parabolic in . Then and likewise for the opposite-standard parabolics. The type-C meander graph of the seaweed is defined via the type-A meander graph of . Namely, letting , we obtain a graph with vertices, which is symmetric w.r.t. the middle. The symmetry w.r.t. the middle is denoted by . Then
[TABLE]
see [11, Theorem 3.2] for the details. With minor adjustments, this works for , too.
Because our type-B explanations in [11] are rather sketchy, we provide an intrinsic construction of the type-B meander graphs. (This is going to be helpful for our next exposition in type D, where some difficulties occur.) We think of as the set of skew-symmetric matrices w.r.t. the antidiagonal. The triangular decomposition of is induced by that of , and we deal with the usual numbering of simple roots, so that for and . If , then the consecutive diagonal blocks of the standard Levi are
, ,…, , , and then the same -blocks in the reverse order.
Here (and below) the words ”the same -blocks” refer not only to the size, but also to the fact that the resulting matrices must be skew-symmetric w.r.t. the antidiagonal.
The associated composition is with , and we also write for . If and , then the associated composition is empty, with sum [math]. This yields a bijection between the standard parabolics and the compositions with sum at most . Consequently, any standard seaweed in has a symmetric (w.r.t. the antidiagonal) “seaweed shape” and can be identified with a pair of compositions. (See Fig. 2, where and .)
To define the type-B meander graphs, we use the embedding . For a standard parabolic , consider the “symmetric” composition of and the “symmetric” parabolic in . Then and likewise for the opposite-standard parabolics. The type-B meander graph of the seaweed is defined via the type-A meander graph of . Namely, letting , we obtain a graph with vertices, which is symmetric w.r.t. the middle. Then Eq. (22) remains true in type B, with the same proof. Since the middle part of the symmetric composition is odd, the middle vertex remains isolated in for all seaweeds in . It is also a -stable segment, which is not counted in the B-analogue of Eq. (22). Therefore, this middle vertex can safely be removed from the type-B meander graphs, which yields exactly the same graphs as in type C. Thus, we arrive at conclusion (1) made in p. 498 in [11]. But this time we see the reason behind it.
However, there is neither such a uniform bijection nor a simple construction of meander graphs in type D, and the reason is that the Dynkin diagram has a branching node.
3. Compositions and meander graphs in type D
We think of as the set of skew-symmetric matrices w.r.t. the antidiagonal. Since , , and , we may assume that . However, these small rank cases may appear in our future reduction procedure. The triangular decomposition of is induced by that of . In particular,
{\mathfrak{b}}={\mathfrak{so}}_{2n}\cap\{\text{the upper-triangular matrices in {\mathfrak{gl}}_{2n}}\}
is the fixed Borel subalgebra of and . Then for , and .
3.1. Parabolic subalgebras and compositions
The first trouble is that if or with and , then does not have a block diagonal matrix form, see Fig. 3. Here one can swap and , which provides an ”admissible” subset of and an isomorphic parabolic. This swapping can be understood as changing the matrix realisation of . But this does not always help in case of seaweeds, i.e., pairs of parabolics. If is such that and , then swapping changes nothing and does not have a “seaweed shape”, as in Fig. 2. This phenomenon was overlooked in [9]. To realise other possible difficulties, let us consider in more details the interrelation between standard parabolics of and compositions.
Proposition 3.1**.**
Let be a standard parabolic. Then
(1)* does not have a block triangular form if and only if and .*
(2)* In all other cases, using the block triangular form, one naturally associates to a composition with and . More precisely,
(i) if , then ;
(ii) if , then .*
Proof.
(1) Obvious. E.g. see Fig. 3 for .
(2i) If , then with and the consecutive diagonal blocks of are , ,…, , , and then the same -blocks in the reverse order. Then and hence .
(2ii) If , then with . Here the consecutive diagonal blocks of are , ,…, , , and then the same -blocks in the reverse order. Then with . ∎
Example 3.2**.**
(i) For the fixed Borel , Proposition 3.1 yields ;
(ii) if , then ;
(iii) corresponds to the empty composition ‘’ with sum [math].
Definition 1**.**
A subset and the parabolics are said to be admissible, if 3.1(1) does not hold, i.e., either or .
By Proposition 3.1, to any standard (or opposite standard) admissible parabolic in one naturally associates the composition with and . There is a sort of inverse procedure that associates a standard admissible parabolic in to any composition with . Given , we define the “symmetric” composition of by , where . Let be the standard “symmetric” parabolic in . Then we associate to the admissible parabolic . The standard Levi in has the consecutive diagonal blocks , ,…, , , and then the same –blocks in the reverse order. Hence, for , we get the inverse map to one constructed in Proposition 3.1(ii).
Remark 3.3*.*
Since , the compositions with and determine one and the same parabolic in . For, appearing as the middle block of is also the last contained in . That is, some admissible give rise to two standard symmetric parabolics in such that . More precisely, this happens if and only if neither nor belongs to .
For this reason, we exclude the compositions of from the further consideration.
Definition 2**.**
Let us say that is a seaweed with crossing (= has a crossing), if and (or vice versa). In the other cases, is said to be a seaweed without crossing (= has no crossing).
The full meaning of these terms will be clarified below when we introduce the meander graphs for seaweeds with or without crossing.
3.2. Seaweeds without crossing, compositions, and meander graphs
Proposition 3.4**.**
*Suppose that has no crossing.
(i) Then, up to permutation of and , we may assume that both and are admissible and , . In particular, has a “seaweed shape”.
(ii) If , then we may assume that and .
(iii) If or does not belong to , then lies in a Levi isomorphic to . Here is given by two compositions with .*
Proof.
(i) If at least one of the subsets is not admissible, then swapping and makes both of them admissible, since has no crossing. Then and can independently be constructed as in Prop. 3.1.
(ii) Since has no crossing, we may assume w.l.o.g. that , hence and . Here with and , see Prop. 3.1(2i). Then there are three possibilities for :
(1) If , then we construct the composition for by the same rule. Here as well.
(2) If , then with . Here the corresponding composition is with , see Prop. 3.1(2ii).
(3) If and , then is not admissible. But there is no harm in swapping and . This does not change and yields an isomorphic seaweed, as in (2).
(iii) Regarding as subsets of the set of simple roots of or , we construct the required compositions of as explained in Section 2.1. ∎
A seaweed without crossing is also denoted by , where and are the associated compositions (constructed in Proposition 3.4) such that and . Given and , we form the symmetric compositions and of , as above. Let and be the corresponding standard ”symmetric” parabolics in , the standard seaweed in , and the corresponding type-A meander graph.
Definition 3**.**
Let be a seaweed without crossing. If and are the associated compositions, then the type-D meander graph of is
[TABLE]
We also write for this graph. (Note that and .)
Remark 3.5*.*
Because different arcs in the type-A meander graphs do not cross each other, the same holds for the type-D meander graph of a seaweed without crossing.
Example 3.6**.**
Suppose that , , and . Then , where . Here consists of two disjoint halves that are symmetric w.r.t. the middle. The first (resp. second) half represents the meander graph of the seaweed (resp. ) in . For instance, if , and , then , and the meander graph for is depicted in Fig. 4.
Example 3.7**.**
By Proposition 3.4, the associated compositions for the Borel are and . Here and . Therefore, has embedded arcs over the horizontal line and no arcs below the horizontal line, see Fig. 5 with .
The type-D meander graphs are symmetric w.r.t. the vertical line between the -th and -th vertices (this holds for the seaweeds with or without crossing). The symmetry w.r.t. this line is denoted by and this line is said to be the -mirror. This line is depicted by the dotted line in the figures.
3.3. Seaweeds with crossing and their meander graphs
Quite a different situation occurs if has a crossing. The three steps of our definition/construction of are:
-
If has a crossing and is not admissible, then is replaced with , so that has no crossing.
-
Following Definition 3, we construct the meander graph .
-
We make a certain alteration in , and the resulting graph is defined to be the meander graph of .
For 1): Let be a seaweed with crossing and , . The admissible subset gives rise to a composition , see Proposition 3.1. As is not admissible, we replace with in it. This yields an admissible subset and the corresponding composition . (We do not change !) The structure of and shows that , , and , cf. the proof of Proposition 3.1(2ii). Note that , hence lies in the Levi .
For 2): Since has no crossing, we obtain the meander graph . It consists of two symmetric copies of the type-A meander graphs for seaweeds in (cf. Example 3.6 and Fig. 4). Recall that the arcs below (resp. over) the horizontal line are determined by a symmetric composition of , which in our case is (resp. ). But this is not yet. As has been changed, we have to reflect this in the graph.
For 3): If , then we modify two largest arcs below the horizontal line that correspond to the two parts in the middle of . That is, the arc from will go not to , but to ; and the arc from goes now to in place of . If , then the same procedure applies to the both parts and two arcs over the horizontal line. If , then either of the sides is suitable for alteration, because the two resulting graphs are isomorphic. This alteration yields two arcs crossing each other, which explains the term ”crossing”. A sample case is depicted below, where and we do not draw the other arcs, over or below the horizontal line.
The graph obtained is the desired type-D meander graph of a seaweed with crossing. Our construction justifies the notation for seaweeds with crossing. In this case, we also write .
Remarks. (1) The above alteration shouldn’t be regarded as the permutation of vertices and , because the arcs on the other side of the horizontal line are not affected!
(2) The rule is that two arcs crossing each other are related to the smaller part among . We then say that crossing is on the correct side of the meander graph. Otherwise, the crossing is on the wrong side. If , then alteration can be made on any side, i.e., both sides are correct. Although, we initially consider the graphs with crossing on the correct side, it can happen that after some reduction steps we obtain a graph with crossing on the wrong side. In that case, we will need further adjustments, see Section 4.
(3) For seaweeds without crossing, the sum of the compositions and is not fixed. Therefore, we always put the index in the notation for . While for the seaweeds with crossing, the sum is always . Hence the notation is unambiguous.
As a by-product of the definition, we have the following observation:
*If has a crossing, then there are exactly two arcs that cross each other in . These two arcs are also the only arcs crossing the -mirror. *
The connected components of through these two arcs are said to be strange. It is easily seen that either these two arcs lie in the same connected component, which is a ”strange” cycle, or they lie in two different (”strange”) segments and permutes these segments.
Example 3.8**.**
The basic and most essential example of a seaweed with crossing is .
Here and the resulting meander graph for is depicted in Fig. 6.
The graph has a unique strange connected component (cycle).
Remark 3.9*.*
Given or , suppose that for some or . Then and consists of three disjoint graphs. The central graph represents a seaweed in and two extreme symmetric graphs represent seaweeds in . More precisely, if , , , and , then the central graph is either or ; and two other graphs are and , see Fig. 7.
If , then the central graph disappears, cf. Example 3.6.
4. The index of seaweeds via type-D meander graphs
By our constructions in Sections 3.2 and 3.3, each connected component of a type-D meander graph is homeomorphic to either a cycle or segment. An isolated vertex is regarded as a segment. For instance, there are two segments and three cycles in Fig. 6. The arcs crossing the -mirror are said to be central. Our main result is the following formula for the index of a standard seaweed in terms of the connected components of .
Theorem 4.1**.**
Let be a standard seaweed and the corresponding type-D meander graph. Then
[TABLE]
where is determined by the following rules.
Suppose that has no crossing, , and . Let and be the number of central arcs below and above the horizontal line, respectively. Assuming that , we set
- –
* if is even;*
- –
* if is odd, , and the arc between and belongs to a segment;*
- –
* in the remaining cases (with odd).*
If has a crossing, then there are two possibilities:
- –
if has a unique strange component (cycle), then ;
- –
if there are two strange segments (= the segments crossing the -mirror), then .
Example 4.2**.**
-
The first possibility in realises for , see Fig. 6 for . Hence . The second possibility occurs for with and . Then , , and , see Fig. 8. Here has two strange segments. Therefore, and .
-
For (Fig. 4), we have and .
-
We have for (Fig. 5). Hence .
In our proof of Theorem 4.1, we use the inductive procedure of [9]. That procedure allows us to reduce computation of the index of arbitrary seaweeds to the case of either a parabolic subalgebra in or the seaweed with crossing for some (see below). For this reason, we begin with the case of parabolics and seaweeds . In dealing with the parabolics, the general Tauvel–Yu–Joseph formula (= TYJ formula) for the index of a seaweed is required. Let be the cascade of strongly orthogonal roots (= Kostant’s cascade) in the Levi subalgebra , see [4, 13] for the details. In particular, is the cascade in the whole of . Let be the linear span of in . Then and the TYJ formula reads:
[TABLE]
see [13, Conj. 4.7] and [5, Section 8]. Clearly, . For future use, we record the data on the cascade in and . For , we have
[TABLE]
For , we have if . Therefore,
[TABLE]
Lemma 4.3**.**
Formula (41) holds for all parabolic subalgebras and the seaweed in .
Proof.
- Using the explicit matrix model of , we notice that it is isomorphic to the semi-direct product , where and are standard dual -modules and the weights of the -dim centre of on and are linearly independent, see the picture.
\mathfrak{gl}_{n-1}$$\mathfrak{gl}_{1}$$(\mathbb{C}^{n-1})^{*}$$\mathbb{C}^{n-1}
Applying the Raïs formula for the index of semi-direct products [12], we then obtain . On the other hand,
– if is even, then consists of cycles;
– if is odd, then consists of cycles and two isolated points (segments), which are not -stable.
According to , here , which yields the value in Eq. (41) in both cases.
Thus, Raïs’ formula and (41) give one and the same value for .
- Let be a standard parabolic, that is, . W.l.o.g., we may assume that is admissible and then take the associated compositions and . Set and , where . It is easily seen that
k(\underline{a})=\#\{\text{the cycles of }\ \Gamma\}+\frac{1}{2}{\cdot}\#\{\text{the non-\sigma\Gamma}\} .
Therefore, Theorem 4.1 gives the value for . (Actually, all segments of are -stable, so equals just the number of cycles.) To apply the TYJ formula (42), one has to distinguish even and odd . Since , Formulae (43) and (44) show that the value of depends on the parity of as well. Namely,
[TABLE]
Suppose that is even. Here Formulae (42) and (44) give us that .
• If is even, then . On the other hand, , , and is even; hence .
• If is odd, then . On the other hand, is even, , and is odd; hence .
Thus, both Theorem 4.1 and Eq. (42) give the same value for .
Suppose that is odd. We first mention the case of and , since it may occur as a step in our future reduction procedure. Then and by Definition 3, the meander graph of is . For this graph, Theorem 4.1 also gives value .
Until the end of the proof, we assume that is odd. Then is a subspace of of codimension . More precisely, . Therefore, if and only if contains a root of the form for some . This is determined by the “last” factor of , which us either (if ) or . Then an easy analysis shows that
[TABLE]
There are three possibilities now, and each time we compare the values given by Eq. (41) and the TYJ formula.
• If , then the TYJ formula gives
.
On the other hand, is odd and is even. It is also easily seen that in both cases ( or and ), the arc between vertices and belongs to a cycle. Therefore, .
• If and , then and the TYJ formula gives
.
On the other hand, is odd and . The condition that also implies that the arc between vertices and belongs to a segment. Therefore, .
• If is odd, then still and, taking into account Eq. (45), the TYJ formula gives
.
On the other hand, both and are odd. Hence .
Thus, it is verified in all cases that . ∎
Remark 4.4*.*
Explicit formulae for the index of the parabolic subalgebras of are obtained in [2, Section 4]. They could have been used in place of the TYJ formula in the proof of Lemma 4.3.
Let us recall the inductive procedure for computing the index of seaweeds in the classical Lie algebras introduced by the first author [9]. The aim of that procedure is to reduce computation of the index of arbitrary seaweeds to parabolic subalgebras. It is a good time to confess that there is a gap concerning the case of in [9, Sect. 5]. Not any seaweed in can be reduced to a parabolic. Strictly speaking, because seaweeds with crossing are not considered in [9], the applicability of the inductive procedure to them is questionable. However, as we shortly see, the procedure can be adjusted so that it works unless is parabolic or . That is, the correct statement is that any standard seaweed in can be reduced to either a parabolic or for some .
Suppose that and are two compositions with , , , and . Consider the standard seaweed without crossing .
Inductive procedure:
Step 1. If either or is empty, then is a parabolic, and there is no reduction.
Step 2. Suppose that both and are non-empty. By [9, Theorem 5.2], can recursively be computed as follows:
(i) If , then , hence
.
(ii) If , then , where is defined as follows. If , then
[TABLE]
and likewise, if .
(iii) This step terminates if one of the compositions becomes empty, i.e., we obtain a parabolic subalgebra in a smaller orthogonal Lie algebra .
This procedure works also for types A,B,C. In particular, if (and hence ), then the similar steps and formulae apply, see [9, Theorem 4.2].
Remark 4.5*.*
The formulae of Step 2 preserve the differences and . For instance, if , then n-|\underline{a}|=(n-b_{1}+a_{1})-\bigl{(}(2a_{1}-b_{1})+\sum_{j=2}^{s}a_{j}\bigr{)}. This means that the forbidden (excluded) compositions cannot occur after a reduction step, i.e., the inductive procedure is well-defined. (Recall that we exclude the compositions such that .)
Let us explain how this procedure works if has a crossing and, say, is not admissible. By Section 3.3, we associate two compositions of with , and , such that . We may as well assume that . The presence of crossing is expressed via the modification of the largest arcs associated with part in . In the situation of Step 2(i), where , we have . The formulae of Step 2(ii) reflect certain invariant-theoretic manipulations with that affect only the upper-left block , where , see [9]. Actually, is the stabiliser of a suitable . The description of is independent of the parts . Therefore, as long as the part of a seaweed with crossing is not involved in the reduction, we can pass to with . Mostly would be a seaweed with crossing defined by Eq. (47) with the subscript ‘c’ in the RHS. But there are some exceptional cases, and this is to be clarified in the proof of Theorem 4.1.
Remark 4.6*.*
The procedure can be thought of as one that applies to the triples , where and , and thereby to the corresponding type-D seaweeds and meander graphs. For instance, the first equality in (47) means that we replace with , if . Accordingly, is replaced with . An important feature is that Step 2(ii) may (and will) be understood in the graph setting as the contraction of certain arcs in related to the parts , see [7, Lemma 5.4(i)]. Since is symmetric w.r.t. the -mirror, these contractions are performed simultaneously on the both ends of it. The pictures below demonstrate the effect of contractions in the left hand end of the meander graph .
The case in which :
\mathbf{\dots\dots\quad\dots\dots\quad\dots\dots\dots}$$a_{1}$$b_{1}-2a_{1}$$b_{1}$$\mathbf{\dots\quad\dots\quad\dots\quad\dots\quad\dots}$$b_{1}-2a_{1}$$a_{1}$$\mapsto
The case in which :
\mathbf{\dots\quad\dots}$$a_{1}$$b_{1}$$2a_{1}{-}b_{1}$$a_{1}$$\mathbf{\ \dots\quad\dots}$$\mapsto
In each case, we contract the orange arcs to the right end points, and the whole configuration including the grey arcs meeting the first nodes is rotated clockwise through the angle 180 degrees about the middle point of the first vertices. We do not draw the vertices after and the arcs related to the parts , etc., because the corresponding fragments of the meander graph remain intact.
A subtle point is that after a certain contraction applied to a graph with crossing, one can obtain a graph with crossing on the wrong side. It will be explained below how to handle this situation.
We say that a seaweed reduces to zero if after some inductive step we obtain . (This happens if and only if at the previous stage one has , and Step 2(i) applies.) The corresponding meander graph is empty.
Proof of Theorem 4.1.
We use the above inductive procedure, which is understood as a procedure applied simultaneously to seaweeds and their meander graphs, see Remark 4.6. Given a seaweed , consider its type-D meander graph and set
[TABLE]
Let us prove that and behave accordingly for Steps 2(i) and 2(ii).
If , then , where , and . On the other hand, is obtained from by deleting cycles (and two segments, which are not -invariant, if is odd). Therefore and also .
If , then . Basically, Step 2(ii) in type D (also for the seaweeds with crossing) consists of two “symmetric” type-A reductions applied simultaneously to the both ends of . On the graph level, this step is interpreted as contraction of certain non-central edges, cf. the above pictures. Therefore, this does not change the topological structure of the graph and the number of central edges. Hence and also has the same value for and .
• If has no crossing, then the procedure is being repeated until we end up with a parabolic subalgebra. This settles the problem for the seaweeds without crossing.
• Suppose now that has a crossing and with and , as explained in Section 3.3. Recall that then and .
Suppose that and hence the crossing is below the horizontal line. Then one can apply Step 2 as long as the second composition has at least two parts. This eventually kills all the parts with and provides the situation, where . So, let us assume that , and , as above. If , then , and the reduction terminates. If , then one can still apply Step 2(ii) to . This replaces with another second composition . By (47), we have \underline{b}^{\prime}=\left\{\begin{array}[]{cl}(a_{1}),&\text{if }\ a_{1}\geqslant n/2\\ (n-2a_{1},a_{1}),&\text{if }\ a_{1}\leqslant n/2\end{array}\right.. That is, the last part of is always , while the last part of the new first composition is always . If , then the corresponding contraction yields the graph with crossing on the correct side. Then we continue the procedure with . If , then and the passage
[TABLE]
suggests that we should have obtained a meander graph with crossing above the horizontal line. But the contraction of edges in yields a graph with crossing below the horizontal line, as it was; i.e., crossing is now on the wrong side!
To remedy this, we permute two central vertices in , which merely corresponds to the permutation of two basis vectors in the space of the standard representation of . This does not change the topological structure of and provides the meander graph, , of . There are two possibilities, though. If still has a crossing (already on the correct side!), then we resume the procedure. The alternative possibility is that the crossing vanishes. This can only happen if we had two strange components (segments). More precisely, this happens if and only if the last part of , i.e. , is equal to , cf. Example 4.8. In both cases, the value of does not change. (In the second case, we have before and after the permutation.)
Thus, either the crossing vanishes at some stage and the seaweed eventually reduces to zero, or the reduction terminates with and , i.e., .
Since Eq. (41) is already verified for the parabolic subalgebras and all by Lemma 4.3, the result follows. ∎
Remark 4.7*.*
The last part of the proof of Theorem 4.1 shows that there are two alternatives for the inductive procedure applied to the seaweeds with crossing. Either has one strange component (cycle), and then it reduces to some ; or has two strange components (segments), and then the crossing eventually vanishes and reduces to zero.
Example 4.8**.**
Let us apply the inductive procedure to the seaweed , see Fig. 8. The chain of seaweeds and reduction steps is
[TABLE]
That is, this seaweed reduces to zero. The second step gives us the graph with crossing on the wrong side. Therefore, the next step marked with the asterisk is the permutation of vertices and (with ), which results in disappearance of crossing. The corresponding chain of meander graphs is depicted in Fig. 9. The edge(s) that are going to be contracted on the next step are depicted in orange.
For all graphs here, one has .
5. Miscellaneous remarks and applications
5.1. Generic stabilisers
Given a Lie algebra , write for a generic stabiliser of the coadjoint representation , if it exists. For any seaweed in types A and C, a generic stabiliser exists; moreover, it is a torus, see [10]. For all other simple Lie algebras, there are parabolic subalgebras such that the coadjoint representation has no generic stabilisers, see [14, 3.2] for and [10, Section 6] in general.
It is shown in [10] that the inductive procedure of Section 4 can be used for computing a generic stabiliser and proving its existence. In Step 2(i), for a generic , we have , where is a maximal torus in and is the restriction of to . Therefore, if is a generic stabiliser for , then is a generic stabiliser for . In Step 2(ii), the situation is even better. If has a generic stabiliser, say , then is a generic stabiliser for , too.
In type D, a seaweed without crossing reduces to a parabolic subalgebra . Hence exists and is a torus if and only if exists and is a torus. The parabolic subalgebras such that is reductive (and therefore is a torus) are classified in [3, Théorème 29], cf. also [7, Lemma 2.3 & Def. 5.7].
For , a generic stabiliser for the coadjoint action is a torus of dimension . And a seaweed with crossing having two strange components reduces to zero as can be seen from the proof of Theorem 4.1. Thus, we happily arrive at the following conclusion.
Proposition 5.1**.**
A seaweed with crossing possesses a non-empty open subset such that is a torus for each and all these stabilisers are conjugate by elements of the connected group , i.e., .
5.2. Strongly quasi-reductive seaweeds
Following [7], a Lie algebra is said to be strongly quasi-reductive if there is a such that is reductive. A more general notion of quasi-reductive Lie algebras is considered in [3]. However, these two coincide for the seaweed subalgebras, since the centre of any consists of semisimple elements.
By [3, Théorème 9], if is strongly quasi-reductive, then there is a reductive stabiliser (with ) such that, up to conjugation, any other reductive stabiliser (with ) is contained in . In [7], such a group is called a maximal reductive stabiliser of , MRS for short. For a seaweed , an MRS of can be described in terms of [7, Theorem 5.3]. In particular, an MRS of is isomorphic to if and only if is a single cycle.
For any seaweed with crossing, there is such that is a torus (Proposition 5.1). Therefore, the seaweeds with crossing are strongly quasi-reductive. All seaweeds in type A or C are also strongly quasi-reductive for the same reason, is a torus [10].
5.3. Frobenius seaweeds in type D
A Lie algebra is said to be Frobenius if . Such Lie algebras are quite popular nowadays. Frobenius seaweeds in type are rather mysterious. Even the asymptotic behaviour of their distribution remains unknown. Partial results on the Frobenius seaweeds in type C are obtained in [11]. Let us see what happens in type D.
Proposition 5.2**.**
*Let be a seaweed with crossing. If has two strange components, then cannot be Frobenius. If has one strange component and , then is a single cycle and is even. Moreover, there is a bijection between the standard Frobenius seaweeds with crossing (up to the transposition ) and the standard seaweeds such that an *MRS of is .
Proof.
If has a crossing and has two strange connected components, then and there are at least two segments that are not -stable. Therefore regardless of the parity of .
Suppose that , the strange component of is a cycle, and . The meander graph of a seaweed with crossing has no -stable segments (Section 3.3). Therefore, by Eq. (41), this strange cycle must be the only component of . It is then easily seen that has the property that is a single cycle and therefore an MRS of is isomorphic to . If we invoke the “three step” construction of in Section 3.3, then represents the left hand side half of the graph obtained in Step 2). Conversely, if and are two compositions of such that is a single cycle, then so is (for ). See a sample in Figure 10 below. It remains to observe that if is a single cycle, then is necessarily even. ∎
Example 5.3**.**
Let with , . Then , and is a single strange cycle. Hence . To illustrate the bijection of Proposition 5.2, we also draw the graph in Figure 10.
Example 5.4**.**
The Lie algebra has three different non-equivalent matrix realisations (-dimensional representations) corresponding to the fundamental weights , and . Therefore, each seaweed acquires three (usually different) meander graphs. Yet, (41) gives the same value for all possible graphs.
Consider with and . Then
• for the realisation associated with , has a crossing; more precisely, ;
• for , there is no crossing and ;
• for , one obtains .
The corresponding meander graphs are presented in Fig. 11.
One readily verifies that Theorem 4.1 yields for all three graphs.
Proposition 5.5**.**
*Let be a standard seaweed without crossing.
(i) If is Frobenius, then .
(ii) There is a bijection between the standard Frobenius seaweeds such that and the standard Frobenius seaweeds in having an even number of central arcs.
(iii) If , then is Frobenius if and only if has an odd number of central arcs, all of which are on one and the same side of the horizontal line, exactly one cycle going through the vertices and , and no segments that are not -stable.*
Proof.
(i) If is Frobenius, then Eq. (41) shows that is not allowed.
(ii) If and , then has no cycles, all its segments are -stable, and is even, see Eq. (41). Assume that . If , then has a cycle, a contradiction! Hence and is even. The graph can also be regarded as the type-C meander graph of a seaweed , and if and only if , cf. Theorem 4.1 and [11, Theorem 3.2].
(iii) If and , then is odd and has either a single cycle or two non -stable segments. Assume that . If , then contains at least two cycles and , a contradiction! If , then , which is not allowed, see Remark 3.3. Hence and is odd. Since , the central arc between the vertices and belongs to a cycle, which is the unique cycle in . Hence all the segments must be -stable. It remains to observe that this argument can be reversed. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] V. Dergachev and A.A. Kirillov . Index of Lie algebras of seaweed type, J. Lie Theory , 10 (2000), 331–343.
- 2[2] A. Dvorsky . Index of parabolic and seaweed subalgebras of 𝔰 𝔬 n 𝔰 subscript 𝔬 𝑛 {\mathfrak{so}}_{n} , Linear Algebra Appl. , 374 (2003), 127–142.
- 3[3] M. Duflo, M. Khalgui , and P. Torasso . Algèbres de Lie quasi-réductives, Transform. Groups , 17 (2012), no. 2, 417–470.
- 4[4] A. Joseph . A preparation theorem for the prime spectrum of a semisimple Lie algebra. J. Algebra , 48 (1977), no. 2, 241–289.
- 5[5] A. Joseph . On semi-invariants and index for biparabolic (seaweed) algebras, I, J. Algebra , 305 (2006), 487–515.
- 6[6] A. Joseph . On semi-invariants and index for biparabolic (seaweed) algebras, II, J. Algebra , 312 (2007), 158–193.
- 7[7] A. Moreau and O. Yakimova . Coadjoint orbits of reductive type of parabolic and seaweed Lie subalgebras, Int. Math. Res. Notices , 2012, no. 19, 4475–4519.
- 8[8] A.I. Ooms . Computing invariants and semi-invariants by means of Frobenius Lie algebras, J. Algebra , 321 (2009), 1293–1312.
