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 bases of and
Facts & Assumptions
Given: The one-based permutation groups , with composition as functions; left swaps values . Write and .
The standard elements form a basis, , and the normalized bar assignment sends to (The normalized type-A Hecke algebra and its bar involution).
The bar assignment descends to a multiplicative semilinear involution of the quotient Hecke algebra (The Hecke bar involution is well defined).
A bar-fixed element in is uniquely , and these elements form a basis (Existence and uniqueness of the Kazhdan–Lusztig basis).
The coefficients satisfy and (Kazhdan–Lusztig polynomials in the classical -normalization).
Multiplication by is the descent scalar or the ascent sum with lower -descent terms (Multiplication by a generator in the Kazhdan–Lusztig basis).
Bruhat order has the reduced-subword characterization and is graded by inversion length (Basic properties of the Bruhat order on ).
The -coefficient is the coefficient of in the standard-basis expansion of (Bruhat intervals and the -coefficients).
Example
Work in the normalization of The normalized type-A Hecke algebra and its bar involution, write permutations in one-line notation, and put as in Kazhdan–Lusztig polynomials in the classical -normalization. (a) In : , , , , and . (b) In the bar images of the standard basis are the Kazhdan–Lusztig basis is all with equal , and exactly when is a cover of the Bruhat order on (the eight covers , , , , , , , in one-line notation). (c) Multiplication checks: and, in the case with one -edge, (here and , so the sum in Multiplication by a generator in the Kazhdan–Lusztig basis has the single term ).
Verification
Rank one. By [F1, F2], and ; by [F7], this gives . Since , is bar-fixed. It is triangular below , so uniqueness [F3] gives and . From in [F1], Its off-diagonal coefficient is , so [F4] gives and .
Every bar image in . Put and . The reduced words give , and . By [F1, F2], their bar images are computed by expanding and its reverse for the two length-two images, and for the length-three word, replacing by . The latter gives . Since and , these are exactly all the displayed bar images. Multiplicativity computes the images directly; it does not assert that itself is bar-fixed.
The six KL elements. Put and . By [F1, F2], both are bar-fixed, and A direct expansion gives so subtracting gives exactly the displayed . Each of is bar-fixed and has top coefficient with lower coefficients in ; all lower indices are below its top by [F6]. Thus uniqueness [F3] identifies all six elements.
Polynomials and covers. Reading the expansions in step 1.3 gives for every , so [F4] gives and is exactly at length difference one. By the reduced-subword criterion [F6], the Bruhat ranks in are , , , and , and each element in one of these layers is below every element in the next layer. Hence the covers are precisely the two edges from , the four edges from rank one to rank two, and the two edges into ; these are exactly the eight pairs listed. Grading rules out other covers.
The ascent multiplication check. The subword criterion [F6] gives . Left sends to , whereas it sends to and to ; thus among the strict lower indices only has a left -descent. Step 2.1 gives , so [F5] yields . For comparison, left sends to , and the descent formula gives . The rank-one square was already proved in step 1.1.
Depends on
- The normalized type-A Hecke algebra and its bar involution
- The Hecke bar involution is well defined
- Bruhat intervals and the $R$-coefficients
- Existence and uniqueness of the Kazhdan–Lusztig basis
- Kazhdan–Lusztig polynomials in the classical $q$-normalization
- Multiplication by a generator in the Kazhdan–Lusztig basis
- 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
- Ben Elias and Geordie Williamson, The Hodge theory of Soergel bimodules, arXiv:1212.0791 — §3.2 (printed pp. 15–16): the normalized Hecke algebra, bar involution, triangular Kazhdan–Lusztig basis, rank-one element, and the dictionary $\underline H_x=C'_x$ and $h_{y,x}=v^{\ell(x)-\ell(y)}P_{y,x}(v^{-2})$. (standard reference, not scraped)