The decreasing-path formula for a geometric reflection order
Fix a Coxeter system \(W\) with finitely many simple generators, and let \(b,x,y\in W\) satisfy \(x\le_Wb\) and \(y\le_Wb\). Use the fixed geometric functional on the original real root space. Let \(p_b\) be its decreasing schedule of all directed reflection edges below \(b\), and use the formal coefficient \(X\) over \(\mathbb Z[X]\).
Then the ordered transfer product has entry \[ \bigl(\mathcal D_{p_b}(X)\delta_y\bigr)_x =\widetilde R_{x,y}(X). \] The path-sum expansion expresses the left side as the sum of \(X^{|q|}\) over the selected directed paths from \(x\) to \(y\). Their geometric labels are strictly decreasing.
Relation to the OpenAI notes
Same polynomial, different construction order.
OpenAI notes: The path-formula theorem introduces the normalized R-polynomial through increasing reflection paths and relates it to the ordinary R-polynomial; decreasing paths follow by reversing the reflection order. bg:paths, eq:bg-path-formula.
Lean (primary): The normalized R-family is defined first as a coefficient of the Hecke bar transform. Its recursion is proved algebraically, and the geometric path product is later proved equal to that independently constructed family. Hecke:482, Hecke:491, ReflectionOrders:1229.
Role in the proof: The bar construction supplies the R-family and its recursion. The path theorem then identifies that family with the ordered path polynomial.
Different stated generality.
OpenAI notes: The cited Dyer theorem is stated for a reflection order in general; the subsequent comparison chooses geometric reflection orders. bg:paths.
Lean (primary): The referenced formal entry theorem establishes the required path formula for the constructed geometric functional on a finite lower region of a finite-generator system. Generic pencils and complete root-plane blocks provide its order-independence argument. ReflectionSchedules:126, ReflectionOrders:1229.
Role in the proof: The geometric-order hypotheses specify the path theorem used here. The generic-functional construction orders all positive roots; the transfer calculation takes place on the finite region in the theorem.
Proof
Step 1. Ordered path-polynomial entries
On the finite lower region below \(b\), expand the transfer product using Ordered transfer products enumerate paths. Its \((x,y)\)-entry is the sum of \(X^{|p|}\) over directed paths whose edges occur in the schedule order. The sorted-path selection theorem makes the weak schedule order strict along every contributing path, because equal root labels cannot be composable.
Step 2. A height-denominator chamber order and its path polynomial
The prescribed-chamber existence theorem gives a ratio order \(O\) in the chamber of \(y\), with height denominator. The adapted path identification therefore gives \[ F_O(x,y;X)=\widetilde R_{x,y}(X). \] Its proof rotates at a least simple descent \(s\), obtaining \(O'\) in the chamber of \(sy\), with \(\ell(sy)<\ell(y)\). The path-polynomial recursion uses \(O'\) on both smaller terms: \[ F_O(x,y;X)= \begin{cases} F_{O'}(sx,sy;X),&\ell(sx)<\ell(x),\\ F_{O'}(sx,sy;X)+X F_{O'}(x,sy;X),&\ell(x)<\ell(sx). \end{cases} \] The rotated path-sum theorem accounts for the paths avoiding the chosen simple label; the simple-prefix decomposition accounts for the extra \(X\). Strong induction over all orders and both endpoints then matches the normalized R-recursion. The linked entries give the parameter construction, the two finite path bijections and every induction substitution.
Step 3. The full intrinsic root-plane block
Fix an induced root-plane system \(D\) with its actual ambient root slopes, and a full intrinsic interval \([\mathrm{lo},\mathrm{hi}]_D\). The interval-flip construction fixes both endpoints and exchanges the two vertices in each strictly internal rank. Its edge map preserves source and target through that vertex map and is an involution.
For a composable pair \(e:x\to y\), \(h:y\to z\), the middle vertex has length strictly between the endpoint lengths. It has exactly one simple left descent, and the flip exchanges that descent. The middle-vertex slope test therefore gives \[ \lambda(e)<\lambda(h) \Longleftrightarrow \lambda(g(h))<\lambda(g(e)). \] The plane-path reversal theorem verifies this equivalence and uses it in both directions of sorted path transport. A decreasing path in a full schedule maps to a path in the reverse schedule, with the same fixed endpoints and the same number of edges. The involution gives the inverse correspondence.
The path-sum expansion now gives equality of the two endpoint entries on the intrinsic interval. To pass to the ambient lower region, paths whose labels all lie in this plane stay in one plane-subgroup coset. The coset graph identification lifts them to the full relative interval between their endpoints. Applying the intrinsic identity there gives the corresponding ambient plane-block entry equality; if the endpoints have no such path, both entries are zero.
Step 4. Generic pencils and order independence
Choose a common transverse functional \(g\) for the given functional \(f\) and an adapted one \(h\), as follows. For three normalized roots \(a,b,c\) with \(c\) outside the plane of \(a,b\), put \[ v_f=f(a-b)(c-b)-f(c-b)(a-b). \] The two difference vectors are independent and \(f(a-b)\ne0\), so \(v_f\ne0\). Require \(g(v_f)\ne0\), impose the analogous conditions for \(h\), and also require \(g(a-b)\ne0\) for distinct normalized roots. There are only countably many nonzero vectors to avoid; the polynomial-family argument in the generic-functional proof chooses such a \(g\).
If a pencil \((1-t)f+tg\) ties \(a,b,c\), eliminating \(t\) from the two equalities would give \(g(v_f)=0\). Thus no root outside the plane can join a tie of \(a,b\). Conversely, the normalized roots in that plane lie on the affine line through \(a,b\), so every one ties when \(a,b\) do. This proves the complete-plane-block condition. Along the linear pencils from \(f\) to \(g\) and from \(h\) to \(g\), a tie involving distinct roots is, by the transverse choice, a complete actual root-plane block.
Near any pencil parameter, the strict comparisons between different tied blocks remain fixed: only finitely many edges occur in the lower region, so finitely many strict inequalities need to be preserved. Inside each block, a linear functional orders the normalized roots either angularly or in reverse angular order. Step 3 identifies these two products. A block with only one reflection label consists of noninteracting edges, whose transfers commute.
Hence every block product, and therefore the whole entry, is locally constant along the pencil, including at crossing parameters. A locally constant function on the connected real parameter interval is constant. Comparing both pencils identifies the entry for \(f\) with that for \(h\).
Step 5. The sign convention and fixed geometric functional
The adapted calculation in Step 2 counts increasing labels. Negating its numerator makes the decreasing schedule count exactly those paths. Step 4 permits replacing that negative numerator by the fixed geometric functional used for the full matrix. The constructed functional separates all positive-root slopes, so it satisfies the required genericity hypothesis. Its entry is therefore \(\widetilde R_{x,y}(X)\).
The Lean result used here is for these geometric orders; the preprint cites Dyer's broader reflection-order theorem. The blueprint follows the proved geometric-order statement.
References
2. Real realizations and moment-graph sheaves.
Lean formalization
OAI.KLInvariance.WallDyer.geometric_entry_eq_rTilde: ReflectionOrders.lean:1229.