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 type-A Kazhdan–Lusztig basis has elementary triangular bar properties
Statement
For each there is a unique element with (i) and (ii) (the sum over the lower Bruhat ideal of ). The elements form an -basis of , and writing one has , unless , for , the bar-duality (matrix form ), and the symmetry . Moreover for , with : and ; every has integer coefficients and fixed parity .
Facts & Assumptions
Given: , the normalized Hecke algebra , its bar involution, and the Laurent coefficients of the bar images in the standard basis.
The standard elements form an -basis of (The normalized type-A Hecke algebra and its bar involution, The standard basis of the generic type-A Hecke algebra).
The bar is a semilinear algebra involution with (The Hecke bar involution is well defined).
The coefficients satisfy unless , , and both matrix identities ; for , their degree bounds, parity, and top coefficient are as stated in the R-coefficient theorem (The -coefficient recursion, support, degree bounds and inversion).
The -linear anti-automorphism commutes with bar and sends to (Reversal anti-involution commutes with the Hecke bar).
Bruhat order on is a finite graded order, strict inequalities raise length, and inversion preserves the order (Basic properties of the Bruhat order on ).
Proof
Construct the coefficients. Fix and descend on over the finite lower Bruhat ideal , starting with . Suppose and has been constructed for every , satisfying . Put . Then The second equality uses the induction equations; for , the identity makes the sum over zero, and its omitted diagonal term is . Write . Anti-invariance gives and . Define . Then and . The induction is finite and uses no choice principle.
Bar invariance and the coefficient equations. Set . The coefficient of in is . For this is ; for it is by step 1.1. If , no can satisfy , so support from [F3] gives coefficient zero. Thus and , which is the bar-duality formula.
Uniqueness. If two bar-invariant elements satisfy the triangular condition, their difference is a bar-fixed sum with each . If , choose a Bruhat-maximal in its finite support. The coefficient of in is : no supported contributes, and support of requires . Since , ; but and intersect only in , a contradiction. Thus the element is unique. The construction also gives and unless .
Basis. The transition from to is unitriangular on the finite Bruhat poset: each . A finite unitriangular matrix over is invertible, so is an -basis.
Degree, leading term, and parity. Induct on , with . For , the equation in step 1.1 has . By [F3] and induction, every term has exponents congruent to modulo . The term is , whose highest term is with coefficient . For each , put and , so ; the highest degree of is at most , since . Therefore has highest term with coefficient and only exponents of parity . As is its positive-degree part by step 1.1, it follows that terms of strictly smaller degree and . This proves the degree and parity clauses.
Inverse-index symmetry. By [F4], is bar-fixed. By [F5], inversion preserves Bruhat order, so this element has the form with lower terms in . Uniqueness from step 3.1 gives . Comparing coefficients yields .
Remarks
The triangular coefficients, degree bounds, parity and basis identities are proved here without coefficientwise positivity. The later local Soergel character and filtration-multiplicity argument proves positivity for these same uniquely normalized elements.
Depends on
- The $R$-coefficient recursion, support, degree bounds and inversion
- The Hecke bar involution is well defined
- The normalized type-A Hecke algebra and its bar involution
- The standard basis of the generic type-A Hecke algebra
- Reversal anti-involution commutes with the Hecke bar
- Basic properties of the Bruhat order on $S_n$
Used by
- Positivity of Kazhdan-Lusztig polynomials, mu-coefficients and structure constants Corollary
- Inverse Kazhdan–Lusztig polynomials Definition
- Kazhdan–Lusztig polynomials in the classical q-normalization Definition
- Finite type-A tensor Hecke bars and complementary coefficient charts Lemma
- Indecomposable labels, characters and filtration ranks agree after real scalar extension Lemma
- The Hecke trace form, its values on the Kazhdan-Lusztig basis, and the standard pairing Lemma
- Type-A tableau central summands are single linkage blocks Lemma
- Existence and uniqueness of the Kazhdan–Lusztig basis Theorem
- Minimal positive Rouquier complexes are linear under the lower Soergel induction Theorem
- Multiplication by a generator in the Kazhdan–Lusztig basis Theorem
- Parabolic Kazhdan-Lusztig polynomials give the dual-canonical transition matrix Theorem
- Soergel's character conjecture for type A Theorem
Dependency tree · two levels
14 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 book version) (standard reference, not scraped)