The R-family and the later KL uniqueness step
The normalized R-family is defined from Hecke bar coefficients. Its diagonal value, vanishing range and simple-descent recursion give the computational structure used later by the path construction. The square-parameter conversion relates this family to ordinary R-polynomials.
In the combinatorial invariance proof, the R-family is the first polynomial object compared across intervals. Ordered reflection paths describe its matrix entries for the geometric orders constructed in the source. The Hilbert comparison produces inequalities involving that transported matrix, and simultaneous induction turns those inequalities into equality of R-polynomials.
The canonical KL family is then treated through its reciprocity relation and degree bound. Once the R-data agree, uniqueness eliminates the remaining difference of KL polynomials. This keyword therefore follows the two polynomial layers in their proof order: bar coefficients and R-recursion first, canonical KL identification afterward.
Reading sequence
- Inverse-basis transforms and the Hecke bar involution — Locate the coefficient construction.
- The normalized R-family as bar coefficients — Define the normalized R-family.
- The descent recursion for normalized R-polynomials — Read the recursion and initial cases.
- Normalized R-polynomials and the square parameter — Compare the parameter conventions.
- The decreasing-path formula for a geometric reflection order — Connect coefficients with ordered paths.
- Simultaneous R-tilde invariance and terminal-kernel freeness — Follow the R-invariance induction.
- KL invariance for finite-generator Coxeter systems — Pass from common R-data to KL invariance.