OctoInformBeta

OpenAI preprint, September 2026 · §3. Dihedral intervals and transported reflection orders · §3.4

Transported schedule, terminal portions and k_D(e): Edges of [u,b][u,b] scored by the slopes of their image labels in W′W', the schedules they form, terminal portions and plane weights

Edges of a Bruhat interval ordered through an interval isomorphism.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Let ι:[u,b]→[u′,b′]\iota\colon[u,b]\to[u',b'] be an order isomorphism from a Bruhat interval of (W,S)(W,S) onto a Bruhat interval of (W′,S′)(W',S'). The edges of the Bruhat graph inside [u,b][u,b] are labelled by reflections of WW, but the order put on them is read in W′W': a reflection order of W′W', carried back to [u,b][u,b] through ι\iota by the roots of the image labels. The item fixes that order as one list of all edges of [u,b][u,b] and cuts from it, at each vertex, the terminal portions of the upward edges. Alongside, for an element xx and a positive root aa of a single Coxeter system, it attaches integers to the planes of the Tits space through aa.

Roots and Slopes

Let II be the finite set indexing the simple reflections sis_i of (W,S)(W,S), and M=(mij)M=(m_{ij}) its Coxeter matrix. The Tits space is ℝI\mathbb{R}^I, and the simple root αi\alpha_i is the coordinate vector of ii.✦ The Tits form BB is the bilinear form on ℝI\mathbb{R}^I built from the Coxeter Gram entries gijg_{ij} and the Tits normal functionals nin_i: B(v,v′)=∑i∈Ivini(v′),ni(v′)=∑j∈Igijvj′,gij=−2cos⁡(π/mij),B(v,v')=\sum_{i\in I} v_i\,n_i(v'),\qquad n_i(v')=\sum_{j\in I} g_{ij}\,v'_j,\qquad g_{ij}=-2\cos(\pi/m_{ij}),(1)✦ an entry mij=0m_{ij}=0, standing for mij=∞m_{ij}=\infty, giving gij=−2g_{ij}=-2. For i∈Ii\in I the geometric simple reflection is σi(v)=v−B(αi,v)αi\sigma_i(v)=v-B(\alpha_i,v)\,\alpha_i.✦ The Tits action of WW on ℝI\mathbb{R}^I is the geometric reflection action of BB and the αi\alpha_i: the homomorphism from WW to the linear automorphisms of ℝI\mathbb{R}^I sending each sis_i to σi\sigma_i, written v↦w(v)v\mapsto w(v).✦

A real root of (W,S)(W,S) is a vector w(αi)w(\alpha_i) with w∈Ww\in W and i∈Ii\in I✦, and a positive root is a real root whose coordinates are all nonnegative.✦ A vector aa represents t∈Wt\in W when t=wsiw−1t=ws_iw^{-1} and a=w(αi)a=w(\alpha_i) for some w∈Ww\in W and i∈Ii\in I.✦ For a reflection tt, αt\alpha_t is a positive root representing tt✦; for a positive root aa, sas_a is the reflection that aa represents.✦ An element w∈Ww\in W inverts a positive root aa when every coordinate of w−1(a)w^{-1}(a) is at most 00.✦ The root plane Π(a,b)\Pi(a,b) of two positive roots is the subspace of ℝI\mathbb{R}^I they span.✦

The height of v∈ℝIv\in\mathbb{R}^I is ht(v)=∑i∈Ivi\mathrm{ht}(v)=\sum_{i\in I}v_i.✦ The geometric functional of (W,S)(W,S) is a linear functional ff on ℝI\mathbb{R}^I, fixed once and for all, for which f(a)/ht(a)f(a)/\mathrm{ht}(a) takes distinct values on distinct positive roots aa.✦ The geometric slope of a positive root aa is μ(a)=f(a)ht(a).\mu(a)=\frac{f(a)}{\mathrm{ht}(a)}.(2)✦ For a linear functional gg on ℝI\mathbb{R}^I, the lexicographic score of a positive root aa is the pair λg(a)=(g(a/ht(a)),μ(a))\lambda_g(a)=\bigl(g(a/\mathrm{ht}(a)),\,\mu(a)\bigr) of real numbers, pairs being compared lexicographically✦; a/ht(a)a/\mathrm{ht}(a) is the height-normalized root.✦

Fix x∈Wx\in W and a positive root aa. The partner of a positive root bb is b*=αsasbsab^{*}=\alpha_{s_as_bs_a}, the positive root of the conjugate of sbs_b by sas_a.✦ The pair (a,b)(a,b) is flipped when every coordinate of sa(b)s_a(b) is at most 00✦, and good for xx when it is flipped and xx inverts neither bb nor b*b^{*}✦; bb is an extra root of (x,a)(x,a) when b≠ab\neq a and (a,b)(a,b) is good for xx.✦ The set of half roots of (x,a)(x,a) is H(x,a)={b:b an extra root of (x,a),μ(b)<μ(b*)},H(x,a)=\{\,b : b \text{ an extra root of } (x,a),\ \mu(b)<\mu(b^{*})\,\},(3)✦ and the half root vector of (x,a)(x,a) is the integer indicator function of H(x,a)H(x,a) on positive roots.✦

Edges of an Interval

An edge of the Bruhat graph of (W,S)(W,S) is a pair e=(x,y)e=(x,y) of elements of WW with ℓ(x)<ℓ(y)\ell(x)<\ell(y) and y=txy=tx for a reflection tt.✦ The label of an edge e=(x,y)e=(x,y) of the Bruhat graph is the reflection t=yx−1t=yx^{-1}, the root label of ee is the positive root β(e)=αyx−1\beta(e)=\alpha_{yx^{-1}}, and the lexicographic score of ee for a linear functional gg on ℝI\mathbb{R}^I is λg(β(e))\lambda_g(\beta(e)). The Bruhat order ≤\le on WW is the reflexive transitive closure of the relation x→yx\to y for the edges (x,y)(x,y) of the Bruhat graph, and for u,b∈Wu,b\in W the Bruhat interval [u,b][u,b] is the set of x∈Wx\in W with u≤x≤bu\le x\le b.✦

An ordered graph on a partially ordered set VV is a set of edges with a source and a target in VV for each edge, the source strictly below the target✦; the upward edges at a vertex xx are the edges with source xx.✦ The moment graph of [u,b][u,b] is the ordered graph on [u,b][u,b], under Bruhat order, whose edges, the edges of [u,b][u,b], are the pairs (x,y)(x,y) of elements of [u,b][u,b] that are edges of the Bruhat graph of WW, every reflection edge and not only the covers, with source xx and target yy.✦

The Definition

Definition 1. Let ι:[u,b]→[u′,b′]\iota\colon[u,b]\to[u',b'] be an order isomorphism from a Bruhat interval of (W,S)(W,S) onto a Bruhat interval of (W′,S′)(W',S'), and write f′f', μ′\mu', β′\beta' and λ′\lambda' for the geometric functional, the geometric slope, the root label and the lexicographic score of (W′,S′)(W',S'). The transported edge of an edge e=(x,y)e=(x,y) of [u,b][u,b] is the edge of the Bruhat graph of (W′,S′)(W',S') ι(e)=(ι(x),ι(y)).\iota(e)=\bigl(\iota(x),\iota(y)\bigr).(4)✦ The transported slope of ee is μι(e)=μ′(β′(ι(e))),\mu_\iota(e)=\mu'\bigl(\beta'(\iota(e))\bigr),(5)✦ and its transported score is σι(e)=λf′′(β′(ι(e)))\sigma_\iota(e)=\lambda'_{f'}\bigl(\beta'(\iota(e))\bigr).✦ The transported schedule TιT_\iota of ι\iota is the list of all the edges of [u,b][u,b], NN in number, sorted by score, in weakly decreasing order of σι\sigma_\iota: Tι=(e1,…,eN),σι(e1)≥σι(e2)≥…≥σι(eN).T_\iota=(e_1,\dots,e_N),\qquad \sigma_\iota(e_1)\ge\sigma_\iota(e_2)\ge\dots\ge\sigma_\iota(e_N).(6)✦ The chronological schedule CιC_\iota of ι\iota is the reverse of the transported schedule TιT_\iota, Cι=(eN,…,e1).C_\iota=(e_N,\dots,e_1).(7)✦ For a list pp of edges of [u,b][u,b] and a vertex xx of [u,b][u,b], the remaining edge conditions of pp at xx are the upward edges at xx that occur in pp, collected in the set Rx(p)={E:E an upward edge at x,E∈p};R_x(p)=\{\,E : E \text{ an upward edge at } x,\ E\in p\,\};(8)✦ A terminal portion at xx is a set Rx(p)R_x(p) with pp a final segment of CιC_\iota. For x∈Wx\in W and a positive root aa of (W,S)(W,S), the plane weight of xx and aa is the finitely supported integer function on the subspaces Π\Pi of ℝI\mathbb{R}^I given by κx,a(Π)=#{b∈H(x,a):Π(a,b)=Π}.\kappa_{x,a}(\Pi)=\#\{\,b\in H(x,a) : \Pi(a,b)=\Pi\,\}.(9)✦

In the paper, the result reads, with DD standing for a root plane and kDk_D and ℓD\ell_D for the paper’s functions attached to DD: the edges of [u,b][u,b] are ordered by the position of the labels of their images in a reflection order of W′W', the terminal portions at a vertex are the final segments of its upward edges, and kD(e)=(ℓD(y)−ℓD(x)−1)/2k_D(e)=(\ell_D(y)-\ell_D(x)-1)/2 for an edge e=(x,y)e=(x,y).

What Is Checked

The definitions are stated over an order isomorphism ι\iota between Bruhat intervals [u,b][u,b] of (W,S)(W,S) and [u′,b′][u',b'] of (W′,S′)(W',S'), the moment graph of [u,b][u,b] with all its reflection edges, and the Tits space of (W′,S′)(W',S') with its positive roots, height and geometric functional f′f'; the plane weight is stated over an element xx and a positive root aa of (W,S)(W,S), the half roots of (x,a)(x,a) and the root planes through aa.

Of these constructions the library proves that for xx and yy in [u,b][u,b], the pair (x,y)(x,y) is an edge of the Bruhat graph of WW exactly when (ι(x),ι(y))(\iota(x),\iota(y)) is an edge of the Bruhat graph of W′W'. On any real vector space with a bilinear form BB and vectors αi\alpha_i such that B(αi,αj)=−2cos⁡(π/mij)B(\alpha_i,\alpha_j)=-2\cos(\pi/m_{ij}), one has B(αi,αi)=2B(\alpha_i,\alpha_i)=2✦, and the reflections σi(v)=v−B(αi,v)αi\sigma_i(v)=v-B(\alpha_i,v)\,\alpha_i satisfy the Coxeter relations (σiσj)mij=1(\sigma_i\sigma_j)^{m_{ij}}=1 for finite mijm_{ij}✦; the Tits form meets this hypothesis, with B(αi,αj)=gijB(\alpha_i,\alpha_j)=g_{ij} on simple roots.✦ Linear functionals whose ratio to the height is injective on positive roots exist✦, and for every x∈Wx\in W and positive root aa the set H(x,a)H(x,a) of half roots is finite.✦