pith. sign in

arxiv: 2605.20928 · v1 · pith:LOOVKM64new · submitted 2026-05-20 · 🧮 math.CO · math.GR

Rational Weyl group elements of odd type D

Yutong Zhang , Yaoran Yang This is my paper

Pith reviewed 2026-05-21 04:01 UTC · model grok-4.3

classification 🧮 math.CO math.GR
keywords Weyl groupsrational elementstype Drationality graphsigned permutationsCoxeter groupsroot posetsdescents
5
0 comments X

The pith

For odd r at least 5 the rational elements of the type-D Weyl group are exactly the longest element w0 together with two signed cyclic elements c_I and d_I for each non-empty subset I of the first r-1 indices.

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

The paper classifies all rational Weyl group elements inside W(D_r) when r is odd and at least 5. It proves these elements consist solely of the longest element w0 plus an explicit pair of signed cyclic elements, called c_I and d_I, one pair for every non-empty subset I of {1,…,r-1}. The resulting count is 2^r-1, confirming an earlier conjecture, and the associated rationality graph becomes two Boolean-type halves joined only at w0. A reader who works with Coxeter groups or rational points on reductive groups would obtain an explicit combinatorial list that lets one draw the full graph and identify its unique degree-one vertices.

Core claim

The authors show that the rational elements in W(D_r) for odd r ≥ 5 are precisely w0 together with the signed cyclic elements c_I and d_I, one pair for each non-empty I ⊆ {1,…,r-1}. The rationality graph Γ(D_r) is then two Boolean-type halves glued at w0, with exactly 2^r-1 vertices whose only degree-one vertices are c_{{1}} and d_{{1}}.

What carries the argument

The signed cyclic elements c_I and d_I together with the rationality graph Γ(D_r) whose edges mark one-step rational descents; the argument uses an acyclic two-level description of each Γ(c_I) and a rigidity argument that applies Voloshyn's descent lemma to all possible rational descents leaving w0.

If this is right

  • The total number of rational Weyl group elements in W(D_r) for odd r ≥ 5 equals 2^r-1.
  • The rationality graph Γ(D_r) consists of two explicitly labelled Boolean-type halves glued together at w0.
  • The only vertices of valency one are c_{{1}} and d_{{1}}.
  • Every type-D obstruction to rationality is realized by an explicit loop or two-cycle in the root-poset rationality graph.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same signed-cycle indexing may supply a model for rational elements in even rank or in other classical types.
  • Explicit normal-form computations could now be carried out by tracing the cycles c_I and d_I.
  • The two-halves structure suggests that a global sign or orientation choice on the root poset might organize rational elements in larger diagrams.

Load-bearing premise

Voloshyn's descent lemma applies directly to all one-step rational descents from w0 while every type-D exclusion appears as an explicit loop or two-cycle inside the root-poset rationality graph.

What would settle it

A computer enumeration for r=5 that produces even one element of W(D_5) outside the listed collection of 31 elements yet still satisfies the rationality condition would falsify the classification.

Figures

Figures reproduced from arXiv: 2605.20928 by Yaoran Yang, Yutong Zhang.

