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.

✓ 4 results · all verified · 4 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; all 4 also cleared it.

The Kazhdan–Lusztig Character and Multiplicity Theorem — Examples

1 · Prerequisites

2 · Summary

This companion collects the finite computations for the-kazhdan-lusztig-character-and-multiplicity-theorem. The principal sl3 block is computed in full: the Kazhdan–Lusztig basis of the normalized Hecke algebra Hv(3), the multiplicity matrix, which is the Bruhat zeta matrix, and its integer inverse, whose signed rows give the simple characters. A counterexample on the ten-element interval [1324,3412] of S4 shows that the leading coefficient of a Kazhdan–Lusztig polynomial is not the ordinary multiplicity, which is the value at q=1. This numerical witness does not rule out a graded realization; constructions and proofs of Koszulity and Ext refinements remain outside this page. The final example works the rank-one sl2 case: the two blocks C0 and C1 have identical multiplicity data, and the actual tensor/projection equivalences transport the impossible-to-split Verma sequence 0→M−2→M0→L0→0 to 0→M−3→M1→L1→0.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

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 O 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 Py,w(q) is the ordinary Verma-flag multiplicity (P(w⋅λ):Δ(y⋅λ)).'

Counterexample: let λ be dominant regular integral for sl4 (for instance λ=0) and take y=1324=s2 and w=3412=s2s1s3s2 in S4, so that ℓ(w)−ℓ(y)=3. On the ten-element interval [1324,3412] the only comparable-pair Kazhdan–Lusztig polynomial different from 1 is P1324,3412(q)=1+q; its leading coefficient is 1, but the multiplicity theorem gives (P(w⋅λ):Δ(y⋅λ))=Py,w(1)=2≠1. Hence the leading coefficient of the Kazhdan–Lusztig polynomial is not the ordinary multiplicity, and an individual coefficient of Py,w need not equal its ordinary category-O multiplicity. Moreover the page constructs no grading on O 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/Ext refinement is reserved for the separate Koszul-duality frontier.

Facts & Assumptions

Given: The Axiom of Choice (inherited from the multiplicity theorem cited below), sl4 with a dominant regular integral weight λ (for instance λ=0), the permutations b:=1324=s2 and w:=3412=s2s1s3s2 in one-based S4, and the classical Kazhdan–Lusztig polynomials Py,z(q) with q=v−2.

[F1]

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

[F2]

Block and grading conventions (The regular integral dot-orbit labelling convention, Finite Verma flags and their multiplicities): (P(w⋅λ):Δ(y⋅λ)) is the ordinary Verma-flag multiplicity of the standard Δ(y⋅λ), the projective dictionary is the ungraded reduction V(P(w⋅λ))=Bˉw−1, and the auxiliary grading lives on the polynomial Soergel lifts.

[F3]

Classical Kazhdan–Lusztig polynomials (Kazhdan–Lusztig polynomials in the classical q-normalization): Py,z has constant term 1, and for y<z its degree is at most (ℓ(z)−ℓ(y)−1)/2; the μ-coefficient μ(y,z) is the coefficient of q(ℓ(z)−ℓ(y)−1)/2, defined as 0 when ℓ(z)−ℓ(y) is even; Py,z=0 unless y≤z.

[F4]

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

[F5]

Bruhat order of S4 (Basic properties of the Bruhat order on Sn, Bruhat intervals and the R-coefficients): y≤z holds exactly when y is a reduced subword of every reduced expression of z; the order is graded by inversion length; intervals are finite.

Counterexample

technique · direct
1.1F5algebra

The interval. The word s2s1s3s2 has length 4 and is reduced, since 3412 has exactly the four inversions (3,1),(3,2),(4,1),(4,2). Its reduced subwords give: 1234 at length 0; 2134,1324,1243 at length 1; 1342,1423,2314,3124,2143 at length 2; 1432,2413,3142,3214 at length 3; and 3412 at length 4. The four elements 1234,2134,1243,2143 contain no reduced subword equal to s2=1324, so they are not above b by the reduced-subword criterion; the remaining ten elements are exactly [b,w].

1.2F3F5algebra

All gaps at most two have P=1. Suppose y<z and d:=ℓ(z)−ℓ(y)≤2. By [F3] the degree of Py,z is at most (d−1)/2≤1/2, hence at most 0; together with constant term 1 this forces Py,z=1. If d=0 then y=z and Py,y=1; if y and z are incomparable, Py,z=0 by [F3]. In particular Pb,2413=1 and P1234,1423=1, both pairs having gap 2.

