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 Soergel character grading alone does not prove category-O Koszulity
Statement refuted
Refuted claim: 'The auxiliary grading on the polynomial Soergel lifts transports to category and makes each regular integral block graded (indeed Koszul), so that the coefficients of the Kazhdan–Lusztig polynomials are the graded decomposition numbers; in particular, for every comparable pair, the leading coefficient of is the ordinary Verma-flag multiplicity .'
Counterexample: let be dominant regular integral for (for instance ) and take and in , so that . On the ten-element interval the only comparable-pair Kazhdan–Lusztig polynomial different from is ; its leading coefficient is , but the multiplicity theorem gives . Hence the leading coefficient of the Kazhdan–Lusztig polynomial is not the ordinary multiplicity, and an individual coefficient of need not equal its ordinary category- multiplicity. Moreover the page constructs no grading on at all: the grading in play is the auxiliary grading of the polynomial lifts, normalised on the Soergel side and passed to by the ungraded reduction of the projective dictionary, so the character theorem alone cannot establish Koszulity; the graded/ refinement is reserved for the separate Koszul-duality frontier.
Facts & Assumptions
Given: The Axiom of Choice (inherited from the multiplicity theorem cited below), with a dominant regular integral weight (for instance ), the permutations and in one-based , and the classical Kazhdan–Lusztig polynomials with .
Multiplicity theorem (Projective Verma multiplicities are Kazhdan–Lusztig values at one): in the regular integral type- block one has for all , and the multiplicity vanishes unless .
Block and grading conventions (The regular integral dot-orbit labelling convention, Finite Verma flags and their multiplicities): is the ordinary Verma-flag multiplicity of the standard , the projective dictionary is the ungraded reduction , and the auxiliary grading lives on the polynomial Soergel lifts.
Classical Kazhdan–Lusztig polynomials (Kazhdan–Lusztig polynomials in the classical -normalization): has constant term , and for its degree is at most ; the -coefficient is the coefficient of , defined as when is even; unless .
Descent recursion (The Kazhdan–Lusztig polynomial descent recursion): for a simple reflection with and , where if and if .
Bruhat order of (Basic properties of the Bruhat order on , Bruhat intervals and the -coefficients): holds exactly when is a reduced subword of every reduced expression of ; the order is graded by inversion length; intervals are finite.
Counterexample
The interval. The word has length and is reduced, since has exactly the four inversions . Its reduced subwords give: at length ; at length ; at length ; at length ; and at length . The four elements contain no reduced subword equal to , so they are not above by the reduced-subword criterion; the remaining ten elements are exactly .
All gaps at most two have . Suppose and . By [F3] the degree of is at most , hence at most ; together with constant term this forces . If then and ; if and are incomparable, by [F3]. In particular and , both pairs having gap .
The recursion at . Write and use , a reduced word with left descent . With one has and , so in [F4] and The first summand vanishes: has no reduced subword , so and by [F3] and [F5]. The correction sum is empty as well: by step 1.1, and for each of these four elements left multiplication by swaps the values and , raising the length from to respectively, so no element of the interval has the required left descent . By step 1.2 the remaining term is , hence .
The main recursion. Apply [F4] to , and the left descent : and , so because has length , and By step 1.1 the interval is ; left multiplication by swaps the values and , turning these into of lengths , so only has the required descent, and there because is even by [F3]. The correction sum is therefore empty; step 2.1 gives and step 1.2 gives , so , with and .
The comparison. The polynomial has leading coefficient (the coefficient of , its degree being ) while its value at is . The multiplicity theorem [F1] computes the ordinary Verma-flag multiplicity as , with dominant regular integral in (indeed for every simple root and is integral). Hence the leading coefficient of the Kazhdan–Lusztig polynomial differs from the multiplicity : the refuted claim's coefficientwise clause is false, and neither individual coefficient of this polynomial equals the ordinary multiplicity; its total value at one does. This is a genuine failure of the claim and not an artefact of undefined quantities: , all polynomials are classical Kazhdan–Lusztig polynomials, and the multiplicity is that of the ordinary block .
The grading clause. The remaining structural clause of the refuted claim is not supplied by the cited results either: the multiplicity of [F1] is the ordinary (ungraded) Verma-flag multiplicity, and the projective dictionary of [F2] is the ungraded reduction , whose auxiliary grading lives on the polynomial lift and is not a grading of . Thus the character identity at cannot establish that the block is graded or Koszul; the graded and refinements belong to the separate Koszul-duality frontier, and step 4.1 refutes only the identification of an individual coefficient with an ordinary multiplicity. It does not refute graded decomposition numbers or the possibility of a Koszul grading: those require additional constructions and proofs, and graded multiplicities may sum to the ordinary multiplicity. The stated conjunction is refuted by its false leading-coefficient clause, with witness in .
Depends on
- Projective Verma multiplicities are Kazhdan–Lusztig values at one
- The regular integral dot-orbit labelling convention
- Kazhdan–Lusztig polynomials in the classical $q$-normalization
- The Kazhdan–Lusztig polynomial descent recursion
- Bruhat intervals and the $R$-coefficients
- Basic properties of the Bruhat order on $S_n$
- Finite Verma flags and their multiplicities
- The Axiom of Choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
34 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)
- 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)