How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Kazhdan–Lusztig polynomials in the classical -normalization
Definition
Identify with by . For in , put and define the Kazhdan–Lusztig polynomial by where is the Kazhdan–Lusztig basis of Existence and uniqueness of the Kazhdan–Lusztig basis. The parity clause of that theorem makes the right side a polynomial in . The conventions are: unless , , has constant term 1, and for its degree is at most . The -coefficient is defined to be 0 when is even; equivalently is the coefficient of in . One writes when and ( and ) or ( and ). The dictionary with the literature is recorded for use: with the classical parameter one has , the element is the basis element of [EW], and with [EW, Remark 3.2].
Remarks
The coefficient rescaling, support, constant term and degree bound use the locally proved coefficient, parity and degree clauses of Existence and uniqueness of the Kazhdan–Lusztig basis. Coefficientwise positivity is not required.
Depends on
Used by
- Inverse Kazhdan–Lusztig polynomials Definition
- L-, R- and two-sided Kazhdan–Lusztig preorders and cells Definition
- The Kazhdan–Lusztig bases of S₂ and S₃ Example
- The R- and Kazhdan–Lusztig recursions on a small singular interval Example
- Star operations are Knuth moves and preserve the relevant cells Lemma
- μ-edges and left equivalence are transported by star operations Lemma
- Multiplication by a generator in the Kazhdan–Lusztig basis Theorem
- The Kazhdan–Lusztig polynomial descent recursion Theorem
Dependency tree · two levels
10 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Ben Elias and Geordie Williamson, The Hodge theory of Soergel bimodules, arXiv:1212.0791 — §3.2, printed pp. 15–16: the Hecke normalization and Remark 3.2, with q=v^-2, H_x=v^ell(x)T_x, and h_{y,x}=v^(ell(x)-ell(y))P_{y,x}(v^-2). (standard reference, not scraped)
- Susumu Ariki, Robinson–Schensted correspondence and left cells, arXiv:math/9910117 — §2.2, Definition 2.3 and Lemma 2.5(1): the classical q-polynomial normalization, degree bound, and constant term. (standard reference, not scraped)
- G. Lusztig, Hecke Algebras with Unequal Parameters, revised version arXiv:math/0208154v2 — Theorem 5.2 and Proposition 5.4 in the split case L=1: the new-basis coefficients and degree/parity bounds. (standard reference, not scraped)