
TL;DR
This paper investigates the structure of enveloping semigroups of simple groups, characterizing certain submonoids, introducing the concept of a navel, and analyzing orbit counts in type A.
Contribution
It provides a detailed structural analysis of enveloping semigroups, introduces the navel concept, and derives orbit generating series for type A groups.
Findings
All J-coirreducible connected stabilizer submonoids are classified.
The navel of a reductive monoid is defined and studied.
The generating series for G×G-orbits in type A is derived.
Abstract
The local structures of enveloping semigroups of simple groups are investigated. All J-coirreducible connected stabilizer submonoids are determined. The notion of a navel of a reductive monoid is introduced. The cross-section lattice of the enveloping monoid is shown to be atomic. In type A, the generating series for the number of -orbits is found.
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.
Remarks on Enveloping Semigroups
Mahir Bilen Can
(November 16, 2019)
Abstract
The local structures of enveloping semigroups of simple groups are investigated. All J-coirreducible connected stabilizer submonoids are determined. The notion of a navel of a reductive monoid is introduced. The cross-section lattice of the enveloping monoid is shown to be atomic. In type A, the generating series for the number of -orbits is found.
**Keywords: Enveloping semigroups, asymptotic semigroups, J-coirreducible monoids, navel
MSC: 20M32, 14M27, 06A06**
1 Introduction
The purpose of our paper is to analyze the local submonoids of enveloping semigroups. More precisely, we investigate submonoids of the form and , where is an enveloping semigroup, is an idempotent, and is the connected component of the identity of the stabilizer subgroup of in the unit group of . Let denote monoid , which we call the connected stabilizer of in . We will characterize all idempotents for which has the property that is a connected algebraic semigroup. To explain our results in more detail, and to motivate our discussion, we will introduce the enveloping semigroups in the historical order of their discovery.
Let be a reductive monoid with the group of invertible elements defined over an algebraically closed field . Since is a connected reductive group, let us write it in the form , where is the derived subgroup of , is the connected center of , and is the center of . This data gives us an affine quotient morphism , where . The quotient is called the abelianization of , and it is a -equivariant embedding of .
Let denote the set of reductive monoids such that
the derived subgroup of is , 2. 2.
is flat with reduced and irreducible fibers.
Then, according to Vinberg [15], there is a unique normal reductive monoid with zero, denoted by , in such that
the unit-group of is , where is a maximal torus in ;
- -
there is an isomorphism , where ;
- -
every in is a fiber product of the form .
This remarkable semigroup, , is called the enveloping semigroup of . In a related work [14], Vinberg showed also that the preimage , denoted by , is equal to the horospherical contraction of as a -variety. Following Vinberg’s terminology, we will call the asymptotic semigroup of .
The results of Vinberg in [15, 14], which were originally obtained over an algebraically closed field of characteristic zero, are shown to hold true in positive characteristic by Rittatore in [12, 13]. Rittatore’s approach, which uses the theory of spherical varieties, has been further generalized by Alexeev and Brion in [1] to a class of spherical varieties that they called the “reductive varieties”. Since these objects are beyond the scope of our work, we will not discuss them; however, we anticipate extensions of some our results in their setting. To explain our progress, and to put our work in the right perspective, first, we will briefly mention some observations due to Renner.
In his memoir [11], Renner translated the aforementioned results of Vinberg and Rittatore to the language of idempotents. In particular, in the proof of [11, Theorem 6.18], which is about the “type-map” for enveloping semigroups, Renner introduced certain J-coirreducible monoids (the precise definition of the type map will be given in the sequel). One of these monoids fills the gap of the asymptotic semigroup, while the others entertain similar roles for the “degenerate asymptotic semigroups.” Here, by the filling the gap, we mean the adjoining of the group to so that becomes a normal semisimple monoid. Such an enlargement of was already shown by Vinberg [14] by an algebraic method, while Renner’s approach is more geometric, which we will explain next. Let denote the Coxeter system, where is the Weyl group of . Let denote , and let denote the unit group of . Then for each nonempty subset , there is a convergent one-parameter subgroup such that the limit is an idempotent in . Let us define . In this notation, the following statements are observed by Renner in [11]:
- (1)
is a J-coirreducible monoid, that is to say, is a connected algebraic semigroup; 2. (2)
the “cross-section lattice” of is covered by the cross-section lattices of ’s,
[TABLE]
Here, by a cross-section lattice we mean a finite set of idempotents parametrizing the double-cosets of the unit group of the monoid. 3. (3)
If , then .
In summary, once a cross-section lattice for is fixed, one finds J-coirreducible monoids which compartmentalize the idempotents of in such a way that one of the J-coirreducible monoids is equal to the asymptotic semigroup of .
We are now ready to give an overview of our paper while describing its main results. In Section 2, we review some fundamental results on the reductive monoids which we will use in the sequel. Starting from Section 3, we will focus on the enveloping semigroups , where is a semisimple algebraic group such that the derived subgroup is a simple algebraic group. The advantage of this restriction is that the Coxeter-Dynkin diagram of is connected. Let denote the minimal nonzero elements of the cross-section lattice of . In the first main result of the paper, we characterize the reductive monoids and (). We show that exactly of ’s with are -stable. Furthermore, we show that such monoids are one dimensional, hence we obtain a description of the -stable curves in . We determine the unit groups of for . In Section 4, we focus on the local monoids and where the rank of is . In particular, we characterize for which the corresponding connected stabilizer monoid is J-coirreducible. In addition, if is one of the types , or , then we characterize the “J-linear” connected stabilizer monoids (Theorem 4.4). Here, by a J-linear monoid we refer to a reductive monoid such that has a unique minimal and a unique maximal element. In Theorem 4.6, we determine the (unit) groups , and provided that is a maximal dimensional J-coirreducible monoid. It turns out that for such connected stabilizers, . The purpose of Section 5 is to show that, for , there is always a unique idempotent in such that both of the local monoids and are affine torus embeddings in . Having such an idempotent is a rare phenomenon. We prove that in a J-coirreducible monoid of “type ” an idempotent has the property that is a torus embedding if and only if . In the same section, we prove a similar result for the reductive monoids whose cross-section lattices have unique nonzero elements. The purpose of Section 6 is to show that the cross-section lattice of is generated by its rank 1 elements. Equivalently (and more precisely), we show that is an atomic lattice. In Section 7, we present a combinatorial result, Theorem 7.8, which gives a count of the number -orbits in the enveloping semigroup . More precisely, it states that the generating series of the number , of -orbits in the enveloping monoid of is given by
[TABLE]
Before we finish our introduction, we want to mention a related work of ours. In [2], we investigate the nilpotent varieties and various partial orders on the asymptotic semigroups. In particular, we show that the nilpotent variety of is an equidimensional variety, and we determine its Putcha poset. We anticipate that some of our results from [2] will have natural extensions to all J-coirreducible monoids. Also, by using the results of [16, 6], and [4], we can extend all results of this paper (and most of the results of [2]) to the setting of the reductive monoid -schemes, where is any perfect field. We plan to come back to this generalization in a future paper.
Acknowledgements. We are grateful to the referees for their comments which improved the quality of our paper. In an earlier version of this article, we claimed that an enveloping semigroup is rationally smooth if and only if is of type A. A referee pointed to us that, even in type A, cannot be rationally smooth. We are thankful to the referee for the precise explanation, which has led us to look closer at the local structure of the enveloping monoids. We thank Lex Renner for his guidance and help, not just for this project. Finally, we acknowledge that this research was partially supported by a grant from the Louisiana Board of Regents.
2 Preliminaries
In this article, we will focus on affine algebraic monoids defined over an algebraically closed field. We will follow the common terminology as set forward in the textbooks [9] and [11]. In particular, we fix the following notation:
[TABLE]
For the convenience of the reader, we will review the definitions of some of these objects. First of all, the order on is defined by
[TABLE]
The induced poset structure on , which is induced from is the same as the well known Bruhat-Chevalley poset structure on . There is a canonical partial order on the set of idempotents of (hence, on the set of idempotents of ) defined by
[TABLE]
The set of idempotents of is invariant under the conjugation action of . A subset is called a cross-section lattice if is a set of representatives for the -orbits on and the bijection defined by is order preserving.
The right centralizer of in , denoted by , is the subgroup
[TABLE]
Assuming that has a zero, for all Borel subgroups of containing the set is a cross-section lattice with , and for any cross-section lattice , the right centralizer is a Borel subgroup containing with , see [9, Theorem 9.10].
The decomposition of into -orbits has a counterpart in the Renner monoid,
[TABLE]
The partial order (2.2) on agrees with the order induced from Bruhat-Chevalley-Renner order (2.1). A fundamental result of Putcha asserts that (for any connected monoid with a zero) is a relatively complemented lattice, anti-isomorphic to a face lattice of a convex polytope, see [9, Theorem 6.20]. Let be a cross-section lattice in . The Weyl group of (relative to ) acts on , and furthermore, we have
[TABLE]
The cross-section lattice with the order (2.2) is a graded poset; the rank function is given by
[TABLE]
A reductive monoid with zero is called J-irreducible monoid if it has a unique nonzero minimal -orbit. Equivalently, if the cross-section lattice of has a unique nonzero idempotent. Let us call the boundary of . We call a J-coirreducible monoid if the boundary of is the closure of a single -orbit. In other words, if is J-irreducible, then ; if is J-coirreducible, then . For more on these monoids, see [9, Chapter 14].
Let be an element in . Then is equal to the minimal number of simple reflections from with . A subgroup that is generated by a subset will be denoted by and it will be called a parabolic subgroup of . For , we will denote by the following set:
[TABLE]
The type-map, , is defined by for . The containment ordering between -orbit closures in is transferred via to a sublattice of the Boolean lattice on . Associated with are the following sets: and . We define the subgroups
[TABLE]
Then we have
, 2. 2.
, 3. 3.
.
We know from [9, Chapter 10] that , and are parabolic subgroups of , and furthermore, we know that . If and for some subsets , then we define and .
Theorem/Definition (Pennell-Putcha-Renner): For every there exist elements , which are uniquely determined by , such that
[TABLE]
The decomposition of in (2.4) will be called the standard form of . Let be two elements from . It is proven in [7] that if and are two elements in standard form in , then
[TABLE]
We will occasionally write to denote the set .
Let be an idempotent from . The right centralizer of , denoted by , is the subgroup
[TABLE]
The left centralizer of , denoted by , is defined similarly. The left and the right centralizers of are parabolic subgroups that are opposite to each other. In particular, their intersection, , is a common Levi subgroup.
We now introduce our “local” monoids. Let be an idempotent from . The stabilizer of in is defined as . This is group is not necessarily connected. The connected stabilizer of in is the reductive monoid defined by
[TABLE]
Thus, the group of invertible elements of is given by the connected component of identity . It is easy to see that is the zero element in . It is also easy to verify that the set of idempotents of is , see [9, Theorem 6.7]. In fact, as shown in [9, Lemma 10.16], the cross-section lattice of is given by
[TABLE]
Another closely related subsemigroup is given by . The cross-section lattice of is given by . The following lemma will be used several times in the sequel. Its proof is recorded in [3, Lemma 1.2.2].
Lemma 2.8**.**
Let be an idempotent in . Then and are reductive groups. Furthermore, is a normal subgroup of ; there is an exact sequence of algebraic groups . The normalizer of in is equal to .
The proof of the next lemma can be found in [9, Proposition 10.9].
Lemma 2.9**.**
Let be an idempotent in . Then
; 2. 2.
; 3. 3.
.
Let us now specialize to an idempotent from . Then Lemma 2.9 shows that in our previous notation. Recall that the type-map of is equal to . In this notation, the restriction of to agrees with the of the cross-section lattice and the restriction of to agrees with the of .
3 Rank 1 Elements
In this section, we analyze some local monoids in the enveloping semigroups. For easing our notation, we denote by .
Notation 3.1**.**
Let denote the Coxeter-Dynkin diagram of . For every subset , we have the corresponding subdiagram in . By abusing notation, we will not distinguish between and . In particular, the subsets of that correspond to the connected components of will be called the connected components of .
In [11, Section 6], by using the language that himself and Putcha developed, Renner reviews Vinberg’s work on enveloping semigroups. In [11, Theorem 6.18], Renner describes
the cross-section lattice of ,
[TABLE] 2. 2.
the type-map of , , where
[TABLE]
In this notation, the natural partial order on the cross-section lattice is given by
[TABLE]
where for .
Remark 1**.**
The empty set is not assumed to be a connected component of , therefore, contains all idempotents of the form , . It follows from (3.3) that the minimum and the maximum elements in are given by and , respectively. It is easy to check that the height of , as a graded poset, is equal to .
Assumption 3.4**.**
In the rest of this section, we assume that the derived subgroup is a simple algebraic group. In particular, the Dynkin diagram of is connected.
Lemma 3.5**.**
Let denote the cross-section lattice of an enveloping monoid. Then the smallest element of is given by . Furthermore, an element covers if and only if .
Proof.
Both of these claims follow from the descriptions of and its ordering, see (3.2) and (3.3). ∎
Let denote the Renner monoid of , and let denote the cross-section lattice of . We define the subsets and in as follows:
[TABLE]
It is easy to check that has elements, and has elements.
Example 3.6**.**
The partial order (3.3) for is depicted in Figure 3.1. It gives the inclusion order between the closures of all -orbits in , where . Here, is the maximal torus in , and .
Proposition 3.7**.**
Let be an element of . Then .
Proof.
By Lemma 3.5, we have . It follows that there is a unique such that either or hold. Since the type map of is given by , where
[TABLE]
and since the Dynkin diagram of is connected, we see that and . In particular, we have
[TABLE]
Recall from Lemma 2.9 that for any idempotent in . In our case, this means that and that . But (3.8) shows that . Therefore,
[TABLE]
Clearly, is the trivial group, hence, the proof is finished. ∎
We proceed with an important corollary of Proposition 3.7.
Corollary 3.9**.**
Let be an idempotent from . If (), then the local monoid is isomorphic to the affine line . Moreover, we have the isomorphism .
Proof.
The cross-section lattice of is given by . In other words, is a J-irreducible monoid. It follows from Proposition 3.7 that the unit group of is a torus. But J-irreducible monoids are semi-simple, hence their centers are one dimensional, see [10, Lemma 8.3.2]. It follows that the unit group of is isomorphic to , hence, .
The second claim follows from Lemma 2.8. ∎
In the next proposition, stands for the opposite of the Bruhat-Chevalley order on the minimal coset representatives of in .
Proposition 3.10**.**
Let be an idempotent from . If (), then we have
[TABLE]
In particular, the dimension of the orbit is given by
[TABLE]
Proof.
Since is a minimal idempotent in , we have . For any , the set of -orbit closures in form a graded poset ranked by the dimension function. Therefore, if we prove our first claim, our second claim will follow at once by computing the length of the maximal element in the Bruhat poset.
To this end, we will use the standard form of the elements in . It is easy to verify from (3.8) that
[TABLE]
Therefore, in the first case, we have . In the second case, we have . It is not difficult to show, by using (2.5), that if are two elements from , then
[TABLE]
Therefore, the inclusion posets of -orbit closures in is isomorphic to as claimed. This finishes the proof. ∎
Remark 2**.**
Note that Proposition 3.10 implies that there are exactly -stable curves in and they all contain 0. Of course, these curves are -stable as well. Going through this vein, we see that the total number of -stable curves in is given by . More generally, let denote the Renner monoid of , and let denote its subposet . The following formula is easily proven by using Proposition 3.10:
[TABLE]
Here, the first term, , is equal to the number of the posets with , and the summation gives the total number of elements in all posets of the form with and . Each of these subposets has a unique minimal element corresponding to a -stable curve.
Next, we determine the groups and for .
Corollary 3.12**.**
Let be an idempotent from . If with , then the following statements hold true:
if , then , where is a codimension one subtorus in ; 2. 2.
if , then , where is a Levi subgroup of a maximal parabolic subgroup of .
Furthermore, in the former case, we have , where is a codimension one subtorus in , and in the latter case, we have , where is a codimension one subtorus in .
Proof.
By the proof of Proposition 3.7 we know that for , is the maximal parabolic subgroup in , and for , it is isomorphic to . In other words, if , then contains a copy of the Levi subgroup of that is determined by , and if , then contains a copy of . Now, our first two claims follow from these facts and Corollary 3.9.
For our second claim, we argue in a similar way; recall from the proof of Proposition 3.7 that the Weyl groups of the reductive groups and are isomorphic. In other words, the structures of the derived subgroups of both of these groups are isomorphic. But since is a (normal) subgroup of and the quotient is a one dimensional torus, the proof is finished. ∎
We finish this section with a remark on the automorphisms of .
Remark 3**.**
It is well-known that the only irreducible reduced root systems with nontrivial automorphisms are of types , , and . The automorphism groups of these root system are given by
; 2. 2.
for ; 3. 3.
; 4. 4.
.
Any nontrivial automorphism of these root systems preserves the connected components as well as the containment relations between connected components of the sub-Coxeter-Dynkin diagrams. Thus, it gives a nontrivial automorphism of the cross-section lattice.
4 The J-coirreducible Slices of
The purpose of this section is to determine the idempotents in for which the corresponding connected stabilizer monoid is J-coirreducible. We maintain our notation from Section 3. In particular, we assume that is a simple algebraic group.
Let be an element from . In Section 3 we observed that if and , then is one dimensional, and the unit group of is isomorphic to , where is a codimension one subtorus in . We will present a generalization of this observation. First, we have a simple remark.
Remark 4**.**
Let be an idempotent from . We claim that if , then is the maximal element in . We already noted in Section 3 that is the maximal element of . By definition, is an element of if and only if no connected component of is entirely contained in . Therefore, if , then there is no proper subset such that . This finishes the proof of our claim.
Lemma 4.1**.**
If the set is a singleton, then the connected stabilizer corresponding to an idempotent of the form () is a J-coirreducible monoid.
Proof.
Let be an idempotent from . By Remark 4, if , then is the maximal element in , so, we assume that . Next, we observe the simple fact that, for every , we have . In particular, for , we have . But is the unique element from that has this property. In other words, for any , the maximum element covers a unique element of the upper interval . This finishes the proof. ∎
Remark 5**.**
The proof of the following fact follows from the descriptions of the cross-section lattices of the connected stabilizer monoids, see (2.7): If are two idempotents from such that is J-coirreducible, then so is .
In the proof of the converse of Lemma 4.1, we will need the following notion.
Definition 4.2**.**
Let be a subset in viewed as a subdiagram in the Coxeter-Dynkin diagram of . An end-node in is an element such that there exists with .
Lemma 4.3**.**
Let be an element from . If () is a J-coirreducible connected stabilizer in , then for some .
Proof.
Let be as in the hypothesis. We now assume towards a contradiction that contains at least two different elements, with . In this case, if is the empty set, then and ; this contradicts with our assumption on the “J-coirreducibleness” of . With this observation and Remark 5, to finish the proof, it suffices to show that if is nonempty, then there is an element such that .
On one hand, if , then we must have . Therefore, we assume that . On the other one hand, if is contained in , then for every , we have the . Therefore, we assume that is not entirely contained in . If is an end-node of such that , then clearly no connected component of is entirely contained in , hence, . We now assume that all end-nodes of are contained in . In this case, if is an isolated connected component of , then we still have . Therefore, we assume that if is a connected component of , then all end-nodes of are contained in . Let be an end-node. Then since other end-nodes of are still contained in , we see that is not entirely contained in , therefore, . We finished showing that under our assumptions there is always a node such that removing from gives us another, bigger idempotent in . This finishes the proof. ∎
Theorem 4.4**.**
Let () be an idempotent from . Then is J-coirreducible if and only if for some . Moreover, in this case, if we assume that the Coxeter-Dynkin diagram of is one of the types , or . then is J-irreducible if and only if is an end-node.
Proof.
By combining Lemmas 4.1 and 4.3, we obtain the proof of the first claim. For our second claim, we first note that, by our additional assumption on the Coxeter-Dynkin diagrams, any connected component of has exactly two end-nodes. We note also that since , we have
- , 2) the connected component of in is equal to . Now, if covers and , then by Remark 4 we know that is the maximal element, so, our claim is true in this case. If , then is a singleton, and furthermore, and the connected component of in is equal to . But this means that is obtained from by removing an end point. This finishes the proof. ∎
In view of Remark 5 and Theorem 4.4, the following definition is meaningful.
Definition 4.5**.**
A J-coirreducible connected stabilizer in is called maximal if is of the form for some .
Remark 6**.**
The list of J-irreducibles connected stabilizers is not fully determined by Theorem 4.4. It would be interesting to find a characterizations of the idempotents such that is J-irreducible.
In our next result we determine explicitly the unit groups of maximal J-coirreducible connected stabilizers.
Theorem 4.6**.**
Let be an idempotent from . If is of the form for some , then is isomorphic to , where is a codimension one subtorus in . Furthermore, in this case, we have .
Proof.
We argue as in the proof of Corollary 3.12. Since , we see that and that the Weyl group of is . Since of agrees with the of , we see also that , and therefore, . It follows that both of the groups and contain a copy of , and is a torus embedding. Recall that the cross-section lattice of is given by . It is easy to verify that if and only if , and is a subset of with . Therefore, is isomorphic to the Boolean lattice on the set . In particular, its height is . This observation shows that, as a torus embedding, the dimension of is given by , hence, the group of units of , that is , is a torus of dimension . By Lemma 2.8, this proves our last claim. To see the validity of our first claim, note that , hence, once again by Lemma 2.8, . In particular, the maximal torus of is at least dimensional. Clearly, it cannot be of dimension , otherwise, we would have . From this we conclude that a maximal torus in has dimension exactly , therefore, is of the form with a codimension one subtorus. This finishes the proof. ∎
The proof of the following result now follows from Theorem 4.6 and Lemma 2.8.
Corollary 4.7**.**
If is an idempotent as in Theorem 4.6, then is isomorphic to .
We proceed to determine the “types” of the J-coirreducible connected stabilizers in .
Definition 4.8**.**
Let be a J-coirreducible monoid with the unique idempotent from . The type of is the subset in . We will denote the type of by .
We return to our notational convention that . Let be a maximal J-coirreducible monoid in . By Theorem 4.6, we know that the unit group of is , hence, its set of simple roots is given by .
Proposition 4.9**.**
Let be a maximal J-coirreducible monoid in . If , then .
Proof.
Note that the unique maximal element in is given by . The of is given by the restriction of of . Since \lambda^{*}(e_{I,J})=\{s\in S\setminus I:\ \text{ ss^{\prime}=s^{\prime}ss^{\prime}\in J}\}, we see that . On the other hand, we have . But we cannot have , otherwise, ; the full set of simple roots cannot be the type of a J-coirreducible monoid. Hence, . This finishes the proof. ∎
5 The Navel
We will now discuss another extreme case. Let us call an idempotent in a cross-section lattice a navel of if . If is a navel of , then we have . Clearly, the converse of this statement is true as well; if , then is a navel. Not every reductive monoid has a navel. To give an example, let us consider the monoid of matrices . Let () denote the matrix
[TABLE]
where is the neutral element in , and is the zero element of . Then is a cross-section lattice for . It is easy to verify that, for every , either , or . Thus, has no navel. In the sequel we will present a generalization of this observation.
Lemma 5.1**.**
If is a navel of in a reductive monoid , then the reductive groups , and are tori. In particular, both of the local monoids and are affine torus embeddings.
Proof.
Since , the reductive groups have no unipotent components, therefore, , , and are tori. ∎
Definition 5.2**.**
Let be a J-irreducible monoid with the unique minimal nonzero idempotent from . The type of is the subset in .
Proposition 5.3**.**
Let be a J-irreducible monoid of type , and let be the cross-section lattice of . Then has a navel if and only if . In this case, the navel is equal to the minimal nonzero idempotent of .
Proof.
Let us assume that is a navel in . By [8, Theorem 4.16], the map is injective, and furthermore, it is order preserving. Since by our assumption , must be the minimal nonzero idempotent in . But then for any we have . In other words, . This argument is reversible. Thus, we see that is a navel in if and only if . ∎
By the dual argument, we have the following proposition whose proof is omitted.
Proposition 5.4**.**
Let be a J-coirreducible monoid of type , and let be the cross-section lattice of . Then has a navel if and only if . In this case, the navel is equal to the maximal idempotent of .
Remark 7**.**
For tautological reasons, in diagonal monoids, every idempotent can be viewed as a navel.
Proposition 5.5**.**
Let be an idempotent in the cross-section lattice of an enveloping monoid. Then is a navel of if and only if . In this case, we have isomorphisms
[TABLE]
In particular, both of the local monoids and are affine torus embeddings.
Proof.
Let be an idempotent in the cross-section lattice of an enveloping monoid. Then , where and . Thus, if and only if
- and 2) . Clearly, if and , then 1) and 2) hold. Conversely, if 1) and 2) hold, then , and , and hence, . This proves the first assertion.
Next, by Lemma 5.1, we know that the reductive groups , , and are tori; we will compute their dimensions. Since , both of the sublattices and are isomorphic to the Boolean lattice on , which is of height . Once again, the rest of the proof follows from Lemma 2.8. ∎
Let be a -orbit in a reductive monoid . The following fibration is well-known,
[TABLE]
where (resp. ) is the right (resp. the left) stabilizer of in ; see, for example, [5, Lemmas 3.5 and 3.6]. In particular, . Now let be the enveloping semigroup of , and let denote the navel of . For simplicity, let us assume that is simply connected and of adjoint type. Since the rank of the idempotent is , we know that .
We claim that the dimension of the -orbit in is equal to . To see this, we refer to a theorem of Vinberg. Let denote the open subset
[TABLE]
Let denote the center of . Then . In [15, Theorem 7], Vinberg shows that the geometric quotient exists, and furthermore, is isomorphic to the wonderful compactification of . The closed -orbit in is isomorphic to , where is a Borel subgroup of containing . Since is -equivariant, the closed orbit of is a fibration over with fiber . But , therefore, we get the torus fibration
[TABLE]
The dimension of is equal to the dimension of the unipotent radical of , . As , we see from (5.7) that . This finishes the proof of our claim. Now as a simple corollary of this fact, we see that for and for the navel of , the fibrations (5.7) and (5.6) are equal. In particular, the stabilizer of in is a horospherical subgroup, that is to say, it is contains a maximal unipotent subgroup of .
We finish this section by computing the local monoids associated with the navels of the J-coirreducible and J-irreducible monoids of type . Let denote the navel of a J-coirreducible monoid . Since the cross-section lattice of is 1 dimensional and since the unit group of is a torus, we see that . Likewise, the unit group of is an -dimensional torus, . Therefore, , and . By arguing in a similar way, we find that if is a J-irreducible monoid of type and is the navel of , then and , where is a codimension one subtorus in .
6 Atomic Lattices
We start with reviewing Vinberg’s description of the parametrizing sets for -orbits . We will show that the lattice of -orbits in is an atomic lattice.
We maintain our notation from the preliminaries. In addition, we have the following notation: if is a closed subgroup of , then denotes , the group of characters of . Then we set . Now, recall that denotes the maximal torus in , which is the unit group of . Then . We will denote by the simple roots determined by . Let denote the corresponding dual roots, and let Ç denote the Weyl chamber,
[TABLE]
Let K denote a closed, convex, polyhedral cone in such that
for , 2. 2.
the cone generates .
Since the Lie algebras of are related to each other as follows
[TABLE]
we see that
[TABLE]
where is the Weyl chamber of . We put . Clearly, . Note that M is a pointed cone. Moreover, if is a homomorphism such that , then we have
; 2. 2.
the cone M generates ; 3. 3.
.
Finally, we see from these facts/definitions that . For each subset we have a unique face of M, denoted by , which is spanned by as a convex cone. In a similar way, for each subset , we have a unique face of , denoted by , which is spanned by . Therefore, the faces of are given by
[TABLE]
Notation 6.2**.**
From now on, for positive integers, , we will use the shorthand . Also, by abusing of notation, if is a subset of the simple roots, or if is a subset of the set of fundamental weights, then we identify them by the sets of indices of the elements that they contain, so, .
As before, we let denote the Dynkin diagram of . For , we denote by the subdiagram of constituted by the vertices , where .
Definition 6.3**.**
A pair corresponding to a face of is called an essential if no connected component of the complement of is entirely contained in .
According to Vinberg [15, Theorem 6], the -orbits in are in one-to-one correspondence with the essential faces of ; the inclusion order between the closures of the -orbits is equivalent to the inclusion order on essential faces:
[TABLE]
where for . We will denote lattice of all faces of by ; the sublattice of the essential faces will be denoted by .
Remark 8**.**
The association is a lattice isomorphism between and the cross-section lattice . This isomorphism extends to give an isomorphism between the lattices and .
Lemma 6.5**.**
Let and be two essential faces from . Then we have
[TABLE]
where is the union of the connected components of such that for .
Proof.
The first equality is an immediate consequence of the “definition” in (6.4). We proceed to prove the second equality. Clearly, if for , then and . Therefore, in order for be equal to , first, we must have . Secondly, the condition that no connected component of the complement of is entirely contained in must be satisfied. This condition is minimally satisfied, if we adjoint to the components of such that . But this is exactly our second claim, hence, the proof is finished. ∎
Let be a lattice with a minimal element . An element in is called an atom if covers . It is easy to see that in the atoms are given by () and (). A lattice is said to be atomic if every element is a join of atoms. It is pointed out by Vinberg [15, Section 0.6] that is a simplicial cone, that is, a cone generated by linearly independent vectors. It is well-known that the lattice of faces of a simplicial cone is a Boolean lattice. Therefore, is a Boolean lattice. In particular, is an atomic lattice. Note that since is the height of , it has exactly atoms. Therefore, the sets of atoms of and are equal. This argument shows that is an atomic lattice. In the next proposition, we prove this result more directly.
Proposition 6.6**.**
Let be an element from . Then it has the following decomposition:
[TABLE]
In particular, , hence, the cross-section lattice of , is an atomic lattice.
Proof.
Without loss of generality we may assume that . Indeed, there is a unique face with ; it is the top element of . Now, both of the faces and are elements in . It follows from Lemma 6.5 that . It also follows from Lemma 6.5 that and . This finishes the first part of the proof. Our second claim follows from Remark 8. ∎
7 A Generating Function
In this section, we will determine the generating series of the number of -orbits in for . The Dynkin diagram of , which we denote by , has -nodes labeled with the simple roots . By Definition 6.3, our problem is equivalent to counting pairs such that
[TABLE]
First, we find a recurrence for the . Clearly, , so, we assume that . We split our count into two disjoint sets:
- (1)
: the set of pairs satisfying (7.1) and ; 2. (2)
: the set of pairs satisfying (7.1) and .
Clearly, . If , then . But if , then can be any of the subsets of , hence, .
We proceed to find a formula (recurrence) for . Once again, we split our problem into two parts:
- (2.1)
counting such that ; 2. (2.2)
counting such that .
In the former case, may, or may not, belong to . In both of these cases, by removing from , and relabeling the nodes, we obtain a pair (where ) in . Conversely, by appending to as the new first node, from any pair in , we obtain two new pairs in such that . Therefore, the number of such pairs is given by .
Now, in the latter case, we look at the following two disjoint situations:
- (2.2.1)
counting such that ; 2. (2.2.2)
counting such that , where , and .
In the former case, can be any nonempty subset of , therefore, we get a contribution of from (2.2.1). We proceed with the latter case. To this end, let us fix a subset of such that , where , and . For such , we will analyze the possibilities for . The intersection is allowed to be any nonempty subset of . Also, may or may not be an element of . Next, we look at the tails, namely, the intersections and . Clearly, the intersection might be empty, or not. If it is empty, then can be chosen arbitrarily, so, it gives possibilities. If is nonempty, then can be chosen in one of the possible ways. Thus, the possibilities for are exhausted, and we arrive at a formula for the cardinality of ,
[TABLE]
We set and . By reorganizing the right hand side of (7.2), we obtain the following lemma.
Lemma 7.3**.**
For every positive integer with , the following recurrence formula hold:
[TABLE]
It is easy to verify (by hand) and by Lemma 7.3 that and that . Next, we will determine a closed formula for the generating series,
[TABLE]
Let us first introduce the notation for . By modifying the limits of the summation on the right hand side of eqn. (7.4), we get
[TABLE]
Thus, by multiplying both sides of eqn. (7.6) by and then by taking the sum over with , we obtain
[TABLE]
By solving for , we obtain
[TABLE]
The denominator is given by
[TABLE]
But the numerator is easy to compute as well,
[TABLE]
Thus we have a cleaner formula for ,
[TABLE]
We are now ready to prove our formulation of the generating series for . For convenience, we set .
Theorem 7.8**.**
Let denote , where is the maximal torus in , and is center of . The generating series of the number , of -orbits in the enveloping monoid of is given by
[TABLE]
Proof.
We already mentioned that . Since , the proof follows from formula (7.7) after a simple calculation. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Valery Alexeev and Michel Brion. Stable reductive varieties. I. Affine varieties. Invent. Math. , 157(2):227–274, 2004.
- 2[2] Mahir Bilen Can. On the Dual Canonical Monoids. ar Xiv e-prints , page ar Xiv:1905.08316, May 2019.
- 3[3] Michel Brion. Local structure of algebraic monoids. Mosc. Math. J. , 8(4):647–666, 846, 2008.
- 4[4] Mahir Bilen Can. Classification of reductive monoid spaces over an arbitrary field. In Advances in algebra , volume 277 of Springer Proc. Math. Stat. , pages 67–94. Springer, Cham, 2019.
- 5[5] Mahir Bilen Can and Lex E. Renner. H 𝐻 H -polynomials and rook polynomials. Internat. J. Algebra Comput. , 18(5):935–949, 2008.
- 6[6] Mathieu Huruguen. Toric varieties and spherical embeddings over an arbitrary field. J. Algebra , 342:212–234, 2011.
- 7[7] Edwin A. Pennell, Mohan S. Putcha, and Lex E. Renner. Analogue of the Bruhat-Chevalley order for reductive monoids. J. Algebra , 196(2):339–368, 1997.
- 8[8] M. S. Putcha and L. E. Renner. The system of idempotents and the lattice of J 𝐽 J -classes of reductive algebraic monoids. J. Algebra , 116(2):385–399, 1988.
