This paper presents an explicit combinatorial method for computing the real Weyl group of a semisimple Lie algebra over the real numbers, aiding classification tasks relevant in physics.
Contribution
It introduces a new combinatorial construction that allows efficient computation of the real Weyl group for semisimple Lie algebras.
Findings
01
Provides an explicit combinatorial construction of the real Weyl group
02
Enables efficient computation of the real Weyl group
03
Facilitates classification of algebraic structures in physics
Abstract
Let g be a semisimple Lie algebra over the real numbers. We describe an explicit combinatorial construction of the real Weyl group of g with respect to a given Cartan subalgebra. An efficient computation of this Weyl group is important for the classification of regular semisimple subalgebras, real carrier algebras, and real nilpotent orbits associated with g; the latter have various applications in theoretical physics.
Tables1
Table 1. Table 1. Examples of some real Weyl group orders
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.
Full text
Computing the real Weyl group
Heiko Dietrich
School of Mathematics, Monash University,
Clayton VIC 3800, Australia
Let g be a semisimple Lie algebra over the real numbers. We describe an explicit combinatorial construction of the real Weyl group of g with respect to a given Cartan subalgebra. An efficient computation of this Weyl group is important for the classification of regular semisimple subalgebras, real carrier algebras, and real nilpotent orbits associated with g; the latter have various applications in theoretical physics.
Key words and phrases:
real Weyl group, real semisimple Lie algebra, computational Lie theory
2000 Mathematics Subject Classification:
This work is supported by an Australian Research Council grant, identifier DP190100317.
1. Introduction
Let gc be a semisimple Lie algebra over the complex numbers. The adjoint group Gc of gc is the identity component (in the Zariski topology) of the automorphism group of gc. Up to conjugacy in Gc, there is a unique Cartan subalgebra hc⩽gc; let Φ be the corresponding root system. The reflections defined by all those roots generate the Weyl group W(Φ) of gc; the latter can also be defined as W(Φ)=NGc(hc)/ZGc(hc). Root systems and Weyl groups are arguably the most important tools in Lie theory, because many problems can be reduced to computations with those combinatorial objects. The situation is similar, but more complicated when considering Lie algebras over the real numbers; one common issue is that now Cartan subalgebras and Weyl groups are not necessarily unique. We refer to the books of Humphreys [15], Knapp [17], or Onishchik [18] for extensive background information.
Now consider a real form g of gc, with associated complex conjugation σ, and choose a Cartan involution θ of g. Let G be the subgroup of Gc consisting of all g∈Gc with g(g)=g, and write G∘ for its identity component (in the Euclidean
topology). Following [17, (7.92a)], we define the real Weyl group of g with respect to a θ-stable Cartan subalgebra h of g as
[TABLE]
In our paper [7], an algorithm is given to compute regular semisimple subalgebras of g up to
conjugacy by G∘. In this algorithm the real Weyl group plays a paramount role. Similarly, the real Weyl
group can be used to classify carrier subalgebras and nilpotent orbits associated with a grading of g,
see [7] for details. Related to that, in [8] an application is discussed of nilpotent orbit
classifications to theoretical physics (supergravity). It is therefore of interest to understand the structure of W(g,h) and to have computational tools that can be used to construct it.
In a more general context, the ATLAS project [1] considered W(G′,H)=NG′(H)/ZG′(H) for an arbitrary real form G′ of Gc with θ-stable Cartan subgroup H⩽G′, see [20, 2, 10]. It is shown in [20, Propositions 4.11 & 4.16] that
[TABLE]
with W(G′,H)∩Wim=A⋉Wim,c; here Wre, Wim, Wim,c are the Weyl groups of the root systems of gc consisting of real, imaginary, and compact imaginary roots, respectively; moreover, Wim=Q⋉Wim,c for some elementary abelian 2-subgroup Q containing A. More details and the definition of (Wc)θ are given in Section 3. While each of (Wc)θ, Wim,c, Wim, and Q can be computed from the Lie algebra data alone, the construction of A is the complicated part and depends on the isogeny type of the real Lie group G′. It is [10, Corollary 6.10] that gives a clue for this construction.
The aim of this paper is to describe how to construct W(g,h) by computer.
Because we focus on the group G∘, which is completely determined by g, it is in principle possible
to determine W(g,h) using only information from g. Here we provide efficient algorithms to do this.
For this we give a self-contained and detailed proof of the decomposition
[TABLE]
and explain how all the subgroups involved can be computed.
While guided by the proofs in [20, 2, 10], our description attempts to be largely self-contained and to avoid, as much as possible, the technical details in those papers. The latter is achieved by specialising results to G∘, and by rewriting some proofs of [20, 2, 10] assuming not much more than basic properties of root systems.
Our implementation of our algorithm is contained in the software package CoReLG for the system GAP [9].
The structure of the paper is as follows. In Section 2 we introduce the notation used in this work. In Section 3 we discuss various root sub-systems and their Weyl groups. Our set-up allows us to describe in detail the proof of the construction of the subgroup A, see Proposition 4.5. In turn, this allows us to prove the main result, a combinatorial construction of W(g,h), in Theorem 4.6. We conclude with some examples in Section 5.
We note that our paper [7] also comments on the construction of NG′(h)/ZG′(h), but some confusing assumptions have been posed on G′, namely that G′=Gc(R) is a group of real points and also connected; see also the clarification in [8, Remark 10]. Here we consider the group G′=(Gc(R))∘, which is called the adjoint group of g, see [14, Section II.5].
2. Notation
We use basic knowledge on root systems, such as bases of simple roots, positive roots, Weyl groups; for background information on Lie algebras and root systems we refer to standard books, such as Humphreys [15], Knapp [17], or Onishchik [18]. Throughout, we use the following notation. Let gc be a semisimple complex Lie algebra with real form g and associated conjugation σ, that is, σ(x+y)=x−y for x,y∈g. Let θ
be a Cartan involution of g with Cartan decomposition g=k⊕p, so that τ=σ∘θ is a compact
structure on gc. We refer to [6, Section 2] for details on the construction of real forms. Let Gc be the adjoint group of gc, which can be defined as the identity component
(in the Zariski topology) of the automorphism group of gc, see [18, (I.7)]. Let G be
the group consisting of all g∈G with g(g)=g, that is, g∈Gc lies in G if and only if g∘σ=σ∘g.
Let G∘ denote the identity component of G in the Euclidean
topology. Note that Gc is an algebraic group and its Lie algebra is spanned by adgx where x runs over the elements of a basis of g, see [18, (I.1)]; since every such basis is defined over R, the group Gc is defined over R. In particular, we can view Gc as a
matrix group by taking matrices with respect to a fixed basis of g; in this situation, it follows that G=Gc(R) is the group of real points of Gc. We fix a θ-stable Cartan subalgebra h of g and let hc be its
complexification; note that hc is a Cartan subalgebra of gc. We define
[TABLE]
as the real Weyl group of g with respect to h. Let Φ be
the root system of gc with respect to hc. The abstract Weyl group defined by Φ is denoted by W=W(Φ) and generated by all reflections sα where α runs over a set of simple roots of Φ, see [15, Section 9.3]. It is well known (see for example [18, (I.7) & (II.16)]) that one can also define W analytically as
[TABLE]
Fix a Chevalley basis of gc, consisting of semisimple elements h1,…,hℓ∈hc and root vectors xα for α∈Φ, see [15, Section 25.2]. For h∈hc and α∈Φ we have [h,xα]=α(h)xα, hence
[TABLE]
and so θ(xα) lies in the root space corresponding to α∘θ. In particular, α∘θ∈Φ, so we have an involution
α↦α∘θ of Φ; we write
θ(α) for α∘θ, and we extend this involution
to the dual space (hc)∗. Let κ denote the Killing form of gc; since gc is semisimple, κ is a symmetric, non-degenerate bilinear form. Its restriction to
hc gives the well-known bijection (hc)∗→hc, μ↦hμ′, where hμ′ is defined by μ(−)=κ(−,hμ′). For
μ,λ∈(hc)∗ define (μ,λ)=κ(hμ′,hλ′),
and for α,β∈Φ write ⟨α,β∨⟩=2(α,β)/(β,β). We conclude with an observation.
Lemma 2.1**.**
The restriction of (−,−) to the real span of Φ is a θ-invariant inner product.
Proof.
It is well-known that this restriction is an inner product, see [15, Section 8.5]. Note that adgcγ(x)=γ∘adgc(x)∘γ−1 for every x∈gc and automorphism γ∈Aut(gc), which shows that κ(θ(x),θ(y))=κ(x,y) for all x,y∈gc. This implies that κ(h,θ(hμ′))=κ(θ(h),hμ′)=μ(θ(h)), hence hθ(μ)′=θ(hμ′). This shows that (θ(μ),θ(λ))=(μ,λ) for all μ,λ∈(hc)∗, as claimed.
∎
3. Some root subsystems
As indicated in the introduction, the decomposition (1.1) of W(g,h) is induced by several sub-root systems of Φ; we introduce and discuss those sub-root systems here.
Let Ψ be a root system and recall that we write W(Ψ) for its Weyl group. A subset Π⊂Ψ is a sub-root system (or just subsystem) if
for α,β∈Π we have −α∈Π and, if α+β∈Ψ, then α+β∈Π. For a given system of positive roots Ψ+ the corresponding Weyl vector is
[TABLE]
Note that (ρ(Ψ),α)=1 for simple roots α∈Ψ, see the proof of [15, Lemma 13.3A], which implies:
Lemma 3.1**.**
Let Ψ be a root system. If α∈Ψ+, then (ρ(Ψ),α)>0.
Recall that Φ is the root system of gc with respect to hc. The subsystems of real, imaginary, compact imaginary, and noncompact imaginary roots are defined as
[TABLE]
with Φim=Φim,c∪Φim,nc, see [17, p. 390]. We set ρre=ρ(Φre) and ρim=ρ(Φim), and define
[TABLE]
Note that Φc is θ-invariant as θ(ρim)=ρim and
θ(ρre)=−ρre. Let α be a positive root; Lemma 3.1 shows that if α is imaginary, then (α,ρim)=0, and if α is real, then (α,ρre)=0. This proves that Φc∩Φim=Φc∩Φre=∅. In the following we denote the Weyl group of ΦX by WX for labels X=c,im,re,…. Note that θ acts on Φ, so if Ψ is a θ-invariant subsystem of Φ, then we denote the fixed points of θ in W(Ψ) by
[TABLE]
3.1. Preliminary results
We need three preliminary results; the first comes from [20, Lemma 3.1]. We include an expanded proof that gives full details using basic results about root systems.
Lemma 3.2**.**
Let Ψ be a θ-invariant subsystem of Φ with Ψ∩Φre=Ψ∩Φim=∅. Then Ψ is the disjoint orthogonal union of two subsystems, that is, Ψ=Ψ1∪Ψ2 with Ψ1∩Ψ2=∅ and (α,β)=0 for all α∈Ψ1 and β∈Ψ2. Furthermore, θ:Ψ1→Ψ2 is an
isomorphism and
[TABLE]
In particular, W(Ψ)θ is generated by sαsθ(α) where α runs over a set of simple roots of Ψ1.
Proof.
The real space V spanned by Ψ is θ-invariant, so we have an eigenspace decomposition V=V1⊕V−1 is . Because of the θ-invariance of the bilinear form, V1 and V−1 are orthogonal. If V1=0, then all roots of Ψ are real, hence Ψ=Ψ∩Φre=∅, which is not possible; thus V1=0. If α∈Ψ satisfies (α,v)=0 for all v∈V1, then α∈V−1, so α∈Ψ∩Φre=∅, which is not possible; thus, there is no α∈Ψ which is orthogonal to V1. It follows that there is a v0∈V1 such that (v0,α)=0 for all α∈Ψ: simply choose v0 outside the hyperplanes defined by each α∈Ψ. We use this vector to define a positive system Ψ+={α∈Ψ∣(α,v0)>0} for Ψ: indeed, setting α<β if and only if (α,v0)<(β,v0) defines a root order, see [11, p. 164]. Note that θ(Ψ+)=Ψ+ since θ(v0)=v0. By [15, Sections 10.4 & 11.3] we can decompose Ψ=Π1∪⋯∪Πm, where the Πi are uniquely determined irreducible subsystems that are pairwise orthogonal; since Ψ is θ-invariant, θ permutes these subsystems. Suppose θ(Πi)=Πi for some i. Then Πi+=Πi∩Ψ+ is a positive system for Πi. The highest root βi of Πi+ is uniquely
determined, see [15, Lemma 10.4A], and because θ fixes Πi+ we have θ(βi)=βi. But then βi∈Ψ∩Φim=∅, which is impossible; this shows that θ(Πi)=Πi for all i. In particular, we can partition Ψ=Ψ1∪Ψ2 such that θ(Ψ1)=Ψ2. Now most of the statements of the lemma now follow. If w=(w1,w2)∈W(Ψ)θ, then for α∈Ψ1 we have w(θ(α))=w2(θ(α)) and w(θ(α))=θ(w(α))=θw1(α); hence w2(θ(α))=θ(w1θ(θ(α))) for all α∈Ψ1, which shows that w2=θw1θ. For the last statement note
that θsαθ=sθ(α). ∎
Lemma 3.3**.**
Let Ψ be a root system with fixed basis of simple roots Δ and real span V. Let v∈V be such that (α,v)⩾0 for
all α∈Δ. Let Ψv be the subsystem {α∈Ψ∣(α,v)=0}, and set Wv={w∈W(Ψ)∣w(v)=v}. Then Ψv∩Δ is a basis of
simple roots of Ψv and W(Ψv)=Wv.
Proof.
This proof follows standard ideas in Lie theory, see for example, [15, Lemma 10.3B] and [11, Lemma 8.3.4].
Write Δ={α1,…,αm} and si=sαi for each i. Every α∈Ψv∩Ψ+ can be written as α=∑ikiαi with integers k1,…,km⩾0, see [15, Section 10.1]. By assumption 0=(α,v)=∑iki(αi,v), so ki can only be nonzero if αi∈Ψv∩Δ. This proves
the first part.
If α∈Ψv, then sα(v)=v, and we see that W(Ψv)⊂Wv. Let w∈W(Ψ) with reduced expression w=si1⋯sit for some t>0. For 1⩽j⩽t+1 set
vj=sij⋯sit(v) with vt+1=v, so that
[TABLE]
for all 2⩽j⩽t+1. Each αi permutes the positive roots other than αi, and si(αi)=−αi, see [15, Lemma 10.2.B]. Since sit⋯sijsij−1(αij−1)
is a negative root, see [11, Corollary 8.3.3], the root sit⋯sij(αij−1) is positive; now (vj,αij−1)⩾0 by the assumption on v. Thus, vj−1=sij−1(vj)=vj−aj−1αij−1 where aj−1=2(vj,αij−1)/(αij−1,αij−1)⩾0.
So w(v)=v if and only if v=v−a1αij1−…−atαijt, if and only if each ai=0, if and only if each vj=v and (v,αij)=0.
∎
The following result is attributed to Chevalley in [20, Proposition 3.8]; since we could not find a proof in the literature, we include it here.
Lemma 3.4**.**
Let Ψ be a root system contained in a real space V, with Weyl group W=W(Ψ).
For given λ1,…,λm∈V define
[TABLE]
Then Ψλ1,…,λm is a
subsystem of Ψ with Weyl group W(Ψλ1,…,λm)=Wλ1,…,λm.
Proof.
Clearly, Ψλ1,…,λm is a subsystem. We use induction on m and first consider m=1 and λ=λ1. Fix a set of simple roots Δ with positive system Ψ+. By the proof of [15, Theorem 10.3(a)], there is w∈W such that (α,w(λ))⩾0 for all α∈Ψ+. By Lemma 3.3
this implies that the subsystem Ψw(λ) has basis of simple roots Δw(λ)={α∈Δ∣(α,w(λ))=0}.
By the same lemma, the group Ww(λ) is generated by all sα with α∈Δw(λ). Now Ψλ=w−1(Ψw(λ)) and
Wλ=w−1Ww(λ)w, so Wλ is generated
by all w−1sαw with α∈Δw(λ). Since w−1sαw=sw−1(α) and w−1(Δw(λ)) is a basis
of Ψλ, it follows that Wλ=W(Ψλ). Lastly, observe that Ψλ1,…,λm=(Ψλ1,…,λm−1)λm and Wλ1,…,λm=(Wλ1,…,λm−1)λm, so the induction step follows by the same argument.
∎
3.2. The Weyl group W(Φ)θ
Recall that W(g,h)=NG∘(h)/ZG∘(h) and that the full Weyl group W(Φ)≅NGc(hc)/ZGc(hc) is generated by all reflections sα. The embedding NG∘(h)→NGc(hc) induces an embedding of the real Weyl group into W(Φ), that is, we consider W(g,h) as a subgroup
[TABLE]
see also [17, (7.93) & Proposition 7.19(c)] or [20, p. 950]. In fact, it is also true that W(g,h)⩽W(Φ)θ: by the proof of [8, Proposition 3], the group G=Gc(R) is reductive in the sense of [17], and so G∘ is reductive by [17, Proposition 7.19(f)]; now [17, (7.92b)] shows that every element in W(g,h) has a representative in Gc that commutes with the Cartan involution θ, which yields
[TABLE]
As a first step towards determining W(g,h), we now describe the structure of W(Φ)θ. The following result comes from [20, Proposition 3.12]; we include a modified proof adapted to our set-up.
Proposition 3.5**.**
We have W(Φ)θ=(Wc)θ⋉(Wre×Wim) with Wre,Wim⊴W(Φ)θ.
Proof.
A small computation shows that if α∈Φre and β∈Φ, then θ(sα(β))=sα(θ(β)), so that
Wre⩽W(Φ)θ. If α∈Φre and w∈W(Φ)θ, then θ(w(α))=w(θ(α))=w(−α)=−w(α), so w(α)∈Φre. Now from wsαw−1=sw(α) it follows that
Wre⊴W(Φ)θ. The argument for Wim⊴W(Φ)θ is similar. Let Φre,+ and Φim,+ be positive systems for Φre and Φim, respectively.
If w∈W(Φ)θ, then w(Φre)=Φre
and w(Φim)=Φim, and so w−1(Φre,+) and
w−1(Φim,+) are positive systems of Φre and
Φim, respectively. Therefore
w−1(Φre,+)=μ−1(Φre,+) and w−1(Φim,+)=ν−1(Φim,+) for some μ∈Wre and
ν∈Wim, respectively, see [15, Section 10.3]. Lemma 2.1 shows that (Φre,Φim)=0, which implies that μ is the identity on Φim and ν is the identity on Φre. It follows that Φre,+=wμ−1ν−1(Φre,+) and Φim,+=wμ−1ν−1(Φim,+). Setting w1=wμ−1ν−1, we have w1(ρre)=ρre and w1(ρim)=ρim.
As Φc={α∈Φ∣(α,ρre)=(α,ρim)=0}, Lemma 3.4 shows that w1∈Wc. Since θ commutes with each of w,μ,ν, it also commutes with w1. Now w=w1μν shows that w∈(Wc)θWreWim.
Every element of (Wc)θ fixes ρre and ρim, but no nontrivial element of
WreWim does that. Hence (Wc)θ∩WreWim={1}.
∎
4. The real Weyl group
We now look at the real Weyl group. As a preliminary step, in the next lemma we recall the following
facts from [12, Lemmas 5.1.4 & 5.2.22] and [6, Lemma 6.1]. Recall that we have chosen a Chevalley basis of gc with elements h1,…,hℓ and xα with α running over the root system Φ of gc.
Lemma 4.1**.**
Let gc and g be as before.
a)
If w∈g is nilpotent, then
t↦exp(tadw) for t∈[0,1] is a path from the identity to
exp(adw), so exp(adw)∈G∘. The element exp(tadxα)exp(−t−1adx−α)exp(tadxα)
lies in NGc(hc) and maps to the reflection sα in the
Weyl group W(Φ)=NGc(hc)/ZGc(hc), independently of t∈C∗.
b)
Let α∈Φ; there exist
λα,rα∈C such that the following hold. First, θ(xα)=λαxα∘θ and λα−1=λ−α=λα∘θ; moreover θ(hα)=hα∘θ. Second, σ(xα)=rαx−α∘θ and
rα−1=r−α=r−α∘θ (complex
conjugate); moreover σ(hα)=h−α∘θ. Third, rαλα is real.
The following lemma exhibits some subgroups of W(g,h).
Lemma 4.2**.**
*We have Wre,(Wc)θ,Wim,c⩽W(g,h).
*
Proof.
We freely use Lemma 4.1 in this proof; rα and λα are defined as in that lemma.
a)
If α∈Φre, then σ(xα)=rαxα,
σ(x−α)=rα−1x−α, and σ(hα)=hα. If σ(xα)=−xα, then set μ=, otherwise set μ=1+rα, so that σ(μxα)=μxα in either case. It follows that the element exp(μadxα)exp(−μ−1adyα)exp(μadxα)
lies in G∘ and maps to sα in W(Φ), so that sα∈W(g,h).
b)
Recall that (Wc)θ is generated by elements of the form sαsθ(α), where α and θ(α) lie in different
orthogonal components of Φc, see Lemma 3.2; in particular, x±α commutes with x±θ(α). If sαsθ(α) is a generator of (Wc)θ, then both xα+rαx−θ(α) and x−α+r−αxθ(α) lie in g as they are invariant under σ. Being sums of two commuting nilpotent elements, they are nilpotent, so
[TABLE]
lies in G∘. Since the x±α commute with
x±θ(α), this element is equal to
[TABLE]
and since r−α=rα−1, the latter element maps to
sαsθ(α) in W(Φ), that is, sαsθ(α)∈W(g,h).
c)
If α∈Φim, then θ(α)=α; moreover, σ(xα)=rαx−α, σ(x−α)=rα−1xα, and σ(hα)=−hα with rα∈R. Furthermore, θ(xα)=λαxα and
because θ is an involution it follows that λα=±1. In the following suppose that λα=1, so α is compact imaginar. Since λ−α=λα−1, it follows that −α is compact imaginary if α is.
Since α is compact, u=hα, x=xα+rαx−α, and y=(xα−rαx−α) lie in k; moreover, [u,x]=2y, [u,y]=−2x, and [x,y]=−2rαu, so they span a subalgebra a of k. If rα>0,
then adax has real eigenvalues and a is
isomorphic to sl(2,R), which is impossible because k is
compact. This implies that rα<0, so ξ=−1/rα is real. We define a=ξx, b=ξy, and c=u, so that [a,b]=2c, [a,c]=−2b, and [b,c]=2a. Now we consider the group SL(2,C) and its real Lie subgroup
[TABLE]
Both are simply connected; for SL(2,C) this is well-known, for SU(2) see [13, Proposition 1.15]. The Lie algebra su(2) of SU(2) has basis elements
[TABLE]
satisfying [A,B]=2C, [A,C]=−2B, and [B,C]=2A. Mapping (A,B,C) to (a,b,c) yields an isomorphism ϕ:su(2)→a which we extend to ϕc:sl(2,C)→ac. Setting h=−iC, e=(1/2)(A−B), and f=(1/2)(A+B),
we have that h,e,f is an sl2-triple; moreover,
[TABLE]
Because of simply-connectedness, ϕ and ϕc lift to unique Lie group
homomorphisms F:SU(2)→G and Fc:SL(2,C)→Gc, respectively, with
F(exp(z))=exp(adϕ(z)) for z∈su(2) and Fc(exp(z))=exp(adϕc(z)) for z∈sl(2,C), see [13, Theorem 5.6]. Because of uniqueness, F is the restriction
of Fc to su(2). Now consider
[TABLE]
Since M=exp(e)exp(−f)exp(e), we have Fc(M)=exp(ξadxα)exp(−ξadx−α)exp(ξadxα), hence Fc(M) is a representative in Gc of sα. By what is said above, Fc(M)=F(M)∈G, hence sα∈W(g,h). We note that the SL(2) argument is motivated by [10, Section 5] and [20, p. 950].
∎
it remains to determine W(g,h)∩Wim. Recall from the beginning of Section 3.2 that every element in W(g,h) has a representative in G that commutes with θ, hence W(g,h) preserves the compact imaginary roots Φim,c and so
Wim,c⊂(W(g,h)∩Wim)⊂Wim,2 where
[TABLE]
The next sections show that Wim,2=Q⋉Wim,c for some elementary abelian 2-group Q, and that W(g,h)∩Wim=A⋉Wim,c for some subgroup A⩽Q. Determining A is the difficult part.
4.1. Superorthogonal roots
A subset A={α1,…,αm}⊂Ψ of a root system is strongly orthogonal if αi±αj∈Ψ∪{0} for
i=j; it is superorthogonal if the only roots in the span of
A are ±αi and these are all distinct. Note that superorthogonal implies strongly orthogonal. Furthermore, if A is strongly orthogonal, then (αi,αj)=0 for i=j: indeed, if (αi,αj)<0, then αi+αj is a root, and if (αi,αj)>0, then αi−αj is a root, see [15, Lemma 9.4]. So strongly orthogonal implies orthogonal,
as it should. The next lemma is motivated by [20, Lemma 3.19].
Lemma 4.3**.**
Let Δ be a simple system of Ψ. If α1,…,αm∈Δ are orthogonal, then {α1,…,αm} is superorthogonal.
Proof.
Let β be a root in the span of the αi. If β=±αi for all i, then we can write β=αi1+⋯+αir such that all partial sums
αi1+⋯+αik are roots, see [15, Corollary 10.2]. It follows that αi+αj∈Ψ for some i,j. If αi−rαj,…,αi+qαj is the αj-string
through αi, then r−q=⟨αi,αj∨⟩=0, see [15, p. 45]. Since αi−αj is not a root by [15, Lemma 10.1], we have r=0; this forces q=0, a contradiction to αi+αj∈Ψ. This shows that β∈{±αi} for some i.
∎
Choose a positive system Φim,c,+ in Φim,c to define ρim,c=ρ(Φim,c) and set
[TABLE]
Choose a positive system Φim,+ of Φim such that ρim,c is dominant with respect to it, that is, such
that (α,ρim,c)⩾0 for all α∈Φim,+; this can be done as follows: let V be the real span of
Φim; choose a basis of V consisting of elements of
Φim; for u,v∈V set u<v if (u,ρim,c)<(v,ρim,c)
or if (u,ρim,c)=(v,ρim,c) and the
first coefficient of v−u with respect to the chosen basis of V is positive;
then this is a root order and the corresponding positive system has the required properties. Consider the subsystem
[TABLE]
By Lemma 3.3, the simple roots in Φim,+
lying in Φim,ρ form a basis of the latter. We denote the set of these simple roots by B={α1,…,αm}. The next result is due to Knapp [20, Proposition 3.20].
Proposition 4.4**.**
Using the previous notation, the following hold.
a)
B={α1,…,αm}⊂Φim,nc* is superorthogonal,*
b)
Wim,2=Q⋉Wim,c,
c)
Q=Wim,2∩W(Φim,ρ).
Proof.
a)
Lemma 3.1 implies that Φim,ρ⊂Φim,nc. Since the αi lie in a basis of Φim,+, it follows that
(αi,αj)⩽0 for all i,j, see [15, Lemma 10.1]. Suppose (αi,αj)<0 for some i,j, so that αi+αj∈Φim by [15, Corollary 9.4]. It is obvious that αi+αj∈Φim,ρ, so that αi+αj∈Φim,nc. But since αi and αj also lie in Φim,nc, a small computation shows that αi+αj∈Φim,c, a contradiction. We conclude that (αi,αj)=0 for all i,j, and now Lemma 4.3 proves that B is superorthogonal.
b)
Note that Q={w∈Wim,2∣w(Φim,c,+)=Φim,c,+}.
If w∈Wim,2, then w−1(Φim,c,+) is a positive
system for Φim,c, so w−1(Φim,c,+)=μ−1(Φim,c,+) for some μ∈Wim,c. This implies wμ−1=q∈Q, and so w=qμ∈QWim,c. By [15, Theorem 10.3(e)], any element of
Wim,c that maps Φim,c,+ to itself is the identity, hence Q∩Wim,c=1. If α∈Φim,c and w∈Wim,2, then
wsαw−1=sw(α) with w(α)∈Φim,c, so Wim,c⊴Wim,2.
c)
Lemma 3.4 shows
W(Φim,ρ)={w∈Wim∣w(ρim,c)=ρim,c}, so Q=Wim,2∩W(Φim,ρ).
∎
4.2. Constructing the last subgroup
Recall that Wim,c⩽W(g,h)⩽Wim,2=Q⋉Wim,c, so it remains to determine the subgroup A⩽Q such that W(g,h)∩Wim=A⋉Wim,c. Together with the previous results, this then leads to the decomposition of W(g,h) as in (1.1). Recall that Q=W(Φim,ρ)∩Wim,2, so
[TABLE]
The next proposition describes W(Φim,ρ)∩W(g,h); intersecting with Q gives A.
Let P be the root lattice defined by the root system Φ, that is, P is the set of all integral linear combinations of the elements in Φ. Since θ acts on Φ, it also acts on P; let Pθ be the sublattice of all μ∈P with μ=θ(μ)=μ∘θ. Recall that ⟨α,β∨⟩=2(α,β)/(β,β) for α,β∈P. The next result gives an explicit construction of W(Φim,ρ)∩W(g,h); this proposition is similar to [10, Corollary 6.10], cf. [2, Section 13], but here we adapt it to our situation and give an independent proof.
Proposition 4.5**.**
Let
B={α1,…,αm} be the superorthogonal set in Proposition 4.4. Then
[TABLE]
where E={(ϵ1,…,ϵm)∈{0,1}m∣∑i=1mϵi⟨μ,αi∨⟩=0mod2 for all μ∈Pθ}.
Proof.
The proof uses some standard results for semisimple algebraic groups; a classical reference is Steinberg’s lecture notes [19]. Here we give detailed references to [12].
First, we use the description in [12, Section 5.2.3 and p. 182] to construct the simply connected algebraic group Gc over C with
Lie algebra isomorphic to gc: let Vc be
a gc-module such that the weights of Vc generate the entire weight
lattice P; let ϕ:gc→gl(Vc) be the corresponding faithful representation.
Then Gc is the subgroup of GL(Vc) generated
by all expϕ(x) with x∈gc nilpotent, see [12, Section 5.2.3 and p. 172], with Lie algebra ϕ(gc). By [12, Corollary 5.2.32], there is a surjective morphism of algebraic groups π:Gc→Gc with kerπ⩽Z(Gc). If g=expϕ(y) with x∈gc and nilpotent y∈gc, then
[TABLE]
see [12, Lemma 2.3.1]; since ϕ−1((expadϕ(y))(ϕ(x)))=(expady)(x), we have π(g)=expady. In conclusion,
[TABLE]
By [16, Theorem 35.3(c)], the group of real points G=Gc(R) is connected (in the
Euclidean topology), and π(G)=G∘ follows from [4, 7.4]. Since Gc is simply connected, θ:gc→gc lifts to a unique involution of Gc with
differential equal to θ, see [13, Theorem 5.6]; by abuse of notation, we denote this involution by θ. That theorem also shows θ(expϕ(x))=expϕ(θ(x)) for all nilpotent x∈gc. To simplify notation, in the following we identify gc with ϕ(gc), that is, we assume that ϕ is the identity. Now define
[TABLE]
Since kerπ⩽Z(Gc) and g=expy with y∈gc nilpotent acts as π(g)=expady on gc, we have that π maps NG(h) and ZG(h) onto NG∘(h) and ZG∘(h), respectively. Since W(g,h)=NG∘(h)/ZG∘(h) by definition, we deduce NG(h)/ZG(h)≅W(g,h), so every element in W(g,h) has a representative in G. Recall that Hc=ZGc(hc) is the connected torus in Gc with Lie algebra hc; we now recall some well-known facts for
[TABLE]
(1)
ZKc(hc)=Hc∩Kc: Since Hc is connected and Hc⩽Gc are matrix groups, [12, Lemma 4.7.3] yields ZGc(Hc)=ZGc(hc), hence ZKc(hc)=ZKc(Hc)=Kc∩Hc.
(2)
ZG(h)=Hc(R): Since Hc=ZGc(Hc)=ZGc(hc) and G=Gc(R), we have
[TABLE]
Since Hc(R)⊂Hc is dense, ZG(Hc(R))=ZG(Hc). Now ZG(h)=ZG(hc) proves the claim.
(3)
NUc(hc)=NUc(Hc) for any subgroup Uc⩽Gc: Recall that Gc and gc are matrix structures. Let g∈Gc and consider the regular map Ad(g):Gc→Gc, x↦gxg−1. If g normalises Hc, then the differential of Ad(g) is gc→gc, x↦gxg−1, see [12, p. 110], and maps hc to hc, hence g normalises hc. Conversely, suppose ghcg−1=hc. Note that H0c=Ad(g)(Hc) is an algebraic subgroup and the differential of Ad(g) maps hc to the Lie algebra h0c of H0c. By assumption, ghcg−1=hc, which implies h0c=hc, hence H0c=Hc by [12, Theorem 4.3.3].
(4)
NG(Hc(R))=NG(h): Using (3), we see that g∈G normalises Hc(R) if and only if it normalises Hc, if and only if it normalises hc, if and only if it normalises h.
By [3, Proposition 6.3.2], there is an isomorphism NG(Hc(R))/Hc(R)≅NKc(Hc)/(Hc∩Kc). Together with the above observations, this implies that
[TABLE]
Recall that π maps G onto G∘. Since hc is θ-stable, θ is an involution on Hc, and we can decompose Hc=H+cH−c,
where H±c={h∈Hc∣θ(h)=h±1}. For each αi in the superorthogonal set B define
[TABLE]
so that gi∈Gc maps to sαi in the full Weyl group W(Φ), see Lemma 4.1. Since each αi is noncompact imaginary, θ(xαi)=−xαi. Since θ(expx)=expθ(x) for nilpotent x∈gc, this shows θ(gi)=gi−1; moreover, the gi commute because of the superorthogonality.
Since W(Φ)=NGc(hc)/ZGc(hc), the set of elements in NGc(hc) that map to a product sαi1⋯sαir in W(Φ) is exactly gZGc(hc) where g=gi1⋯gir∈Gc. Recall that W(g,h) is a subgroup of W(Φ) and we have W(g,h)=NKc(hc)/ZKc(hc). This shows that the image of the above g lies in W(g,h) if and only if there exists h∈ZGc(hc) such that gh∈Kc, that is, θ(gh)=gh. Writing h=h+h− with h±∈H±c, we have that θ(gh)=θ(g)h+h−−1, and therefore θ(gh)=gh if and only if
g−1θ(g)=h−2. By what is said above, θ(g)=g−1, so g maps to an element of W(g,h) if and only if
there is h−∈H−c with g−2=h−2. Thus, we study the diagonalisable group H−c.
Recall that P is the weight lattice
of Φ. Since Gc is simply connected, [12, Proposition 5.3.12] shows that we can identify the character group of Hc with P. More precisely, let γ1,…,γm be the simple roots of Φ. Following [12, pp. 162 & 172], for a root α∈Φ and t∈C write xα(t)=exp(txα), and for t∈C∗ define
wα(t)=xα(t)x−α(−t−1)xα(t) and hα(t)=wα(t)wα(1)−1. By [12, Example 5.2.33], the elements of Hc can uniquely be written as
hγ1(t1)⋯hγm(tm), and [12, Lemma 5.2.17] shows that λ(hα(t))=t⟨λ,α∨⟩ for all λ∈P. Since H−c is an algebraic subgroup of Hc, it is the intersection of
the kernels of the characters in a sublattice of P, see [12, Proposition 3.9.5]. This sublattice is (1+θ)P={λ+θ(λ)∣λ∈P}: if h∈H−c, then (λ+θ(λ))(h)=λ(h)λ(h−1)=1 for all λ∈P; if h∈Hc satisfies μ(h)=1 for all μ∈(1+θ)P, then λ(hθ(h))=1 for all λ∈P; since P contains all roots, this implies hθ(h)=1, so h∈H−c. Thus H−c is defined by (1+θ)P. We now show that
[TABLE]
see also [5, Proposition 12.3]. Clearly, (1+θ)P⩽Pθ. Note that both lattices have
the same rank equal to the dimension e of the 1-eigenspace of θ on the Q-space spanned by P. It is obvious that Pθ is pure, meaning that P/Pθ is torsion free. Together, Pθ is the
the smallest sublattice containing (1+θ)P that is pure, that is, Pθ is the purification of (1+θ)P. Since Pθ is pure, [12, Proposition 3.9.6] shows that it defines a connected algebraic subgroup of H−c, namely an e-dimensional torus E. Since Pθ and (1+θ)P have the same rank, it follows that (1+θ)P defines a group isomorphic to F×E, where F is finite. Thus, Pθ defines E=(H−c)∘. Moreover, it follows from [12, Remark 3.9.8] that F is isomorphic to the torsion subgroup of P/(1+θ)P; so Pθ/(1+θ)P≅F≅H−c/(H−c)∘.
Note that if μ∈Pθ, then μ+μ∈(1+θ)P, which shows that Pθ/(1+θ)P is an elementary abelian 2-group. We conclude that (H−c)2=(H−c)∘. Putting things together, we see that g=gi1⋯gir∈Gc as above maps to an element of W(g,h) if and only if g−2 lies in (H−c)2=(H−c)∘, if and only if μ(g−2)=1 for all μ∈Pθ. From the definitions of gi and hαi(t), it follows that gi−2=hαi(−1). Furthermore, as mentioned above, for μ∈P we have
μ(hαi(−1))=(−1)⟨μ,αi∨⟩. It follows that sαi1⋯sαir lies in W(g,h) if and only if ∑j=1r⟨μ,αij∨⟩ is even for all μ∈Pθ.
∎
4.3. Description of the real Weyl group
We can now state the main result; for convenience, we recall the assumptions. Let gc be a semisimple complex Lie algebra with real form g. Let θ be a Cartan involution of g and fix a θ-stable Cartan subalgebra h of g. Let Gc be the adjoint group of gc, let G be the group consisting of all g∈Gc with g(g)=g, and set W(g,h)=NG∘(h)/ZG∘(h).
Theorem 4.6**.**
We have W(g,h)=(Wc)θ⋉(Wre×(A⋉Wim,c)) with A=Q∩W(Φim,ρ)∩Wim,2.
The groups Wre, Wim,c, and Wc are described in Section 3; the group (Wc)θ is the set of fixed points under the action of θ. The group Q is described in (4.1) and the group W(Φim,ρ)∩Wim,2 is described in Proposition 4.5. Together, this yields a construction of W(g,h) based on the root system of gc.
5. Computations
An implementation of our construction algorithm for W(g,h) is distributed with the software package CoReLG for the computer algebra system GAP [9]. Based on the description provided here, the implementation of all steps of the algorithm is straightforward
so we will not comment on this. As an example, we have constructed the real Weyl groups for all simple real forms of rank at most 8. Table 1 lists some results where for each Lie type the computation took the most time (in seconds), or where A was maximal (size 16). We have split the timing into the time for computing the root system and Chevalley basis (column labeled time RS) and the remaining time for computing the real Weyl group (column labeled time WG). The column labeled id lists the id of the real form as given by the CoReLG function IdRealForm and the column labeled csa lists the position of the respective Cartan subalgebra in the output of the CoReLG function CartanSubalgebrasOfRealForm.
Bibliography20
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Atlas of Lie groups and representations. See liegroups.org .
2[2] J. Adams and F. du Cloux. Algorithms for representation theory of real reductive groups. J. Inst. Math. Jussieu , 8(2):209–259, 2009.
3[3] J. Adams and O. Taïbi. Galois and Cartan cohomology of real groups. Duke Math. J. 16:1057–1097, 2018.
4[4] A. Borel. Introduction aux groupes arithmétiques. (French) Publications de l’Institut de Mathématique de l’Université de Strasbourg, XV. Actualités Scientifiques et Industrielles, No. 1341 Hermann, Paris 1969.
5[5] C. Chevalley. Théorie des groupes de Lie. Tome II. Groupes algébriques. (French) Actualités Sci. Ind. no. 1152. Hermann & Cie., Paris, 1951.
6[6] H. Dietrich, P. Faccin, and W. A. de Graaf. Computing with real Lie algebras: real forms, Cartan decompositions, and Cartan subalgebras. J. Symbolic Comput. , 56:27–45, 2013.
7[7] H. Dietrich, P. Faccin, and W. A. de Graaf. Regular subalgebras and nilpotent orbits of real graded Lie algebras. J. Algebra , 423:1044–1079, 2015
8[8] H. Dietrich, W. A. de Graaf, D. Ruggeri, and M. Trigiante. Nilpotent orbits in real symmetric pairs and stationary black holes. Fortschr. Phys. , 65, 2, 1600118, 2017.