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.
Inverse Kazhdan–Lusztig polynomials
Definition
For set where the inner sum is over strictly increasing Bruhat chains from to , the chain occurs only when , and are the coefficients of the Kazhdan–Lusztig basis (Existence and uniqueness of the Kazhdan–Lusztig basis). Every chain lies in a finite Bruhat interval by Basic properties of the Bruhat order on , so the sum is finite. If there are no chains; if , the empty chain gives . If , each chain has at least one factor with , so .
Let and . The matrix is strictly triangular on the finite Bruhat poset, hence nilpotent; the entry of is the sum of products over chains of strict steps. Therefore where can be any integer at least the maximum strict-chain length. In particular, and
The inverse Kazhdan–Lusztig polynomials in the classical sign convention are . If is the diagonal matrix with entries , then . Equivalently, if is the basis of dual to the Kazhdan–Lusztig basis, then since .
Remarks
The finite chain inverse and dual-basis description use the locally proved unitriangular basis and coefficient clauses of Existence and uniqueness of the Kazhdan–Lusztig basis. Coefficientwise positivity is not required.
Depends on
Used by
Dependency tree · two levels
13 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
- G. Lusztig, Hecke Algebras with Unequal Parameters, revised version arXiv:math/0208154v2 — §10.1–10.2: chain formula and inverse matrices; §10.7: the dual-basis interpretation. (standard reference, not scraped)
- Susumu Ariki, Robinson–Schensted correspondence and left cells, arXiv:math/9910117 (18 pp.) — §2.2: the classical Kazhdan–Lusztig polynomial and μ-coefficient conventions used with the sign normalization. (standard reference, not scraped)