OctoInformBeta

OpenAI preprint, September 2026 · §2. Real realizations and moment-graph sheaves

Theorem 2.2: The product of 1+TExy1+TE_{xy} over the Bruhat edges below bb, sorted by the geometric functional, has (x,y)(x,y) entry R̃x,y(T)\tilde R_{x,y}(T) for x,y≤bx,y\le b

Dyer’s path formula for geometric orders.

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 (W,S)(W,S) be a Coxeter system of finite rank, with simple reflections sis_i indexed by a finite set II and Coxeter matrix (mij)(m_{ij}). An upward edge x→yx \to y of the Bruhat graph joins xx to y=txy = tx for a reflection tt with ℓ(x)<ℓ(y)\ell(x) < \ell(y), and carries the label t=yx−1t = yx^{-1}✦; the Bruhat order ≤\le is the reflexive transitive closure of these edges.✦ Dyer’s path formula expresses the normalized RR-polynomial R̃x,y\tilde R_{x,y} through the directed paths from xx to yy whose labels are monotone in a reflection order.

The library takes the geometric orders, the orders that a linear functional on the Tits space ℝI\mathbb{R}^I of (W,S)(W,S) induces on the positive roots of (W,S)(W,S) by their slopes, and writes the path sum as an entry of a product of the matrices 1+TExy1 + TE_{xy}, with TT an indeterminate and ExyE_{xy} the matrix unit of the edge x→yx \to y, one factor for each edge below a fixed b∈Wb \in W, taken in that order. It treats as well the orders given by a ratio of two functionals, and an interval [u,b][u,b] whose edges are ordered through an order isomorphism ι:[u,b]→[u′,b′]\iota : [u,b] \to [u',b'] onto a Bruhat interval of a second Coxeter system (W′,S′)(W',S') of finite rank.

Roots and Slopes

Let VV be a real vector space with a bilinear form BB and vectors αi\alpha_i, i∈Ii \in I, such that B(αi,αj)=−2cos⁡(π/mij)B(\alpha_i,\alpha_j) = -2\cos(\pi/m_{ij}). The geometric simple reflection σi\sigma_i is the linear automorphism of VV given by σi(v)=v−B(αi,v)αi,\sigma_i(v) = v - B(\alpha_i,v)\,\alpha_i ,(1)✦ and the geometric action of WW on VV is the group homomorphism from WW to the linear automorphisms of VV that sends sis_i to σi\sigma_i.✦

The Tits space of (W,S)(W,S) is ℝI\mathbb{R}^I. Its simple roots αi\alpha_i are the standard basis vectors✦, and its Tits form BB is the bilinear form whose Gram matrix in this basis is the Coxeter Gram matrix Gij=−2cos⁡(π/mij)G_{ij} = -2\cos(\pi/m_{ij}), an entry mij=∞m_{ij} = \infty giving Gij=−2G_{ij} = -2.✦ The Tits action w⋅vw \cdot v of WW on ℝI\mathbb{R}^I is the geometric action (1) for this form.✦

A root is a vector a=w⋅αia = w \cdot \alpha_i with w∈Ww \in W and i∈Ii \in I✦, and aa represents a reflection tt when a=w⋅αia = w \cdot \alpha_i and t=wsiw−1t = ws_iw^{-1} for some such ww and ii.✦ A positive root is a root with nonnegative coordinates✦; its height ht(a)\mathrm{ht}(a) is the sum of its coordinates✦, and its normalized root is aˆ=a/ht(a)\hat a = a/\mathrm{ht}(a).✦ For a reflection tt, αt\alpha_t is a chosen positive root representing tt.✦ The root of an edge x→yx \to y of the Bruhat graph is αyx−1\alpha_{yx^{-1}}, the root of its label.✦

A linear functional ff on ℝI\mathbb{R}^I is generic when distinct positive roots aa have distinct values f(aˆ)f(\hat a). The geometric functional gg is a fixed linear functional on ℝI\mathbb{R}^I whose geometric slopes g(a)/ht(a)g(a)/\mathrm{ht}(a) are distinct for distinct positive roots aa.✦ For a linear functional ff, the score of a positive root aa is the pair κf(a)=(f(aˆ),g(a)/ht(a))\kappa_f(a) = \bigl(f(\hat a),\ g(a)/\mathrm{ht}(a)\bigr)(2)✦ in the lexicographic order on ℝ2\mathbb{R}^2, and the score of an edge is the score of its root.✦

