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 - and Kazhdan–Lusztig recursions on a small singular interval
Facts & Assumptions
Given: One-based , , , and . Put .
Bruhat order is graded by inversion length, has the reduced-subword characterization and prefix-rank criterion, and satisfies the lifting implication: if , , and , then (Basic properties of the Bruhat order on ).
The -coefficient is defined as the coefficient of in (Bruhat intervals and the -coefficients).
has constant term on comparable pairs, degree at most for , and ; vanishes for even length differences (Kazhdan–Lusztig polynomials in the classical -normalization).
The KL left descent recursion uses when , with correction indices having and (The Kazhdan–Lusztig polynomial descent recursion).
The chain-defined inverse coefficients satisfy for , with diagonal ; their matrix is the two-sided inverse of (Inverse Kazhdan–Lusztig polynomials, The Kazhdan–Lusztig inversion formula).
The -coefficients vanish unless , have diagonal , obey the left descent recursion, and have leading and trailing terms and on comparable pairs (The -coefficient recursion, support, degree bounds and inversion).
Example
In , written in one-line notation, let and (a reduced word of length ; the two middle generators commute). (a) The interval has exactly ten elements: ; ; ; and . (b) For comparable pairs in this interval the only Kazhdan–Lusztig polynomial different from is ; so , and is a -pair with : -pairs need not be covers. All other -pairs inside the interval are covers, and all for are the corresponding Laurent polynomials read off from The -coefficient recursion, support, degree bounds and inversion. (c) The descent recursion of The Kazhdan–Lusztig polynomial descent recursion at , and (a left descent of , with and , so ) reads the sum is empty because and its only element with is , for which ; since , the recursion returns , in agreement with (b). (d) The inverse Kazhdan–Lusztig polynomial of Inverse Kazhdan–Lusztig polynomials is , while and ; the matrix identity of The Kazhdan–Lusztig inversion formula holds on the ten-point interval. In particular the inverse coefficients are not all nonnegative even though all are.
Verification
The full interval. The displayed word for has inversion length , so it is reduced. Its reduced subwords of lengths give respectively ; ; ; ; and . The four excluded elements have no reduced subword , so they are not above ; the other ten are. For an explicit order check, write , , , , and , , , . The reduced-subword criterion gives the intermediate covers ; ; ; ; each rank-two element is also above , and each rank-three element is below . These are all cover incidences between adjacent ranks, so all other comparisons are their transitive consequences.
The correction interval. Left gives and . Step 1.1 gives . Their left products are respectively , of lengths , whereas the original lengths are . Thus only has that descent, and by its even length gap. In particular is excluded: .
All the -coefficients. By [F9], noncomparable pairs have , diagonal entries are , and every comparable coefficient is nonzero because its leading term is . For a cover, the degree range and parity in [F9] leave only the terms and , so . For a comparable pair of gap two, induct on and choose a left descent of . If , the recursion gives ; this coefficient is nonzero, so [F9] implies , and induction gives . If , then : its indices have equal length, and equality would force . By the lifting implication in [F1], , so the other recursion term is . Thus every gap-two pair in has coefficient . The only gap-three pair in is . Since is a left descent of both, . For , is a left descent, so . The first term is zero because has no reduced subword ; the second is . Hence . This determines every coefficient for pairs in the displayed interval.
The sole nonconstant polynomial. By [F3], all comparable pairs of gap at most two have , so the only possibly nonconstant pair within the interval is . To evaluate , apply [F4] with left to , obtaining lower top . No element below has left -descent: its subwords are , with no inversion between the values . Also . Hence . Now use [F4] at : step 2.1 makes its correction sum empty, , and , so . Therefore and . Every other comparable distinct pair has , so its nonzero occurs exactly on covers.
Inverse entries and both matrix products. Step 3.1 gives diagonal , cover entries , and gap-two entries . Each gap-two interval in step 1.1 has two intermediate elements. Thus [F5] gives inverse entries at gaps . At the sole gap-three pair there are four elements at each intermediate rank, so . This gives every entry of the inverse matrix, including every displayed value in part (d). For , the off-diagonal entries at gaps one and two are and ; at gap three the entry is . For , these entries are , , and . Diagonal entries are and noncomparable entries are zero by support, so both matrix products are the identity. Although all -entries in this finite example are nonnegative, its cover inverse entries and are negative. Every calculation is finite and uses no choice principle.
Depends on
- Bruhat intervals and the $R$-coefficients
- The $R$-coefficient recursion, support, degree bounds and inversion
- The Kazhdan–Lusztig polynomial descent recursion
- Kazhdan–Lusztig polynomials in the classical $q$-normalization
- Inverse Kazhdan–Lusztig polynomials
- The Kazhdan–Lusztig inversion formula
- Basic properties of the Bruhat order on $S_n$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
17 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 descent recursion for Kazhdan–Lusztig polynomials and its μ-correction term. (standard reference, not scraped)
- G. Lusztig, Hecke Algebras with Unequal Parameters, revised version arXiv:math/0208154v2 — §§4.3–4.9: R-coefficients, recurrence and bounds; §§10.1–10.2: the inverse chain formula and inverse matrices, in the equal-parameter specialization. (standard reference, not scraped)
- Ben Elias and Geordie Williamson, The Hodge theory of Soergel bimodules, arXiv:1212.0791 — §3.2 (printed pp. 15–16): normalized Hecke algebra, bar and KL-basis conventions, and Remark 3.2 with $\underline H_x=C'_x$ and $h_{y,x}=v^{\ell(x)-\ell(y)}P_{y,x}(v^{-2})$. (standard reference, not scraped)