A starting route into the Blueprint

The central objects are a Coxeter group, one of its Bruhat intervals, and the canonical KL polynomial attached to the interval endpoints. Begin with words and length, then the definition of Bruhat order. The polynomial side begins with explicit Hecke operators; the quadratic relation and bar involution determine the coefficient families that will be compared.

The proof connects these objects through a boundary sheaf on the reflection graph. A stalk is a graded module, an edge module is a quotient by a root label, and selected kernels record the outgoing restrictions that remain to be imposed. Reading these definitions makes the later image comparisons concrete: both images are submodules of one edge module.

The global edge inclusion and one-edge Hilbert comparison form the central calculation. They feed a sequence of elementary transfers, whose endpoints are actual sheaf characters. The final induction uses exactness of those endpoints to recover freeness and polynomial invariance together. The reading sequence selects a first pass through this chain; the keyword and topic pages then expose its detailed prerequisites.

Reading sequence

  1. Words, length, reflections, and inversion sequences — Learn words, reflections and length.
  2. Strong Bruhat order — Pass from words to interval order.
  3. The standard module and its left and right Hecke operators — Define the operators behind the polynomial families.
  4. Module-valued sheaves on an ordered graph — Read the modules and restriction maps.
  5. Kernels of upward edge conditions — Interpret a selected set of equations.
  6. Kernel Hilbert values and normalized states — Define the numerical state.
  7. The normalized single-edge inequality and its equality criterion — Follow one complete comparison step.
  8. Combinatorial invariance of Kazhdan–Lusztig polynomials — Return to the main statement.

Entries for this keyword