Alphabeta Math
Pipeline-generated
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.

✓ 5 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

The Kazhdan–Lusztig Character and Multiplicity Theorem

1 · Prerequisites

2 · Summary

This page proves the Kazhdan–Lusztig character and multiplicity theorem in a regular integral block of type A, through the Soergel functor rather than as an imported conjecture. The labelling conventions fix the dot-orbit labels, BGG reciprocity, the classical q=v−2 normalization and the label-reversing Soergel dictionary. A standard-support rank comparison for polynomial Soergel lifts then computes the Verma-flag multiplicity of each indecomposable projective, and Soergel's character theorem ch(Bw)=H‾w read degree by degree at q=1 turns it into the Kazhdan–Lusztig value Py,w(1). BGG reciprocity converts the projective multiplicities into Verma composition multiplicities, and inverting the unitriangular multiplicity matrix — a weighted incidence-algebra inverse, not ordinary Bruhat Möbius inversion — yields the inverse-Kazhdan–Lusztig character formula ch L(w⋅λ)=∑xqw,x′(1) ch M(x⋅λ). The actual tensor/block-projection translations between dominant regular integral blocks are then proved to be inverse equivalences preserving all labelled data. A closing scope remark separates these ordinary statements from the graded, Ext and Koszul refinements, which are reserved for a separate frontier. The finite computations, the signed inverse matrices and the counterexample to the naive coefficientwise reading are collected on the-kazhdan-lusztig-character-and-multiplicity-theorem-examples.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

The regular integral dot-orbit labelling convention

Definition

Fix a finite-dimensional complex semisimple Lie algebra g of type An−1 with Cartan h, positive system Φ+, Weyl vector ρ, Weyl group W (identified with Sn) and dot action w⋅λ=w(λ+ρ)−ρ. Fix a dominant regular integral weight λ, i.e. ⟨λ+ρ,α∨⟩≠0 for every root and λ integral, and let Oλ be the corresponding regular integral block in the conventions of The regular integral block and its antidominant weight: standard objects Δ(w⋅λ)=M(w⋅λ), simples L(w⋅λ), indecomposable projectives P(w⋅λ) for w∈W, with λ=e⋅λ the unique dominant and w0⋅λ the unique antidominant element and Δ(w0⋅λ)=L(w0⋅λ).

This item freezes the following conventions, each inherited from the cited suppliers and used verbatim below.

(i) Multiplicity conventions. (P(w⋅λ):Δ(y⋅λ)) is the Verma-flag multiplicity of Finite Verma flags and their multiplicities and [M(y⋅λ):L(w⋅λ)] the composition multiplicity, and (P(w⋅λ):Δ(y⋅λ))=[M(y⋅λ):L(w⋅λ)] by BGG reciprocity (BGG reciprocity).

(ii) Bruhat reversal convention. Along the bijection W∋w↦w⋅λ the Bruhat order runs opposite to the dominance order, in the two exact senses used on this page: y≤w implies w⋅λ≤y⋅λ in the dominance order, and every nonzero multiplicity forces the index direction, i.e. [M(y⋅λ):L(w⋅λ)]≠0 implies y≤w in the Bruhat order. The first sense is the inclusion direction of Dominant integral dot translates embed canonically in the Verma module (for w≥y one has M(w⋅λ)⊆M(y⋅λ), so the highest weight of the submodule is the lower one), and the second is Jordan-Holder factors of Verma modules dominate the head (BGG 8.12), which confines every composition factor of M(y⋅λ) to labels w≥y. The full statement that the two orders are isomorphic as posets is not needed here and is not asserted; only these two directions, together with the finiteness of intervals of the Bruhat order (Basic properties of the Bruhat order on Sn), are used.

(iii) Hecke and Kazhdan–Lusztig normalization. The Kazhdan–Lusztig basis H‾w=∑y≤wpy,wHy of the normalized type-A Hecke algebra (Existence and uniqueness of the Kazhdan–Lusztig basis), with py,w=vℓ(w)−ℓ(y)Py,w(v−2) in the classical q=v−2 normalization (Kazhdan–Lusztig polynomials in the classical q-normalization), support py,w=0 unless y≤w, diagonal pw,w=1, and simultaneous inversion symmetry py−1,w−1=py,w.

(iv) Soergel label and character dictionary. Write Rx for the polynomial standard graph bimodule supported at x, and Bx for the normalized indecomposable polynomial Soergel bimodule, which is generally not a standard graph bimodule. With right reduction Bˉ=B⊗SC and left coinvariant-module values of V, the projective dictionary is V(P(w⋅λ))≅Bˉw−1 (Indecomposable projectives correspond to indecomposable Soergel modules). The graph label x corresponds to the standard Δ(x−1⋅λ). The individual support ranks are measured on the polynomial lift before reduction, as in Verma-flag multiplicities are standard-filtration ranks under V; no separated graph-support filtration of the reduced module is asserted.

For degree bookkeeping use precisely the standard-generator normalization of Standard graph bimodules, support filtrations and characters: Δx(d)=Rx(d−ℓ(x)), and rx,d(B) counts these normalized polynomial standard layers. Thus the coefficient polynomial is mx(B;v):=∑drx,d(B)vd,hΔ(B)=∑xmx(B;v)T~x,T~x=vℓ(x)Tx. Here T~x is the normalized standard Hecke element Hx used in clause (iii) and The normalized type-A Hecke algebra and its bar involution. The published Soergel split-Grothendieck-ring convention instead names its simple Kazhdan--Lusztig generators Hi=v(Ti+1)=T~si+v; these must not be confused with the standard element Hsi=vTi (The split Grothendieck group of the Soergel category is the type-A Hecke algebra). The standard-character supplier The type-A standard character is multiplicative identifies hΔ with that split-Grothendieck-ring isomorphism. This records the coefficient normalization, and does not infer the image of a general indecomposable Bx by multiplying simple generators. In particular the character theorem must be used to identify hΔ(Bx) with H‾x; a product of simple Soergel classes is a Bott--Samelson class and need not be [Bx]. The inverse labels and all rank comparisons above use auxiliary polynomial gradings only; forgetting them gives the ordinary projective dictionary.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Projective Verma multiplicities equal Soergel standard ranks