2.1F4F5step 1.1step 1.2algebra

The recursion at (id,2413). Write id=1234 and use 2413=s1s3s2, a reduced word with left descent s1. With s=s1 one has s 2413=1423 and s id=2134, so c=0 in [F4] and Pid,2413(q)=q P2134,1423(q)+Pid,1423(q)− ⁣ ⁣ ⁣∑id≤u≤1423s1u<u, μ(u,1423)≠0 ⁣ ⁣ ⁣μ(u,1423) q(3−ℓ(u))/2Pid,u(q). The first summand vanishes: 1423=s3s2 has no reduced subword s1, so 2134≰1423 and P2134,1423=0 by [F3] and [F5]. The correction sum is empty as well: [id,1423]={1234,1324,1243,1423} by step 1.1, and for each of these four elements left multiplication by s1 swaps the values 1 and 2, raising the length from 0,1,1,2 to 1,2,2,3 respectively, so no element of the interval has the required left descent s1. By step 1.2 the remaining term is Pid,1423=1, hence Pid,2413=1.

3.1F3F4step 1.1step 1.2step 2.1algebra

The main recursion. Apply [F4] to b=1324, w=3412 and the left descent s=s2: s2w=2413 and s2b=1234, so c=1 because s2b has length 0<1=ℓ(b), and Pb,w(q)=Pid,2413(q)+q Pb,2413(q)− ⁣ ⁣ ⁣∑b≤u≤2413s2u<u, μ(u,2413)≠0 ⁣ ⁣ ⁣μ(u,2413) q(4−ℓ(u))/2Pb,u(q). By step 1.1 the interval [b,2413] is {1324,1423,2314,2413}; left multiplication by s2 swaps the values 2 and 3, turning these into 1234,1432,3214,3412 of lengths 0,3,3,4, so only u=b has the required descent, and there μ(b,2413)=0 because ℓ(2413)−ℓ(b)=2 is even by [F3]. The correction sum is therefore empty; step 2.1 gives Pid,2413=1 and step 1.2 gives Pb,2413=1, so Pb,w=1+q, with μ(b,w)=1 and ℓ(w)−ℓ(b)=3.

4.1F1F2step 3.1algebra

The comparison. The polynomial Pb,w(q)=1+q has leading coefficient 1 (the coefficient of q1, its degree being 1) while its value at q=1 is 2. The multiplicity theorem [F1] computes the ordinary Verma-flag multiplicity as (P(w⋅λ):Δ(b⋅λ))=Pb,w(1)=2, with 0 dominant regular integral in sl4 (indeed ⟨ρ,αi∨⟩=1≠0 for every simple root and 0 is integral). Hence the leading coefficient 1 of the Kazhdan–Lusztig polynomial differs from the multiplicity 2: 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: b≤w, all polynomials are classical Kazhdan–Lusztig polynomials, and the multiplicity is that of the ordinary block O0.

5.1F1F2step 4.1∎

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 V(P(w⋅λ))=Bˉw−1, whose auxiliary grading lives on the polynomial lift and is not a grading of Oλ. Thus the character identity at q=1 cannot establish that the block is graded or Koszul; the graded and Ext 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 (y,w)=(1324,3412) in sl4.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The Kazhdan–Lusztig multiplicity matrix for the sl_3 principal block

Example

Take g=sl3 (type A2, W=S3) and the principal block, i.e. the regular integral block O0 of the weight λ=0 (0+ρ=ρ is regular). In one-line notation the labels w∈{123,213,132,231,312,321} index the weights w⋅0=0,−α1,−α2,−2α1−α2,−α1−2α2,−2ρ. All nineteen Kazhdan–Lusztig polynomials of comparable pairs in S3 equal 1 (there are nineteen pairs y≤w in the Bruhat order on S3), so [M(y⋅0):L(w⋅0)]=Py,w(1)=1  if y≤w,0  otherwise: the multiplicity matrix is the Bruhat zeta matrix of S3 (with rows y, columns w), e.g. [M(0):L(w⋅0)]=1 for all six w, [M(321⋅0):L(w⋅0)]=0 unless w=321, and M(213⋅0) has the four composition factors L(213⋅0),L(231⋅0),L(312⋅0),L(321⋅0), each once. By BGG reciprocity the Verma-flag matrix (P(w⋅0):Δ(y⋅0)) is the same zeta matrix, e.g. (P(123⋅0):Δ(y⋅0))=0 for y≠123 and (P(321⋅0):Δ(y⋅0))=1 for all y.

