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.
Multiplication by a generator in the Kazhdan–Lusztig basis
Facts & Assumptions
Given: , a simple reflection , the normalized Hecke algebra, and its Kazhdan–Lusztig basis.
The elements form a standard basis and satisfy (The normalized type-A Hecke algebra and its bar involution).
The basis elements are bar-invariant, have , unless , for , and (Existence and uniqueness of the Kazhdan–Lusztig basis).
Under the classical polynomial normalization, for , and is the coefficient of in , set to when the length difference is even. For a Bruhat cover , this gives (Kazhdan–Lusztig polynomials in the classical -normalization).
Bruhat order has the reduced-subword characterization and left lifting properties, and is preserved by inversion (Basic properties of the Bruhat order on ).
The reversal anti-automorphism fixes , sends to , and reverses products (Reversal anti-involution commutes with the Hecke bar).
Statement
Let be a simple reflection and . In the Kazhdan–Lusztig basis of Existence and uniqueness of the Kazhdan–Lusztig basis: and symmetrically if , if . Here is the coefficient of in (Kazhdan–Lusztig polynomials in the classical -normalization), which can be nonzero only when is odd; the sums are finite since is finite. In particular , and when and . The span conclusion is for the ascent case : there, lies in the span of and of the with and .
Proof
The left-ascent difference. Put by [F2, F3]. We prove the formulas by induction on , assuming the descent formula for all smaller upper indices. If , reduced concatenation gives ; if , write and use the quadratic relation to get . Suppose and set . For any , fix a reduced expression for and a reduced subword for . Since , prefixing gives a reduced expression for ; when , prefixing to the subword gives a reduced subword for , and when , . Thus every standard-basis term of is indexed by an element . The same holds for , since and every satisfies . Only the leading term can produce in , with coefficient : for , the terms from have length at most . The leading term of gives coefficient in . Thus is supported strictly below . Using [F1], its coefficient at is with when .
Coefficients with . Let and . The terms and are each either or in , except when ; that exception forces and is excluded. If , then in fact , since would give , contrary to . The sum defining then contains its term , since . By definition of , ; every remaining sum term has and . If , then , , and the sum is empty. Thus in both cases.
Coefficients with . For , the coefficient is : the simple ascent makes a Bruhat cover, so the degree bound and constant term of give . Suppose and . If , then (otherwise ), so and the sum is empty; the remaining is either zero or in . Now assume . Fix a reduced expression for and a reduced subword for . Since and , prefixing gives a reduced expression for and a reduced subword for , so ; because , . For each with , induction gives , or . Comparing the coefficient of gives . For every such with , the left-lifting clause in [F4] gives ; conversely implies . Thus the sum in becomes , and . Since , Step 2.1 gives ; the other two coefficients are also in . Therefore .
Conclude the left-ascent formula. Both and are bar-invariant, since the coefficients are integers by [F3]. Thus is bar-invariant. By steps 1.1–3.1 it is a sum of lower standard basis elements with coefficients in . Adding to would give another bar-invariant element in ; uniqueness in [F2] forces . This proves the formula when .
Left descents. Suppose and put . The ascent case for gives . The quadratic relation gives . Apply to this equality. Every in the sum has , so induction gives . Thus , and . This also covers ; the ascent sum is empty for and for the stated length-at-most-one case.
Right multiplication. Apply the left formulas to and then apply . By [F5] it reverses the product and fixes ; by inverse-index symmetry in [F2], it sends to . Bruhat inversion sends to , and ; the coefficient is unchanged because and is the coefficient of in that coefficient. This yields the asserted right formulas. The proof uses only finite Bruhat intervals and no choice principle.
Remarks
The argument uses the locally proved triangular basis and degree clauses of Existence and uniqueness of the Kazhdan–Lusztig basis, and the coefficient-of- definition of . Coefficientwise positivity is not required.
Depends on
Used by
- L-, R- and two-sided Kazhdan–Lusztig preorders and cells Definition
- The Kazhdan–Lusztig bases of S₂ and S₃ Example
- Star operations are Knuth moves and preserve the relevant cells Lemma
- μ-edges and left equivalence are transported by star operations Lemma
- Kazhdan–Lusztig cells of type A are classified by RSK tableaux Theorem
- The Kazhdan–Lusztig polynomial descent recursion Theorem
Dependency tree · two levels
15 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 — §§6.3–6.7: the equal-parameter generator formulas; Corollary 6.5 identifies μ^s as the coefficient of v_L^{-1}, which becomes this page's coefficient of v under v_L=v^{-1}; Theorem 6.6 gives the left formula. (standard reference, not scraped)
- Ben Elias and Geordie Williamson, The Hodge theory of Soergel bimodules, arXiv:1212.0791 — §3.2, printed pp. 15–16: the normalized Hecke algebra and Kazhdan–Lusztig basis. (standard reference, not scraped)