A ratio order O=(n,d)O = (n,d) is a pair of linear functionals on ℝI\mathbb{R}^I such that dd is positive, d(αi)>0d(\alpha_i) > 0 for every ii, and the slopes n(a)/d(a)n(a)/d(a) are distinct for distinct positive roots aa✦; the slope of an edge is the slope of its root.✦ An element yy of WW lies in the chamber of OO when n(y⋅αi)>0n(y \cdot \alpha_i) > 0 for every i∈Ii \in I.✦

Products Along a Schedule

Consider a directed graph in which each edge has a source and a target. A directed path from a vertex xx to a vertex yy is a sequence of edges e1,…,ere_1, \dots, e_r such that e1e_1 has source xx, the target of each eke_k is the source of ek+1e_{k+1}, and ere_r has target yy; the empty sequence is a path from xx to xx.✦ A schedule is a finite list p=(e1,…,en)p = (e_1, \dots, e_n) of edges, and its subpaths from xx to yy are the subsequences of pp that are directed paths from xx to yy.✦

For an element TT of a semiring, the schedule product of pp is the matrix indexed by the vertices Πp(T)=(1+TEe1)(1+TEe2)⋯(1+TEen),\Pi_p(T) = (1 + TE_{e_1})(1 + TE_{e_2}) \cdots (1 + TE_{e_n}),(3)✦ where Ee=ExyE_e = E_{xy} is the matrix unit of an edge ee from xx to yy, and Πp(T)x,y\Pi_p(T)_{x,y} is its (x,y)(x,y) entry.

The edges below b∈Wb \in W are the upward edges x→yx \to y of the Bruhat graph with both ends in the lower ideal {x∈W:x≤b}\{x \in W : x \le b\}.✦ For a linear functional ff on ℝI\mathbb{R}^I, the Dyer schedule pf(b)p_f(b) lists the edges below bb in weakly decreasing order of their scores κf\kappa_f from (2)✦, and the Dyer matrix of bb is Dbf(T)=Πpf(b)(T).D^f_b(T) = \Pi_{p_f(b)}(T).(4)✦

For a ratio order OO, the adapted schedule of bb lists the edges below bb in weakly increasing order of slope.✦ The adapted path polynomial of x,y∈Wx, y \in W is Rx,yO(T)=∑γT|γ|∈ℤ[T],R^O_{x,y}(T) = \sum_{\gamma} T^{|\gamma|} \in \mathbb{Z}[T],(5)✦ the sum over the subpaths γ\gamma from xx to yy of the adapted schedule of yy, with |γ||\gamma| the number of edges of γ\gamma.

The Bruhat interval [u,b][u,b] of elements u,b∈Wu, b \in W is the set of x∈Wx \in W with u≤x≤bu \le x \le b, both endpoints included.✦

The interval [u,b][u,b] of elements u≤bu \le b in WW carries the induced order, and its Bruhat graph has the elements of [u,b][u,b] as vertices and the upward edges between them as edges.✦ Let (W′,S′)(W',S') be a Coxeter system of finite rank with geometric functional g′g' and scores κf′\kappa'_f defined as in (2), let u′≤b′u' \le b' in W′W', and let ι:[u,b]→[u′,b′]\iota : [u,b] \to [u',b'] be an order isomorphism onto the Bruhat interval [u′,b′][u',b']. The transported edge of an edge x→yx \to y of [u,b][u,b] is the edge ι(x)→ι(y)\iota(x) \to \iota(y) of the Bruhat graph of W′W'✦, and the transported score of x→yx \to y is the score κg′′\kappa'_{g'} of its transported edge.✦ The transported schedule pιp_\iota lists the edges of [u,b][u,b] in decreasing order of transported score.✦

The Normalized RR-Polynomial