Facts & Assumptions

Given: The Axiom of Choice (inherited from the multiplicity and BGG suppliers below), the one-based group S3 with its Bruhat order, the normalized Hecke algebra Hv(3) with α:=v−v−1, and sl3 with the dominant regular integral weight 0 and its principal block O0.

[F1]

Hecke algebra and bar (The normalized type-A Hecke algebra and its bar involution, The Hecke bar involution is well defined): Hsi2=1−αHsi with α=v−v−1; the bar is the semilinear multiplicative involution with Hsi‾=Hsi+α; HwHsi=Hwsi when ℓ(wsi)=ℓ(w)+1; the {Hw} form an A-basis.

[F2]

Existence and uniqueness of the Kazhdan–Lusztig basis (Existence and uniqueness of the Kazhdan–Lusztig basis): H‾w is the unique bar-fixed element of Hw+∑y<wvZ[v]Hy, these elements form a basis, and H‾w=∑y≤wpy,wHy with py,w=0 unless y≤w and pw,w=1.

[F3]

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

[F4]

Bruhat order of S3 (Basic properties of the Bruhat order on Sn): the reduced-subword criterion, graded by inversion length, ranks {123},{132,213},{231,312},{321} with the eight covers (123,132), (123,213), (132,231), (132,312), (213,231), (213,312), (231,321), (312,321).

[F5]

The composition-multiplicity theorem (Simple Verma composition multiplicities are Kazhdan–Lusztig values): in the regular integral block O0, [M(y⋅0):L(w⋅0)]=Py,w(1), vanishing unless y≤w.

[F6]

BGG reciprocity (BGG reciprocity): (P(μ):Δ(ν))=[M(ν):L(μ)] for all weights, with Δ(ν)=M(ν) the Verma module of Verma modules.

[F7]

Block conventions (The regular integral dot-orbit labelling convention): for the dominant regular integral weight λ=0 of sl3 the standards are Δ(w⋅0)=M(w⋅0), the simples L(w⋅0), the projectives P(w⋅0), the dot action is w⋅0=w(ρ)−ρ, and the multiplicity notations are those of [F5] and [F6].

Verification

technique · direct
1.1F7algebra

The dot orbit. With ρ=α1+α2 for the root system A2, the dot action w⋅0=w(ρ)−ρ computes: 123⋅0=0; 213⋅0=s1(ρ)−ρ=−α1; 132⋅0=s2(ρ)−ρ=−α2; 231⋅0=(s1s2)⋅0=s1⋅(−α2)=s1(ρ−α2)−ρ=−2α1−α2; 312⋅0=(s2s1)⋅0=−α1−2α2; 321⋅0=w0(ρ)−ρ=−2ρ. The positive-root pairings of ρ are 1,1,2, 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 O0 is a regular integral block with the six labelled standards, simples and projectives.

1.2F1F2F4algebra

The Kazhdan–Lusztig basis of Hv(3). Put X=H213, Y=H132 and A:=X+v, B:=Y+v; by [F1] both A and B are bar-fixed, because X+v‾=(X+α)+v−1=X+v and likewise for Y. The reduced words give H231=XY, H312=YX and H321=YXY in the one-based model, so AB=H231+v(H213+H132)+v2H123 and BA=H312+v(H132+H213)+v2H123. For the length-three element, expanding (Y+v)(X+v)(Y+v) and replacing Y2 by 1−αY gives BAB=H321+v(H231+H312)+(1+v2)H132+v2H213+(v+v3)H123, hence BAB−B=H321+v(H231+H312)+v2(H132+H213)+v3H123. Each of the six elements H123, A, B, AB, BA, BAB−B is bar-fixed and lies in its top standard basis element plus a vZ[v]-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 H‾123,H‾213,H‾132,H‾231,H‾312,H‾321.

2.1F3F4step 1.2algebra

