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.
The Kazhdan–Lusztig polynomial descent recursion
Facts & Assumptions
Given: , a simple reflection , a left descent , and the polynomial normalization .
, the standard elements form a basis and are products along reduced expressions, and (The normalized type-A Hecke algebra and its bar involution).
The Kazhdan–Lusztig basis and its generator multiplication formula are as stated in Multiplication by a generator in the Kazhdan–Lusztig basis.
when , and is the coefficient of in ; it is zero unless is odd (Kazhdan–Lusztig polynomials in the classical -normalization).
Writing , the basis coefficients vanish outside Bruhat order and satisfy (Existence and uniqueness of the Kazhdan–Lusztig basis).
Bruhat order is graded by , simple reflections change length by one, inversion preserves Bruhat order and length, and Bruhat comparison is characterized by reduced subwords; in particular for a simple reflection (Basic properties of the Bruhat order on ).
Statement
Let be a simple reflection, with , and . With whenever , where if and if ; here is the coefficient defined in Kazhdan–Lusztig polynomials in the classical -normalization (so the summand only occurs for odd, and is then an integer). The same recursion holds with (right descents) after replacing each index by , using and .
Proof
The coefficient equation. Since , we have . By [F2], By [F4], is supported on , and [F5]'s reduced-subword characterization gives . The constant-term and degree clauses in [F3] give and , so . Expand each using [F4]. Reduced words and the quadratic relation in [F1] give if ; if , then is reduced and . Thus the coefficient of on the left is when , and when . The coefficient on the right is . Therefore
Convert to -polynomials. Put . By [F5], . If , then and ; after substituting in step 1.1 and dividing by , the first two terms become . If , then , so they become . These identities also hold when an index is outside the relevant Bruhat interval, using the zero convention for . For a sum term, , giving the factor . Thus the two cases are the displayed formula with and , respectively. If , then is odd; since by [F5], the exponent is an integer.
Right descents. If , inversion preserves Bruhat order by [F5], so and . Apply the left formula to . Replace every inverted index using [F4]; lengths and length differences are unchanged by [F5], while becomes . This gives the right-descent recursion.
Remarks
The coefficient comparison uses the locally proved multiplication formula, normalization and inverse-index symmetry. Coefficientwise positivity is not required.
Depends on
Used by
Dependency tree · two levels
16 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
- Susumu Ariki, Robinson–Schensted correspondence and left cells, arXiv:math/9910117 — §2.2, Definition 2.4: the classical Kazhdan–Lusztig polynomial descent recursion and its μ-correction term. (standard reference, not scraped)
- G. Lusztig, Hecke Algebras with Unequal Parameters, revised version arXiv:math/0208154v2 — §§6.1–6.7: equal-parameter Kazhdan–Lusztig basis multiplication and coefficient symmetry, translated to v_L=v^{-1}. (standard reference, not scraped)