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 character formula in regular integral category O
Statement
Assume the Axiom of Choice. In a regular integral type- block , for every the class of in the Grothendieck group, equivalently its formal character, is where are the inverse Kazhdan–Lusztig coefficients of Inverse Kazhdan–Lusztig polynomials (, for , ) and the sum is supported on . Equivalently, in the signed normalization the formula is the signed inverse-Kazhdan–Lusztig sum The coefficients are the weighted incidence-algebra inverse of , given by the finite signed chain sum of products of ; they are integers that may be negative. They specialize to ordinary Bruhat Möbius values on intervals where every comparable-pair Kazhdan–Lusztig value is , but not in general. Only the value at occurs.
Facts & Assumptions
Given: The Axiom of Choice (inherited from the Grothendieck-group and multiplicity theory cited below), a regular integral type- block with , and the coefficient matrices , and indexed by .
The composition-multiplicity theorem (Simple Verma composition multiplicities are Kazhdan–Lusztig values): for all , in the regular integral block, and this vanishes unless ; at it is .
Grothendieck group and bases (Simple and standard bases of K0(O), The Grothendieck group and character of O): the classes and separately the classes form -bases of , the transition on a finite central-character label set is unitriangular, is the free abelian group on isomorphism classes modulo for short exact sequences, and the formal character is an additive map on .
Inverse Kazhdan–Lusztig coefficients (Inverse Kazhdan–Lusztig polynomials, The Kazhdan–Lusztig inversion formula): , a finite chain sum; , so ; and unless , while for ; the signed coefficients are .
Classical normalization (Kazhdan–Lusztig polynomials in the classical -normalization): for , with unless , , constant term , and degree at most for ; in particular .
Bruhat order of (Basic properties of the Bruhat order on ): it is graded by inversion length, has the reduced-subword criterion and finite intervals, and implies .
Descent recursion (The Kazhdan–Lusztig polynomial descent recursion): for a simple reflection with and , where if and if .
Block conventions (The regular integral dot-orbit labelling convention): the indexed simples, standards and projectives of , the multiplicity notations, the Bruhat direction of nonzero multiplicities, and the classical normalization of the Kazhdan–Lusztig coefficients.
Proof
By [F1] the class of every standard in expands in the simple basis as , where ; by [F4] and [F7] the matrix is unitriangular for the Bruhat order: and unless .
The matrix is the specialization at of the Kazhdan–Lusztig coefficient matrix , because by [F4]; specialisation is a ring homomorphism , so the inverse matrix of is by the two-sided inverse statement of [F3]. By the support clause of [F3], unless , and all entries are integers; in particular the sum in the formula is supported on , and every coefficient is the value at one of an integer Laurent polynomial.
The specialization is not the Möbius function in general; the following finite witness is computed inside with the recursion [F6]. Put and ; the reduced subwords of this reduced word for give the interval , ten elements, and all comparable pairs of gap at most two have by the degree bound of [F4], so the only pair that can be nonconstant is the endpoint , of gap . Apply [F6] with the left descent of : , and , so , where runs over the elements of with ; left multiplication by swaps the values and , turning these four elements into of lengths , so only has the required descent, and there because the gap is even by [F4]. Hence the correction sum vanishes, and with (gap ) the recursion reduces to . For the remaining value apply [F6] at with the left descent : and , so ; the first term vanishes because has no reduced subword , so and by [F4] and [F5], and the correction sum is empty because the four elements of all have lengths raised to by left multiplication with , so none is a left descent. Thus , and altogether , while for every other comparable pair in .
Since the classes and are the two -bases of the Grothendieck group of the block by [F2], step 1.1 exhibits the transition matrix from simples to standards, and its inverse from step 1.2 performs the reverse change of basis: for every one has , the sum being finite and supported on by [F5] and step 1.2. Applying the additive character map of [F2] termwise gives the equivalent formal-character identity . In the signed normalization of [F3], substituting and using that and differ by the even number gives the signed inverse-Kazhdan–Lusztig sum .
The chain formula of [F3] expresses the inverse coefficients of step 2.1 as the weighted incidence-algebra inverse of : , a finite sum over the strictly increasing chains of the finite interval described in [F5]. If every comparable-pair value in equals , each product in the -th term equals and the alternating chain count is exactly the ordinary Bruhat Möbius value ; so on intervals with all comparable-pair values equal to the coefficients are ordinary Bruhat Möbius numbers.
Consequently the specialized multiplicity matrix on the interval is , where is the zeta matrix of the Bruhat poset and has the single nonzero entry at . Since is the minimum and the maximum of the interval, only for and only for , so and , that is ; at the endpoint the inverse entry is therefore , whereas the ordinary Bruhat Möbius value of the interval is (the rank sizes are and the Möbius recursion gives at the bottom, at the four atoms, at the four rank-two elements and at the top). Using the endpoint polynomial from step 1.3, this proves the claim that the coefficients specialize to ordinary Bruhat Möbius values when all comparable-pair values are but not in general, and exhibits them as integers that may be negative; by step 2.1 these are exactly the coefficients of the character formula, and only their value at occurs.
Depends on
- Simple Verma composition multiplicities are Kazhdan–Lusztig values
- Inverse Kazhdan–Lusztig polynomials
- The Kazhdan–Lusztig inversion formula
- The Grothendieck group and character of O
- Simple and standard bases of K0(O)
- Kazhdan–Lusztig polynomials in the classical $q$-normalization
- The Kazhdan–Lusztig polynomial descent recursion
- Basic properties of the Bruhat order on $S_n$
- The regular integral dot-orbit labelling convention
- The Axiom of Choice
Used by
Dependency tree · two levels
42 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
- Lin Chen, lecture notes (Spring 2024), Lecture 8: Hecke algebras and the Kazhdan-Lusztig conjecture (complete 10-page lecture) (standard reference, not scraped)
- Anders Bjoerner and Francesco Brenti, Combinatorics of Coxeter Groups, Graduate Texts in Mathematics 231, Springer (author-hosted complete 370-page PDF) (standard reference, not scraped)