All polynomials equal 1, and the count. Reading the six expansions of step 1.2 against H‾w=∑y≤wpy,wHy gives py,w=vℓ(w)−ℓ(y) whenever y≤w: the coefficients are 1 on the diagonal, v at gap one, v2 at gap two and v3 at the longest pair. Hence [F3] gives Py,w(q)=1 for every one of the comparable pairs. By the rank description [F4] the comparable pairs are: the six diagonal pairs; for y=123 the five strict pairs; for each of y=213,132 the three strict pairs (the two rank-two elements and 321); and for each of y=231,312 the pair with 321; altogether 6+5+3+3+1+1=19 pairs, and every one has Py,w=1.

3.1F4F5step 2.1

The multiplicity matrix. By [F5] and step 2.1, [M(y⋅0):L(w⋅0)]=Py,w(1)=1 exactly when y≤w and 0 otherwise; this is the Bruhat zeta matrix of S3 with rows y and columns w. For the displayed instances: y=123 is the minimum of the Bruhat order, so [M(0):L(w⋅0)]=1 for all six w; y=321 is the maximum, so [M(321⋅0):L(w⋅0)]=0 unless w=321, where it is 1; and for y=213 the comparable columns are w=213,231,312,321 by [F4], so M(213⋅0) has exactly the four composition factors L(213⋅0),L(231⋅0),L(312⋅0),L(321⋅0), each once.

4.1F6F7step 3.1∎

The Verma-flag matrix. Applying BGG reciprocity [F6] with μ=w⋅0 and ν=y⋅0 gives (P(w⋅0):Δ(y⋅0))=[M(y⋅0):L(w⋅0)], which by step 3.1 is 1 exactly when y≤w and 0 otherwise; the interpretation of the left-hand multiplicity is the Verma-flag multiplicity of the labelled projective by [F7]. In particular (P(123⋅0):Δ(y⋅0))=0 for y≠123 (with value 1 at y=123, since 123 is the minimum and no other y lies below it) and (P(321⋅0):Δ(y⋅0))=1 for all y (all y lie below the maximum 321). So the projective-flag matrix is the same zeta matrix.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Inverting Kazhdan–Lusztig multiplicities to obtain simple characters

Example

In the principal block O0 of sl3 of the previous example, order the labels as 123,213,132,231,312,321; the inverse of the zeta matrix A=P(1) is the integer matrix A−1=(1−1−111−1010−1−11001−1−1100010−100001−1000001), and the character formula gives, with the sum supported on x≥w, ch L(123⋅0)=ch M(123⋅0)−ch M(213⋅0)−ch M(132⋅0)+ch M(231⋅0)+ch M(312⋅0)−ch M(321⋅0), ch L(213⋅0)=ch M(213⋅0)−ch M(231⋅0)−ch M(312⋅0)+ch M(321⋅0), ch L(132⋅0)=ch M(132⋅0)−ch M(231⋅0)−ch M(312⋅0)+ch M(321⋅0), ch L(231⋅0)=ch M(231⋅0)−ch M(321⋅0),ch L(312⋅0)=ch M(312⋅0)−ch M(321⋅0),ch L(321⋅0)=ch M(321⋅0). In particular the inverse coefficients are signed integers even though all Kazhdan–Lusztig polynomials are 1, and for w=123 the formula is the BGG Euler-characteristic expression ch L(0)=∑w(−1)ℓ(w)ch M(w⋅0) of the trivial module.

Facts & Assumptions

Given: The Axiom of Choice (inherited from the character and Euler-character suppliers below), the regular integral principal block O0 of sl3, the label order 123,213,132,231,312,321, the multiplicity matrix A=(Py,w(1)), and the displayed integer matrix B of the Example.

[F1]

The character formula (The Kazhdan–Lusztig character formula in regular integral category O): in O0, ch L(w⋅0)=∑xqw,x′(1) ch M(x⋅0), supported on x≥w, where qx,w′ are the inverse Kazhdan–Lusztig coefficients.

[F2]

The sl3 multiplicity matrix (The Kazhdan–Lusztig multiplicity matrix for the sl_3 principal block): all comparable-pair Kazhdan–Lusztig polynomials in S3 equal 1, the matrix A=P(1)=(Py,w(1)) is the Bruhat zeta matrix of S3 (rows y, columns w: Ay,w=1 exactly when y≤w), the Bruhat ranks are {123},{132,213},{231,312},{321} with the eight covers (123,132),(123,213),(132,231),(132,312),(213,231),(213,312),(231,321),(312,321), and the nineteen comparable pairs are the transitive closure of these covers.

[F3]

