Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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-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.

Depends on

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