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.

Multiplication by a generator in the Kazhdan–Lusztig basis

Facts & Assumptions

Given: n≥1, a simple reflection s=si, the normalized Hecke algebra, and its Kazhdan–Lusztig basis.

[F1]

The elements Hx form a standard basis and satisfy Hs2=1+(v−1−v)Hs (The normalized type-A Hecke algebra and its bar involution).

[F2]

The basis elements H‾w=∑x≤wpx,wHx are bar-invariant, have pw,w=1, px,w=0 unless x≤w, px,w∈vZ[v] for x<w, and px−1,w−1=px,w (Existence and uniqueness of the Kazhdan–Lusztig basis).

[F3]

Under the classical polynomial normalization, px,w=vℓ(w)−ℓ(x)Px,w(v−2) for x≤w, and μ(x,w) is the coefficient of v in px,w, set to 0 when the length difference is even. For a Bruhat cover x<w, this gives px,w=v (Kazhdan–Lusztig polynomials in the classical q-normalization).

[F4]

Bruhat order has the reduced-subword characterization and left lifting properties, and is preserved by inversion (Basic properties of the Bruhat order on Sn).

[F5]

The reversal anti-automorphism ♭ fixes Hs, sends Hw to Hw−1, and reverses products (Reversal anti-involution commutes with the Hecke bar).

Statement