Inverse Kazhdan–Lusztig coefficients (Inverse Kazhdan–Lusztig polynomials, The Kazhdan–Lusztig inversion formula): Q′=(qx,w′)=P−1 is the two-sided inverse of the Kazhdan–Lusztig coefficient matrix P=(px,w), defined by the finite chain sum, so specializing at v=1 gives Q′(1)=A−1.

[F4]

Classical normalization (Kazhdan–Lusztig polynomials in the classical q-normalization): py,w(1)=Py,w(1), so the entries of P(1) are the classical polynomial values, integers here.

[F5]

Grothendieck group and characters (The Grothendieck group and character of O, Simple and standard bases of K0(O)): the classes of the simples and separately of the Vermas are Z-bases of the Grothendieck group of the block, and the formal character is an additive map on it.

[F6]

The BGG Euler-character identity (The Euler-character identity for a finite-dimensional simple module): for a dominant integral weight λ, [L(λ)]=∑w∈W(−1)ℓ(w)[M(w∘λ)] in the Grothendieck group of the linkage block.

[F7]

The Weyl character formula (The Weyl character formula): for dominant integral λ, ch L(λ)=A(λ+ρ) A(ρ)−1, so at λ=0 one gets ch L(0)=A(ρ)A(ρ)−1=1, the character of the trivial module.

Verification

technique · direct
1.1F2F4algebra

The two matrix products. Write the displayed matrix as B. The product AB has entries (AB)y,w=∑x: y≤xBx,w, a sum over the interval [y,⋅]; reading rows x of B against the comparability lists of [F2]: for y=123 the six rows of B sum to (1,0,0,0,0,0); for y=213 the rows with x∈{213,231,312,321} sum to (0,1,0,0,0,0); for y=132 the rows with x∈{132,231,312,321} sum to (0,0,1,0,0,0); for y=231 the rows 231,321 sum to (0,0,0,1,0,0); for y=312 the rows 312,321 sum to (0,0,0,0,1,0); for y=321 the last row is (0,0,0,0,0,1). Hence AB=I. Since A is unitriangular by [F2], it has an integral two-sided inverse (the finite geometric series for I+(A−I)), so AB=I implies B=A−1 and BA=I. Equivalently, (BA)y,w=∑x: x≤wBy,x sum over the lower ideal of the column label, rather than over a prefix of the displayed order; for example the row-123 sums at w=132 and w=312 are 1−1=0 and 1−1−1+1=0 respectively.

2.1F1F3F4step 1.1

The inverse coefficients. By [F3] the matrix of inverse Kazhdan–Lusztig coefficients is Q′=P−1, and by [F4] its specialization at v=1 is A−1=B; hence qx,w′(1)=Bx,w for all x,w, the entries of B being integers, some negative. Substituting the rows of B into the character formula of [F1], with the support x≥w of [F2], gives exactly the six displayed identities: row 123 is (1,−1,−1,1,1,−1), row 213 is (0,1,0,−1,−1,1) and row 132 is (0,0,1,−1,−1,1), row 231 is (1,0,−1) on the labels 231,312,321, row 312 is (1,−1) on 312,321, and row 321 is 1.

3.1F2F5F6F7step 2.1∎

The w=123 row and the Euler characteristic. On the labels ordered by [F2], the first row of B is q123,x′(1)=(−1)ℓ(x): the values are +1 at x=123 (length 0), −1 at x=213,132 (length 1), +1 at x=231,312 (length 2) and −1 at x=321 (length 3). Hence the row-123 identity of step 2.1 is ch L(0)=∑x(−1)ℓ(x)ch M(x⋅0), the BGG Euler-characteristic expression; by [F6] applied to the dominant integral weight 0 this is the class of L(0) in the Grothendieck group of the block, and by [F7] ch L(0)=A(ρ)A(ρ)−1=1 is the character of the trivial module. This independent check confirms the signed inversion: all Kazhdan–Lusztig polynomials are 1, yet the inverse coefficients are signed integers.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Translation between two regular integral blocks

Example