Figure 1
Figure 1. Figure 1: The type-𝐷 numbering used throughout the paper. 2. Root-poset and rationality preliminaries Throughout the paper 𝑟 ≥ 5 is odd, and the type-𝐷𝑟 root system is realized as in (6)–(7). We write 𝜌 ≤ 𝜂 ⟺ 𝜂 − 𝜌 ∈ ∑𝑟 𝑎=1 ℤ≥0𝛼𝑎 (18) for the usual root-poset order on Π+. If 𝑥 = (𝑥1 , …, 𝑥𝑟 ) ∈ ℝ 𝑟 , 𝑥 = ∑𝑟 𝑎=1 𝑚𝑎 (𝑥)𝛼𝑎 , (19) then the coordinates 𝑚𝑎 (𝑥) are 𝑚𝑎 (𝑥) = 𝑥1 + ⋯ + 𝑥𝑎 , 1 ≤ 𝑎 ≤ 𝑟 − 2, (20) 𝑚𝑟−1(𝑥) = 𝑥1 + … view at source ↗
Figure 2
Figure 2. Figure 2: The two halves of the rationality graph are indexed by subsets. Edge labels are simple reflections; omitted vertices and [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
read the original abstract

Voloshyn introduced rational Weyl group elements in connection with rational normal forms on complex reductive groups and conjectured that, in type $D_r$ with $r$ odd, their number is $2^r-1$. We prove a stronger structural statement. For $r\geq 5$ odd, the rational Weyl group elements in $W(D_r)$ are exactly the longest element $w_0$ together with two explicitly described signed cyclic elements $c_I$ and $d_I$ for every non-empty subset $I\subseteq\{1,\ldots,r-1\}$. Consequently the rationality graph $\Gamma(D_r)$ is two explicitly labelled Boolean-type halves glued at $w_0$, its number of vertices is $2^r-1$, and its only vertices of valency one are $c_{\{1\}}$ and $d_{\{1\}}$. The proof combines an acyclic two-level description of the rationality graphs $\Gamma(c_I)$ with a rigidity argument for all one-step rational descents from $w_0$. The latter uses Voloshyn's descent lemma, while all type-$D$ exclusions are given by explicit loops or two-cycles in the root-poset rationality graph.

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 / 3 minor

Summary. The manuscript proves that for odd r ≥ 5 the rational elements of the Weyl group W(D_r) consist precisely of the longest element w_0 together with two families of signed cyclic elements c_I and d_I indexed by the non-empty subsets I ⊆ {1,…,r-1}. It deduces that the rationality graph Γ(D_r) consists of two Boolean-type halves glued only at w_0, contains exactly 2^r−1 vertices, and has c_{{1}} and d_{{1}} as its unique degree-one vertices. The argument rests on an acyclic two-level description of the graphs Γ(c_I) combined with a rigidity statement for one-step rational descents from w_0 that invokes Voloshyn’s descent lemma and realizes all type-D exclusions by explicit loops or two-cycles in the root-poset rationality graph.

Significance. The result supplies a parameter-free combinatorial classification that confirms Voloshyn’s conjecture on the cardinality 2^r−1 and gives an explicit, falsifiable description of the rationality graph. The proof is self-contained once Voloshyn’s lemma is granted, ships an acyclic two-level graph model together with concrete root-poset realizations, and identifies the precise gluing and valency structure; these features strengthen the link between rational Weyl elements and rational normal forms on complex reductive groups of type D.

minor comments (3)
  1. [§2] §2, definition of signed cyclic elements: an explicit coordinate formula or a worked example for r=5 would make the sign conventions and the distinction between c_I and d_I immediately verifiable without consulting external references.
  2. [Figure 3] Figure 3 (root-poset rationality graph): the caption and surrounding text should state explicitly which edges correspond to the loops and two-cycles that realize the type-D exclusions, so that the reader can check the completeness claim without reconstructing the graph.
  3. [§4.2] §4.2, statement of the rigidity argument: the sentence claiming that Voloshyn’s descent lemma applies directly to all one-step descents from w_0 would benefit from a one-line reminder of the precise hypothesis of the lemma that is being invoked.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and accurate summary of our manuscript, the assessment of its significance, and the recommendation for minor revision. We are pleased that the combinatorial classification and the structure of the rationality graph are viewed as strengthening the link to rational normal forms. No specific major comments appear in the report, so we have no points requiring detailed rebuttal or revision at this stage; we remain ready to incorporate any minor editorial suggestions from the editor or referee.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper proves its classification of rational Weyl group elements in odd type D_r by combining an explicit acyclic two-level description of the rationality graphs Γ(c_I) with a rigidity argument for one-step descents from w0 that invokes Voloshyn's descent lemma, plus explicit combinatorial realizations of all type-D exclusions as loops or two-cycles in the root-poset rationality graph. The enumeration yielding exactly 2^r-1 elements follows directly from the structural description over non-empty subsets I, without any fitted parameters, self-definitional reductions, or load-bearing self-citations. The cited lemma is external and independent, and the constructions are parameter-free, so the derivation chain is self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the validity of Voloshyn's descent lemma for rigidity and on the claim that type-D exclusions are exactly the explicit loops or two-cycles exhibited in the root-poset graph; no free parameters or new invented entities are introduced in the abstract.

axioms (2)
  • domain assumption Voloshyn's descent lemma holds and applies to one-step rational descents from w0
    Invoked explicitly for the rigidity argument controlling descents from the longest element
  • domain assumption All type-D rational exclusions arise as loops or two-cycles in the root-poset rationality graph
    Used to certify that no additional elements exist outside the stated families

pith-pipeline@v0.9.0 · 5736 in / 1659 out tokens · 41328 ms · 2026-05-21T04:01:49.480109+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

5 extracted references · 5 canonical work pages

  1. [1]

    Voloshyn, Multiple rational normal forms in Lie theory, J

    D. Voloshyn, Multiple rational normal forms in Lie theory, J. Algebra 691 (2026), 453–487. doi:10.1016/j.jalgebra.2025.11.019

    work page doi:10.1016/j.jalgebra.2025.11.019 2026

  2. [2]

    Humphreys, Reflection Groups and Coxeter Groups, Cambridge Stud

    J.E. Humphreys, Reflection Groups and Coxeter Groups, Cambridge Stud. Adv. Math., vol. 29, Cambridge Univ. Press, Cambridge, 1990. doi:10.1017/CBO9780511623646

    work page doi:10.1017/cbo9780511623646 1990

  3. [3]

    In: Third Int

    A. Björner and F. Brenti, Combinatorics of Coxeter Groups, Grad. Texts in Math., vol. 231, Springer, New York, 2005. doi:10.1007/3-540- 27596-7

    work page doi:10.1007/3-540- 2005

  4. [4]

    StoryTec: A Digital Storytelling Platform for the Authoring and Experiencing of Interactive and Non-linear Stories

    N. Bourbaki, Lie Groups and Lie Algebras, Chapters 4–6, Elements of Mathematics, Springer-Verlag, Berlin, 2002. doi:10.1007/978-3-540- 89394-3

    work page doi:10.1007/978-3-540- 2002

  5. [5]

    Carter, Simple Groups of Lie Type, Pure and Applied Mathematics, vol

    R.W. Carter, Simple Groups of Lie Type, Pure and Applied Mathematics, vol. 28, John Wiley & Sons, London–New York–Sydney, 1972. Yutong Zhang and Yaoran Yang:Preprint submitted to ElsevierPage 23 of 23

    work page 1972