Statement

Assume the Axiom of Choice. Let Oλ be a regular integral type-A block with W=Sn, and for w∈W let Bw−1 be the polynomial Soergel lift of V(P(w⋅λ)), so that V(P(w⋅λ))=Bˉw−1 is its right reduction. Write rx,d(B) for the graded multiplicity of the polynomial standard graph module supported at x in the standard support filtration of a polynomial Soergel bimodule B, in the standard-generator normalization of the polynomial Soergel category. Then for all y,w∈W (P(w⋅λ):Δ(y⋅λ))=∑dry−1,d(Bw−1). These are ranks before reduction: the right side sums the graded standard support multiplicities of the polynomial lift, not multiplicities in any separated filtration of the finite-dimensional module V(P(w⋅λ)).

Facts & Assumptions

Given: The Axiom of Choice (inherited from the block and projective theory cited below), a regular integral type-A block Oλ with W=Sn, and labels y,w∈W.

[F1]

Block and dictionary conventions (The regular integral dot-orbit labelling convention): P(w⋅λ) are the indecomposable projectives, V(P(w⋅λ))=Bˉw−1 holds with Bw−1 the polynomial lift, standard support at x corresponds to Δ(x−1⋅λ), and (P:Δ) is the Verma-flag multiplicity.

[F2]

Projective dictionary (Indecomposable projectives correspond to indecomposable Soergel modules): V is an equivalence from Proj⁡(Oλ) onto the ungraded Soergel modules, with P(w⋅λ)↦Bˉw−1; the inverse-label assignment is a bijection on isomorphism classes.

[F3]

General rank comparison (Verma-flag multiplicities are standard-filtration ranks under V): for a projective P with polynomial lift B(P)=⨁wBw−1mw built from a decomposition P=⨁wP(w⋅λ)mw, one has (P:Δ(y⋅λ))=∑dry−1,d(B(P)); these are ranks before reduction.

[F4]

Projective covers (Projective covers in O are indecomposable and unique): P(w⋅λ) is a projective cover of L(w⋅λ) and is indecomposable; any two projective covers of the same simple are isomorphic.

[F5]

Krull–Schmidt (Fitting decomposition in a finite-length abelian category): every object of Oλ is a finite direct sum of nonzero indecomposable objects, and the decomposition is unique up to isomorphism and permutation of the summands.

[F6]

Verma-flag multiplicities (Finite Verma flags and their multiplicities): (X:Δ(μ)) is well defined for Verma-filtered X, independent of the flag, and additive over the factors of any flag.

Proof

technique · direct
1.1F1F2F4

The object P:=P(w⋅λ) is a nonzero indecomposable projective of Oλ, namely a projective cover of the simple L(w⋅λ), and by the projective dictionary [F2] its Soergel value is V(P)=Bˉw−1, the right reduction of the single polynomial lift Bw−1.

1.2F2F3F4F5

Every decomposition of P into indecomposables is a one-summand decomposition. Indeed, by [F5] a decomposition P≅⨁vP(v⋅λ)mv exists and any two such decompositions agree up to isomorphism and permutation of summands; since the nonzero object P is an indecomposable projective cover by [F4], only one summand can be present, so the decomposition is P≅P(v⋅λ) for a single label v. Applying the equivalence V of [F2] to this isomorphism gives Bˉw−1≅Bˉv−1; as V is a bijection on isomorphism classes of indecomposables, v=w. Hence in the dictionary of [F3] the polynomial lift assigned to P is the single term B(P)=Bw−1, with no further summands.

2.1F1F2F3F6step 1.2∎

Substitute B(P)=Bw−1 from step 1.2 into the general rank comparison [F3] applied to the projective P=P(w⋅λ): its left side is the Verma-flag multiplicity (P(w⋅λ):Δ(y⋅λ)) of [F1] and [F6], and its right side is ∑dry−1,d(Bw−1), the sum of the graded standard-support multiplicities of the polynomial lift Bw−1. This is the displayed identity for all y,w∈W. The ranks on the right are pre-reduction ranks of the polynomial lift, by the final clause of [F3] and by the reduction convention [F2]; no separated filtration of V(P(w⋅λ)) is produced or used.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Projective Verma multiplicities are Kazhdan–Lusztig values at one

Statement

Assume the Axiom of Choice. In a regular integral type-A block Oλ, for all y,w∈W (P(w⋅λ):Δ(y⋅λ))=Py,w(1), the value at q=1 of the classical Kazhdan–Lusztig polynomial of the pair y≤w; the multiplicity is the total value at one, not an individual coefficient of Py,w, and it vanishes unless y≤w in the Bruhat order.

Facts & Assumptions

Given: The Axiom of Choice (inherited from the projective-lift theory cited below), a regular integral type-A block Oλ with W=Sn, labels y,w∈W, and the grading variable v with q=v−2.

[F1]