For g=sl2, label W≅S2 by {123,213} (the subgroup of S3 fixing 3), and write a weight as its coordinate l=λ(h), so ρ=1, the dot action is s⋅l=−l−2, and the dominant regular integral weights are l=n∈Z≥0 with regular integral block Cn on the labels {n,−n−2}. Then for n=0 and n=1 the two blocks C0 and C1 have identical multiplicity data: with e=123 and s=213, (P(e⋅l):Δ(e⋅l))=1,(P(s⋅l):Δ(e⋅l))=1,(P(s⋅l):Δ(s⋅l))=1,(P(e⋅l):Δ(s⋅l))=0, [M(e⋅l):L(e⋅l)]=[M(e⋅l):L(s⋅l)]=[M(s⋅l):L(s⋅l)]=1,[M(s⋅l):L(e⋅l)]=0, for l=0 and l=1, matching the Kazhdan–Lusztig values P123,123=P123,213=P213,213=1 and P213,123=0 of S2. In each block P(e⋅l)=Δ(e⋅l) is the projective cover of L(e⋅l) and P(s⋅l) fits into the nonsplit sequence 0→Δ(e⋅l)→P(s⋅l)→Δ(s⋅l)→0, while Δ(s⋅l)=L(s⋅l); the character formula gives ch L(e⋅l)=ch M(e⋅l)−ch M(s⋅l) and ch L(s⋅l)=ch M(s⋅l), and for the dominant label e the first identity telescopes to the Weyl character en+en−2+⋯+e−n of the (n+1)-dimensional simple module. The actual equivalence F=pr⁡χ1(L(1)⊗−)incl⁡χ0, with inverse G=pr⁡χ0(L(1)∗⊗−)incl⁡χ1, sends the sequence 0→M−2→M0→L0→0 of the principal block to 0→M−3→M1→L1→0.

Facts & Assumptions

Given: The Axiom of Choice (inherited from the projectivity and transport suppliers below), the Lie algebra sl2 with Cartan element h, positive root α and ρ=α/2, weights written as coordinates l=λ(h); for n∈Z≥0 the block Cn on the dot orbit {n,−n−2}, with labels e=123 and s=213.

[F1]

Block conventions (The regular integral dot-orbit labelling convention, Central characters are dot-Weyl orbits): Δ(w⋅l)=M(w⋅l), L(w⋅l), P(w⋅l) labelled by W, the central character depends only on the dot orbit, and a Verma is killed by the projection to a block exactly when its weight is outside the orbit of that block.

[F2]

Verma modules and the PBW model (Verma modules, The PBW model of a Verma module): M(l) is generated by the highest weight vector vl, and multiplication u↦uvl identifies U(n−) with M(l); in particular the vk:=fkvl (k≥0) form a basis and generate M(l).

[F3]

Antidominant Vermas are simple (Antidominant regular Verma modules are simple): if ⟨l+ρ,α∨⟩<0 then M(l) is simple.

[F4]

The maximal-label projectivity (A maximal-label Verma is projective in its truncation): in a finite downward-closed ideal of a linkage class, the Verma at a maximal weight is projective.

[F5]

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

[F6]

BGG reciprocity (BGG reciprocity): (P(l):Δ(l′))=[M(l′):L(l)] for all weights, the left side being the Verma-flag multiplicity.

[F7]

Factors of a Verma (Jordan-Holder factors of Verma modules dominate the head (BGG 8.12)): if L(l′) occurs in a composition series of M(w⋅l) for dominant integral l, then l′=u⋅l with u≥w, and L(w⋅l) occurs exactly once.

[F8]

Translation functors and their transport (Translation functors by tensoring and projection, Translation identifies the regular integral blocks): for dominant regular integral weights the functors Tλμ=pr⁡χμ(E⊗−)incl⁡χλ and Tμλ=pr⁡χλ(E∗⊗−)incl⁡χμ (with E the finite-dimensional simple whose highest weight is the unique dominant member of W(μ−λ)) are inverse exact equivalences carrying Δ(w⋅λ)↦Δ(w⋅μ), L(w⋅λ)↦L(w⋅μ) and P(w⋅λ)↦P(w⋅μ).

[F9]

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

[F10]

Kazhdan–Lusztig data (Kazhdan–Lusztig polynomials in the classical q-normalization, The Kazhdan–Lusztig character formula in regular integral category O): for S2 the three comparable-pair polynomials are Pe,e=Pe,s=Ps,s=1 and Ps,e=0; hence the inverse coefficient matrix at v=1 is (qx,w′(1))=(1−101), and in each block ch L(e⋅l)=ch M(e⋅l)−ch M(s⋅l), ch L(s⋅l)=ch M(s⋅l).

[F11]

The Weyl character formula (The Weyl character formula): for dominant integral l the finite-dimensional simple L(l) has character A(l+ρ)A(ρ)−1, which for sl2 is the finite geometric sum el+el−2+⋯+e−l.

