The ordinary integral R-polynomial family
Let \(Q\) be the Laurent indeterminate in \(\mathbb Z[Q,Q^{-1}]\). A Laurent polynomial is a finite sum \(\sum_{n\in\mathbb Z}a_nQ^n\). The element \(Q\) is a unit with inverse \(Q^{-1}\), so the Hecke R-value \(r_Q(x,y)\) is defined.
The polynomiality theorem proves that every exponent occurring in \(r_Q(x,y)\) is nonnegative. Thus there is a unique polynomial \[ R_{x,y}(q)\in\mathbb Z[q] \] whose Laurent image is \(r_Q(x,y)\). The source defines it by the truncation map retaining the nonnegative coefficients, after proving polynomiality. In symbols, \[ R_{x,y}(Q)=r_Q(x,y). \] Uniqueness follows because the inclusion of polynomials into Laurent polynomials is injective: it retains every coefficient.
Evaluation at a unit
For a commutative ring \(C\) and a unit \(q_0\in C\), evaluate integer coefficients through the canonical map \(\mathbb Z\to C\). The specialization theorem gives \[ R_{x,y}(q_0)=r_{q_0}(x,y). \] The polynomial also has a well-defined value at nonunits, since polynomial evaluation uses only nonnegative powers. The inverse-operator description uses units.
Initial values and recurrence
The source proves \[ R_{x,x}=1,\qquad R_{x,y}=0\quad(x\not\le y), \] and, for any \(sy<y\), \[ R_{x,y}= \begin{cases} R_{sx,sy},&sx<x,\\ (q-1)R_{x,sy}+qR_{sx,sy},&sx>x. \end{cases} \] Polynomiality, specialization and this recurrence are developed together in the construction theorem. The separate degree theorem proves the bound by the length difference.
For distinct simple reflections \(s,t\), the reduced word \(st\) gives \[ R_{1,st}=(q-1)R_{1,t}+qR_{s,t}=(q-1)^2. \] Here \(R_{s,t}=0\): comparable elements of the same length must be equal, and \(s\ne t\).
References
The local source declarations below give the construction and proof.
Lean formalization
OAI.KLInvariance.OrdinaryR.variableUnit: OrdinaryR.lean:24.
OAI.KLInvariance.OrdinaryR.polynomial: OrdinaryR.lean:62.
OAI.KLInvariance.OrdinaryR.toLaurent_polynomial: OrdinaryR.lean:65.
Used by
- The reciprocity defect on a proper upper interval
- The reciprocal convolution identity for R-polynomials
- R-reciprocity for the actual boundary-sheaf character
- Lower-character normalization and convolution on an ambient interval
- Normalized R-polynomials and the square parameter
- Polynomiality, specialization and descent of ordinary R-values
- The reversed R-kernel with its bottom term removed
- The recursive polynomial family on Bruhat intervals