The standard-rank comparison (Projective Verma multiplicities equal Soergel standard ranks): (P(w⋅λ):Δ(y⋅λ))=∑dry−1,d(Bw−1), where Bw−1 is the polynomial lift with right reduction V(P(w⋅λ))=Bˉw−1 and the rx,d are the pre-reduction graded standard-support multiplicities in the normalization of Standard graph bimodules, support filtrations and characters.

[F2]

Soergel's character theorem (Soergel's character conjecture for type A): for every x∈Sn the character of the indecomposable type-A Soergel bimodule Bx is the Kazhdan–Lusztig basis element ch(Bx)=H‾x, equivalently [Bx]↦H‾x under the identification of the split Grothendieck group with the Hecke algebra; the scalar-extension comparison identifies the rational and real versions.

[F3]

The actual standard-character normalization (Standard graph bimodules, support filtrations and characters, The type-A standard character is multiplicative, The split Grothendieck group of the Soergel category is the type-A Hecke algebra, The regular integral dot-orbit labelling convention): rx,d(B) counts the normalized standard layer Δx(d)=Rx(d−ℓ(x)) before reduction, so hΔ(B)=∑xmx(B;v)T~x with mx(B;v)=∑drx,d(B)vd and T~x=vℓ(x)Tx=Hx in the normalized standard Hecke basis of [F4]. The character hΔ equals the split-Grothendieck-ring isomorphism. Its simple value is v(Ti+1)=Hsi+v, rather than the standard Hsi; multiplying these simple values computes a Bott--Samelson character, not in general the character of an indecomposable.

[F4]

Kazhdan–Lusztig basis (Existence and uniqueness of the Kazhdan–Lusztig basis): H‾w=∑y≤wpy,wHy with pw,w=1, py,w=0 unless y≤w, and simultaneous inversion symmetry py−1,w−1=py,w.

[F5]

Classical normalization (Kazhdan–Lusztig polynomials in the classical q-normalization): py,w=vℓ(w)−ℓ(y)Py,w(v−2) for y≤w, with Py,w=0 unless y≤w and Pw,w=1; specialising v=1 gives py,w(1)=Py,w(1).

[F6]

Block conventions (The regular integral dot-orbit labelling convention): (P(w⋅λ):Δ(y⋅λ)) is the Verma-flag multiplicity, V(P(w⋅λ))=Bˉw−1 is the label-inverting projective dictionary, and the support convention py,w=0 unless y≤w is the Bruhat direction fixed there.

Proof

technique · direct
1.1F1F6

The comparison of [F1] expresses the Verma-flag multiplicity of the indecomposable projective P(w⋅λ) as the total graded standard-support rank of the polynomial lift Bw−1: (P(w⋅λ):Δ(y⋅λ))=∑dry−1,d(Bw−1).

1.2F2F3F4

The character theorem [F2] gives hΔ(Bw−1)=H‾w−1=∑xpx,w−1Hx. By the coefficient formula of [F3], the left side is ∑xmx(Bw−1;v)Hx, where mx(Bw−1;v)=∑drx,d(Bw−1)vd uses the normalized polynomial standard layers before reduction. Comparing coefficients in the standard Hecke basis of [F4] yields mx(Bw−1;v)=px,w−1(v) for every x, as an identity of Laurent polynomials. This comparison uses the character formula; it does not identify an indecomposable class with a product of simple classes.

2.1F4F5step 1.1step 1.2∎

Evaluate step 1.2 at the label x=y−1 and at v=1: the left side becomes ∑dry−1,d(Bw−1), which equals the multiplicity by step 1.1, and the right side becomes py−1,w−1(1); the inversion symmetry py−1,w−1=py,w of [F4] and the specialization py,w(1)=Py,w(1) of [F5] turn this into (P(w⋅λ):Δ(y⋅λ))=Py,w(1) for all y,w∈W. The vanishing clause is the support statement py,w=0 unless y≤w of [F4] and [F5], and only the total value at one is used: no individual coefficient of Py,w is interpreted as a category-O multiplicity, and no grading on O is constructed — the grading in play is the auxiliary grading of the polynomial lift, normalized on the Soergel side.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Simple Verma composition multiplicities are Kazhdan–Lusztig values

Statement

Assume the Axiom of Choice. In a regular integral type-A block Oλ, for all y,w∈W [M(y⋅λ):L(w⋅λ)]=(P(w⋅λ):Δ(y⋅λ))=Py,w(1), with the pair ordered so that the multiplicity vanishes unless y≤w in the Bruhat order; in particular the Kazhdan–Lusztig conjecture's multiplicity statement holds for every dominant regular integral weight, with the same combinatorial answer.

Facts & Assumptions

Given: The Axiom of Choice (inherited from the BGG reciprocity and block theory cited below), a regular integral type-A block Oλ with W=Sn, and labels y,w∈W.

[F1]

BGG reciprocity (BGG reciprocity): for all weights λ,μ one has (P(λ):Δ(μ))=[Δ(μ):L(λ)]=[M(μ):L(λ)], where the left multiplicity is the Verma-flag multiplicity and the right one the simple composition multiplicity.

[F2]

The projective-Verma multiplicity theorem (Projective Verma multiplicities are Kazhdan–Lusztig values at one): in the regular integral type-A block, (P(w⋅λ):Δ(y⋅λ))=Py,w(1) for all y,w∈W, and this vanishes unless y≤w.

[F3]

Standards are Vermas (Standard and costandard objects, Finite Verma flags and their multiplicities): Δ(ν)=M(ν) for every weight ν, and the Verma-flag multiplicity (X:Δ(ν)) is the well-defined multiplicity of that standard in a finite flag.

[F4]