Verification

technique · direct
1.1F1algebra

The two blocks. With ρ=1 the dot action on coordinates is s⋅l=s(l+1)−1=−l−2, so the orbit of n is {n,−n−2}; a weight l is dominant regular integral exactly when l∈Z≥0, and then −n−2<n in the dominance order. Hence Cn is a regular integral block with the two labels e=123↦n and s=213↦−n−2; for n=0 and n=1 the abstract labelled data are the same, which is what makes the two blocks directly comparable.

1.2F2algebra

The PBW computation. Fix n≥0 and put vk:=fkvn, a basis of M(n) by [F2]; the highest weight vector v0 generates M(n) and spans the n-weight space, which is one-dimensional. From the sl2 relations [h,f]=−2f, [e,f]=h one computes h⋅vk=(n−2k)vk, f⋅vk=vk+1, and, by induction on k from e⋅v0=0, e⋅vk=k(n−k+1)vk−1. If M(n)=A⊕B with v0=a+b, then a and b lie in the one-dimensional weight space M(n)n=Cv0; if b≠0 then b is a nonzero multiple of v0, so v0∈B and M(n)=U(g)v0⊆B, while if b=0 then v0=a∈A and M(n)⊆A; either way one of the summands is zero. So M(n) is indecomposable.

2.1F2F3step 1.2

The submodule W. Let W:=span⁡{vk:k≥n+1}. By step 1.2 it is stable under f and h; and e⋅vn+1=(n+1)(n−(n+1)+1)vn=0, while for k≥n+2 one has e⋅vk=k(n−k+1)vk−1 with k−1≥n+1, so e maps W into W. Hence W is a nonzero submodule. Its highest weight vector vn+1 has weight n−2(n+1)=−n−2 and is killed by e; the linear map M(−n−2)→W sending the basis element fkv−n−2 of the PBW model of M(−n−2) to vn+1+k is a g-module isomorphism by the action formulas of step 1.2 (both sides have the same h-eigenvalues and the same e,f-action). Since −n−2+1=−n−1<0, the Verma M(−n−2) is simple by [F3], so W≅M(−n−2)=L(−n−2).

2.2F10F11step 1.2

Characters. By step 1.2 the weight multiplicities of M(n) are 1 in each weight n−2k, k≥0, so ch M(n)=∑k≥0en−2k and ch M(−n−2)=∑k≥0e−n−2−2k; the character formula of [F10] therefore gives ch L(n)=ch M(n)−ch M(−n−2)=∑k=0nen−2k=en+en−2+⋯+e−n, in agreement with the Weyl character of the finite-dimensional simple L(n) by [F11], and ch L(−n−2)=ch M(−n−2).

3.1F2F7step 1.2step 2.1

The quotient is L(n). By step 1.2 the images of v0,…,vn form a basis of Q:=M(n)/W, with weights n,n−2,…,−n, each occurring once; in particular Q is finite-dimensional and nonzero with a one-dimensional n-weight space. By [F7] every composition factor of M(n) is L(n) or L(−n−2), and L(n) occurs exactly once. The simple L(−n−2)=M(−n−2) is infinite-dimensional, because the PBW basis {fkv−n−2:k≥0} of M(−n−2) is infinite by [F2]; hence no composition factor of the finite-dimensional module Q is L(−n−2), and the only remaining factor is L(n), occurring once. Therefore Q≅L(n), and M(n) has exactly the two composition factors L(n) and L(−n−2), each once.

4.1F4F5F6step 1.2step 2.1step 3.1

