The proof of combinatorial invariance

An interval order isomorphism is the input to the main theorem: the canonical Kazhdan–Lusztig polynomial of its two endpoints is unchanged. The proof first develops Coxeter length and Bruhat order, then defines the Hecke operators, their bar transform, and the canonical polynomial families. These definitions fix the normalizations used throughout the argument.

The geometric part recovers reflection edges from the interval order and uses target-root scores to order the source edges. The sheaf part constructs actual boundary modules, their pairings and characters. Root-plane localization reduces the comparison of two embedded edge images to dihedral structure models; the transported count theorem supplies the difference of their label exponents. This gives the global edge inclusion under the specified upper-kernel freeness hypothesis.

The one-edge Hilbert comparison turns that inclusion into a numerical step. Iterating the step produces an ordered transfer product; the geometric path identity identifies it with the target R-matrix. Its adapted part first constructs a chamber order, rotates at a least simple descent and matches the path-polynomial recursion with the Hecke recursion. Character reciprocity supplies the endpoint formulas. When the R-data agree, the comparison is exact at its endpoints, forcing equality at every step and recovering free suffix kernels. The simultaneous invariance induction proves R-invariance together with this freeness. Canonical KL uniqueness then gives the KL conclusion, and finite-support reduction reaches arbitrary Coxeter systems. The sequence below follows these inputs into the final result.

Reading sequence

  1. Strong Bruhat order — Define the interval order being preserved.
  2. The standard module and its left and right Hecke operators — Define the algebraic operators.
  3. Inverse-basis transforms and the Hecke bar involution — Construct the transform defining the R-data.
  4. Existence and uniqueness of the canonical KL families — Identify the polynomial family in the conclusion.
  5. Reflection roots as polynomial edge labels — Connect root geometry with coefficient labels.
  6. Unlabelled interval isomorphisms preserve reflection edges — Recover the reflection edges from the order.
  7. Directed edge lists, path weights and selected path sets — Define directed edge lists and their selected path sets.
  8. Ordered transfer products enumerate paths — Expand the transfer entry into weighted paths.
  9. A chamber order rotates at a least simple descent — Move a least simple root to greatest position at a shorter top.
  10. The two-order descent recursion for increasing path polynomials — Derive the recursion from the two path bijections.
  11. The path polynomial of a chamber order equals the normalized R-polynomial — Identify the adapted path polynomial with the Hecke R-family.
  12. Reversal of the full path product in an induced dihedral interval — Prove the full intrinsic plane-block identity.
  13. The decreasing-path formula for a geometric reflection order — Identify the geometric path product with R-data.
  14. Minimal-boundary sheaves and their normalized stalk — Introduce the actual sheaf used by comparison.
  15. R-reciprocity for the actual boundary-sheaf character — Obtain the actual sheaf-character identity.
  16. Decomposition of the sheaf after root-plane localization — Construct the local models used in comparison.
  17. The edge-image inclusion for a chronological schedule suffix — Obtain the conditional image inclusion.
  18. The normalized single-edge inequality and its equality criterion — Convert it into the normalized numerical step.
  19. From one-edge bounds to the full transfer inequality — Iterate the bound under the upper-freeness hypotheses.
  20. The complete schedule comparison under upper-kernel freeness — Supply image inclusions from the exact upper suffix kernels.
  21. R-matrix equality makes the comparison endpoints exact — Make endpoints exact when the R-data agree.
  22. Recovering a projective kernel from scaled image equality — Recover projective kernels from the resulting image equalities.
  23. Simultaneous R-tilde invariance and terminal-kernel freeness — Follow the simultaneous induction.
  24. KL invariance for finite-generator Coxeter systems — Identify the canonical KL polynomials after R-invariance.
  25. Finite-support interval models in standard parabolic systems — Reduce an arbitrary interval to finite support.
  26. Combinatorial invariance of Kazhdan–Lusztig polynomials — Read the unrestricted final theorem.

Entries for this keyword