Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
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 polynomial descent recursion

Facts & Assumptions

Given: n≥1, a simple reflection s=si, a left descent sw<w, and the polynomial normalization q=v−2.

[F1]

A=Z[v±1], the standard elements Hx form a basis and are products along reduced expressions, and Hs2=1+(v−1−v)Hs (The normalized type-A Hecke algebra and its bar involution).

[F2]

The Kazhdan–Lusztig basis and its generator multiplication formula are as stated in Multiplication by a generator in the Kazhdan–Lusztig basis.

[F3]

px,z=vℓ(z)−ℓ(x)Px,z(v−2) when x≤z, and μ(x,z) is the coefficient of v in px,z; it is zero unless ℓ(z)−ℓ(x) is odd (Kazhdan–Lusztig polynomials in the classical q-normalization).

[F4]

Writing H‾t=∑x≤tpx,tHx, the basis coefficients vanish outside Bruhat order and satisfy py−1,w−1=py,w (Existence and uniqueness of the Kazhdan–Lusztig basis).

[F5]

Bruhat order is graded by ℓ, simple reflections change length by one, inversion preserves Bruhat order and length, and Bruhat comparison is characterized by reduced subwords; in particular [id,s]={id,s} for a simple reflection (Basic properties of the Bruhat order on Sn).

Statement

Let s=si be a simple reflection, w∈Sn with sw<w, and y≤w. With Px,z:=0 whenever x≰z, 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; here μ is the coefficient defined in Kazhdan–Lusztig polynomials in the classical q-normalization (so the summand only occurs for ℓ(sw)−ℓ(z) odd, and (ℓ(w)−ℓ(z))/2 is then an integer). The same recursion holds with s∈R(w) (right descents) after replacing each index x by x−1, using Py−1,w−1=Py,w and μ(y−1,w−1)=μ(y,w).

Proof

technique · compare the standard-basis coefficients in the left generator multiplication formula
1.1F1F2F3F4F5algebra

The coefficient equation. Since sw<w, we have s(sw)=w>sw. By [F2], H‾sH‾sw=H‾w+∑z≤swsz<zμ(z,sw)H‾z. By [F4], H‾s is supported on {x:x≤s}, and [F5]'s reduced-subword characterization gives [id,s]={id,s}. The constant-term and degree clauses in [F3] give Pid,s=1 and pid,s=v, so H‾s=Hs+vHid. Expand each H‾t=∑x≤tpx,tHx using [F4]. Reduced words and the quadratic relation in [F1] give HsHx=Hsx if sx>x; if sx<x, then x=s(sx) is reduced and HsHx=Hs2Hsx=Hsx+(v−1−v)Hx. Thus the coefficient of Hy on the left is psy,sw+v−1py,sw when sy<y, and psy,sw+vpy,sw when sy>y. The coefficient on the right is py,w+∑y≤z≤sw, sz<zμ(z,sw)py,z. Therefore py,w={psy,sw+v−1py,sw,sy<y,psy,sw+vpy,sw,sy>y,−∑y≤z≤swsz<zμ(z,sw)py,z.

2.1F3F5step 1.1algebra

Convert to q-polynomials. Put d:=ℓ(w)−ℓ(y). By [F5], d≥0. If sy<y, then ℓ(sw)−ℓ(sy)=d and ℓ(sw)−ℓ(y)=d−1; after substituting px,z=vℓ(z)−ℓ(x)Px,z(v−2) in step 1.1 and dividing by vd, the first two terms become Psy,sw(q)+qPy,sw(q). If sy>y, then ℓ(sw)−ℓ(sy)=d−2, so they become qPsy,sw(q)+Py,sw(q). These identities also hold when an index is outside the relevant Bruhat interval, using the zero convention for P. For a sum term, ℓ(z)−ℓ(y)−d=−(ℓ(w)−ℓ(z)), giving the factor q(ℓ(w)−ℓ(z))/2. Thus the two cases are the displayed formula with c=1 and c=0, respectively. If μ(z,sw)≠0, then ℓ(sw)−ℓ(z) is odd; since ℓ(w)=ℓ(sw)+1 by [F5], the exponent (ℓ(w)−ℓ(z))/2 is an integer.

3.1F4F5step 2.1algebra∎

Right descents. If ws<w, inversion preserves Bruhat order by [F5], so sw−1<w−1 and y−1≤w−1. Apply the left formula to y−1,w−1,s. Replace every inverted index using [F4]; lengths and length differences are unchanged by [F5], while sz<z becomes zs<z. This gives the right-descent recursion.

Remarks

The coefficient comparison uses the locally proved multiplication formula, normalization and inverse-index symmetry. Coefficientwise positivity is not required.

Depends on

Used by

Dependency tree · two levels

16 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