Let CC be a commutative ring and a∈Ca \in C. On the free CC-module with basis (Hw)w∈W(H_w)_{w \in W}, the operator LsL_s of a simple reflection ss is LsHw={Hswif ℓ(sw)>ℓ(w),Hsw+aHwif ℓ(sw)<ℓ(w),L_s H_w = \begin{cases} H_{sw} & \text{if } \ell(sw) > \ell(w),\\ H_{sw} + aH_w & \text{if } \ell(sw) < \ell(w), \end{cases}(6)✦ left multiplication by HsH_s in the Hecke algebra with Hs2=1+aHsH_s^2 = 1 + aH_s. For w∈Ww \in W, LwL_w is the product Ls1⋯LskL_{s_1} \cdots L_{s_k} along a chosen reduced expression w=s1⋯skw = s_1 \cdots s_k✦, and the bar image of HyH_y is Hy¯=Ly−1−1H1\overline{H_y} = L_{y^{-1}}^{-1} H_1.✦ The normalized RR-polynomial R̃x,y(T)∈ℤ[T]\tilde R_{x,y}(T) \in \mathbb{Z}[T] is the coefficient of HxH_x in the bar image of HyH_y, taken over C=ℤ[T]C = \mathbb{Z}[T] with a=−Ta = -T: Hy¯=∑x∈WR̃x,y(T)Hx(a=−T).\overline{H_y} = \sum_{x \in W} \tilde R_{x,y}(T)\, H_x \qquad (a = -T).(7)✦

The Claim

Theorem 1. Let (W,S)(W,S) be a Coxeter system of finite rank, with geometric functional gg and normalized RR-polynomials R̃x,y\tilde R_{x,y}.

  1. For b,x,y∈Wb, x, y \in W with x≤bx \le b and y≤by \le b, the Dyer matrix (4) of the geometric functional over ℤ[T]\mathbb{Z}[T] satisfies Dbg(T)x,y=R̃x,y(T).D^g_b(T)_{x,y} = \tilde R_{x,y}(T).(8)✦

  2. For a schedule pp in any directed graph, an element TT of a semiring and vertices xx and yy, Πp(T)x,y=∑γT|γ|,\Pi_p(T)_{x,y} = \sum_{\gamma} T^{|\gamma|},(9)✦ the sum over the subpaths γ\gamma of pp from xx to yy.

  3. For a directed graph whose edges ee carry labels λ(e)\lambda(e) in an ordered set, with λ(e)≠λ(e′)\lambda(e) \ne \lambda(e') whenever the target of ee is the source of e′e', every directed path e1,…,ere_1, \dots, e_r with λ(e1)≥λ(e2)≥…≥λ(er)\lambda(e_1) \ge \lambda(e_2) \ge \dots \ge \lambda(e_r) satisfies λ(e1)>λ(e2)>…>λ(er).\lambda(e_1) > \lambda(e_2) > \dots > \lambda(e_r).(10)✦

  4. For an element TT of a semiring, b∈Wb \in W, generic linear functionals ff and hh on ℝI\mathbb{R}^I, and x,y∈Wx, y \in W with x≤bx \le b, Dbf(T)x,y=Dbh(T)x,y.D^f_b(T)_{x,y} = D^h_b(T)_{x,y}.(11)✦

  5. For a ratio order OO and x,y∈Wx, y \in W with yy in the chamber of OO, Rx,yO(T)=R̃x,y(T).R^O_{x,y}(T) = \tilde R_{x,y}(T).(12)✦

  6. For an order isomorphism ι:[u,b]→[u′,b′]\iota : [u,b] \to [u',b'] onto a Bruhat interval of a Coxeter system (W′,S′)(W',S') of finite rank with normalized RR-polynomials R̃′\tilde R', and for x,y∈[u,b]x, y \in [u,b], the schedule product (3) of the transported schedule over ℤ[T]\mathbb{Z}[T] satisfies Πpι(T)x,y=R̃ι(x),ι(y)′(T).\Pi_{p_\iota}(T)_{x,y} = \tilde R'_{\iota(x),\iota(y)}(T).(13)✦

In the paper, the result reads: for a reflection order, with R̃x,y(T)\tilde R_{x,y}(T) the sum of TrT^r over the directed paths of rr edges from xx to yy in the Bruhat graph whose left labels strictly increase, Rx,yR_{x,y} the RR-polynomial in the variable qq and d(x,y)=ℓ(y)−ℓ(x)d(x,y) = \ell(y) - \ell(x), q−d(x,y)/2Rx,y(q)=R̃x,y(q1/2−q−1/2)q^{-d(x,y)/2} R_{x,y}(q) = \tilde R_{x,y}(q^{1/2} - q^{-1/2}), and the same holds for strictly decreasing labels.

What Is Checked

The claims (9) and (10) are stated over an arbitrary directed graph. The others are stated over a Coxeter system of finite rank with its Bruhat order and Bruhat graph, the Tits space with its roots, Tits action and geometric functional, generic linear functionals and ratio orders with their chambers, the Dyer matrices (4) and the transported schedule, the adapted path polynomials (5), an order isomorphism of Bruhat intervals, and the normalized RR-polynomials (7).

About these constructions the library proves that the lower ideal {x∈W:x≤b}\{x \in W : x \le b\} is finite✦, that the label yx−1yx^{-1} of an upward edge x→yx \to y is a reflection✦, that a linear functional with distinct geometric slopes exists✦, and that each operator LsL_s of (6) is invertible with two-sided inverse Ls−aL_s - a. For VV, BB and αi\alpha_i as in (1), it proves B(αi,αi)=2B(\alpha_i,\alpha_i) = 2✦ and the Coxeter relations (σiσj)mij=1(\sigma_i\sigma_j)^{m_{ij}} = 1 whenever mijm_{ij} is finite.✦