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 four weighted cells of A1×A1 give a canonical basic set at odd residue characteristic
Statement
Let , the finite Weyl group , and let . Form its weighted Hecke algebra with coefficient and the symmetric quadratic convention . Let for an odd prime , let , and specialize . Write , , and let be the decomposition matrix of the four explicit -lattices obtained from the cell quotients.
The left, right, and two-sided cells are the four singleton sets . Their four cell modules are pairwise distinct one-dimensional -modules, and each has an -stable rank-one lattice. Their reductions are the four distinct simple -modules, so is the identity matrix up to the displayed ordering. Consequently, relative to any integer-valued statistic on the generic simple modules, these four cell modules form a canonical basic set in the sense of Canonical basic sets for split Hecke specializations.
This is a finite Weyl case. In Geck's normalization, its specialization also satisfies the exact hypothesis for every generic irreducible character in Theorem 4.11; the proof below verifies the decomposition matrix directly.
Facts & Assumptions
Given: The weighted Coxeter and Hecke conventions in the Statement, an odd prime , and the definitions of the KL basis, cells, cell modules, and canonical basic set.
Arbitrary-rank Coxeter presentations, length, reflections, and Bruhat order and Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank: the Coxeter presentation determines length and Bruhat order; reduced words and subwords give the finite lower intervals needed for triangularity.
Weight functions and ordered group-algebra coefficients and Simple-generator weights extend uniquely to a weight function: a weight function is additive on length-additive products, and simple-generator labels extend exactly when they agree along finite odd-labelled edges.
The unequal-parameter Coxeter Hecke algebra and The arbitrary-rank weighted Hecke basis and Bruhat-triangular bar: the Hecke generators satisfy their stated quadratic and braid relations, and the standard elements form a free coefficient-module basis after specialization to a commutative coefficient ring.
Existence and uniqueness of the ordered-group unequal-parameter Kazhdan–Lusztig basis: the elements form a bar-invariant triangular basis, with for .
Unequal-parameter left, right, and two-sided cells and cell quotients and Weighted cell quotients are well-defined modules and bimodules: coefficient transitions define the cell preorders, and the cell quotients are modules with bases given by their cell elements.
Canonical basic sets for split Hecke specializations: for the chosen lattice decomposition matrix , the minimum and the two multiplicity/order conditions define a canonical basic set.
The canonical Hecke trace and symmetrizing form and The canonical Hecke trace is symmetric and perfect: for a finite Coxeter group, the coefficient of the identity standard basis element defines a trace with a symmetric perfect pairing, and this trace is preserved by commutative base change.
Schur elements of a split semisimple algebra with a symmetrizing trace: for a split semisimple algebra with symmetrizing trace , the Schur elements , when they exist, are the nonzero scalars in .
Proof
Given: The presentation , weights , the specialization , and the facts above.
From and , . Thus every word reduces to one of . The homomorphism to sending , respects all relators and separates these four elements, so they are distinct. Their lengths are , respectively. Since the only finite edge has even label , the odd-edge condition in [F2] permits the unequal labels ; it gives a well-defined weight function .
Put , , and . The rank-two relations give and , so direct expansion gives and . The generators commute because , and . These elements are bar invariant and have leading standard term with lower Bruhat support and negative coefficients; uniqueness in [F4] identifies them as the KL basis.
For , set , . The specialized quadratic relation is . Since , it is a unit in , so and belong to . They sum to , their product is zero by the quadratic relation, and , so they are complementary idempotents. Every rank-one element equals , making both summands free of rank one. The commuting rank-one subalgebras tensor to with the standard rank-four basis [F3], so the four products give and hence , .
The complete left-product table is determined by , , , , , , , and . The right table is identical because the algebra is commutative. With an arrow when occurs in or , the only non-loop arrows are , , , and . No transition points back, so mutual comparability has four singleton classes for each left, right, and two-sided preorder.
In the quotient for , both and vanish, so and act by and . In the quotient for , vanishes while ; hence acts by . In the quotient for , vanishes, so acts by ; gives -eigenvalue . In the quotient for , and , so the action is . By [F5] each is a well-defined one-dimensional cell module. Their four eigenvalue pairs are distinct over , since and in the characteristic-zero field .
The four cell characters from step 4.1 take values in , so with the displayed scalar actions is an -stable rank-one lattice for each. Their reductions have eigenvalues respectively , , , and in . Since is odd these are four distinct characters of ; each is simple, and each reduced lattice has composition multiplicity one for exactly its matching character. Thus , up to ordering.
Let be the generic coefficient field and put , which has eigenvalues and . By [F7], the canonical trace on the normalized standard basis takes value on the identity and on nonidentity elements, and its generic pairing is symmetrizing. For one rank-one factor, the algebra over is , with characters , . By [F8], write . Evaluating at and gives and ; solving yields and . For , the algebra and trace are tensor products of the rank-one factors, so the four Schur elements are products of one term from and one from . Under the residue map in , each product is . Thus Geck's Theorem 4.11 has its exact finite-Weyl and nonvanishing hypotheses here and gives the identity decomposition matrix; step 5.1 has already proved the same conclusion directly.
For any integer-valued , an identity decomposition matrix has exactly one nonzero entry in each column, equal to . Thus for each simple , is the -value of its matching cell module; all other rows in that column vanish. Both conditions in [F6] hold, so the four cell modules form a canonical basic set. The claim is restricted to this explicit finite Weyl group and this odd-characteristic specialization.
Depends on
- Arbitrary-rank Coxeter presentations, length, reflections, and Bruhat order
- Weight functions and ordered group-algebra coefficients
- Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank
- Simple-generator weights extend uniquely to a weight function
- The unequal-parameter Coxeter Hecke algebra
- The arbitrary-rank weighted Hecke basis and Bruhat-triangular bar
- Existence and uniqueness of the ordered-group unequal-parameter Kazhdan–Lusztig basis
- Unequal-parameter left, right, and two-sided cells and cell quotients
- Weighted cell quotients are well-defined modules and bimodules
- Canonical basic sets for split Hecke specializations
- Schur elements of a split semisimple algebra with a symmetrizing trace
- The canonical Hecke trace and symmetrizing form
- The canonical Hecke trace is symmetric and perfect
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
38 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)
- Meinolf Geck, Modular Representations of Hecke Algebras, EPFL lecture notes (2006) (standard reference, not scraped)
- Anders Björner and Francesco Brenti, Combinatorics of Coxeter Groups, GTM 231 (2005) (standard reference, not scraped)