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.
Existence and uniqueness of the ordered-group unequal-parameter Kazhdan–Lusztig basis
Statement
Let be any set with Coxeter group , let be any weight function into a totally ordered abelian group, let , and let and its bar involution be as above. For each , there is a unique element such that
The family is an -basis. For a simple generator the normalization is
Facts & Assumptions
Given: An arbitrary-rank Coxeter system, a weight function , its ordered group algebra , the Hecke algebra , and its bar involution.
Weight functions and ordered group-algebra coefficients: , the bar sends to , and is the subgroup spanned by monomials with .
The arbitrary-rank weighted Hecke basis and Bruhat-triangular bar: is an -basis, bar is a semilinear involution, and is supported on with .
Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank: every lower Bruhat interval is finite, implies , and the Bruhat order is described by reduced subwords.
Proof
Given: The data in the Statement.
Fix . By [F3], its strict lower interval is finite and consists only of shorter elements, so construct for those by induction on length. Their triangular expansions show that the form an -basis of : the transition matrix is finite, unitriangular, and ordered by length.
Set . By [F2], there are unique coefficients with . Since bar is an involution and each is bar invariant by induction, implies . The basis property in step 1.1 gives for each .
Write with finite support. The equality forces and . Let ; then . Define . Applying bar and using gives . Expanding the in the standard basis shows that all coefficients below remain in , because a sum of two negative exponents is negative. This constructs a normalized bar-invariant .
Suppose is another element with the stated properties. Then is bar invariant with each . Choose a nonzero with maximal. In , the coefficient of is : every other term of maximal length has a distinct leading basis vector, while all lower bar terms have strictly smaller length by [F2, F3]. Bar invariance gives , but , a contradiction. Hence .
The family is linearly independent: in any finite relation, choose a term of maximal length; its coefficient at the corresponding is unchanged by the unitriangular expansions and must vanish. It spans by induction on , because and all terms on the right other than have smaller length. Thus it is an -basis.
For a simple generator , write with . The bar formula in [F2] gives . Bar invariance is therefore equivalent to . Splitting into negative and positive exponents gives if , if , and if , proving the displayed normalization by uniqueness.
Depends on
- Arbitrary-rank Coxeter presentations, length, reflections, and Bruhat order
- Weight functions and ordered group-algebra coefficients
- The unequal-parameter Coxeter Hecke algebra
- Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank
- The arbitrary-rank weighted Hecke basis and Bruhat-triangular bar
Used by
- A characteristic-two specialization collapses four weighted cell labels Counterexample
- Finite-Weyl Lusztig data and the precise basic-set hypotheses Definition
- Unequal-parameter left, right, and two-sided cells and cell quotients Definition
- A B2 unequal-parameter KL basis and four left-cell transitions Example
- The four weighted cells of A1×A1 give a canonical basic set at odd residue characteristic Theorem
- Weighted cell quotients are well-defined modules and bimodules Theorem
Dependency tree · two levels
24 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
- George Lusztig, Hecke Algebras with Unequal Parameters, revised arXiv text (2014) (standard reference, not scraped)
- Anders Björner and Francesco Brenti, Combinatorics of Coxeter Groups, GTM 231 (2005) (standard reference, not scraped)