Block conventions (The regular integral dot-orbit labelling convention): the simples L(w⋅λ), standards Δ(w⋅λ)=M(w⋅λ) and indecomposable projectives P(w⋅λ) indexed by w∈W, the composition multiplicity notation [M(y⋅λ):L(w⋅λ)], and the Bruhat direction [M(y⋅λ):L(w⋅λ)]≠0⇒y≤w.

Proof

technique · direct
1.1F1F3F4

Apply BGG reciprocity [F1] with the two weights w⋅λ and y⋅λ: because P(w⋅λ) is the projective cover of L(w⋅λ) and Δ(y⋅λ)=M(y⋅λ) by [F3], reciprocity reads (P(w⋅λ):Δ(y⋅λ))=[Δ(y⋅λ):L(w⋅λ)]=[M(y⋅λ):L(w⋅λ)].

1.2F2F4

The projective-Verma theorem [F2] evaluates the projective-flag multiplicity in the regular integral block: (P(w⋅λ):Δ(y⋅λ))=Py,w(1), the value at q=1 of the classical Kazhdan–Lusztig polynomial, and this value is zero unless y≤w in the Bruhat order.

2.1F2F4step 1.1step 1.2∎

Substituting the value of step 1.2 into the chain of equalities of step 1.1 gives [M(y⋅λ):L(w⋅λ)]=(P(w⋅λ):Δ(y⋅λ))=Py,w(1) for all y,w∈W, and the vanishing clause transfers along the same chain: the multiplicity is zero unless y≤w, in agreement with the Bruhat direction recorded in [F4]. Since Py,w(1) is a combinatorial quantity of the symmetric group alone, this multiplicity statement — the Kazhdan–Lusztig conjecture's multiplicity assertion — holds with the same answer for every dominant regular integral weight.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The Kazhdan–Lusztig character formula in regular integral category O

Statement

Assume the Axiom of Choice. In a regular integral type-A block Oλ, for every w∈W the class of L(w⋅λ) in the Grothendieck group, equivalently its formal character, is [L(w⋅λ)]=∑x∈Wqw,x′(1) [M(x⋅λ)],i.e.ch L(w⋅λ)=∑x∈Wqw,x′(1) ch M(x⋅λ), where qx,w′ are the inverse Kazhdan–Lusztig coefficients of Inverse Kazhdan–Lusztig polynomials (Q′=P−1, qx,w′∈vZ[v] for x<w, qw,w′=1) and the sum is supported on x≥w. Equivalently, in the signed normalization qx,w=sgn(x)sgn(w)qx,w′ the formula is the signed inverse-Kazhdan–Lusztig sum ch L(w⋅λ)=∑x≥w(−1)ℓ(w)−ℓ(x)qw,x(1) ch M(x⋅λ). The coefficients qw,x′(1) are the weighted incidence-algebra inverse of (Py,z(1)), given by the finite signed chain sum of products of Py,z(1); 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 1, but not in general. Only the value at q=1 occurs.

Facts & Assumptions

Given: The Axiom of Choice (inherited from the Grothendieck-group and multiplicity theory cited below), a regular integral type-A block Oλ with W=Sn, and the coefficient matrices P=(px,w), Q′=(qx,w′) and A=(Py,z(1)) indexed by W×W.

[F1]

The composition-multiplicity theorem (Simple Verma composition multiplicities are Kazhdan–Lusztig values): for all y,w∈W, [M(y⋅λ):L(w⋅λ)]=Py,w(1) in the regular integral block, and this vanishes unless y≤w; at y=w it is Pw,w(1)=1.

[F2]

Grothendieck group and bases (Simple and standard bases of K0(O), The Grothendieck group and character of O): the classes [L(λ)] and separately the classes [M(λ)] form Z-bases of K0(O), the transition on a finite central-character label set is unitriangular, K0 is the free abelian group on isomorphism classes modulo [B]=[A]+[C] for short exact sequences, and the formal character ch M=∑μ(dim⁡Mμ)eμ is an additive map on K0.

[F3]

Inverse Kazhdan–Lusztig coefficients (Inverse Kazhdan–Lusztig polynomials, The Kazhdan–Lusztig inversion formula): qx,w′=∑m≥0(−1)m∑x=z0<⋯<zm=wpz0,z1⋯pzm−1,zm, a finite chain sum; Q′=P−1, so Q′P=PQ′=I; qw,w′=1 and qx,w′=0 unless x≤w, while qx,w′∈vZ[v] for x<w; the signed coefficients are qx,w=sgn(x)sgn(w)qx,w′.

[F4]

Classical normalization (Kazhdan–Lusztig polynomials in the classical q-normalization): py,w=vℓ(w)−ℓ(y)Py,w(v−2) for y≤w, with Py,w=0 unless y≤w, Pw,w=1, constant term 1, and degree at most (ℓ(w)−ℓ(y)−1)/2 for y<w; in particular py,w(1)=Py,w(1).

[F5]

Bruhat order of Sn (Basic properties of the Bruhat order on Sn): it is graded by inversion length, has the reduced-subword criterion and finite intervals, and y≤w implies y−1≤w−1.

[F6]

Descent recursion (The Kazhdan–Lusztig polynomial descent recursion): for a simple reflection s with sw<w and y≤w, Py,w(q)=q1−cPsy,sw(q)+qcPy,sw(q)− ⁣ ⁣ ⁣∑y≤z≤swsz<z, μ(z,sw)≠0 ⁣ ⁣ ⁣μ(z,sw) q(ℓ(w)−ℓ(z))/2Py,z(q), where c=1 if sy<y and c=0 if sy>y.

[F7]

