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 multiplicity matrix for the sl_3 principal block
Example
Take (type , ) and the principal block, i.e. the regular integral block of the weight ( is regular). In one-line notation the labels index the weights . All nineteen Kazhdan–Lusztig polynomials of comparable pairs in equal (there are nineteen pairs in the Bruhat order on ), so the multiplicity matrix is the Bruhat zeta matrix of (with rows , columns ), e.g. for all six , unless , and has the four composition factors , each once. By BGG reciprocity the Verma-flag matrix is the same zeta matrix, e.g. for and for all .
Facts & Assumptions
Given: The Axiom of Choice (inherited from the multiplicity and BGG suppliers below), the one-based group with its Bruhat order, the normalized Hecke algebra with , and with the dominant regular integral weight and its principal block .
Hecke algebra and bar (The normalized type-A Hecke algebra and its bar involution, The Hecke bar involution is well defined): with ; the bar is the semilinear multiplicative involution with ; when ; the form an -basis.
Existence and uniqueness of the Kazhdan–Lusztig basis (Existence and uniqueness of the Kazhdan–Lusztig basis): is the unique bar-fixed element of , these elements form a basis, and with unless and .
Classical normalization (Kazhdan–Lusztig polynomials in the classical -normalization): with , and unless , .
Bruhat order of (Basic properties of the Bruhat order on ): the reduced-subword criterion, graded by inversion length, ranks with the eight covers , , , , , , , .
The composition-multiplicity theorem (Simple Verma composition multiplicities are Kazhdan–Lusztig values): in the regular integral block , , vanishing unless .
BGG reciprocity (BGG reciprocity): for all weights, with the Verma module of Verma modules.
Block conventions (The regular integral dot-orbit labelling convention): for the dominant regular integral weight of the standards are , the simples , the projectives , the dot action is , and the multiplicity notations are those of [F5] and [F6].
Verification
The dot orbit. With for the root system , the dot action computes: ; ; ; ; ; . The positive-root pairings of are , and the negative-root pairings are their negatives; Weyl conjugation permutes these nonzero integral pairings, so all six weights are dot-regular and integral, so is a regular integral block with the six labelled standards, simples and projectives.
The Kazhdan–Lusztig basis of . Put , and , ; by [F1] both and are bar-fixed, because and likewise for . The reduced words give , and in the one-based model, so and . For the length-three element, expanding and replacing by gives , hence . Each of the six elements , , , , , is bar-fixed and lies in its top standard basis element plus a -span of strictly lower Bruhat elements (the lower indices are strictly lower by the rank description of [F4]); by the uniqueness in [F2] they are exactly .
All polynomials equal , and the count. Reading the six expansions of step 1.2 against gives whenever : the coefficients are on the diagonal, at gap one, at gap two and at the longest pair. Hence [F3] gives for every one of the comparable pairs. By the rank description [F4] the comparable pairs are: the six diagonal pairs; for the five strict pairs; for each of the three strict pairs (the two rank-two elements and ); and for each of the pair with ; altogether pairs, and every one has .
The multiplicity matrix. By [F5] and step 2.1, exactly when and otherwise; this is the Bruhat zeta matrix of with rows and columns . For the displayed instances: is the minimum of the Bruhat order, so for all six ; is the maximum, so unless , where it is ; and for the comparable columns are by [F4], so has exactly the four composition factors , each once.
The Verma-flag matrix. Applying BGG reciprocity [F6] with and gives , which by step 3.1 is exactly when and otherwise; the interpretation of the left-hand multiplicity is the Verma-flag multiplicity of the labelled projective by [F7]. In particular for (with value at , since is the minimum and no other lies below it) and for all (all lie below the maximum ). So the projective-flag matrix is the same zeta matrix.
Depends on
- Simple Verma composition multiplicities are Kazhdan–Lusztig values
- The regular integral dot-orbit labelling convention
- Existence and uniqueness of the Kazhdan–Lusztig basis
- Kazhdan–Lusztig polynomials in the classical $q$-normalization
- The normalized type-A Hecke algebra and its bar involution
- The Hecke bar involution is well defined
- Basic properties of the Bruhat order on $S_n$
- Verma modules
- BGG reciprocity
- The Axiom of Choice
Used by
Dependency tree · two levels
39 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
- 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)
- Lin Chen, lecture notes (Spring 2024), Lecture 8: Hecke algebras and the Kazhdan-Lusztig conjecture (complete 10-page lecture) (standard reference, not scraped)