Let s=si be a simple reflection and w∈Sn. In the Kazhdan–Lusztig basis {H‾w} of Existence and uniqueness of the Kazhdan–Lusztig basis: H‾s H‾w={(v+v−1) H‾w,sw<w,H‾sw+∑z∈Snsz<z<wμ(z,w) H‾z,sw>w, and symmetrically H‾wH‾s=(v+v−1)H‾w if ws<w, H‾wH‾s=H‾ws+∑zs<z<wμ(z,w)H‾z if ws>w. Here μ(z,w) is the coefficient of v in pz,w (Kazhdan–Lusztig polynomials in the classical q-normalization), which can be nonzero only when ℓ(w)−ℓ(z) is odd; the sums are finite since Sn is finite. In particular H‾sH‾s=(v+v−1)H‾s, and H‾sH‾w=H‾sw when sw>w and ℓ(w)≤1. The span conclusion is for the ascent case sw>w: there, H‾sH‾w lies in the span of H‾sw and of the H‾z with z<w and sz<z.

Proof

technique · use induction on $\ell(w)$ and the uniqueness of the bar-invariant triangular basis element
1.1F1F2F3F4algebra

The left-ascent difference. Put As:=H‾s=Hs+vHid by [F2, F3]. We prove the formulas by induction on ℓ(w), assuming the descent formula for all smaller upper indices. If sx>x, reduced concatenation gives HsHx=Hsx; if sx<x, write x=s(sx) and use the quadratic relation to get HsHx=Hsx+(v−1−v)Hx. Suppose sw>w and set Cw:=H‾sw+∑z:sz<z<wμ(z,w)H‾z. For any x≤w, fix a reduced expression for w and a reduced subword for x. Since sw>w, prefixing s gives a reduced expression for sw; when sx>x, prefixing s to the subword gives a reduced subword for sx, and when sx<x, sx<x≤w<sw. Thus every standard-basis term of AsH‾w is indexed by an element ≤sw. The same holds for Cw, since w<sw and every z<w satisfies z<sw. Only the leading term Hw can produce Hsw in AsH‾w, with coefficient 1: for x<w, the terms from HsHx have length at most ℓ(x)+1≤ℓ(w)<ℓ(sw). The leading term of H‾sw gives coefficient 1 in Cw. Thus Dw:=AsH‾w−Cw is supported strictly below sw. Using [F1], its coefficient at Hy is fy=psy,w+{v−1py,w,sy<y,vpy,w,sy>y,−py,sw−∑y≤z<wsz<zμ(z,w)py,z, with pa,b=0 when a≰b.

2.1F2F3step 1.1algebra

Coefficients with sy<y. Let y<sw and sy<y. The terms psy,w and py,sw are each either 0 or in vZ[v], except when sy=w; that exception forces y=sw and is excluded. If y≤w, then in fact y<w, since y=w would give sy=sw>w=y, contrary to sy<y. The sum defining fy then contains its z=y term μ(y,w), since py,y=1. By definition of μ, v−1py,w−μ(y,w)∈vZ[v]; every remaining sum term has z>y and py,z∈vZ[v]. If y≰w, then py,w=0, μ(y,w)=0, and the sum is empty. Thus fy∈vZ[v] in both cases.

3.1F1F2F3F4step 1.1step 2.1algebra

Coefficients with sy>y. For y=w, the coefficient is fw=v−pw,sw=0: the simple ascent makes w<sw a Bruhat cover, so the degree bound and constant term of Pw,sw give pw,sw=v. Suppose y<sw and y≠w. If y≰w, then sy≰w (otherwise y<sy≤w), so psy,w=py,w=0 and the sum is empty; the remaining py,sw is either zero or in vZ[v]. Now assume y≤w. Fix a reduced expression for w and a reduced subword for y. Since sw>w and sy>y, prefixing s gives a reduced expression for sw and a reduced subword for sy, so sy≤sw; because y≠w, sy<sw. For each z<w with sz<z, induction gives H‾sH‾z=(v+v−1)H‾z, or (Hs−v−1)H‾z=0. Comparing the coefficient of Hy gives py,z=vpsy,z. For every such z with y≤z, the left-lifting clause in [F4] gives sy≤z; conversely sy≤z implies y<sy≤z. Thus the sum in fy becomes v∑sy≤z<w, sz<zμ(z,w)psy,z, and fy=vfsy+vpsy,sw−py,sw. Since s(sy)=y<sy<sw, Step 2.1 gives fsy∈vZ[v]; the other two coefficients are also in vZ[v]. Therefore fy∈vZ[v].

4.1F2F3step 1.1step 2.1step 3.1algebra

Conclude the left-ascent formula. Both AsH‾w and Cw are bar-invariant, since the μ coefficients are integers by [F3]. Thus Dw is bar-invariant. By steps 1.1–3.1 it is a sum of lower standard basis elements with coefficients in vZ[v]. Adding Dw to H‾sw would give another bar-invariant element in Hsw+∑y<swvZ[v]Hy; uniqueness in [F2] forces Dw=0. This proves the formula when sw>w.

5.1F1F2F3step 4.1algebra

Left descents. Suppose sw<w and put w′:=sw. The ascent case for w′ gives H‾sH‾w′=H‾w+∑z:sz<z<w′μ(z,w′)H‾z. The quadratic relation gives (Hs−v−1)H‾s=0. Apply Hs−v−1 to this equality. Every z in the sum has z<w′<w, so induction gives (Hs−v−1)H‾z=0. Thus (Hs−v−1)H‾w=0, and H‾sH‾w=(Hs+v)H‾w=(v+v−1)H‾w. This also covers H‾s2; the ascent sum is empty for w=id and for the stated length-at-most-one case.

6.1F2F3F4F5step 4.1step 5.1algebra∎

Right multiplication. Apply the left formulas to w−1 and then apply ♭. By [F5] it reverses the product and fixes H‾s; by inverse-index symmetry in [F2], it sends H‾w−1 to H‾w. Bruhat inversion sends sz<z<w−1 to zs−1<z−1<w, and s−1=s; the coefficient is unchanged because pz−1,w−1=pz,w and μ is the coefficient of v in that coefficient. This yields the asserted right formulas. The proof uses only finite Bruhat intervals and no choice principle.

Remarks

The argument uses the locally proved triangular basis and degree clauses of Existence and uniqueness of the Kazhdan–Lusztig basis, and the coefficient-of-v definition of μ. Coefficientwise positivity is not required.

Depends on

Used by

Dependency tree · two levels

15 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