Connected components of closed affine Deligne-Lusztig varieties
Ling Chen
School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, China
[email protected]
and
Sian Nie
Institute of Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, 100190, Beijing, China
[email protected]
Abstract.
For split reductive algebraic groups, we determine the connected components of closed affine Deligne-Lusztig varieties of arbitrary parahoric level.
Key words and phrases:
Affine Deligne-Lusztig varieties; connected components.
2010 Mathematics Subject Classification:
20G25, 14G35
L.C. is supported in part by NSFC grant 11401559 and UCAS grant Y55202HY00. S.N. is supported in part by QYZDB-SSW-SYS007 and NSFC grant (No. 11501547 and No. 11621061).
Introduction
0.1.
The motivation of this paper comes from the study of reductions of PEL type Shimura varieties at a prime number p. A Shimura varity of PEL type can be viewed as a moduli space of abelian varieties with additional structures such as polarization, endomorphisms, level structures and so on. To each such abelian variety we can attach its p-divisible group, which inherits corresponding additional structures. Thus the special fiber of the moduli space at p decomposes into finitely many locally closed subspaces called Newton strata, which are parameterized by the isogeny classes of these p-divisible groups (with additional structures).
By the uniformization theorem of Rapoport and Zink [19], one can describe the Newton strata in terms of so-called Rapoport-Zink spaces. Their geometric properties play an important role in the study of Shimura varieties. Via Dieudonné theory, the set of geometric points of a Rapoport-Zink space can be identified with certain union of affine Deligne-Lusztig varieties. The main purpose of this paper is to study the connected components of such unions of affine Deligne-Lusztig varieties.
Let Fq be a finite field of q elements and let k be its algebraic closure. Let F be a finite extension of Qp with residue class field Fq or F=Fq((t)) be the field of Laurent series over Fq. Denote by L the completion of a maximal unramified extension of F. We fix a uniformizer t of F.
Let G be an unramified reductive group over F. Let σ be the Frobenius automorphism of L/F. We also denote by σ the induced automorphism on G(L).
Fix a maximal torus T and a Borel subgroup B⊇T over F. The Iwahori-Weyl group is defined by W~=N(L)/T(L)0, where N is the normalizer of T in G and T(L)0 is the unique maximal compact subgroup of T(L). Fix a σ-invariant Iwahori subgroup I⊆G(L) containing T(L)0. We have the Iwahori-Bruhat decomposition G(L)=⊔x∈W~IxI. Let P⊇I be a σ-stable parahoric subgroup. For b∈G(L) and x∈W~, the attached affine Deligne-Lusztig variety is define by
[TABLE]
If F is of equal characteristic, this is the set of k-points of a locally closed subscheme in the partial affine flag variety G(L)/P. If F is of mixed characteristic, it is the set of k-points of a locally closed perfect subscheme of the p-adic partial flag variety in the sense of [1] and [23].
In the theory of local Shimura varieties (or Rapoport-Zink spaces), it is natural to consider the following union of affine Deligne-Lusztig varieties:
[TABLE]
where λ is a geometric cocharacter of T and Adm(λ)⊆W~ denotes the λ-admissible set (see §1.2 for notation). When the data (G,λ,P) arises from a (PEL type) Shimura variety (in particular, F is of mixed characteristic), X(μ,b)P is the set of k-valued points of the corresponding Rapoport-Zink space (see [18]).
We are interested in the set π0(X(λ,b)P) of connected components of X(μ,b)P. When P is hyperspecial, π0(X(μ,b)P) is determined by Viehmann [20] if G is split, by Chen-Kisin-Viehmann [3] if μ is minuscule and by the second named author [17] if μ is non-minuscule. Recently, He and Zhou [12] determined π0(X(μ,b)P) when b is basic 111Actually, they obtained such result for an arbitrary connected reductive group over F.. Moreover, in the residue split case, they obtained a description of π0(X(μ,b)P) (with b arbitrary) in terms of straight elements and their associated Levi subgroups (see [12, Theorem 0.2]). These results play an essential role in describing connected components of unramified Rapoport-Zink spaces (see [2], [3]) and in verifying the Langlands-Rapoport conjecture for mod-p points on Shimura varieties (see [14], [22]).
0.2.
As indicated in the pioneer work [20] and [3], we can determine π0(X(λ,b)P) in the following three steps.
The first step is reduction to adjoint and simple groups. Let Gad be the adjoint group of G, and denote by bad, λad and Pad the images of b, λ and P in Gad(L) respectively. Then π0(XG(λ,b)P) can be computed from π0(XGad(λad,bad)Pad) via the following Cartesian diagram
[TABLE]
Once G is adjoint, it is a product of simple groups over F. So we can assume G is simple and adjoint.
The second step is reduction to Hodge-Newton indecomposable case. If the pair (λ,b) is Hodge-Newton decomposable, then [5, Theorem 3.8] says that XG(λ,b)P is a disjoint union of closed subvarieties of the form XG′(λ′,b′)P′, where G′⊇T is some proper Levi subgroup of G over F. Thus, by induction on the semisimple rank of G, it suffices to consider the Hodge-Newton indecomposable case.
The third step is explicit computation in Hodge-Newton irreducible case. Suppose (λ,b) is Hodge-Newton indecomposable and Gad is simple over F. By [3, Theorem 2.5.6], either b is σ-conjugate to tλ with λ central in G or (λ,b) is Hodge-Newton irreducible (see Section 2 for notation). In the former case, we have
[TABLE]
which is discrete. Here Jb={g∈G(L);g−1bσ(g)=b} denotes the σ-centralizer of b. Therefore, it remains to consider the Hodge-Newton irreducible case.
Conjecture 0.1**.**
If (λ,b) is Hodge-Newton irreducible, then the natural projection ηG:G(L)/P→π1(G) induces a bijection
[TABLE]
0.3.
The main result of this paper is the following.
Theorem 0.1**.**
Conjecture 0.1 is true if G splits over F.
Thanks to [10], the natural projection X(λ,b):=X(λ,b)I→X(λ,b)P is surjective. Thus, to prove Theorem 0.1, it suffices to consider the Iwahori case. To this end, we adopt the strategies of [3] and [12]. The starting point is Proposition 1.2, which says that each connected component of X(λ,b) intersects with some Xx(b), where x ranges over the set Adm(λ)str of straight elements (see §1.2 for notation) contained in Adm(λ). Since Xx(b)≅π1(G)σ, we deduce that
[TABLE]
Then it remains to prove that Q′∈Xx′(b) and Q′′∈Xx′′(b) with x′,x′′∈Adm(λ)str are connected in X(λ,b) if ηG(Q′)=ηG(Q′′). We verify this statement by constructing curves in X(λ,b) connecting Q′ and Q′′. This completes the proof of Theorem 0.1.
The paper is organized as follows. In §1, we recall basic notations and lemmas. In §2, we introduce the notion of permissible elements and prove Theorem 0.1 by assuming Proposition 2.10. In §3 we prove Proposition 2.10 for simply laced root systems, and in §4 and §5 we deal with the non-simply laced case. In the Appendix, we prove case-by-case several combinatorial properties concerned with simply laced root systems, which are used in the proof of Proposition 2.10.
Acknowledgement
We would like to thank Xuhua He for many helpful conversations. Part of the work was done during the second named author’s visit to Institute for Advanced Study. He would like to thank the institute for the excellence working atmosphere.
1. Preliminaries
1.1.
We continue with the notations in the introduction. Moreover, throughout the body of the paper, we assume that G and T split over the valuation ring OF of F and that G is simple over F.
Let R=(Y,ΦG∨,X,ΦG,\SS0) be a based root datum of G, where X and Y are the character and cocharacter groups of T respectively together with a perfect pairing ⟨,⟩:Y×X→Z; ΦG=Φ⊆X (resp. Φ∨⊆Y) is the set of roots (resp. coroots); \SS0 is the set of simple roots appearing in the σ-stable Borel subgroup B⊇T. For α∈Φ, we denote by sα the reflection which sends μ∈Y to μ−⟨μ,α⟩α∨, where α∨∈Φ∨ denotes the corresponding coroot. We say sα is a simple reflection if α∈\SS0. We also denote by \SS0 the set of simple reflections.
Let W0 be the Weyl group of T in G, which is a reflection subgroup of GL(YR) generated by \SS0. The extended affine Weyl group of T in G is given by
[TABLE]
Let p:N(L)→N(L)/T(OL)=W~ be the quotient map. For x∈W~ we denote by x˙∈N(L) a lift of x (under p). We can embed W~ into the group of affine transformations of YR, where the action of w~=tμw is given by v↦μ+w(v). Let Φ+=Φ∩Z⩾0\SS0 be the set of positive roots and let a={v∈YR;0<⟨α,v⟩<1,α∈Φ+} be the base alcove.
Let Φ~G=Φ~=Φ×Z be the set of (real) affine roots. Let α~=(α,k)∈Φ~. We can view α~ as an affine function such that α~(v)=−⟨α,v⟩+k for v∈YR. The induced action of W~ on Φ~ is given by (w~(α~))(v)=α~(w~−1(v)) for w~∈W~. Let sα~=tkα∨sα∈W~ be the corresponding affine reflection. Then {sα~;α~∈Φ~} generates the affine Weyl group
[TABLE]
Moreover, W~=Wa⋊Ω, where Ω={x∈W~;x(a)=a}. Set Φ~+={α~∈Φ~;α~(a)>0} and Φ~−=−Φ~+. Then Φ~=Φ~+⊔Φ~−. The associated length function ℓ:W~→N is defined by ℓ(w~)=∣Φ~−∩w~(Φ~+)∣. Let \SSa={sα~;α~∈Φ~,ℓ(sα~)=1}. Then Wa is generated by \SSa and (Wa,\SSa) is a Coxeter system.
For w~,w~′∈W~, we say w~≤w~′ if there exist w~=w~1,…,w~r=w~′ such that ℓ(w~k)<ℓ(w~k+1) and w~kw~k+1−1 is an affine reflection for 1⩽k⩽r−1. We call this partial order ≤ the Bruhat order on (W~,\SSa).
For α∈Φ, let Uα⊆G be the corresponding root subgroup. We set
[TABLE]
which is called a Iwahori subgroup. Here OL is the valuation ring of L.
1.2.
Let v∈YR. We say v is dominant if ⟨v,α⟩⩾0 for each α∈Φ+. We denote by vˉ the unique dominant W0-conjugate of v. Let Y+ (resp. YR+) be the set of dominant vectors in Y (resp. YR). For χ1,χ2∈Y we write χ1⩽χ2 if χ2−χ1∈Z⩾0(Φ+)∨, and write χ1⪯χ2 if χˉ1⩽χˉ2.
For w~∈W~ there exists a nonzero integer n such that (w~)n=tξ for some ξ∈Y. We define νw~=ξ/n, which does not depend on the choice of n. For b′,b′′∈G(L) we set Jb′,b′′={g∈G(L);g−1b′σ(g)=b′′} and put Jb′=Jb′,b′′ if b′=b′′.
Let b∈G(L). We denote by [b]={g−1bσ(g);g∈G(L)} the σ-conjugate class of b. Due to Kottwitz [15], the σ-conjugacy class [b] is uniquely determined by two invariants: the Kottwitz point ηG([b])∈π1(G) and the Newton point ν[b]G∈YR+. Here ηG:G(L)→π1(G)=W~/Wa≅Y/ZΦ∨ is the natural projection which sends Iw~I to w~Wa. To define ν[b]G, we notice that there exists x∈W~ such that x˙∈[b]. Then ν[b]G=νˉx, which does not depend on the choice of x.
Let λ∈Y+ and b∈G(L). The closed affine Deligne-Lusztig variety associated to (λ,b) is defined by
[TABLE]
where
[TABLE]
is called the λ-admissible set. We refer to [8] and [7] for more on Adm(λ). Note that Adm(λ′)⊆Adm(λ) if λ′⪯λ (see [6, Lemma 4.5]). By [10], X(λ,b)=∅ if and only if ηG(tλ)=ηG([b]) and λ−ν[b]G∈R⩾0(Φ+)∨. Note that Jb acts on X(λ,b) by right multiplication.
We say w~∈W~ is fundamental if Iw~I lies in the I-σ-conjugacy class of w~˙. By [16], w~ is fundamental if and only if it is straight, that is, ℓ(w~n)=nℓ(w~) for each n∈Z⩾0. We refer to [11] for more descriptions of straight elements.
Proposition 1.1** ([9]).**
Let x∈W~ be a fundamental element. Then Xx(b)=∅ if and only if [b]=[x˙], in which case Xx(b)≅Jb/(Jb∩I).
The following result plays a foundational role in this paper.
Proposition 1.2** ([10], [17]).**
If X(λ,b)=∅, then each connected component of X(λ,b) intersects with Xx(b) for some straight element x∈Adm(λ).
1.3.
Let M⊆G be a Levi subgroup containing T. Then B∩M⊇T is a Borel subgroup of M. By replacing the triple (T,B,G) with (T,B∩M,M), we can define, as in §1.1, ΦM+, W~M, \SSMa, ΩM, Φ~M+, ≤M, IM and so on. For K⊆\SSMa we denote by WK the reflection subgroup of Wa generated by K. Let W⊇WK be a subgroup of W~. We set WK={x∈W;x≤xs for each s∈K} and KW=(WK)−1.
For v∈YR we set Φv={α∈Φ;α(v)=0} and denote by Mv the Levi subgroup of G generated by T and the root subgroups Uα for α∈Φv. If v is dominant, we set Jv={s∈\SS0;s(v)=v}. For J⊆\SS0 there exists v∈YR+ such that Jv=J. We write ΦJ=ΦMv, ΦJ+=ΦMv+, W~J=W~Mv, ΩJ=ΩMv, ≤J=≤Mv and so on.
Lemma 1.3**.**
Let M⊇T be a Levi subgroup of G. Let x,y∈W~M such that x≤My. Then z′xz−1≤z′yz−1 for z,z′∈W~\SSMa.
Proof.
We may assume y=xsα~ for some α~∈Φ~M+. Since x≤My, we have x(α~)∈Φ~M+. Let γ~=z(α~)∈Φ~+. Then z′yz−1=z′xz−1sγ~ and z′xz−1(γ~)=z′x(α~)>0. This means z′xz−1≤z′yz−1 as desired.
∎
Let J⊆\SS0. For χ,χ′∈Y we write χ⩽Jχ′ if χ′−χ∈Z⩾0(ΦJ+)∨, and write χ⩽Jχ′ if χ⩽χ′+ϕ for some ϕ∈ZΦJ∨.
Lemma 1.4**.**
Let w~∈ΩJ. Let α∈Φ+ and z∈W0J such that sαz∈W0J. For u∈WJ we have
(1) zw~z−1sα∈Adm(μ−u−1z−1(α∨))∪Adm(μ);
(2) sαzw~z−1∈Adm(μ+u−1z−1(α∨))∪Adm(μ).
Proof.
Notice that tzu(μ)sα≤tzu(μ) if ⟨zu(μ),α⟩⩾1, and tzu(μ)sα=tzu(μ)−α∨tα∨sα≤tzu(μ)−α∨ if ⟨zu(μ),α⟩⩽0. By symmetry, sαtzu(μ)≤tzu(μ) if ⟨zu(μ),α⟩⩽−1, and sαtzu(μ)=tα∨sαtzu(μ)+α∨≤tzu(μ)+α∨ if ⟨zu(μ),α⟩⩾0. Therefore, tzu(μ)sα∈Adm(μ−u−1z−1(α∨))∪Adm(μ) and sαtzu(μ)∈Adm(μ+u−1z−1(α∨))∪Adm(μ). Notice that w~≤Jtu(μ) and z,sαz∈W~\SSMJa. By Lemma 1.3, we have zw~z−1sα≤tzu(μ)sα∈Adm(μ−u−1z−1(α∨))∪Adm(μ) and sαzw~z−1≤sαtzu(μ)∈Adm(μ+u−1z−1(α∨))∪Adm(μ) as desired.
∎
Lemma 1.5**.**
Assume Φ is simply laced. Let γ,γ′∈Φ+−ΦJ such that γ−γ′∈ZΦJ. Then γ,γ′ are conjugate under WJ.
Proof.
We can assume γ,γ′ are J-dominant. Since Φ is simply laced, γ,γ′ are also J-minuscule. So we have γ=γ′ since γ−γ′∈ZΦJ.
∎
For D⊆Φ+ we denote by Dmax (resp. Dmax,J) the set of maximal elements of D with respect to the partial order ⩽ (resp. ⩽J).
Lemma 1.6**.**
Assume Φ is simply laced. Let z∈W0J and let D⊆Φ+−ΦJ be a WJ-stable subset such that D∩z−1(Φ−)=∅. Then sz(β)z=zsβ∈W0J for β∈(D∩z−1(Φ−))max,J.
Proof.
If zsβ∈/W0J, there exists γ∈ΦJ+ such that zsβ(γ)<0. Noticing that β=±γ, we have ⟨β∨,γ⟩=⟨γ∨,β⟩∈{−1,0,1} since Φ is simply laced. If ⟨β∨,γ⟩⩾0, then zsβ(γ)=z(γ)−⟨β∨,γ⟩z(β)>0, a contradiction. So we have ⟨β∨,γ⟩=−1 and sγ(β)=β+γ>β, which contradicts our choice of β. The proof is finished.
∎
1.4.
Let χ,χ′∈Y and γ∈\SS0. Write χ→γ+χ′ if χ′=χ+γ and ⟨χ,γ⟩⩽−1. If, moreover, ⟨χ,γ⟩=−1, we write χ↣γ+χ′. We write χ→+χ′ (resp. χ↣+χ′) if there exist simple roots γ1,⋯,γm such that χ→γ1+⋯→γm+χ′ (resp. χ↣γ1+⋯↣γm+χ′ ). On the other hand, write χ→γ−χ′ if χ′=χ−γ and ⟨χ,γ⟩⩾1. We can define χ→−χ′ in a similar way.
We say χ∈Y is weakly dominant if ⟨χ,α⟩⩾−1 for each α∈Φ+.
Lemma 1.7**.**
Let χ,χ′∈Y and λ∈Y+. Then we have
(1) χ′⩽λ if χ⩽λ and χ→+χ′;
(2) χ is weakly dominant if χ↣+χ′ and χ′ is dominant;
(3) χ⪯λ if χ⩽λ and χ is weakly dominant;
(4) χ′ is weakly dominant if χ→−χ′ and χ is weakly dominant.
In particular, χ′⪯λ if χ→+χ′, χ′⩽λ and χ′ is weakly dominant.
Proof.
(3) is [4, Proposition 2.2]. (2) and (4) follow from [17, Lemma 6.6]. (1) is proved in [4], and we repeat its proof here. We can assume χ→γ+χ′ for some simple root γ∈\SS0. To verify χ′=χ+γ∨⩽λ, we prove the coefficient of γ∨ in λ−χ is strictly positive. Assume otherwise, then 0⩾⟨λ−χ,γ⟩⩾0−(−1)⩾1, a contradiction. So (1) is proved.
∎
For v∈RΦ we have v=∑α∈\SS0cαα, where cα∈R is called the coefficient of α in v. We say γ∈Φ+ is elementary if the coefficient of each simple root in γ is at most one.
Lemma 1.8**.**
Suppose there exists a simple root α∈\SS0 having three neighbors in the Dynkin diagram of \SS0. Let γ∈Φ+ such that the coefficient of α in γ is at most one. Then γ is elementary.
For α,β∈\SS0, we denote by dist(α,β) the length of the shortest path (geodesic) connecting α and β in the Dynkin diagram of \SS0. For D,D′⊆\SS0 we set dist(D,D′)=min{dist(γ,γ′);γ∈D,γ′∈D′}.
2. Proof of the main result
In this section we outline the proof of Theorem 0.1. We fix λ∈Y+ and b∈G(L) such that (λ,b) is Hodge-Newton irreducible, that is, ηG(tλ)=ηG(b) and the coefficient of each simple coroot in λ−ν[b]G is strictly positive. In particular, X(λ,b)=∅.
Following [21], we say x∈W~ is short if νx is dominant and x∈ΩJνx.
Lemma 2.1** ([21]).**
There exists a unique short element w~ such that w~˙∈[b]. Moreover, w~∈tμW0 with μ⪯λ weakly dominant.
Proof.
By Proposition 1.2, there exists a straight element x∈Adm(λ) such that [b]=[x˙]. In particular, νˉx=ν[b]G. Let z∈W0Jνˉx such that νx=z(ν[b]G). We set w~=z−1xz and hence w~˙∈[x˙]=[b]. By [17, Lemma 4.1], w~∈ΩJνw~ and μ is weakly dominant. Since x∈Adm(λ) and W0xW0=W0w~W0, we have μ⪯λ as desired. The uniqueness of w~ follows from [21, Lemma 5.3].
∎
Let w~ be the short element with w~˙∈[b]. Let μ∈Y such that w~∈tμW0. Then μ is Jνw~-dominant and Jνw~-minuscule. Let J⊆Jνw~ be the union of connected components H of Jνw~ such that μ is noncentral on ΦH. Let K={s∈J;s(μ)=μ}. Then x=tμwKwJ, where wK and wJ are the unique longest elements of WK and WJ respectively.
Lemma 2.2**.**
We have μ+α∨⩽λ for α∈\SS0−J.
Proof.
By definition, the coefficient of α in λ−ν[b]G is strictly positive. On the other hand, ν[b]G=νw~∈μ+RΦJ∨ since w~∈W~J. Thus the coefficient of α in λ−μ∈ZΦ∨ is also strictly positive as desired.
∎
Lemma 2.3**.**
If γ∈Φ+−ΦJνw~ is J-dominant, then ⟨μ,γ⟩⩾1.
Proof.
By definition, μ−νw~=μ−ν[b]G∈RΦJ∨ is J-dominant. So μ−νw~∈R⩾0(ΦJ+)∨. Since γ is J-dominant, we have ⟨μ,γ⟩=⟨νw~,γ⟩+⟨μ−νw~,γ⟩⩾⟨νw~,γ⟩>0 as desired.
∎
For χ∈Y we denote by χJ (resp. χJ) the unique J-antidominant (resp. J-dominant) WJ-conjugate of χ.
Corollary 2.4**.**
Let z∈W0J and γ∈Φ+−ΦJ such that z≥zsγ∈W0J (resp. z≤zsγ∈W0J). Then zw~sγz−1,zsγw~z−1∈Adm(λ) if zw~sγz−1∈Adm(λ) (resp. zsγw~z−1∈Adm(λ)). Moreover, the latter condition holds if μ+γJ∨⪯λ.
Proof.
By symmetry, we can assume z≥zsγ. If γ∈ΦJνw~+−ΦJ, we have zsγw~z−1=zw~sγz−1∈Adm(λ). Otherwise, by Lemma 2.3 we have ⟨μ,γJ⟩⩾1 and hence μ−(γJ)∨⪯μ⪯λ. So zsγw~z−1∈Adm(λ) by Lemma 1.4. The “Moreover” part follows from Lemma 1.4.
∎
Lemma 2.5**.**
Let γ∈Φ+−ΦJ such that ⟨μ,γJ⟩=⟨μ,γ⟩=0. Then γ⩽Jw−1(γ).
Proof.
By assumption γJ⩽Kγ and hence γ=u(γJ) for some u∈WK. Since wJwK∈WJK and ℓ((wJwK)(wKu))=ℓ(wJwK)+ℓ(wKu), we have wKu≤(wJwK)(wKu)=wJu. Moreover, since γJ is J-antidominant, we have wK(γ)=wKu(γJ)⩽JwJu(γJ)=wJ(γ), that is, w−1(γ)⩾Jγ as desired.
∎
Following [17, Section 8], we define a subset Cλ,J,b of Φ+ as follows. If G is of type G2 and J={sγ} with γ the unique short simple root, we define
[TABLE]
Otherwise, we define
[TABLE]
Lemma 2.6**.**
[17, Lemma 8.1 & Corollary 8.2]**
The quotient ZΦ∨/ZΦJ∨ is spanned by α∨ for α∈Cλ,J,b.
Lemma 2.7**.**
Let α∈Cλ,J,b and s=twJ(α∨)swJ(α). Then we have
(a) w~,sw~,w~s,sw~s∈Adm(λ);
(b) (Zα+Zw(α))∩Φ is simply laced;
(c) ⟨μ,wJ(α)⟩⩾2 if wJ(α)+wK(α)∈Φ.
Proof.
Since w~∈ΩJ, we have w~≤Jtμ∈Adm(λ). By definition, wJ(α∨) is J-dominant and J-minuscule. Thus s∈W~\SSMJa. Thanks to Lemma 1.3, sw~s∈Adm(λ). Moreover, we have
[TABLE]
where the first inequality follows form Lemma 1.3 (since w~≤JtwJ(μ)); the second inequality follows from the fact ⟨wJ(μ+α∨),wJ(α)⟩=⟨μ,α⟩+2⩾−1+2=1 (since μ is weakly dominant). If α∈Φ+−ΦJνw~, then ⟨μ,wJ(α)⟩⩾1 (by Lemma 2.3) and w−1(wJ(α))>0, which implies sw~≤w~∈Adm(λ) as desired. If α∈ΦJνw~+−ΦJ, we have sw~=w~s∈Adm(λ). Thus (a) is proved.
(b) is proved in the proof of [17, Propostiion 8.3].
To prove (c), we assume wJ(α)+wK(α)∈Φ and ⟨μ,wJ(α)⟩⩽1, and show this will lead to a contradiction. Since wJ(α∨) is J-dominant and J-minuscule, by [3, Lemma 4.6.1], there exists γi∈ΦJ+ with 1⩽i⩽m such that wJ(α∨)−wwJ(α∨)=wJ(α∨)−wK(α∨)=∑1⩽i⩽mγi∨, ⟨γi∨,γj⟩=0 and ⟨wJ(α∨),γi⟩=⟨μ,γi⟩=1 for any 1⩽i=j⩽m. In particular, wK(α∨)=sγ1⋯sγm(wJ(α∨)). Since wJ(α)+wK(α)∈Φ and (Zα+Zw(α))∩Φ is simply laced, we have
[TABLE]
that is, ∑1⩽i⩽m⟨γi∨,wJ(α)⟩=3. On the other hand, by ⟨μ,wJ(α)⟩⩽1 we have
[TABLE]
which contradicts that μ is weakly dominant. So (c) is proved.
∎
For b′,b′′∈G(L) we set Jb′,b′′={g∈G(L);g−1b′σ(g)=b′′}. For P,P′∈X(λ,b) we write P∼λ,bP′ if they are connected in X(λ,b).
Proposition 2.8**.**
Let α∈Cλ,J,b and s=twJ(α∨)swJ(α). Then we have g0I∼λ,bg0s˙I for g0∈Jb,w~˙.
Proof.
Set β=wJ(α). Define \textslg:A1→X(λ,b) by \textslg(z)=g0U−β(zt−1)I. We extend g to a (unique) morphism from P1=A1⊔{∞} to X(λ,b), which is still denoted by g. Then \textslg(0)=g0I and \textslg(∞)=g0s˙I. It remains to show the image of g lies in X(λ,b). Let c0∈OL× be the constant such that w~˙−1U−β(zt−1)w~˙=U−w−1(β)(c0zt⟨μ,β⟩−1).
If α∈Φ+−ΦJνw~, then β=−w−1(β) and ⟨μ,β⟩⩾1 by Lemma 2.3. Moreover, thanks to Lemma 2.7 (b), the root system Φ∩(Zβ+Zw−1(β)) is simply laced and ⟨μ,β⟩⩾2 if β+w−1(β)∈Φ. Thus
[TABLE]
Therefore,
[TABLE]
where the last inclusion follows from Lemma 2.7 (a).
If α∈ΦJνw~+−ΦJ, we have β=α and w~ commutes with sβ. Thus
[TABLE]
So the image of g always lies in X(λ,b) as desired.
∎
Let γ∈Φ+ and x∈W~. We say γ is x-permissible if
[TABLE]
for any y1,y2∈OL.
Let z,z′∈W0J and γ∈Φ+. Write z↔γz′ with z′=sγz if zw~z−1sγ,sγzw~z−1∈Adm(λ) and γ is zw~z−1-permissible, or equivalently by Lemma 2.12, z′w~z′−1-permissible. We write z↔z′ if there exist positive roots γ1,…,γn such that z↔γ1⋯↔γnz′. By Lemma 1.3, we always have zw~z−1,z′w~z′−1∈Adm(λ).
Proposition 2.9**.**
Let z,z′∈W0J and gz∈Jb,z˙w~˙z˙−1. If z↔γz′ for some γ∈Φ+, then gzI∼λ,bgzs˙γI. As a consequence, if z↔z′, then gzI∼λ,bgzz˙(z˙′)−1I.
Proof.
Define \textslg:P1→X(λ,b) by \textslg(y)=gzUγ(y)I. Then \textslg(0)=gzI and \textslg(∞)=gzs˙γI. Since γ is zw~z−1-permissible, the image of g lies in X(λ,b) and hence gzI,gzs˙γI are connected in X(λ,b).
∎
Proposition 2.10**.**
Let z∈W0J. If z=1, then there exists γ∈Φ+ such that z≥zsγ∈W0J and z↔zsγ. As a consequence, we have z↔z′ for any z′∈W0J.
Corollary 2.11**.**
Each connected component of X(λ,b) intersects with Jb,w~˙I/I. In particular, Jb acts transitively on π0(X(λ,b)).
Proof.
Let C be a connected component of X(λ,b). By Proposition 1.2, C intersects with Xx(b) for some straight element x∈Adm(λ). Therefore, by Proposition 1.1, there exists g∈Jb,x˙ such that gI∈C. Let z∈W0Jνw~⊆W0J such that z−1(νx)=ν[b]G=νw~. By Lemma 2.1, x=zw~z−1. Applying Proposition 2.9 (where we take z′=1), we have gI∼λ,bgz˙I and hence gz˙I∈(Jb,w~˙I/I)∩C as desired. Since Jb acts transitively on Jb,w~˙ by left multiplication, Jb acts transitively on π0(X(λ,b)).
∎
Now we are ready to prove Theorem 0.1.
Let Jw~˙∘=kerηG∩Jw~˙ and Jb∘=kerηG∩Jb=g0Jw~˙∘g0−1 with g0∈Jb,w~˙. By Corollary 2.11, Jb acts transitively on π0(X(λ,b))). Since Jb∘ is a normal subgroup of Jb, it suffices to show Jb∘ fixes the connected component C of X(λ,b) which contains g0I. Thanks to [12, Theorem 5.5], Jw~˙∘ is generated by Jw~˙∩IMJνw~, Jw~˙∩p−1(WJνw~a) and Jw~˙∩p−1(ΩJνw~∘), where ΩJνw~∘=kerηG∩ΩJνw~≅ZΦ∨/ZΦJνw~∨. Notice that
[TABLE]
Moreover, Jw~˙∩p−1(ΩJνw~∘) lies in the group generated by Jw~˙∩p−1(WJνw~−J) and Jw~˙∩p−1(ΩJ∘), where ΩJ∘=kerηG∩ΩJ.
Firstly, we show g0(Jw~˙∩I)g0−1 fixes C. This follows by observing that g0(Jw~˙∩I)g0−1 fixes g0I∈C.
Secondly, we show g0(Jw~˙∩p−1(ΩJ∘))g0−1 fixes C. Let γ∈Cλ,J,b. By definition, γ is J-antidominant and J-minuscule. So there exits a unique element, denoted by yγ, lying in ΩJ∩twJ(γ∨)WJ⊆ΩJ∘. Since w~yγ=yγw~ (because ΩJ is commutative), there exists a lift y˙γ∈N(L) of yγ which also lies in Jw~˙. By Lemma 2.6, ΩJ∘ is spanned by Cλ,J,b. So it suffices to show each g0y˙γg0−1 fixes C, that is, g0I∼λ,bg0y˙γI. Set β=wJ(γ) and s=tβ∨sβ. Then s=yγz−1 for some z∈W0. Noticing that yγ∈ΩJ and s=zyγ−1∈W~\SSMJa, we have z∈W0J. Since g0y˙γz˙−1∈Jb,z˙w~˙z˙−1, by Proposition 2.9 we have g0s˙I=g0y˙γz˙−1I∼λ,bg0y˙γI. On the other hand, by Proposition 2.8 we have g0I∼λ,bg0s˙I. So g0I∼λ,bg0y˙γI as desired.
Thirdly, we show g0(Jw~˙∩p−1(WJa))g0−1 fixes C. Since w~˙ is basic in MJ(L) and μ is noncentral on each connected component of J, by [12, Theorem 6.3] Jw~˙∩p−1(WJa) acts trivially on π0(XMJ(μ,w~˙)), which, coupled with the natural inclusion XMJ(μ,w~˙)⊆X(λ,w~˙), implies g0(Jw~˙∩p−1(WJa))g0−1 fixes C.
Finally, we show g0(Jw~˙∩p−1(WJνw~−Ja)g0−1 fixes C. Notice that WJνw~−Ja is generated by sα and tα∨ for α∈ΦJνw~−J+. Let s˙α∈N(L)∩Jw~˙ be a lift of sα. As we have already shown g0tα∨g0−1∈g0(Jw~˙∩p−1(ΩJ∘))g0−1 fixes C, it suffices to prove g0I∼λ,bg0s˙αI. This follows from Proposition 2.9 by noticing that sα∈W0J. The proof is finished.
In the remainder of this section, we deduce a criterion of zw~z−1-permissible elements for z∈W0J.
Lemma 2.12**.**
Let z∈W0J, w~′=zw~z−1 and α∈Φ+−z(ΦJ). Then α is zw~z−1-permissible if and only if one of the following conditions fails:
(1) ⟨μ′,α⟩=⟨μ′,w′(α)⟩=0;
(2) w′(α),w′−1(α)<0;
(3) α+w′(α),α+w′−1(α)∈Φ+;
(4) ⟨α∨,w′(α)⟩=−1.
Here μ′∈Y and w′∈W0 such that w~′=tμ′w′.
As a consequence, if, moreover, sαz∈W0J, then α is w~′-permissible if and only if α is sαw~′sα-permissible.
Proof.
Note that μ′=z(μ) and w′=zwz−1=zwKwJz−1. We have
(a) Uα(y1)w~′∈Iw~′I if sαw~′<w~′ and Uα(y1)w~′∈Isαw~′I otherwise for any y1∈OL×.
(b) If α=w′(α) and ⟨μ′,α−w′(α)⟩=0, then ∣\SS0∣⩾3 and hence Φ∩(Zα+Zw′(α)) is not of type G2.
Now we prove (b). Assume otherwise, that is, ∣\SS0∣⩽2. Since w′(α)=α, we have J=∅ and hence ∣J∣=1 (since J=\SS0). In particular, w′=sβ for some β∈z(ΦJ+) with ⟨μ′,β⟩=1 (since w~∈ΩJ). So α−w′(α)∈Zβ−{0} and ⟨μ′,α−w′(α)⟩=0, a contradiction. Therefore (b) is proved.
(⇐) We assume α is not w~′-permissible and show (1), (2), (3) and (4) are satisfied.
Suppose ⟨μ′,α⟩=0. If ⟨μ′,α⟩⩽−1, then for y1,y2∈OL× we have
[TABLE]
If ⟨μ′,α⟩⩾1, then
[TABLE]
which contradicts our assumption. So ⟨μ′,α⟩=0. Similar argument also shows that ⟨μ′,w′(α)⟩=0. Therefore, (1) is verified.
Since α is not w~′-permissible, by (1) and (a) we have w′(α)=α. Applying (b) we have
(b’) Φ∩(Zα+Zw′(α)) is not of type G2.
We claim that
(c) if α−w′(α)∈Φ+ (resp. α−w′−1(α)∈Φ+), then w′−1(α−w′(α))>0 (resp. w′(α−w′−1(α))>0).
Indeed, since α−w′(α)∈z(ZΦJ) and ⟨μ′,α−w′(α)⟩=0, we deduce that α−w′(α)∈z(ΦJ+) and hence α−w′(α)∈z(ΦK+). Then α−w′−1(α)∈Φ+ follows from the observation that w′−1z(ΦK+)⊆Φ+. The other statement follows in the same way by replacing the triple (μ′,w′,K) with (−w′−1(μ′),w′−1,w−1(K)). So (c) is proved.
Moreover, we have
(d) If w′(α)>0 (resp. w′−1(α)>0), then α−w′(α)∈Φ+ (resp. α−w′−1(α)∈Φ+).
Without loss of generality, we assume w′(α)>0. By (1), (b’) and the fact that α=±w′(α) are of the same length, one computes that
[TABLE]
for some constant c∈OL×. So α−w′(α)∈Φ+ (since α is not w~′-permissible) and (d) is proved.
Suppose w′(α)>0. By (d) and (c), w′−1(α−w′(α))>0 and hence w′−1(α)=α+w′−1(α−w′(α))>0. Applying (d) again, we have α−w′−1(α)>0, a contradiction. So w′(α)<0. Similarly, w′−1(α)<0 and (2) is verified.
By (1) and (2), we have
[TABLE]
for some constant c′∈OL×. Thus α+w′(α)∈Φ+. Similarly, we have α+w′−1(α)∈Φ+ and (3) is verified.
Suppose ⟨α∨,w′(α)⟩⩾0. Then, by (b’), Φ∩(Zα+Zw′(α)) is of type B2 since α and w′(α) are of the same length and α+w′(α)∈Φ+. In particular, ⟨α∨,w′(α)⟩=0 and α−w′(α)∈Φ+. Thus, by (c) we have w′−1(α)=α+w′−1(α−w′(α))>0, which contradicts (2). So ⟨α∨,w′(α)⟩⩽−1 and hence ⟨α∨,w′(α)⟩=−1 (since α=±w′(α) are of the same length). Therefore, (4) is verified.
(⇒) Assume (1), (2), (3) and (4) hold. One deduces that α+w′(α)∈Φ+, w~′<sα+w′(α)w~′ and Φ∩(Z(α)+Z(w′(α))) is of type A2. Thus, for y1,y2∈OL× we have
[TABLE]
Since sα+w′(α)w~′∈/{w~′sα,sαw~′}, α is not w~′-permissible as desired.
∎
3. Simply laced Dynkin diagrams
In this section we prove Proposition 2.10 for simply laced root system Φ. Let λ,μ,J,w~,w be as in Section 2. Fix 1=z∈W0J.
Lemma 3.1**.**
Let α,β∈\SS0−J such that
(i) ⟨μ,α⟩⩾0 and ⟨μ,β⟩=−1;
(ii) ⟨μ,δi⟩⩾0 for 2⩽i⩽m, where β=δ1,δ2,…,δm=α is a geodesic (shortest path) in the Dynkin diagram of \SS0.
If μ+α∨ is not weakly dominant, then ∑k=2m−1⟨μ,δk⟩⩽1 and one of the following cases occurs:
(1) μ+δm∨+⋯+δ1∨ is weakly dominant;
(2) \SS0 is of type E8, μ=kω1∨+ω3∨−ω4∨+ω6∨ (resp. μ=ω1∨−ω4∨+ω5∨+kω8∨) with k∈Z⩾0, α=α1 (resp. α=α8), β=α4, Jνw~=\SS0−{α,β} and J=Jνw~−{α2}. In this case, μ+δm∨+⋯+δ1∨+ξ1∨+ξ2∨+β∨ is weakly dominant, where {ξ1,ξ2}={α2,α5} (resp. {ξ1,ξ2}={α2,α3}).
(3) \SS0 is of type E8, μ=ω1∨−ω5∨+ω6∨+kω8∨ with k∈Z⩾0, α=α8, β=α5 and Jνw~=J=\SS0−{α5,α8}. In this case, μ+δm∨+⋯+δ1∨+ϵ+ξ1∨+ξ2∨+ϵ∨+β∨ is weakly dominant, where ϵ=α4 and {ξ1,ξ2}={α2,α3}.
Here, in (2) and (3), we use the labeling of the type E8 Dynkin diagram as in [13] by the integers 1⩽i⩽8, and αi and ωi∨ denote the corresponding simple root and fundamental coweight respectively.
The proof is given in §A.1.
Now we define
[TABLE]
Lemma 3.2**.**
Assume Φ is simply laced. Then for each nonempty subset D⊆Ξ1+(μ) there exists α∈Dmax,J such that one of the following statements fails:
(1’) ⟨μ,α⟩=⟨μ,w(α)⟩=0;
(2’) w(α),w−1(α)∈/D;
(3’) α+w−1(α)∈Φ−Ξ1+(μ);
(4’) w−1(α)−ϵ∈D if w−1(α)−ϵ,α+ϵ∈Φ for some ϵ∈ΦJ+;
(5’) α′∈D if α′∈Φ+ and α′⩽Jα.
The proof is given in §A.3.
3.1.
First we show Proposition 2.10 holds if
[TABLE]
We claim that there exist δ∈Dmax,J′ such that z≥zsδ∈W0J and z⟶−z(δ)zsδ. Let γ∈Dmax,J′. Then z≤zsγ∈W0J (by Lemma 1.6) and μ+γJ∨⪯λ. By Corollary 2.4 we have zw~sγz−1,zsγw~z−1∈Adm(λ). Thus, to prove the claim, it suffices to show in −z(Dmax,J′)⊆Φ+ there exists a zw~z−1-permissible root. Assume otherwise, that is, the four statements of Lemma 2.12 holds for each root in −z(Dmax,J′). We show this will lead to a contradiction.
First we show D′⊆Ξ1+(μ). Let γ∈Dmax,J′. By Lemma 2.12 (1) we have 0=⟨μ,w(γ)⟩=⟨μ,γ⟩⩾⟨μ,γJ⟩. If γ∈/Ξ1+(μ), then ⟨μ,γJ⟩⩾0 (since μ is weakly dominant) and hence ⟨μ,γJ⟩=0. By Lemma 2.5, w(γ)⩽Jw−1(w(γ))=γ and hence z(w(γ))⩽z(γ)<0, which contradicts to Lemma 2.12 (2). So γ∈Ξ1+(μ) and hence D′⊆Ξ1+(μ).
Fix a maximal element γ0∈D′ with respect to ⩽J (see §1.3). Define
[TABLE]
We show each α∈Dmax,J satisfies the five conditions of Lemma 3.2, which is a contradiction. Indeed, one checks that (1’) and (2’) follows directly from (1) and (2) of Lemma 2.12 respectively. Moreover, (5’) follows from the inclusion z∈W0J and the equality (α′)J=αJ (by Lemma 1.5). By Lemma 2.12 (3), we have α+w−1(α)∈z−1(Φ−). Due to the choice of γ0∈D′, we have α+w−1(α)∈/D′, that is, α+w−1(α)∈/Ξ+(λ,μ). In particular, α+w−1(α)∈/Ξ1+(μ) and (3’) follows. It remains to verify (4’). Let ϵ∈ΦJ+ such that w−1(α)−ϵ,α+ϵ∈Φ. Then z(α+ϵ)>0 since α∈Dmax,J. Noticing that z(α+w−1(α))<0, we deduce that z(w−1(α)−ϵ)=z(α+w−1(α))−z(α+ϵ)<0. So w−1(α)−ϵ∈D and (4’) follows.
3.2.
Now we assume D′=Ξ(λ,μ)∩z−1(Φ−)=∅. Let D1={α∈\SS0;z(α)<0}⊆\SS0−J and D2={β∈\SS0;⟨μ,β⟩=−1}. Then D1=∅ since z is nontrivial. Moreover, D1∩D2⊆D′=∅. Let α∈D1. We have μ+α∨⩽λ by Lemma 2.2. If μ+α∨ is weakly dominant, then μ+α∨⪯λ (by Lemma 1.7) and hence ∅=D1⊆D′, a contradiction. Thus μ+α∨ is not weakly dominant. In particular, by [17, Lemma 6.5] and that μ is weakly dominant, μ is not dominant and hence D2=∅. Let α∈D1 and β∈D2 such that dist(α,β)=dist(D1,D2) (see the end of §1.4). Therefore, one of (1), (2) and (3) in Lemma 3.1 occurs. By the choices of α and β, we have ⟨μ,δj⟩⩾0 for 2⩽j⩽m−1 and z(ξ1),z(ξ2),z(ϵ)>0.
If Lemma 3.1(1) occurs, set θ=δm+⋯+δ1, n=m and ηj=δj for 1⩽j⩽m. If Lemma 3.1(2) occurs, set θ=δm+⋯+δ1+ξ1+ξ2+β, n=m+3, (η1,η2,η3)=(β,ξ1,ξ2) and ηj+3=δj for 1⩽j⩽m. If Lemma 3.1(3) occurs, set θ=δm+⋯+δ1+2ϵ+ξ1+ξ2+β, n=m+5, (η1,η2,η3,η4,η5)=(β,ϵ,ξ1,ξ2,ϵ) and ηj+5=δj for 1⩽j⩽m. Then z(ηi)>0 for 1⩽i⩽n−1. In all cases, we have sηi⋯sηn−1(ηn)=ηn+⋯+ηi for 1⩽i⩽n. Moreover, by Lemma 3.1 one checks directly that μ+α∨→+μ+θ∨ (see §1.4). Combining Lemma 1.7 with Lemma 3.1, we deduce that μ+θ∨⩽λ and hence μ+θ∨⪯λ. In particular, z(θ)>0 since D′=∅. Let 1⩽i0⩽n−1 be the minimal integer such that
[TABLE]
Set δ=ηn+⋯+ηi0+1∈Φ+. By exchanging ξ1 and ξ2 in Lemma 3.1 if necessary, we may and do further assume that
(∗) in Lemma 3.1 (3) (resp. Lemma 3.1 (2)), z(δ+ηi0),z(δ+ηi0−1)>0 if i0=4 (resp. if i0=3).
Let γ∈Φ+ be a maximal WJ-conjugate of δ such that γ⩾Jδ and z(γ)<0 (or equivalently, zsγ≤z). By Lemma 1.6, we have zsγ∈W0J.
For ϕ∈ZΦ (resp. u∈W0) we denote by supp(ϕ) (resp. supp(u)) the unique minimal subset E⊆\SS0 such that ϕ∈ZΦE (resp. u∈WE). Notice that supp(ϕ) is a connected subset of \SS0 if ϕ is a root.
Lemma 3.3**.**
We have the following properties:
(a) ηi0∈/supp(γ−δ);
(b) ⟨ηi∨,γ⟩=⟨ηi∨,δ⟩ for 1⩽i⩽i0.
As a consequence, sηi⋯sηi0(γ)=γ+ηi0+⋯+ηi for 1⩽i⩽i0.
Proof.
Since z(γ)<0, δ⩽Jγ and z(δ+ηi0)>0, we have ηi0∈/supp(γ−δ) and (a) follows. Moreover, ⟨ηi0,γ⟩⩽⟨ηi0,δ⟩=−1. Since ηi0=−γ and Φ is simply laced, we have
(c) ⟨ηi0∨,γ⟩=−1=⟨ηi0∨,δ⟩.
Case(1): ηi∈/supp(δ) for 1⩽i⩽i0. Then by (a) we have ηi0∈/supp(γ). Thus supp(γ), which is connected, lies in the connected component of \SS0−{ηi0} containing supp(δ). Noticing that {ηi0,…,η1} is connected and ηi0 is a neighbor of supp(δ), we deduce (by the requirement of Case(1)) that either ηi=ηi0 or ηi and supp(δ) are in different connected components of \SS0−{ηi0}. By (c), we only need to consider the latter case, where we have ⟨ηi∨,γ⟩=0=⟨ηi∨,δ⟩ and (b) is proved.
Case(2): Case(1) fails. So either (2) or (3) in Lemma 3.1 occurs. Without loss of generality, we assume the latter case occurs and hence 1⩽i0⩽5. By (c), we can assume further 2⩽i0⩽5. We claim γ⩾Jδ is elementary (i.e. a sum of distinct simple roots) and supp(γ−δ)⊆\SS0−supp(δ) is disconnected to ηi (for 1⩽i⩽i0). This will prove (b). If i0∈{3,5}, by (a) we have ηi0∈/supp(γ), which means supp(γ) lies in the connected component of \SS0−{ηi0} and hence is of type A. If i0=4, by (∗) and (a) we have ξ1,ξ2∈/supp(γ). So supp(γ) lies in the connected component of \SS0−{ξ1,ξ2}, which is of type A. If i0=2, by (a) the coefficient of ϵ=ηi0 in γ is one, which means γ is elementary by Lemma 1.8.
∎
We define zi=zsηi⋯sη1 and zi′=zsγsηi⋯sη1 for 0⩽i⩽i0.
Lemma 3.4**.**
For 1⩽i⩽i0 we have (a) z(ηi),zsγ(ηi)>0 and (b) zi,zi′∈W0J.
Proof.
If ηi∈J, then (a) follows from the observation z,zsγ∈W0J. Now we assume ηi∈/J. If ⟨γ∨,ηi⟩⩾0, we have zsγ(ηi)=z(ηi)−⟨γ∨,ηi⟩z(γ)⩾z(ηi)>0 as desired. If ⟨γ∨,ηi⟩⩽−1, by the equality ⟨γ∨,ηi⟩=⟨δ∨,ηi⟩ in Lemma 3.3, either ηi=ηi0 or ηi=ηi0−1 in the situation of (∗). In any case, we always have zsγ(ηi)=z(γ+ηi)⩾z(δ+ηi)>0 and (a) is proved.
Let ε∈J. One checks that z−1zi(ε)>0 and supp(z−1zi(ε))=supp(sηi⋯sη1(ε))⊆H:=J∪{ηj;1⩽j⩽i0}. By (a), we have zsγ(H),z(H)⊆Φ+. So zi(ε)=z(z−1zi(ε)),zi′(ε)=zsγ(z−1zi(ε))>0 and (b) is proved.
∎
Lemma 3.5**.**
Let 1⩽i⩽i0. Then one of the following fails:
(1) ⟨zi−1′(μ),zsγ(ηi)⟩=0;
(2) zi−1′wzi−1′−1(zsγ(ηi))<0;
(3) zsγ(ηi)+zi−1′wzi−1′−1(zsγ(ηi))∈Φ.
Similar result holds if we replace the pair (zi′,zsγ) with (zi,z). In particular, zsγ(ηi) and z(ηi) are zi−1′w~zi−1′−1-permissible and zi−1w~zi−1−1-permissible respectively.
Proof.
Let Hi={η1,…,ηi} and H=J∪Hi0. Assume (2) holds. Then
[TABLE]
Since supp(sηi−1⋯sη1wsη1⋯sηi−1(ηi))⊆H and zsγ∈W0H (see Lemma 3.4), we have sηi−1⋯sη1wsη1⋯sηi−1(ηi)<0. Noticing that
[TABLE]
we deduce that wsη1⋯sηi−1(ηi)>0, which together with
[TABLE]
implies that supp(wsη1⋯sηi−1(ηi))⊆Hi−1.
Assume Lemma 3.1(1) occurs. Then Hi is of type A. However, the coefficient of β in sη1⋯sηi−1(ηi)+wsη1⋯sηi−1(ηi)∈ZHi is 2. So (3) fails.
Assume Lemma 3.1(3) (resp. Lemma 3.1(2)) occurs. If 1⩽i⩽6 (resp. 1⩽i⩽4), then ⟨zi−1′(μ),zsγ(ηi)⟩=⟨μ,β⟩=−1 and (1) fails. Otherwise, the coefficient of β in sη1⋯sηi−1(ηi) is 2. Hence the coefficient of β in sη1⋯sηi−1(ηi)+wsη1⋯sηi−1(ηi)∈ZHi is 4. Therefore, (3) fails since Hi is of type D.
The “In particular” part follows from Lemma 2.12.
∎
Now we are ready to prove Proposition 2.10 under the assumption Ξ(λ,μ)∩z−1(Φ+)=∅.
By Lemma 3.4, we have zi,zi′∈W0J and z(ηi),zsγ(ηi)>0 for 1⩽i⩽i0. We show that
(a) zi−1⟷z(ηi)zi and zi−1′⟷zsγ(ηi)zi′ for 1⩽i⩽i0.
To this end, by Lemma 3.5 and Corollary 2.4, it remains to show
(a1) szsγ(ηi)zi−1′w~zi−1′−1,sz(ηi)zi−1w~zi−1−1∈Adm(λ).
For 1⩽i⩽n, we set
[TABLE]
By Corollary 2.4, to verify (a1), it suffices to show μ+(θi)J∨⪯λ for 1⩽i⩽i0. We only deal with the case when Lemma 3.1(3) occurs, other cases can be handled similarly. First we show μ+θi∨⪯λ for i⩾7, in which case θi=ηi+⋯+η1. Indeed, if i=n=m+5, then μ+θi∨=μ+θ∨⪯λ. Assuming μ+θi+1∨⪯λ with i⩾7, we show μ+θi∨⪯λ. Noticing that ⟨μ+θi+1∨,ηi+1⟩=⟨μ,ηi+1⟩+1⩾1 if i⩾7, we have μ+θi∨=μ+θi+1∨−ηi+1∨⪯μ+θi+1∨⪯λ as desired. If 1⩽i⩽6, one checks that ⟨μ,θi⟩=−1 and hence μ+θi∨⪯μ⪯λ as desired. Therefore, (a1) and hence (a) are proved.
Then we show that
(b) zi0⟷−z(γ)zi0′.
Again by Corollary 2.4 we need to show
(b1) sz(γ)zi0w~zi0−1,zi0w~zi0−1sz(γ)∈Adm(λ).
By Lemma 3.3,
[TABLE]
So zi0−1(z(γ))−θ=γ−δ∈ZΦJ and zi0−1z(γ) is a WJ-conjugate of θ (see Lemma 1.5). Now (b1) follows from Corollary 2.4 since μ+θ∨⪯λ.
Set ϑ=(sη2⋯sηi0(γ))J. If Lemma 3.1(1) occurs, supp(ϑ)∈J∪{δm,…,δ2}. If Lemma 3.1(2) or (3) occurs, δ1+⋯+δm⩽ϑ (since α=δm and β=δ1 are contained in supp(ϑ)) and the coefficient of β in ϑ is one. Then ⟨μ,ϑ⟩⩾0 in all cases. Since wsη2⋯sηi0(γ)⩾Jϑ, we have
[TABLE]
Moreover, by Lemma 2.3, ⟨μ,w(β)⟩=⟨μ,wJ(β)⟩⩾1 since wJ(β)∈Φ+−ΦJνw~ is J-dominant. Therefore,
[TABLE]
that is, ⟨zi0(μ),zi0wzi0−1(−z(γ))⟩=−⟨μ,wzi0−1z(γ)⟩⩽−1. By Lemma 2.12, −z(γ) is zi0w~zi0−1-permissible and (b) follows.
Combining (a) with (b) we deduce z=z0↔z0′=zsγ, which finishes the proof of Proposition 2.10 (for simply laced Dynkin diagrams).
4. Non-simply laced Dyndin diagrams except G2
In this section, we show Proposition 2.10 holds if the connected Dynkin diagram \SS0 of Φ is non-simply laced but not of type G2. Since G is semisimple, there exists a simply laced Dynkin diagram \SS0′ (of type A2k+1 or Dk or E6) equipped with a nontrivial diagram involution ι such that the extended affine Weyl group W~ associated to Φ is a subgroup of the ι-fixed point subgroup of W~′=P′⋊W0′. Here P′ (resp. W0′) denotes the coweight lattice (resp. Weyl group) of the root system Φ′ of \SS0′. For α∈Φ′ we set α=(α+ι(α))/2. Then Φ={α;α∈Φ′}. Denote by rα=sα∈W0 the corresponding reflection of α. Notice that ⟨α,ι(α)⟩=0 if α=ι(α).
Lemma 4.1**.**
The Bruhat order on (W~′,\SS0′) restricts to the Bruhat order on (W~,\SS0).
For D⊆Φ′ we set Dι={δ∈D;ι(δ)=δ}.
Lemma 4.2**.**
There are exactly two connected components of \SS0′−(\SS0′)ι. Moreover, ι exchanges these two connected components.
Let λ,w~,μ,J,w be as in Section 2. Let J′={α∈\SS0′;α∈J}. Then μ=ι(μ) is J′-dominant, J′-minuscule and weakly dominant for Φ′. In particular, w~∈ΩJ′. Fix 1=z∈W0J, that is, 1=z=ι(z)∈W0′J′.
Let χ=∑α∈\SS0′cαα and χ′=∑α∈\SS0′cα′α with cα,cα′∈Z. We define χ′∧χ=∑α∈\SS0′min{cα,cα′}α.
Lemma 4.3**.**
Let γ∈Φ′+−ΦJ′′ such that γ−ι(γ)∈ZΦJ′′. Then γ∧ι(γ),γ−γ∧ι(γ)∈Φ′+∪{0}. Moreover, if γ=ι(γ) and ⟨δ∨,γ⟩=⟨δ∨,ι(γ)⟩=−1 for some δ∈ΦJ′′, then δ=ι(δ) and ⟨δ,γ∧ι(γ)⟩=−1.
Proof.
We argue by induction on the height of γ. If γ is J′-antidominant, then so is ι(γ), which means γ=ι(γ) since γ−ι(γ)∈ZΦJ′′. Assume γ is not J′-antidominant. Then there exists α∈J′ such that γ′=γ−α∈Φ′+. Let ξ′=γ′∧ι(γ′). If γ′=ι(γ′), the statement follows easily. Now we assume γ′=ι(γ′). By induction hypothesis, γ′=ξ′+ε′ for some ε′∈ΦJ′′+. Noticing that ⟨γ′∨,ε′⟩=−⟨γ′∨,α⟩=1 we have α=ε′ and either ⟨α∨,ε′⟩=−1 or ⟨α∨,ξ′⟩=−1.
Case(1): α=ι(α). If ⟨α∨,ε′⟩=⟨α∨,ι(ε′)⟩=−1, then ⟨α∨,ξ′⟩=0 and hence ⟨α∨,ξ′+ε′+ι(ε′)⟩=−2, which is a contradiction since Φ′ is simply laced. So ⟨α∨,ξ′⟩=−1 and γ∧ι(γ)=ξ′+α as desired.
Case(2): α=ι(α). If ⟨α∨,ξ′⟩=0, then ⟨α∨,ε′⟩=−1. By definition supp(ε′)⊆\SS0′−(\SS0′)ι. Thus supp(α+ε′) (which is connected) lies in a connected component of \SS0′−(\SS0′)ι. By Lemma 4.2, we have supp(α+ε′)∩supp(ι(α+ε′))=∅ and hence γ∧ι(γ)=ξ′ as desired. Assume ⟨α∨,ξ′⟩=−1. Then ⟨α∨,ε′⟩=0. If ⟨α∨,ι(ε′)⟩=0, then ⟨α+ξ′+ε′,ι(α+ξ′+ε′)⟩=−2, which is impossible. So ⟨α∨,ι(ε′)⟩⩾1. Then ε′−ι(α)∈ΦJ′′+∪{0} (since α is a simple root) and γ=α+ξ′+ι(α)+(ε′−ι(α)), which means γ∧ι(γ)=α+ξ′+ι(α) as desired.
Finally we show the “Moreover” part. Set ξ=γ∧ι(γ)∈Φ′+−ΦJ′′. Since γ=ι(γ), γ=ξ+ε for some ε∈ΦJ′′+ with ε=ι(ε). If ⟨δ∨,ξ⟩⩾1, then ⟨δ∨,ε⟩=⟨δ∨,ι(ε)⟩⩽−2, which means −δ=ε=ι(ε) (since Φ′ is simply laced), a contradiction. If ⟨δ∨,ξ⟩=0, then ⟨δ∨,ε⟩=⟨δ∨,ι(ε)⟩=−1 and ⟨δ∨,ξ+ε+ι(ε)⟩=−2 which is again impossible. Thus ⟨δ∨,ξ⟩=−1 and ⟨δ∨,ε⟩=⟨δ∨,ι(ε)⟩=0. It remains to show δ=ι(δ). Assume otherwise. Then both ξ+δ+ι(δ) and ξ+ε+ι(ε) are positive roots and ⟨ξ+δ+ι(δ),ξ+ε+ι(ε)⟩=−2, a contradiction. Therefore, δ=ι(δ) and the proof is finished.
∎
For ϕ∈ZΦ′−ZΦJ′′ we define
[TABLE]
If Aϕ=∅, by Lemma 1.5, Aϕ contains a unique J′-antidominant root, which we denoted by ϑϕ. If ϕ−ι(ϕ)∈ZΦJ′′, then Aϕι=∅ if and only if Aϕ=∅.
Lemma 4.4**.**
We have the following properties:
(1) If Aϕι=∅, then zsγ,zrγ∈W0′J′ for γ∈(Aϕ)max,J′ satisfying γ∧ι(γ)∈(Aϕι)max,J′.
(2) If Aϕ+ι(ϕ)=∅, then zsγ,zrγ∈W0′J′ for γ∈(Aϕ)max,J′.
Proof.
First we have zsγ∈W0′J′ by Lemma 1.6.
(1) Set γ0=γ∧ι(γ)∈(Aϕι)max,J′. By Lemma 4.3, γ=γ0+ε for some ε∈ΦJ′′+∪{0}. It remains to show zrγ∈W0′J′. If it is false, then γ=ι(γ) and zrγ(δ)<0 for some δ∈J′. Since zsγ,zsι(γ)∈W0′J′ and z(γ),z(ι(γ))<0, we have ⟨δ∨,γ⟩=⟨δ∨,ι(γ)⟩=−1. By Lemma 4.3, ⟨δ,γ0⟩=−1 and δ=ι(δ). Due to the choice of γ0, we have zsδ(γ0)=z(γ0+δ)>0 and zrε(γ0)=z(γ0+ε+ι(ε))>0. Thus
[TABLE]
which is a contradiction.
(2) Assume Aϕ+ι(ϕ)=∅. As in (1) above, if zrγ∈/W0′J′, then γ=ι(γ) and there exists δ∈ΦJ′′+ such that zrγ(δ)=z(δ+γ+ι(γ))<0, that is, δ+γ+ι(γ)∈Aϕ+ι(ϕ). This is a contradiction.
∎
4.1.
Define D={η∈\SS0′;z(η)<0}⊆\SS0′−J′ and E={η∈D;dist(η,ι(η))=d}, where d=min{dist(η,ι(η));η∈D}. We choose α∈E such that ⟨μ,α⟩⩽⟨μ,η⟩ for any η∈E. Let α=δ1,δ2,…,δm=ι(α) be a geodesic in \SS0′, where m is a positive odd integer. Set θ=δ1+⋯+δm and k0=(m+1)/2. By the choice of α, we have z(δi)>0 for 2⩽i⩽m−1.
Lemma 4.5**.**
One of the following cases occurs:
(1) α=ι(α) and ⟨μ,θ′⟩⩾0 with θ′=θ−α−ι(α). Moreover, μ+α∨+ι(α∨)⪯λ (resp. μ+θ∨⪯λ) if ⟨μ,θ′⟩⩾1 (resp. ⟨μ,θ′⟩=0);
(2) α=ι(α) and μ+α∨⪯λ;
(3) \SS0′ is of type E6, α=α2, ⟨μ,α4⟩=−1 and μ+α∨+α4∨⪯λ;
(4) \SS0′ is of type Dn, {α,ι(α)}={αn−1,αn} with ⟨μ,α⟩⩾0, ⟨μ,αn−2⟩=−⟨μ,αn−d⟩=1 with 3⩽d⩽n−2, αn−2,αi∈J, ⟨μ,αi⟩=0 for n−d+1⩽i⩽n−3. Moreover, μ+α∨+ι(α∨)+αn−2∨+⋯+αn−d∨⪯λ.
The proof is given in §A.2.
Lemma 4.6**.**
If α=ι(α) and Aα+ι(α)=∅, then supp(γ)⊆\SS0−(\SS0′)ι for γ∈Aα. In particular, there exists u∈WJ′−(\SS0′)ι such that u=ι(u) and u(α)=γ.
Proof.
Recall k0=(m+1)/2 and δk0=ι(δk0). One checks (by the type of \SS0′) that ι exchanges the two connected components of \SS0′−{δk0} which contain α and ι(α) respectively. Thus it suffices to show δk0∈/supp(γ). Assume Otherwise. Then γ⩾δ1+⋯+δk0 (since supp(γ) is connected) and hence δ2,…,δk0∈J′. Thus z(δ1+⋯+δk0)<0 and z(ι(δ1+⋯+δk0−1))=ι(z(δ1+⋯+δk0−1))<0. Therefore, z(θ)=z(δ1+⋯+δk0+ι(δ1+⋯+δk0−1))<0, that is, θ∈Aα+ι(α)=∅, a contradiction. So γ=y(α) for some y∈WJ′ whose support supp(y) lies in the connected component of \SS0′−(\SS0′)ι containing α. Set u=yι(y)=ι(y)y. Then u=ι(u) and u(α)=γ as desired.
∎
Lemma 4.7**.**
Let γ be as in Lemma 4.4 (1). If μ+γJ′∨⪯λ, then zw~rγz−1∈Adm(λ). Here Adm(λ) is defined with respect to \SS0.
Proof.
If γ=ι(γ), then γ∈Φ and γJ=γJ′. By Corollary 2.4, we have zw~rγz−1=zw~sγz−1∈Adm(λ). Assume γ=ι(γ). Set ζ=γ∧ι(γ)∈Φ′+ and ε=γ−ζ∈ΦJ′′+ (see Lemma 4.3). Then z(ζ+ε+ι(ε))>0 by the maximality of γ with respect to ⩽J′. Since ι(ζ)=ζ and ι(γJ′)=γJ′, there exists u∈WJ such that u−1(ζ)=γJ′. Since u(μ) is weakly dominant, one of the follows three cases occurs:
Case(1): ⟨u(μ),ζ+ε+ι(ε)⟩⩾1. Then
[TABLE]
as desired, where the last inequality follows from Lemma 2.4 since w~≤Jtu(μ)rε.
Case(2): ⟨u(μ),ζ+ε+ι(ε)⟩⩽0 and ⟨u(μ),ζ+ε⟩=⟨u(μ),ζ+ι(ε)⟩⩾0. Then we have
[TABLE]
as desired.
Case(3): ⟨u(μ),γ⟩=−1 and ⟨u(μ),ε⟩=⟨u(μ),ι(ε)⟩=0. Then we have tzu(μ)≥tzu(μ)sz(−γ)sz(−ι(γ))≥zw~rγz−1 as desired.
∎
The following lemma is proved in §A.4.
Lemma 4.8**.**
Let ζ∈Φ′+−ΦJ′′ be such that ζJ′=ι(ζJ′) and A2ζ=∅. If ⟨μ,ζJ′⟩=−1 and ⟨μ,ϑ2ζ⟩⩾0, then one of the following fails:
(1) ⟨μ,ζ⟩=⟨μ,w(ζ)⟩=0, that is, ⟨μ,ζ⟩=⟨μ,w(ζ)⟩=0;
(2) ⟨ζ∨,w(ζ)⟩=−1, that is, {⟨ζ∨,w(ζ)⟩,⟨ζ∨,wι(ζ)⟩}={0,−1} if ι(ζ)=ζ and ⟨ζ,w(ζ)⟩=−1 ι(ζ)=ζ. In particular, either ζ+w(ζ) or ζ+wι(ζ) is a root of Φ′.
Now we are ready to prove Proposition 2.10.
Suppose Lemma 4.5 (1) occurs. We set θ′=θ−α−ι(α)∈Φ′+. Then ⟨α∨,θ′⟩=⟨α∨,ι(θ′)⟩=−1. We choose γ∈Φ′+−ΦJ′′ such that z≥zrγ∈W0J and z⟷−z(γ)zrγ as follows.
Case(1): Aα+ι(α)=∅. Let γ∈Aα+ι(α) be as in Lemma 4.4 (1). Then γJ′=θ and θ′∈ΦJ′′+ (since supp(γ) is connected, which means γ⩾θ). Thus ⟨μ+α∨+ι(α∨),θ′⟩=⟨μ,θ′⟩−2⩽−1 (since μ is J′-minuscule) and hence μ+θ∨⪯μ+α∨+ι(α∨). So we always have μ+γJ′∨⪯λ. Then zw~rγz−1∈Adm(λ) follows from Lemma 4.7.
Case(2): Aα+ι(α)=∅ and ⟨μ,θ′⟩=0. Then μ+θ∨⪯λ. If Aθ=∅, let γ∈Aθ be as in Lemma 4.4 (1) (with ϕ=θ). Then zw~rγz−1∈Adm(λ) by Lemma 4.7. Otherwise, we have z(θ)>0. Let γ∈Aα be as in Lemma 4.4 (2) (with ϕ=α). Then zrγ∈W0′J′ since Aα+ι(α)=∅. Let u∈WJ′−(\SS0′)ι be as in Lemma 4.6 such that ι(u)=u and u(α)=γ. Noticing that u(θ′)>0 (since δk0∈supp(θ′)∩(\SS0′)ι), supp(u(θ′))⊆J′∪{δ2,…,δm−1} and z(J′∪{δ2,…,δm−1})⊆Φ′+, we have zu(θ′)>0. Moreover, since μ is weakly dominant, we have ⟨μ,θ⟩=2⟨μ,α⟩+⟨μ,θ′⟩=2⟨μ,α⟩⩾−1, which implies ⟨μ,α⟩⩾0. Therefore,
[TABLE]
where the third inequality follows from the inequality z(γ+u(θ′)+ι(γ))=zu(θ)⩾z(θ)>0 (since θ is J′-antidominant).
Case(3): Aα+ι(α)=∅ and ⟨μ,θ′⟩⩾1. Then μ+α∨+ι(α∨)⪯λ. Let γ∈Aα be as in Lemma 4.4 (2) and let u∈WJ′−\SS0′ι be as in Case(2). We have
[TABLE]
where the first and second inequalities follow from the fact that μ is weakly dominant and that ⟨γ∨,ι(γ)⟩=0.
Thanks to Corollary 2.4, it remains to show −z(γ) is zw~z−1-permissible. Assume otherwise. By Lemma 2.12 (1), ⟨μ,γ⟩=⟨μ,w(γ)⟩=0. If ⟨μ,γJ′⟩=0, then w(γ)⩽J′w−1w(γ)=γ (see Lemma 2.5) and zw(γ)⩽z(γ)<0, which contradicts Lemma 2.12 (2). So ⟨μ,γJ′⟩=−1. We claim that
(i) γ∈Aθ and hence γJ′=θ.
Assume otherwise. If Aα+ι(α)=∅, then γ∈Aα+ι(α)=Aθ, a contradiction. So Aα+ι(α)=∅ and γ∈Aα. By Lemma 2.12 (3), z(γ+w(γ))∈Φ−, which implies either z(γ+wι(γ)) or z(γ+w(γ)) lies in Φ′−. In the former case we have γ+wι(γ)∈Aα+ι(α), a contradiction. So z(γ+w(γ))∈Φ′−. Since the coefficient of α in γ+w(γ)∈Φ′ is 2, we see that \SS0′ is of type E6, α∈{α3,α5} and δk0=α4. If δk0∈/supp(γ+w(γ)), then supp(γ+w(γ))⊆\SS0′−{δk0} is of type A, which is impossible. So δk0∈supp(γ+w(α)) and γ+w(γ)⩾J′2α+δk0. Then we have
[TABLE]
and hence α+δk0+ι(α)∈Aα+ι(α), a contradiction. Therefore, (i) is proved.
Again, since either z(γ+wι(γ)) or z(γ+w(γ)) lies in Φ′−, by (i) we have A2γ=∅, which means \SS0′ is of type E6, α∈{α3,α5}. Since ⟨μ,γJ′⟩=−1, α∈/J′ and νw~ is dominant, we have J′=\SS0′−{α3,α5} and μ=ω1∨−ω3∨+ω4∨−ω5∨+ω6∨. Then ϑ2γ=α1+α2+α6+2(α3+α4+α5) and ⟨μ,ϑ2γ⟩=0. By Lemma 4.8 and Lemma 2.12, −z(γ) is zw~z−1-permissible, a contradiction.
Suppose Lemma 4.5 (2) occurs. If A2α=∅ and ⟨μ,ϑ2α⟩=−1, let γ∈A2α be as in Lemma 4.4 (1). Otherwise, let γ∈Aα be as in Lemma 4.4 (1). We show z⟷−z(γ)zrγ. First note that μ+γJ′∨⪯λ. So zw~rγz−1∈Adm(λ) by Lemma 4.7. It remains to show −z(γ) is zw~z−1-permissible. Assume otherwise. As in the above case, we deduce that ⟨μ,γJ′⟩=−1 and that either z(γ+w(γ)) or z(γ+wι(γ)) lies in Φ′−. If γ∈A2α, then the coefficient of α in γ+w(γ) is 4, which is impossible. If γ∈Aα, then A2α=∅. So ⟨μ,ϑ2α⟩⩾0 by our construction of γ. Thanks to Lemma 4.8 and Lemma 2.12, −z(γ) is zw~z−1-permissible, a contradiction.
Suppose Lemma 4.5 (3) occurs. Then μ+α∨+α4∨⪯λ. By the choice of α, we have z(α4)>0 and hence zrα4∈W0′J′. If z(α+α4)>0, then zrαrα4=zsαsα4∈W0′J′. Similarly as in §3.2, we have
[TABLE]
as desired. If z(α+α4)<0, let γ∈Aα+α4 be as in Lemma 4.4. We show z⟷−z(γ)zrγ. Indeed, thanks to Lemma 2.4 and Lemma 4.7, it remains to show −z(γ) is zw~z−1-permissible. Note that the coefficients of α and α4 in either γ+wι(γ) or γ+w(γ) are always 2 and 2. So γ+wι(γ),γ+w(γ)∈/Φ′. Thus γ+w(γ)∈/Φ and the statement follows from Lemma 2.12 (3).
Suppose Lemma 4.5 (4) occurs. We can assume α=αn−1. Set β=αn−d and ηk=αn−d−1+k for 1⩽i⩽d. Set θ=η1+⋯+ηd−1+αn−1+αn. Then μ+θ∨⪯λ. Let 0⩽i0⩽d−1 be the minimal integer such that z(αn+ηd+⋯+ηi0+1)<0.
If i0=0, that is, Aα+ι(α)+β=∅, let γ∈(Aα+ι(α)+β)max,J′. Then ι(γ)=γ (since γ⩾αn−1+αn) and z≥zsγ=zrγ∈(W0′)J′ (see Lemma 1.6). We show that z⟷−z(γ)zsγ. Indeed, by Corollary 2.4, it remains to show −z(γ) is zw~z−1-permissible. Assume otherwise. Then ⟨μ,w(γ)⟩=0 (see Lemma 2.12 (1)). However, γJ′=αn+⋯+αn−d and ⟨μ,γJ′⟩⩾0. Thus ⟨μ,γJ′⟩=0, w(γ)⩽J′w−1w(γ)=γ (see Lemma 2.5) and zw(γ)⩽z(γ)<0, contradicting Lemma 2.12 (2).
Assume i0⩾1. If i0⩽d−2, choose γ∈(Aα+ι(α))max,J′ such that γ⩾J′αn+ηd+⋯+αi0+1. Otherwise, let γ=α=αn−1. By Lemma 1.6, we have zrγ∈W0J. Moreover, zrγ(ηi)=z(ηi)>0 if 1⩽i⩽i0−1, and zrγ(ηi0)=z(γ+ηi0)⩾z(αn+ηd+⋯+ηi0)>0 (by the choice of i0). In a word, z,zrγ∈(W0′)H′ with H′=J′∪{η1,…,ηi0}. We show z↔zrγ. Set zi=zsηi⋯sη1 and zi′=zrγsηi⋯sη1 for 0⩽i⩽i0. Then zi,zi′∈W0′J′ (see Lemma 3.4). Moreover, for 1⩽i⩽i0, (zi−1′)−1(zrγ(ηi))=zi−1−1(z(ηi))=η1+⋯+ηi is conjugate to η1=αn−d under WJ. Since μ+αn−d∨=sαn−d(μ)⪯λ, it follows from Corollary 2.4 that sz(ηi)zi−1w~zi−1−1,szrγ(ηi)zi−1′w~zi−1′−1∈Adm(λ). On the other hand, we have zi−1−1(z(ηi))+wzi−1−1(z(ηi))∈ZΦH′′, in which the coefficient of η1 is two. So zi−1−1(z(ηi))+wzi−1−1(z(ηi))∈/Φ′ (since αn−1,αn∈/H′), that is, z(ηi)+zi−1wzi−1−1(z(ηi))∈/Φ (note that ηi=ηi). By Lemma 2.12, z(ηi) and zrγ(ηi) are zi−1w~zi−1−1-permissible and zi−1′w~zi−1′−1-permissible respectively. Thus z=z0⟷z(η1)⋯⟷z(ηi0)zi0 and zi0′⟷zrγ(ηi0)⋯⟷zsγ(η1)z0′=zrγ. Finally we show zi0⟷−z(γ)zi0′. Note that zi0−1z(γ)=γ+ηi0+⋯+η1. As in §3.2, we have ⟨μ,wzi0−1z(γ)⟩⩾1 and hence −z(γ) is zi0w~zi0−1-permissible. It remains to show zi0w~zi0−1rz(γ)∈Adm(λ). If i0⩽d−2, then γ=ι(γ), and zi0−1z(γ) is conjugate to θ under WJ. Thus the statement follows from Corollary 2.4 (since μ+θ∨⪯λ). If i0=d−1, then γ=α. We set θ′′=η1+⋯+ηd−1. Then ⟨μ,θ′′⟩=0, zi0(θ′′),zi0(θ′′+α)<0 and zi0(θ′′+α+ι(α))>0, one checks that
[TABLE]
The proof is finished.
5. Type G2 root system
In this section, we show that Proposition 2.10 holds if \SS0 is of type G2. Let α and β be the unique simple long root and simple short root respectively. Let λ,μ,J,w~,w be as in Section 2. Fix 1=z∈W0J.
5.1.
Assume J={sα}. Then w~=tμsα, −z(β),z(α)>0, ⟨μ,α⟩=1, ⟨μ,β⟩⩾0 and μ+α∨+β∨⪯λ. Set γ1=β, γ2=α+3β, γ3=α+2β, γ4=2α+3β and γ5=α+β. For 1⩽j⩽i⩽5, we have z(γi)>0 if z(γj)>0. We denote by (Ci) the case that z(γi)<0 and z(γi+1)>0. Assume (Ci) holds, then z≥zsγi∈W0J. By Lemma 2.12 and Corollary 2.4, to show z⟷−z(γi)zsγi, it suffices to prove zw~sγiz−1∈Adm(λ).
Assume (C1) holds. Then
[TABLE]
Assume (C2) holds. Then
[TABLE]
Assume (C3) holds. Then
[TABLE]
Assume (C4) holds. Then
[TABLE]
Assume (C5) holds. Then
[TABLE]
5.2.
Assume J={sβ}. Then w~=tμsβ, z(β),−z(α)>0, ⟨μ,β⟩=1, ⟨μ,α+β⟩⩾0 and μ+α∨⪯λ. Set δ1=α, δ2=α+β, δ3=2α+3β, δ4=α+2β and δ5=α+3β. For 1⩽j⩽i⩽5, we have z(δi)>0 if z(δj)>0. We denote by (Ci′) the case that z(δi)<0 and z(δi+1)>0. Assume (Ci′) holds, then z≥zsδi∈W0J. By Lemma 2.12 and Corollary 2.4, to show z⟷−z(δi)zsδi, it suffices to show zw~sδiz−1∈Adm(λ).
Assume (C1′) holds. Then tz(μ+α∨)≥tz(μ)sz(α)≥zw~sδ1z−1.
Assume (C2′) holds. Then
[TABLE]
Assume (C3′) holds. Then
[TABLE]
Assume (C4′) holds. Then
[TABLE]
Assume (C5′) holds. Then
[TABLE]
5.3.
Assume J=∅. Then w~=tμ, μ is dominant and μ+α∨,μ+α∨+β∨⪯λ. If z(α)<0, then
[TABLE]
and hence z⟷−z(α)zsα. Otherwise, we have z(β)<0. If z(α+3β)<0, then
[TABLE]
and hence z⟷−z(α+3β)zsα+3β. If z(α+3β)>0, then
[TABLE]
and z⟷−z(β)zsβ.
Appendix A
In the appendix, we prove Lemma 3.1, Lemma 4.5, Lemma 3.2 and Lemma 4.8 via a case-by-case analysis on the type of the Dynkin diagram of \SS0 (or \SS0′ in Section 4).
For χ∈Y we define Dχ+={α∈\SS0;⟨χ,α⟩⩾1}, Dχ0={α∈\SS0;⟨χ,α⟩=0} and Dχ−={α∈\SS0;⟨χ,α⟩=−1}. For α,α′∈\SS0 (or \SS0′) we denote by [α,α′] be the subset of simple roots that lie on the geodesic (shortest path) in the Dynkin diagram connecting α′ and α. Set (α,α′)=[α,α′]−{α,α′}. Let’s consider the following condition:
(c) \SS0=Dχ+∪Dχ0∪Dχ−, and (α,α′)∩Dχ+=∅ for any α=α′∈Dχ−.
It is clear that (c) holds if χ is weakly dominant.
Again, we adopt the labeling of Dynkin diagrams by positive integers as in [13]. For i∈Z⩾1 we denote by αi the corresponding simple root. We write αk⊴αk′ if k⩽k′.
Lemma A.1**.**
If (c) holds for χ∈Y, then χ is weakly dominant if one of the following conditions holds:
(1) \SS0 is of type A;
(2) \SS0 is of type Dn, maxDχ+⩾max(Dχ−−{αn−1,αn}) and {αn−1,αn}⊆Dχ−.
Lemma A.2**.**
Let w~,J,μ be as in Section 2. Let α,α′∈\SS0−J with ⟨μ,α′⟩=−1. Then we have
(1) ∑H⟨μ∣H,α′⟩<−1, where H ranges over connected components of J, and μ∣H∈RΦH∨ denotes the restriction of μ to RΦH;
(2) (α,α′)∩Dμ+=∅ if either (i) \SS0 is of type D and α,α′∈\SS0−{αn−1,αn} or (ii) \SS0 is of type A.
Proof.
Notice that α′∈\SS0−Jνw~ and νw~=prJ(μ)=μ−∑Hμ∣H. Therefore, we have
[TABLE]
as desired.
Under the condition of (2), one checks that ∑H;H⊆(α,α′)⟨μ∣H,α′⟩⩾−1. Thus, by (1) there exists a connected component H′⊆(α,α′) of J such that ⟨μ∣H′,α′⟩<0. So ∅=H′∩Dμ+⊆(α,α′)∩Dμ+ as desired.
∎
Lemma A.3**.**
Assume \SS0 is simply laced. Let χ∈Y and α∈\SS0 such that (c) holds for χ, and (α,α′)∩Dχ−=∅ for any α′∈Dχ−. Then (c) holds for χ+α∨.
A.1.
We prove Lemma 3.1. First note that (c) holds for μ since μ is weakly dominant.
Case(1): \SS0 is of type A. We show μ+α∨ is weakly dominant. By Lemma A.1, it suffices to show (c) holds for μ+α∨. Since (c) holds for μ, by Lemma A.3, it remains to show (α,α′)∩Dμ+=∅ for α′∈Dμ−, which follows from Lemma A.2 (2).
Case(2): \SS0 is of type Dn. Thanks to Lemma A.2 (1), one checks that {αn−1,αn}⊆Dμ− and the following two statements hold.
(a1) if one of αn−1 and αn, say αn, belongs to Dμ−, then there exists k⩽n−2 such that ⟨μ,αk⟩=1 and αk−1,…,αn−1∈J;
(a2) if {αn−1,αn}∩Dμ−=∅, then maxDμ+>maxDμ−.
Case(2.1): (a1) occurs. Then α=αi with i⩽k−2. We show θ+α∨ is weakly dominant. By Lemma A.1, it suffices to show (c) holds for μ+α∨. Applying Lemma A.3, it remains to show (α,α′)∩Dμ+=∅ for each α′∈Dμ−. If α′=αn, we have αk∈(α,α′)∩Dμ+ as desired. Otherwise, α′=αj with j⩽k−2 and the statement follows from Lemma A.2 (2).
Case(2.2): (a2) occurs. We can assume α=αi with i=n−1.
Case(2.2.1): i<maxDμ+. We show μ+α∨ is weakly dominant. Again Lemma A.1 (2) holds for μ+α∨. It suffices to show (c) holds for μ+α∨. Since {αn−1,αn}∩Dμ−=∅, this follows from Lemma A.3.
Case(2.2.2): maxDμ+⩽i⩽n−2. We show μ+α∨ is weakly dominant. Indeed, one checks that μ+α∨↣+μ′:=μ+α∨+αi+1∨+⋯+αn−1∨+αn∨. By Lemma 1.7, it suffices to show μ′ is weakly dominant. By Lemma A.1, it suffices to show (c) holds for μ′, which follows directly by Lemma A.2 (2) and the observation that Dμ′−⊆{αi−1,αn−2}∪Dμ− and Dμ′⊇({αn,αn−1}∪Dμ+)−{αi−1,αn−2}.
Case(2.2.3): i=n. Suppose first that there exists 1⩽j⩽n−1 such that ⟨μ,αj⟩=−1 and (αj,α)∩Dμ+=∅. By Lemma A.2 (1) and the fact α∈/J, we have j⩽n−2, ⟨μ,αn−1⟩=1 and αj+1,⋯,αn−1∈J. Thus μ+α∨→+μ′:=μ+α∨+αn−2∨+⋯+αj∨. We show μ′ is weakly dominant (and hence Lemma 3.1 (1) holds). Since αn∈Dμ′+, by Lemma A.1 it suffices to show (c) holds for μ′, which can be proved similarly as in Case(2.2.2). Now suppose (α′,α)∩Dμ+=∅ for any α′∈Dμ−. We show μ+α∨ is weakly dominant. To this end, we have ⟨μ+α∨,αn⟩⩾2 and (c) holds for μ+α∨ by Lemma A.2 and Lemma A.3. The statement now follows from Lemma A.1.
Case(3): \SS0 is of type En with n∈{6,7,8}. Let’s consider the forgetful map f which associates to each quintuple (Jνw~,μ,J,α,β) in Lemma 3.1 the quadruple (Jνw~,μ∣νw~,α,β). It can be easily verified that the image of f is a finite set. Let c be the fiber of f containing (Jνw~,μ,J,α,β). Then there exists a unique quintuple (Jνw~,μc,J,α,β) in c, such that for each (Jνw~,μ′,J,α,β) in c, μ′−μc is a nonnegative linear combination of fundamental coweights.
By a case by case analysis on finitely many c’s, we verified Lemma 3.1 holds for each (Jνw~,μc,J,α,β). Now we show it also holds for (Jνw~,μ,J,α,β) in c.
Case(3.1): (Jνw~,μc,J,α,β) falls in the case Lemma 3.1 (3). Then so does (Jνw~,μ,J,α,β). With (Jνw~,J,α,β) as in Lemma 3.1 (3) and μ∣νw~=μc∣νw~, it can be easily checked that μ=ω1∨−ω5∨+ω6∨+kω8∨ for some k∈Z⩾0. Moreover, with some simple calculations, we can deduce that μ+α∨ is not weakly dominant, and that ∑k=2m−1⟨μ,δk⟩=1. Furthermore, since μc+δm∨+⋯+δ1∨+2ϵ∨+ξ1∨+ξ2∨+β∨ is weakly dominant, it follows that μ+δm∨+⋯+δ1∨+2ϵ∨+ξ1∨+ξ2∨+β∨ is weakly dominant, where ϵ=α4 and {ξ1,ξ2}={α2,α3}. So (Jνw~,μ,J,α,β) falls in the case Lemma 3.1 (3).
Case(3.2): (Jνw~,μc,J,α,β) falls in the case Lemma 3.1 (2). Then so does (Jνw~,μ,J,α,β). The proof is similar as in Case(3.1).
Case(3.3): (Jνw~,μc,J,α,β) does not fall in the case Lemma 3.1 (2) or (3). If μc+α∨ is weakly dominant, then so is μ+α∨ and the proposition follows. Assume μc+α∨ is not weakly dominant. Then μc+δm∨+⋯+δ1∨ is weakly dominant and hence so is μ+δm∨+⋯+δ1∨. If ∑i=2m−1⟨μ,δ⟩=0, the proposition follows either μ+α∨ is or is not weakly dominant. Otherwise, by ∑i=2m−1⟨μ,δ⟩⩾1 and ⟨μ,δi⟩⩾0 for 2⩽i⩽m−1, we have μ+δm∨+⋯+δ1∨→−μ+α∨. By Lemma 1.7(4), μ+α∨ is weakly dominant and the proposition follows.
A.2.
We prove Lemma 4.5. Again notice that μ is weakly dominant for Φ and hence for Φ′. Moreover, μ+α∨⩽λ by Lemma 2.2.
Case(1): \SS0′ is of type An with n odd. Then ι(αk)=αn+1−k for 1⩽k⩽n. If α=α(n+1)/2, then ι(α)=α and μ+α∨=μ+α∨⩽λ. Similarly as in Case(1) of §A.1, we have μ+α∨⪯λ as desired.
Assume α=αi with 1⩽i⩽(n−1)/2. If (α,ι(α))∩Dμ+=∅, we show (α,ι(α))∩Dμ−=∅ and hence (α,ι(α))⊆Dμ0. Indeed, if (α,ι(α))∩Dμ−=∅, by Lemma A.2 (2) we have (α,α′)∩Dμ+=∅ for each α′∈(α,ι(α))∩Dμ−, a contradiction. Thus we have μ+α∨=μ+αi∨+αn+1−i∨→+μ′:=μ+αi∨+⋯+αn+1−i∨. We show μ′ is weakly dominant and hence μ′⪯λ (see Lemma 1.7). By Lemma A.1, it suffices to show (c) holds for μ′. Notice that Dμ′−⊆Dμ−∪{αi−1,αn+2−i} and Dμ′+⊇(Dμ+∪{αi,αn+1−i})−{αi−1,αn+2−i}. The statement now follows from Lemma A.2 (2). If (α,ι(α))∩Dμ+=∅, we show μ+α∨=μ+α∨+ι(α∨) is weakly dominant. Again it suffices to verify (c) holds for μ+α∨. By Lemma A.3, it remains to show (α,α′)∩Dμ+=∅ for α′∈Dμ−∪{ι(α)}. Indeed, if α′=ι(α), the statement follows from our assumption. Otherwise, the statement follows from Lemma A.2 (2). Moreover, by Lemma A.2 (2), we have ∣(α,ι(α))∩Dμ−∣<∣(α,ι(α))∩Dμ+∣ and hence ∑k=i+1n−i⟨μ,αk⟩⩾1 as desired (see Lemma 4.5 (1)).
Case(2): \SS0′ is of type Dn. Then ι fixes αk for 1⩽k⩽n−2 and exchanges αn−1 and αn. Since J′=ι(J′), by Lemma A.2 (1) we have αn−1,αn∈\SS0′−Dμ− and maxDμ+⩾maxDμ−. If α=αi with 1⩽i⩽n−2, then we have μ+α∨=μ+α∨⪯λ as in Case(2) of §A.1. Now we assume α=αn. Since αn−1,αn∈\SS0′−J′, ⟨μ,αn−2⟩⩾0 by Lemma A.2 (1).
Case(2.1): there exits αj∈Dμ− such that (αj+1,αn−2)∩Dμ+=∅. By Lemma A.2 (1), we have [αj+1,αn−3]⊆Dμ0∩J, αn−2∈J and ⟨μ,αn−2⟩=1. Thus μ+α∨+ι(α∨)→+μ′:=μ+α∨+ι(α∨)+αn−2∨+⋯+αj∨. We show μ′⪯λ. By Lemma 1.7, it suffices to show
μ′ is weakly dominant. Since αn−1,αn∈Dμ′+, by Lemma A.1 it remains to verify (c) for μ′. Notice that Dμ′−⊆(Dμ−∪{αj−1})−{αj} and Dμ′+⊇(Dμ+∪{αn−1,αn})−{αn−2,αj−1}. The statement follows from A.2 (2).
Case(2.2): (α′,αn−2)∩Dμ+=∅ for any α′∈Dμ−. We set μ′=μ+α∨+ι(α∨) if ⟨μ,αn−2⟩⩾1 and μ′=μ+α∨+ι(α∨)+αn−2∨ otherwise. We need to show μ′ is weakly dominant. Since αn−1,αn∈Dμ′+, by Lemma A.1, it suffices to verify (c) holds for μ′, which follows similarly as in Case(2.1).
Case(3): \SS0′ is of type E6. Assume α=ι(α)=α2. If μ is dominant or ⟨μ,α⟩=−1, then μ+α∨ is weakly dominant and hence μ+α∨⪯λ. Otherwise, by Lemma A.2 and the observation μ=ι(μ), we have −⟨μ,α4⟩=⟨μ,α3⟩=⟨μ,α5⟩=1 and J′=\SS0′−{α2,α4}. Then μ+α∨→+μ′=μ+α∨+α4∨ and μ′ is dominant. Therefore, μ′⪯λ as desired. Assume α=ι(α)=α4. Then either ⟨μ,α⟩=1 or μ is dominant by Lemma A.2, which means μ+α∨ is weakly dominant as desired. Assume α=α3. By Lemma A.2, either μ is dominant or −1=⟨μ,α⟩=−1=⟨μ,α1⟩=⟨μ,α4⟩=1. Then one checks Lemma 4.5 (4) holds. Assume α=α1. By Lemma A.2, ⟨μ,αi⟩⩾0 for i∈{1,2,3}. Moreover, ⟨μ,α3⟩=⟨μ,α2⟩=1 if ⟨μ,α4⟩=−1. Then one checks Lemma 4.5 (4) holds. Therefore, the proof is finished.
A.3.
We show Lemma 3.2. We assume the five conditions hold for each element of Dmax,J, and show this will lead to a contradiction. First we make some reductions.
Choose η∈D. Let D′′={γ∈D;γ−η∈ZΦJ} and let Φ′′ be the root system spanned by ΦJ and η. Thanks to [3][Proposition 4.2.11], the set of simple roots of Φ′′ is J∪{ηJ}. By definition we have that Dmax,J′′⊆Dmax,J and that w~ is short for Φ′′. Thus by replacing the pair (D,Φ) with (D′′,Φ′′), we can assume that
(i) J=\SS0−{sβ} and D⊆{γ∈Φ;γ−β∈ΦJ} for some β∈\SS0. Moreover, μ, which is J-dominant and J-minuscule, is noncentral on each connected component of J.
By (3’) and (1’) (of Lemma 3.2) we also have
(ii) ⟨μ,β⟩=−1, ϑ2β∈Φ and ⟨μ,ϑ2β⟩=0, where ϑ2β denotes the unique J-antidominant and J-minuscule character in 2β+ZΦJ.
Let γ∈D. Then γ−β∈ZΦJ and we can write γ=β+∑HHγ, where H ranges over the connected components of J and Hγ∈Z⩾0ΦH. By (1’) and (ii), there exits at most one connected component H′ such that ⟨μ,H′γ⟩=1. If this happens, we say γ is of type H′.
Assume \SS0 is of type A. Then α+w(α)∈/Φ for any α∈Dmax,J since the coefficient β in α+w(α) is two, contradicting (3’).
Assume \SS0 is of type Dn. There are three cases to consider:
Case(1): β∈{α1,αn−1,αn}. This is impossible as in the Type A case.
Case(2): β=αn−2. Then μ=ωk∨−ωn−2∨+ωn−1∨+ωn∨ (since μ is noncentral on each connected component of J=\SS0−{β}). Let H1, Hn−1 and Hn be the three connected components of J containing α1, αn−1 and αn respectively. If there exists α∈Dmax,J which is of type H1, then Hn−1α=Hnα=0, which implies w(α)⩾Jβ+αn−1+αn and hence ⟨μ,w(α)⟩⩾1, a contradiction to (1’). Thus each root in D is not of type H1. Choose α∈Dmax,J such that H1α⩽JH1ϕ for any ϕ∈D. By symmetry we can assume α is of type Hn−1, that is, Hn−1α=αn−1. Then Hn((w−1(α))=αn, Hn−1((w−1(α))=0 and H1α<JH1((w−1(α))∈ΦH1+. By (4’) we have w−1(α)−αn∈D. However, H1(w−1(α)−αn)=H1(w−1(α))>H1α, contradicting the choice of α.
Case(3): Suppose β=αi with 2⩽i⩽n−3. Let H1 and Hn be the two connected components of J containing α1 and αn respectively. Then μ=ωk∨−ωi∨+ωj∨ for some 1⩽k⩽i−1 and j∈{i+1,n−1,n}.
Case(3.1): j=i+1. If there exists α∈Dmax,J which is of type H1, then Hnα=0. Thus w(α)⩾Jβ+2αi+1 and hence ⟨μ,w(α)⟩⩾1, a contradiction. Therefore, each root of D is not of type H1. Choose α∈Dmax,J such that H1α⩽JH1ϕ for any ϕ∈D. By (3’), we have α+w−1(α)∈Φ, which implies Hnα=αi+1+⋯+αn−2+αn−1 and Hn(w−1(α))=αi+1+⋯+αn−2+αn (up to exchanging αn−1 and αn). Moreover, H1(w−1(α))>H1α. By (4’), w−1(α)−αn∈D with H1(w−1(α)−αn)=H1(w−1(α))>H1α, contradicting the choice of α.
Case(3.2): j=n. Since ⟨prJ(μ),β⟩>0, we have i⩾3. Moreover, since ⟨μ,ϑ2β⟩=0 (see (ii)), we have k=i−1. Set δ1=αi+1+⋯+α(n−i−1)/2+2α(n−i+1)/2+⋯+2αn−2+αn−1+αn and δ2=αi+1+⋯+α(n−i−1)/2. For each γ∈Dmax,J we have γ+w−1(γ)∈Φ by (3’), which implies n−i is odd and
(d1) Hnγ=δ1 and Hn(w−1(γ))=δ2 if γ is of type Hn.
(d2) Hnγ=δ2 and Hn(w−1(γ))=δ1 if γ is of type H1.
Let α∈Dmax,J. Assume α is of type Hn. Then H1α=0. By (d1) and (4’) we have w−1(α)−(αi+1+⋯+α(n−i−1)/2)=α1+⋯+αi∈D. Let α′∈Dmax,J such that α′⩾α1+⋯+αi. Then H1(α′)=α1+⋯+αi−1. By (d2) and (4’), we have w−1(α′)−(α(n−i+1)/2+⋯+αn−1)=α2+⋯+αn−2+αn∈D. However, ⟨μ,α2+⋯+αn−2+αn⟩=1, contradicting (1’). Therefore, α is of type H1 and hence each root of D is not of type Hn. By (d2) and (4’) we deduce that αn⩽Jw−1(α)−(α(n−i+1)/2+⋯+αn−1)∈D, which is of type Hn, a contradiction.
Assume \SS0 is of type En with n∈{6,7,8}. Then there are only finitely many pairs (μ,β) satisfying (i) and (ii). The statement is checked case-by-case by a similar strategy in Case (3) 222By a simple reduction, we only need to address the case where each connected component of J if of type A or type D.. Therefore, the proof is finished.
A.4.
Finally we show Lemma 4.8. Let \SS0′′ be the connected component of the Dynkin diagram J′∪{ζJ′} containing ζJ′. Set J′′=\SS0′′−{ζJ′}⊆J′. By definition, ζJ′=ζJ′′. We claim that
(i) The restriction of ι to \SS0′′ is nontrivial unless \SS0′′ is of type A.
Assume ι acts trivially on \SS0′′. Then ι fixes each element of J′′. If \SS0′ is of type A (resp. E6), then ∣J′′∣⩽1 (resp. ∣J′′∣⩽2) and ∣\SS0′′∣⩽2 (resp. ∣\SS0′′∣⩽3), which means \SS0′′ is of type A. If \SS0′ is of type Dn, then J′′⊆\SS0′−{αn−1,αn}. Moreover, supp(ζJ′)⊆\SS0′−{α1,αn−1,αn} because A2ζ=∅. Since \SS0′−{αn−1,αn} is of type A, one checks that \SS0′′=J′′∪{ζJ′} is also of type A. So (i) is proved.
Now we assume (1) and (2) of Lemma 3.2 hold, and show this will lead to a contradiction.
Case(1): \SS0′′ is of type A. Then A2ζ=∅, a contradiction.
Case(2): \SS0′′ is of type Dn. By (i) ι fixes αk for 1⩽k⩽n−2, and exchanges αn−1 and αn. Since A2ζ=∅, ζJ′=αi with 2⩽i⩽n−2.
Case(2.1): ζJ′=αn−2. Then μ∣\SS0′′=ωk∨+ωn−1∨+ωn∨ for some 1⩽k⩽n−3. If ζ⩾J′′αk, then supp(ζ)⊆\SS0′′−{αn−1,αn} (since ⟨μ,ζ⟩=0). Thus w(ζ)⩾J′′α+αn−1+αn and hence ⟨μ,w(ζ)⟩⩾1, contradicting (1) of Lemma 3.2. So exactly one of αn−1 and αn lies in supp(ζ). In particular, ζ=ι(ζ) and hence ζ is a short root of the root system Φ′′ of \SS0′′. However, ζ+w(ζ) is ι-fixed (since the coefficient of β is two) and hence ζ+w(ζ) is a long root of Φ′′. This implies ⟨ζ∨,w(ζ)⟩=0, contradicting (2) of Lemma 3.2.
Case(2.2): ζJ′=αi with 2⩽i⩽n−3. Then μ∣\SS0′′=ωk∨−ωi∨+ωi+1∨ for some 1⩽k⩽i−1. If ζ⩾J′′β+αk, then αi+1∈/supp(ζ). Thus w(ζ)⩾J′′β+2αi+1 and hence ⟨μ,w(ζ)⟩⩾1, a contradiction. So the coefficient of αi+1 in ζ is one. By (2), we have either ζ+w(ζ)∈Φ′′ or ζ+ιw(ζ)∈Φ′′. As in Case(3.1) of §A.3, this implies ζ=ι(ζ), which is impossible as in Case(2.1).
Case(3): \SS0′′ is of type E6. By (i) ι restricts to a nontrivial involution of \SS0′′. Assume ζJ′=α2. By Lemma A.2 and the observation μ=ι(μ), we have μ∣\SS0′′=−ω2∨+ω4∨. Thus the coefficient of α4 in ζ is one since ⟨μ,ζ⟩=0, which implies ⟨μ,w(ζ)⟩=1, contradicting (1). Assume ζJ′=α4. By Lemma A.2 and the assumption ⟨μ,ϑ2ζ⟩⩾0, we have μ∣\SS0′′=ω2∨−ω4∨+ω3∨+ω5∨. Then one checks that either ⟨μ,ζ⟩⩾1 or ⟨μ,w(ζ)⟩⩾1, which contradicts (1). The proof is finished.