The normalized R-family as bar coefficients
Let \(a\) be an indeterminate. In the normalized Hecke module over \(\mathbb Z[a]\), form the inverse-word bar basis with operator parameter \(-a\). Define \[ \widetilde R_{x,y}(a) =\text{the coefficient of }e_x\text{ in that bar-basis vector at }y. \] The minus sign belongs to the defining parameter convention. It makes the simple-edge coefficient \(a\), matching the positive path parameter used later.
Triangularity of the bar basis gives \[ \widetilde R_{x,x}=1,\qquad \widetilde R_{x,y}=0\quad\text{if }x\not\leq y. \] These are polynomials with integer coefficients, constructed from operators rather than postulated as solutions of a recursion.
The descent recursion is a theorem about this family. The relation to ordinary \(R_{x,y}(q)\) after the square-parameter substitution is another theorem, with its own normalization factors. The path theorem later identifies this operator-defined family with the polynomial counting increasing reflection paths.
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.
References
Lean formalization
OAI.KLInvariance.Hecke.rTilde: Hecke.lean:482.
OAI.KLInvariance.Hecke.rTilde_diagonal: Hecke.lean:485.
OAI.KLInvariance.Hecke.rTilde_zero: Hecke.lean:488.