pith. sign in

arxiv: 1907.01398 · v1 · pith:52QEEUBXnew · submitted 2019-07-02 · 🧮 math.RT

Computing the real Weyl group

Heiko Dietrich , Willem A. de Graaf This is my paper

Pith reviewed 2026-05-25 10:25 UTC · model grok-4.3

classification 🧮 math.RT
keywords real Weyl groupsemisimple Lie algebraCartan subalgebracombinatorial constructionnilpotent orbitsreal formsLie algebra classification
0
0 comments X

The pith

The real Weyl group of a semisimple real Lie algebra admits an explicit combinatorial construction once a Cartan subalgebra is fixed.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper provides an explicit combinatorial method to construct the real Weyl group of a semisimple Lie algebra over the reals, given a Cartan subalgebra. This construction matters because the real Weyl group is needed to classify regular semisimple subalgebras, real carrier algebras, and real nilpotent orbits. These classifications support applications in theoretical physics. A reader working with real forms of Lie algebras would value an efficient way to obtain this group without additional data.

Core claim

We describe an explicit combinatorial construction of the real Weyl group of g with respect to a given Cartan subalgebra.

What carries the argument

The explicit combinatorial construction that generates the real Weyl group elements from the fixed Cartan subalgebra.

Load-bearing premise

The real Weyl group admits a description that is both explicit and purely combinatorial once a Cartan subalgebra is fixed.

What would settle it

Applying the construction to sl(2,R) with its standard Cartan subalgebra and checking whether the generated group equals the known real Weyl group of that algebra.

read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript claims to provide an explicit combinatorial construction of the real Weyl group of a real semisimple Lie algebra g relative to any fixed Cartan subalgebra. The construction is motivated by the need for efficient computation in the classification of regular semisimple subalgebras, real carrier algebras, and real nilpotent orbits, with noted applications in theoretical physics.

Significance. If the claimed combinatorial construction is correct and implementable, it would supply a practical algorithmic tool for real Lie theory computations that are currently cumbersome. This aligns with known combinatorial descriptions via restricted root systems and Satake diagrams, and could directly support the listed classification tasks.

minor comments (2)
  1. [Abstract] The abstract states the existence of the construction but provides no outline of the method, no small example, or reference to a specific section containing the main algorithm; adding a brief illustrative example in the introduction would clarify the combinatorial steps for readers.
  2. [§1] Notation for the real Weyl group and the fixed Cartan subalgebra should be introduced consistently at the first use in §1 or §2 to avoid ambiguity when the construction is later applied to specific root systems.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their review and for recommending minor revision. No specific major comments appear in the report, so we have no individual points requiring point-by-point response.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The abstract and supplied context describe an explicit combinatorial construction of the real Weyl group relative to a fixed Cartan subalgebra, with applications to classification problems. No equations, derivation steps, fitted parameters, or self-citations are provided that could reduce any claim to its own inputs by construction. The reader's assessment of score 2.0 aligns with the absence of any load-bearing reduction; the central claim remains independent of the paper's own outputs and is consistent with standard facts on restricted root systems and Satake diagrams. No circular steps of any enumerated kind are detectable.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract only; no information on free parameters, axioms, or invented entities is available.

pith-pipeline@v0.9.0 · 5573 in / 838 out tokens · 24759 ms · 2026-05-25T10:25:31.067087+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