Block conventions (The regular integral dot-orbit labelling convention): the indexed simples, standards and projectives of Oλ, the multiplicity notations, the Bruhat direction of nonzero multiplicities, and the classical normalization q=v−2 of the Kazhdan–Lusztig coefficients.

Proof

technique · direct
1.1F1F4F7

By [F1] the class of every standard in K0(Oλ) expands in the simple basis as [M(y⋅λ)]=∑w[M(y⋅λ):L(w⋅λ)] [L(w⋅λ)]=∑wAy,w[L(w⋅λ)], where Ay,w=Py,w(1); by [F4] and [F7] the matrix A is unitriangular for the Bruhat order: Aw,w=1 and Ay,w=0 unless y≤w.

1.2F3F4

The matrix A is the specialization at v=1 of the Kazhdan–Lusztig coefficient matrix P=(px,w), because py,w(1)=Py,w(1) by [F4]; specialisation v↦1 is a ring homomorphism Z[v±1]→Z, so the inverse matrix of A is A−1=Q′(1)=(qx,w′(1)) by the two-sided inverse statement Q′=P−1 of [F3]. By the support clause of [F3], qw,x′(1)=0 unless w≤x, and all entries are integers; in particular the sum in the formula is supported on x≥w, and every coefficient qw,x′(1) is the value at one of an integer Laurent polynomial.

1.3F4F5F6

The specialization is not the Möbius function in general; the following finite witness is computed inside S4 with the recursion [F6]. Put b:=1324=s2 and T:=3412=s2s1s3s2; the reduced subwords of this reduced word for T give the interval [b,T]={1324; 1342,1423,2314,3124; 1432,2413,3142,3214; 3412}, ten elements, and all comparable pairs of gap at most two have P=1 by the degree bound of [F4], so the only pair that can be nonconstant is the endpoint (b,T), of gap 3. Apply [F6] with the left descent s=s2 of T: s2T=2413, s2b=1234 and c=1, so Pb,T=P1234,2413+qPb,2413−∑zμ(z,2413)q(4−ℓ(z))/2Pb,z, where z runs over the elements of [b,2413]={1324,1423,2314,2413} with s2z<z; left multiplication by s2 swaps the values 2 and 3, turning these four elements into 1234,1432,3214,3412 of lengths 0,3,3,4, so only z=b has the required descent, and there μ(b,2413)=0 because the gap 2 is even by [F4]. Hence the correction sum vanishes, and with Pb,2413=1 (gap 2) the recursion reduces to Pb,T=P1234,2413+q. For the remaining value apply [F6] at (1234,2413) with the left descent s1: s12413=1423 and c=0, so P1234,2413=qP2134,1423+P1234,1423−∑zμ(z,1423)q(3−ℓ(z))/2P1234,z; the first term vanishes because 1423=s3s2 has no reduced subword s1, so 2134≰1423 and P2134,1423=0 by [F4] and [F5], and the correction sum is empty because the four elements of [1234,1423]={1234,1324,1243,1423} all have lengths 0,1,1,2 raised to 1,2,2,3 by left multiplication with s1, so none is a left descent. Thus P1234,2413=1, and altogether Pb,T(q)=1+q, while Py,z=1 for every other comparable pair in [b,T].

2.1F2F3F5step 1.1step 1.2

Since the classes [L(w⋅λ)] and [M(x⋅λ)] are the two Z-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 w∈W one has [L(w⋅λ)]=∑xqw,x′(1) [M(x⋅λ)], the sum being finite and supported on x≥w by [F5] and step 1.2. Applying the additive character map of [F2] termwise gives the equivalent formal-character identity ch L(w⋅λ)=∑xqw,x′(1) ch M(x⋅λ). In the signed normalization qx,w=sgn(x)sgn(w)qx,w′ of [F3], substituting qw,x′(1)=(−1)ℓ(w)+ℓ(x)qw,x(1) and using that ℓ(w)+ℓ(x) and ℓ(w)−ℓ(x) differ by the even number 2ℓ(x) gives the signed inverse-Kazhdan–Lusztig sum ch L(w⋅λ)=∑x≥w(−1)ℓ(w)−ℓ(x)qw,x(1) ch M(x⋅λ).

3.1F3F5step 2.1

The chain formula of [F3] expresses the inverse coefficients of step 2.1 as the weighted incidence-algebra inverse of A: qx,w′(1)=∑m≥0(−1)m∑x=z0<z1<⋯<zm=wPz0,z1(1)⋯Pzm−1,zm(1), a finite sum over the strictly increasing chains of the finite interval [x,w] described in [F5]. If every comparable-pair value Py,z(1) in [x,w] equals 1, each product in the m-th term equals 1 and the alternating chain count ∑m(−1)m#{strictly increasing chains x=z0<⋯<zm=w} is exactly the ordinary Bruhat Möbius value μ(x,w); so on intervals with all comparable-pair values equal to 1 the coefficients are ordinary Bruhat Möbius numbers.

4.1F3F4step 1.3step 2.1step 3.1∎