The projective structure. The block Cn={n,−n−2} is a finite downward-closed ideal with maximum n; by [F4] the Verma Δ(n)=M(n) is projective in the block. Every submodule is a sum of weight spaces: polynomial interpolation in h extracts the finitely many weight components of any vector. If a submodule contains vk for 0≤k≤n, then ekvk is a nonzero multiple of v0 by step 1.2, and the submodule is all of M(n). Thus every proper submodule lies in W=span⁡{vk:k≥n+1}, whose quotient is L(n) by step 3.1; W, rather than all lower weight spaces, is the unique maximal submodule. A submodule mapping onto L(n) contains a weight-n vector and hence v0, so M(n)↠L(n) is essential. By uniqueness of projective covers [F5], P(n)=P(e⋅l) is isomorphic to Δ(n) and is the projective cover of L(n). For the other label apply BGG reciprocity [F6]: (P(−n−2):Δ(n))=[M(n):L(−n−2)]=1 and (P(−n−2):Δ(−n−2))=[M(−n−2):L(−n−2)]=1 by steps 2.1 and 3.1, while all other flag multiplicities vanish since the block has only these two labels. So P(s⋅l)=P(−n−2) has a flag with the two factors Δ(n) and Δ(−n−2), each once. If its quotient factor were Δ(n), projectivity of Δ(n) would split that two-step flag, contradicting the indecomposability of P(−n−2) in [F5]. Hence the submodule factor is Δ(n) and the quotient factor is Δ(−n−2), giving the short exact sequence 0→Δ(n)→P(−n−2)→Δ(−n−2)→0. This sequence is nonsplit: a splitting would exhibit P(−n−2)≅Δ(n)⊕Δ(−n−2) as a direct sum of two nonzero objects, contradicting the indecomposability of projective covers in [F5]. Finally Δ(−n−2)=M(−n−2)=L(−n−2) by step 2.1.

5.1F10step 2.1step 3.1step 4.1

The multiplicity data for n=0,1. The four flag multiplicities of the Example are those just computed and do not depend on n: (P(e⋅l):Δ(e⋅l))=1, (P(s⋅l):Δ(e⋅l))=1, (P(s⋅l):Δ(s⋅l))=1, (P(e⋅l):Δ(s⋅l))=0 (the last because P(n)≅Δ(n) has only the factor Δ(n)). The composition multiplicities are likewise independent of n: [M(n):L(n)]=[M(n):L(−n−2)]=[M(−n−2):L(−n−2)]=1 and [M(−n−2):L(n)]=0 by steps 2.1 and 3.1, since M(−n−2)=L(−n−2) is simple and its highest weight differs from n. For n=0,1 these are exactly the displayed matrices; they match Pe,e=Pe,s=Ps,s=1, Ps,e=0 by [F10], as asserted by the multiplicity theorem on the A page.

5.2F1F5F8F9step 1.2step 2.1step 3.1step 4.1

The transported sequence. Take the principal block n=0 and the target n=1, both dominant regular integral, and note that for λ=0, μ=1 the difference μ−λ=1 has dominant member ν=1; here E=L(1) is the two-dimensional simple with weights +1,−1, each once, and E∗≅E. By [F9] the tensor E⊗M(0) has Verma flag factors M(1) and M(−1), and E⊗M(−2) has factors M(−1) and M(−3). The projections to the blocks χ1 and χ0 keep exactly the factors lying in the respective dot orbits {1,−3} and {0,−2} by [F1]: hence F(M(0))=pr⁡χ1(E⊗M(0))≅M(1) and F(M(−2))≅M(−3), while G(M(1))=pr⁡χ0(E⊗M(1))≅M(0) from the factors M(2),M(0) and G(M(−3))≅M(−2) from the factors M(−2),M(−4). By the transport theorem [F8] F(L(0))=L(1), G(L(1))=L(0), F(P(0))=P(1), F(P(−2))=P(−3) and conversely. Since F is exact, applying it to the nonsplit sequence 0→M(−2)→M(0)→L(0)→0 of the principal block produces the exact sequence 0→F(M(−2))→F(M(0))→F(L(0))→0, that is 0→M(−3)→M(1)→L(1)→0 in the block C1; it is nonsplit because an exact inverse equivalence G would carry a splitting of its image back to a splitting of the original sequence. The original middle module is M(0)=P(0), not P(−2); it is indecomposable by step 1.2, and its submodule M(−2) and quotient L(0) are both nonzero by steps 2.1 and 3.1, so such a splitting is impossible.

6.1step 4.1step 5.1step 2.2step 5.2∎

The claims of the Example are therefore all verified: the two blocks C0 and C1 share the displayed multiplicity matrices (steps 4.1 and 5.1), the projective cover P(e⋅l) equals Δ(e⋅l) and P(s⋅l) carries the nonsplit two-step sequence with Δ(s⋅l)=L(s⋅l) (step 4.1), the character identities telescope to the Weyl character of the (n+1)-dimensional simple (step 2.2), and the actual inverse equivalences F and G transport the principal-block Verma sequence to 0→M−3→M1→L1→0 (step 5.2). The two blocks use different weight series; only the labels and the combinatorial data agree.

Sources