Prerequisites that meet in the main proof
Three collections of definitions support the comparison. Coxeter words give length, reflections and Bruhat intervals. Realization data turn reflections into root vectors and linear labels. Graded algebra supplies homogeneous components, finite module data, scalar quotients and Hilbert values. The proof repeatedly passes between these descriptions, so their conventions must be read together.
The strong-exchange theorem controls changes in reduced words. Root-sign and root-plane results control the geometry of reflection edges. On the algebra side, a root label becomes a degree-one polynomial, and quotienting by it gives the edge coefficient ring. These are the inputs for the sheaf restrictions and for the factor \(1-q\) in an upper-image Hilbert value.
The later arguments use these foundations in specific combinations: rank-two geometry supplies counts, localization supplies image equalities, and positive Hilbert values detect whether an inclusion is strict. The route below gives the definitions before those applications and connects each prerequisite to a proof-bearing node.
Reading sequence
- Words, length, reflections, and inversion sequences — Fix word and length notation.
- Strong exchange and deletion from a reduced word — Derive the deletion mechanism.
- The Tits form, simple roots, and normal functionals — Introduce roots and their normal functionals.
- Reflection roots as polynomial edge labels — Turn root vectors into algebraic edge labels.
- Finite nonnegatively graded module data — Read the actual nonnegative module-data fields.
- Hilbert functions, formal series and numerical values — Distinguish series, numerical values and graded rank.
- Finite graded polynomial modules have convergent Hilbert values — Justify the values used in comparison.