26 extracted references · 26 canonical work pages

  1. [1]

    /T_he adjoint gr oup Gc of gc is the identity component (in the Zariski topology) of the automorph ism group of gc

    I/n.sc/t.sc/r.sc/o.sc/d.sc/u.sc/c.sc/t.sc/i.sc/o.sc/n.sc Let gc be a semisimple Lie algebra over the complex numbers. /T_he adjoint gr oup Gc of gc is the identity component (in the Zariski topology) of the automorph ism group of gc. Up to conjugacy in Gc, there is a unique Cartan subalgebra hc ⩽ gc; let Φ be the corresponding root system. /T_he reflec- ti...

    work page 2019

  2. [2]

    /T_hroughout, we use the following notation

    N/o.sc/t.sc/a.sc/t.sc/i.sc/o.sc/n.sc We use basic knowledge on root systems, such as bases of simple ro ots, 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]. /T_hroughout, we use the following notation. Let gc be a semisimple complex ...

    work page

  3. [3]

    Let Ψ be a root system and recall that we write W (Ψ) for its Weyl group

    S/o.sc/m.sc/e.sc /r.sc/o.sc/o.sc/t.sc /s.sc/u.sc/b.sc/s.sc/y.sc/s.sc/t.sc/e.sc/m.sc/s.sc 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- ...

    work page

  4. [4]

    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]

    T/h.sc/e.sc /r.sc/e.sc/a.sc/l.sc W/e.sc/y.sc/l.sc /g.sc/r.sc/o.sc/u.sc/p.sc 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 w e have chosen a Chevalley basis of gc with elements h1, . . . , h ℓ and xα with α running over the root sys...

    work page

  5. [5]

    (4) N ˜G( ˜H c(R)) = N ˜G(h): Using (3), we see that g ∈ ˜G normalises ˜H c(R) if and only if it normalises ˜H c, if and only if it normalises hc, if and only if it normalises h

    By assumption, ghcg− 1 = hc, which implies hc 0 = hc, hence H c 0 = ˜H c by [12, /T_heorem 4.3.3]. (4) N ˜G( ˜H c(R)) = N ˜G(h): Using (3), we see that g ∈ ˜G normalises ˜H c(R) if and only if it normalises ˜H c, if and only if it normalises hc, if and only if it normalises h. By [3, Proposition 6.3.2], there is an isomorphism N ˜G( ˜H c(R))/ ˜H c(R) ∼ = ...

    work page

  6. [6]

    Based on the description provided here, the implementation of all steps of the algorithm is straightforwar d so we will not comment on this

    C/o.sc/m.sc/p.sc/u.sc/t.sc/a.sc/t.sc/i.sc/o.sc/n.sc/s.sc An implementation of our construction algorithm for W (g, h) is distributed with the so/f_tware pack- age CoReLG for the computer algebra system GAP [9]. Based on the description provided here, the implementation of all steps of the algorithm is straightforwar d so we will not comment on this. As an...

    work page

  7. [7]

    See liegroups.org

    Atlas of Lie groups and representations. See liegroups.org

    work page

  8. [8]

    Adams and F

    J. Adams and F. du Cloux. Algorithms for representation theory of real reductive groups.J. Inst. Math. Jussieu, 8(2):209– 259, 2009

    work page 2009

  9. [9]

    Adams and O

    J. Adams and O. Ta ¨ıbi. Galois and Cartan cohomology of real groups. Duke Math. J. 16:1057–1097, 2018. Computing the real Weyl group 11 g id csa |(W c)θ| | W re| | A| | W im,c| time RS time WG E8(8) [E,8,2] 8 2 4 4 576 4.2 3.7 E7(7) [E,7,2] 8 2 4 4 16 1.8 1.3 E6(6) [E,6,2] 4 6 2 8 1 0.5 0.3 sl(9, R) [A,8,6] 5 24 1 16 1 0.5 0.3 so(8, 9) [B,8,5] 9 2 192 8 ...

    work page 2018

  10. [10]

    A. Borel. Introduction aux groupes arithm ´etiques. (French) Publications de l’Institut de Math´ematique de l’Universit´e de Strasbourg, XV. Actualit ´es Scientifiques et Industrielles, No. 1341 Hermann, Paris 1 969

    work page

  11. [11]

    Chevalley

    C. Chevalley. /T_h ´eorie des groupes de Lie. Tome II. Groupes alg´ebriques. (French) Actualit´es Sci. Ind. no. 1152. Hermann & Cie., Paris, 1951

    work page 1951

  12. [12]

    Dietrich, P

    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

    work page 2013

  13. [13]

    Dietrich, P

    H. Dietrich, P. Faccin, and W. A. de Graaf. Regular subalg ebras and nilpotent orbits of real graded Lie algebras. J. Algebra, 423:1044–1079, 2015

    work page 2015

  14. [14]

    Dietrich, W

    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

    work page 2017

  15. [15]

    GAP – groups, algorithms, and programming

    /T_he GAP Group. GAP – groups, algorithms, and programming. Available at gap-system.org

    work page

  16. [16]

    du Cloux

    F. du Cloux. Combinatorics for the representation theo ry of real reductive groups. See www.liegroups.org/papers/algorithms.pdf

    work page

  17. [17]

    W. A. de Graaf. Lie Algebras: /T_heory and Algorithms. Volu me 56 of North-Holland Mathematical Library . Elsevier Science, 2000

    work page 2000

  18. [18]

    W. A. de Graaf. Computation with linear algebraic group s. Monographs and Research Notes in Mathematics. CRC Press, Boca Raton, FL, 2017

    work page 2017

  19. [19]

    B. Hall. Lie groups, Lie algebras, and representations . Volume 222 of Graduate Texts in Mathematics. Springer, Cham, second edition, 2015

    work page 2015

  20. [20]

    Helgason

    S. Helgason. Differential geometry, Lie groups, and sym metric spaces. Vol. 80 of Pure and Applied Mathematics. Academic Press Inc., New York, 1978

    work page 1978

  21. [21]

    J. E. Humphreys. Introduction to Lie algebras and repre sentation theory. Second printing, revised. Graduate Text s in Mathematics, 9. Springer-Verlag, New York-Berlin, 1978

    work page 1978

  22. [22]

    J. E. Humphreys. Linear algebraic groups. Springer Ver lag, 1975

    work page 1975

  23. [23]

    A. W. Knapp. Lie groups beyond an introduction. Colume 1 40 of Progress in Mathematics . Birkh ¨auser Boston Inc., Boston, MA, second edition, 2002

    work page 2002

  24. [24]

    Onishchik

    Arkady L. Onishchik. Lectures on Real Semisimple Lie Al gebras and /T_heir Representations. European Mathematical Society, Z¨urich, 2004

    work page 2004

  25. [25]

    Steinberg

    R. Steinberg. Lectures on Chevalley groups. Revised an d corrected edition of the 1968 original. University Lectur e Series, 66. American Mathematical Society, Providence, RI , 2016

    work page 1968

  26. [26]

    D. A. Vogan, Jr. Irreducible characters of semisimple L ie groups. IV. Character-multiplicity duality. Duke Math. J. , 49(4):943–1073, 1982

    work page 1982