Consequently the specialized multiplicity matrix on the interval [b,T] is A=Z+E, where Z is the zeta matrix of the Bruhat poset and E has the single nonzero entry 1 at (b,T). Since b is the minimum and T the maximum of the interval, Zx,b=1 only for x=b and ZT,x=1 only for x=T, so EZ−1=E=ZE and (Z+E)(Z−1−E)=I−ZE+EZ−1=I, that is A−1=Z−1−E; at the endpoint the inverse entry is therefore μ(b,T)−1=−1−1=−2, whereas the ordinary Bruhat Möbius value of the interval is μ(b,T)=−1 (the rank sizes are 1,4,4,1 and the Möbius recursion gives 1 at the bottom, −1 at the four atoms, +1 at the four rank-two elements and −(1−4+4)=−1 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 1 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 q=1 occurs.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Translation identifies the regular integral blocks

Statement

Assume the Axiom of Choice. Let λ,μ be dominant regular integral weights for the same complex type-A semisimple Lie algebra and fixed positive system. Let ν be the unique dominant member of W(μ−λ) and E=L(ν) the finite-dimensional simple. The actual translation functors F=Tλμ=pr⁡χμ(E⊗−)incl⁡χλ,G=Tμλ=pr⁡χλ(E∗⊗−)incl⁡χμ are exact mutually inverse equivalences, with natural adjunction isomorphisms Id⁡≅GF and FG≅Id⁡. They preserve the dot-orbit labels: for every w∈W, FΔ(w⋅λ)≅Δ(w⋅μ),FL(w⋅λ)≅L(w⋅μ),FP(w⋅λ)≅P(w⋅μ), and conversely for G. Consequently the two blocks have identical Verma-flag and composition multiplicities, both equal to Py,w(1), and F transports the inverse-Kazhdan–Lusztig character identity as a Grothendieck-group identity with the same signed weighted-inverse coefficients qw,x′(1) and the same support x≥w. Formal characters in the two blocks use their respective weights x⋅λ and x⋅μ; they need not be equal as weight series. The dominant/antidominant, Bruhat, left/right and inverse-Soergel-label conventions are preserved. This is an ungraded categorical transport and supplies no Ext or Koszul grading.

Facts & Assumptions

Given: The Axiom of Choice (inherited from the category-O suppliers cited below), dominant regular integral weights λ,μ of a fixed type-A root datum, the weights a:=λ+ρ, b:=μ+ρ (both strictly dominant), the dominant weight ν with Wν=W(μ−λ), the finite-dimensional simple E=L(ν), and the translation functors F=Tλμ, G=Tμλ.

[F1]

Translation functors and central characters (Translation functors by tensoring and projection, Central characters are dot-Weyl orbits): Tχ,E,χ′=pr⁡χ′∘(E⊗−)∘incl⁡χ for a finite-dimensional h-semisimple E, with exact inclusions and projections of the central-character decomposition; for weights, Tλμ=pr⁡χμ(E⊗−)incl⁡χλ and Tμλ=pr⁡χλ(E∗⊗−)incl⁡χμ with ν the unique dominant member of W(μ−λ); χλ′=χμ if and only if λ′∈W⋅μ, so a Verma Δ(λ′) is killed by pr⁡χμ exactly when λ′∉W⋅μ, and is preserved identically when λ′∈W⋅μ.

[F2]

Exactness and biadjunction (Translation functors are exact and biadjoint): for every finite-dimensional h-semisimple E the functor Tχ,E,χ′ is exact and Tχ′,E∗,χ is both a left and a right adjoint of it; in particular F and G are exact, F has G as both a left and a right adjoint, and exactness of the right adjoint makes F send projectives to projectives and G send projectives to projectives.

[F3]

Verma flags under finite-dimensional tensoring (Finite-dimensional tensoring preserves Verma flags): for a weight μ′, the object E⊗Δ(μ′) has a finite Verma flag with factors Δ(μ′+η), the factor occurring dim⁡Eη times.

[F4]

Dominant norm comparison (A dominant vector minimises its distance to a dominant weight): for dominant ξ,η and every w∈W, ∣ξ−wη∣≥∣ξ−η∣, with equality if and only if wη∈Wξη; for regular ξ equality forces wη=η.

[F5]

Weight-norm bound and multiplicity one (Weights of a finite-dimensional simple module lie in the norm ball): every weight γ of L(ν) satisfies ∣γ∣≤∣ν∣ with equality if and only if γ∈Wν, and every orbit weight Wν occurs with multiplicity one in L(ν).

[F6]

Homomorphism spaces between Vermas (Homomorphism spaces between Verma modules have dimension at most one): dim⁡Hom⁡g(M(μ′),M(λ′))≤1 for all weights, so End⁡(M)=M↦ scalars on every Verma: the identity spans End⁡(M) and every nonzero endomorphism of a Verma is an isomorphism.

[F7]

Projectives have Verma flags (Projectives in category O have finite Verma flags): every projective object of O has a finite Verma flag.

[F8]

Enough projectives and covers (Category O has enough projectives): every simple admits a projective cover, unique up to isomorphism and indecomposable; every object of O has finite length and is a quotient of a finite direct sum of projective covers.

[F9]

Abelian and extension closed (Category O is abelian and extension closed among weight modules): O is abelian and closed under submodules, quotients and finite direct sums, so kernels and cokernels of morphisms between its objects lie in O.

[F10]

Finite-dimensional simples and their duals (Finite-dimensional simple modules are classified by dominant highest weights, Translation functors by tensoring and projection): for the dominant integral weight ν there is a unique finite-dimensional simple E=L(ν) of highest weight ν, and its dual E∗ is the finite-dimensional simple with highest weight −w0ν, whose extremal orbit is W(λ−μ) and whose weights obey [F5] with the same norm ∣ν∣.

[F11]

Block conventions and multiplicities (The regular integral dot-orbit labelling convention, Projective Verma multiplicities are Kazhdan–Lusztig values at one, Simple Verma composition multiplicities are Kazhdan–Lusztig values, BGG reciprocity): in each of the regular integral blocks Oλ, Oμ the standards, simples and indecomposable projectives are labelled by W, the dominant label is e, the antidominant one w0, (P(w⋅λ):Δ(y⋅λ))=[M(y⋅λ):L(w⋅λ)] by BGG reciprocity, and both multiplicities equal Py,w(1), vanishing unless y≤w.

[F12]

The inverse-Kazhdan–Lusztig character formula (The Kazhdan–Lusztig character formula in regular integral category O): in Oλ, [L(w⋅λ)]=∑xqw,x′(1)[M(x⋅λ)] with qx,w′ the inverse Kazhdan–Lusztig coefficients, supported on x≥w.

Proof

technique · direct
1.1F4F5F10

Since λ and μ are dominant regular integral, the shifted weights a=λ+ρ and b=μ+ρ are strictly dominant and have trivial stabilizers in W; the dominant member ν of W(μ−λ)=W(b−a) satisfies ∣ν∣=∣b−a∣, and by [F5] and [F10] every weight γ of E=L(ν) has ∣γ∣≤∣b−a∣, with equality exactly on Wν, where the multiplicity is one.

1.2F2

By [F2] the functors F and G are exact, and G is both a left and a right adjoint of F (with the roles of E and E∗ exchanged for the reverse pair); exactness of the right adjoint on the other side makes F preserve projectives and G preserve projectives. Write η:Id⁡→GF and ε:FG→Id⁡ for the unit and counit of the adjunction F⊣G; both composites GF and FG are exact as compositions of exact functors.

2.1F1F3F4F5step 1.1step 1.2

Compute FΔ(y⋅λ)=pr⁡χμ(E⊗Δ(y⋅λ)) for y∈W. By [F3] the object E⊗Δ(y⋅λ) has a Verma flag with factors Δ(y⋅λ+γ), γ running over the weights of E with multiplicity dim⁡Eγ, and by [F1] the exact projection pr⁡χμ maps this flag to a flag of the projected object whose factor at γ is Δ(y⋅λ+γ) when y⋅λ+γ∈W⋅μ and 0 otherwise. A retained factor has y⋅λ+γ=x⋅μ for some x, that is ya+γ=xb with a,b strictly dominant and regular. Then ∣γ∣=∣xb−ya∣=∣b−x−1ya∣≥∣b−a∣ by [F4] applied to the dominant vectors b and a; regularity of b makes equality of the norm comparison force x−1ya=a, and regularity of a then forces x=y. Comparing with the bound ∣γ∣≤∣b−a∣ of [F5] gives equality, so γ∈Wν and x=y; then γ=y(b−a)=y(μ−λ), the factor is Δ(y⋅λ+y(μ−λ))=Δ(y⋅μ), and by the multiplicity-one clause of [F5] it occurs exactly once. No other retained factor exists, since every retained factor was shown to equal this one. The projected object therefore has a one-step flag with quotient Δ(y⋅μ), so FΔ(y⋅λ)≅Δ(y⋅μ) for every y.

2.2F1F3F4F5F10step 1.1step 1.2

The dual computation gives GΔ(y⋅μ)≅Δ(y⋅λ) for every y. By [F3] applied to the finite-dimensional module E∗ of [F10], the flag factors of E∗⊗Δ(y⋅μ) are Δ(y⋅μ+γ′) with multiplicities dim⁡(E∗)γ′, and a factor retained by pr⁡χλ satisfies yb+γ′=xa for some x∈W. Then ∣γ′∣=∣xa−yb∣=∣a−x−1yb∣≥∣b−a∣ by [F4] applied to the dominant vectors a and b, and regularity of a forces x−1yb=b and then x=y; the weight bound [F5] applied to the weights of E∗ (whose extremal orbit is W(λ−μ) with multiplicity one, [F10]) gives equality ∣γ′∣=∣b−a∣, γ′=y(a−b)=y(λ−μ), and the retained factor Δ(y⋅μ+y(λ−μ))=Δ(y⋅λ) occurs once. Hence GΔ(y⋅μ)≅Δ(y⋅λ).

3.1F6step 1.2step 2.1step 2.2

For each y∈W, the unit ηΔ(y⋅λ):Δ(y⋅λ)→GFΔ(y⋅λ) corresponds under the adjunction isomorphism Hom⁡(FΔ(y⋅λ),FΔ(y⋅λ))≅Hom⁡(Δ(y⋅λ),GFΔ(y⋅λ)) to the identity of FΔ(y⋅λ); since FΔ(y⋅λ)≅Δ(y⋅μ)≠0 by step 2.1, the unit is nonzero. Its target is GFΔ(y⋅λ)≅GΔ(y⋅μ)≅Δ(y⋅λ) by steps 2.1 and 2.2, so ηΔ(y⋅λ) is a nonzero endomorphism of a Verma module after transport along this isomorphism, and by [F6] every nonzero endomorphism of a Verma module is an isomorphism. Hence η is an isomorphism on every standard object of Oλ.

3.2F6step 1.2step 2.1step 2.2

The same argument for the counit: for each y∈W, εΔ(y⋅μ):FGΔ(y⋅μ)→Δ(y⋅μ) corresponds to the identity of GΔ(y⋅μ)≠0 under the adjunction, hence is nonzero, and its source is FGΔ(y⋅μ)≅FΔ(y⋅λ)≅Δ(y⋅μ) by steps 2.1 and 2.2; by [F6] it is an isomorphism on every standard object of Oμ.

4.1F7step 1.2step 3.1step 3.2

The isomorphisms of steps 3.1 and 3.2 extend to every Verma-filtered object. If 0→A→B→C→0 is a short exact sequence in Oλ with A and C Verma-filtered and ηA,ηC isomorphisms, then GF is exact by step 1.2, and naturality of η gives a map of short exact sequences from 0→A→B→C→0 to 0→GFA→GFB→GFC→0 with isomorphisms at the outer terms; the five lemma makes ηB an isomorphism. Inducting along a finite Verma flag of X (Finite Verma flags and their multiplicities, the flag decomposition 0=X0⊆⋯⊆Xn=X with Verma quotients) gives that ηX is an isomorphism for every Verma-filtered X, and [F7] makes every projective of Oλ Verma-filtered; the identical induction with FG exact and the counit gives that εY is an isomorphism for every Verma-filtered Y of Oμ, in particular for every projective.

5.1F8F9step 4.1

The isomorphisms extend to all objects by finite projective presentations. By [F8] every object X of Oλ has finite length and is a quotient of a finite direct sum of projective covers; choosing such a cover P0↠X and applying the same to the kernel of this map (an object of Oλ by [F9]) produces an exact sequence P1→P0→X→0 with P0,P1 finite direct sums of projective covers, hence projective and Verma-filtered by [F7]. Applying the exact functor GF and using naturality of η identifies ηX with the map induced on the cokernel of ηP1,ηP0, which are isomorphisms by step 4.1; therefore ηX is an isomorphism. The same argument in Oμ with a finite projective presentation and the exact functor FG makes εY an isomorphism for every Y in Oμ. Thus the unit and counit of the adjunction F⊣G are natural isomorphisms, so F and G are mutually inverse equivalences of categories.

6.1F8F11step 2.1step 2.2step 5.1

Being inverse equivalences, F is exact and reflects the categorical structures. For the labels: FΔ(w⋅λ)≅Δ(w⋅μ) was proved in step 2.1. For each w, FL(w⋅λ) is a simple object, and the exact functor F turns the epimorphism Δ(w⋅λ)↠L(w⋅λ) onto its unique simple quotient into an epimorphism Δ(w⋅μ)≅FΔ(w⋅λ)↠FL(w⋅λ); since the simple quotient of Δ(w⋅μ) is unique and equal to L(w⋅μ), one has FL(w⋅λ)≅L(w⋅μ). Finally P(w⋅λ) is a projective cover of L(w⋅λ) by [F8] and [F11], so FP(w⋅λ) is a projective object mapping onto FL(w⋅λ)≅L(w⋅μ) with essential kernel: if a subobject Z′⊆FP(w⋅λ) mapped onto FL(w⋅λ), then applying the inverse equivalence would exhibit a subobject of P(w⋅λ) mapping onto L(w⋅λ), so essentiality on the source forces Z′=FP(w⋅λ). By uniqueness of projective covers in [F8], FP(w⋅λ)≅P(w⋅μ). The dual statements GΔ(w⋅μ)≅Δ(w⋅λ), GL(w⋅μ)≅L(w⋅λ) and GP(w⋅μ)≅P(w⋅λ) follow from step 2.2 and the identical argument with the roles exchanged.

7.1F11F12step 2.2step 6.1∎

The multiplicities are transported termwise. Since F is an equivalence, it is full and faithful, so applying F to a finite Verma flag of P and applying G to a finite Verma flag of FP are inverse bijections between the flag multiplicities of P and of FP; by steps 6.1 and 2.2 the labels match, giving (FP(w⋅λ):FΔ(y⋅λ))=(P(w⋅λ):Δ(y⋅λ)) and, with step 6.1, (P(w⋅μ):Δ(y⋅μ))=(P(w⋅λ):Δ(y⋅λ))=Py,w(1) by [F11]; BGG reciprocity [F11] likewise transports the composition multiplicities and their vanishing. Transporting the identity of [F12] along the induced isomorphism of Grothendieck groups gives [L(w⋅μ)]=∑xqw,x′(1)[M(x⋅μ)] with the same weighted-inverse coefficients and the same support x≥w, because F carries L(w⋅λ) to L(w⋅μ) and M(x⋅λ)=Δ(x⋅λ) to M(x⋅μ). The conventions are preserved because the label w is unchanged: dominant and antidominant labels, Bruhat comparisons, left/right labels and inverse Soergel labels carry over; the formal characters are read in the respective weight series x⋅λ and x⋅μ and need not coincide. Nothing above uses or produces a grading on O, an Ext-algebra or a Koszul structure.

RemarkRemark: Literature-sourcedProof: Not applicableOpen item page →

The full Ext version requires the Koszul grading of category O

Remark

Scope warning. The grading used on this page is the auxiliary grading of the polynomial Soergel lifts: it is what makes the character theorem read off graded standard-support ranks, and it is forgotten by the Soergel functor, which is an ungraded equivalence on projectives (Indecomposable projectives correspond to indecomposable Soergel modules). Consequently the results proved here are the ordinary (ungraded) Verma-flag, composition and character statements, together with the exact shift-to-q=1 conversion (Projective Verma multiplicities are Kazhdan–Lusztig values at one, Simple Verma composition multiplicities are Kazhdan–Lusztig values, The Kazhdan–Lusztig character formula in regular integral category O); they do NOT construct a grading on category O, and in particular they assert nothing about graded multiplicities, about the Ext-algebra of O, or about Koszul duality. Individual coefficients of the Kazhdan–Lusztig polynomials need not be ordinary category-O multiplicities: their value at q=1 is the ordinary multiplicity. This does not rule out a graded refinement whose graded multiplicities sum to that value. The graded version (a Koszul grading, graded BGG reciprocity and the Ext form of the multiplicity theorem, in the sense of the Beilinson–Ginzburg–Soergel programme) remains reserved for the separate Koszul-duality frontier of this library and is deliberately not smuggled into this page.

5 · Examples, counterexamples and false statements

None yet.

Sources