Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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 type-A Kazhdan–Lusztig basis has elementary triangular bar properties

Statement

For each w∈Sn there is a unique element H‾w∈Hv(n) with (i) H‾w‾=H‾w and (ii) H‾w∈Hw+∑y<wvZ[v] Hy (the sum over the lower Bruhat ideal of w). The elements {H‾w}w∈Sn form an A-basis of Hv(n), and writing H‾w=∑y≤wpy,wHy one has pw,w=1, py,w=0 unless y≤w, py,w∈vZ[v] for y<w, the bar-duality px,w=∑yrx,y py,w‾ (matrix form P=RPˉ), and the symmetry py−1,w−1=py,w. Moreover for y<w, with d=ℓ(w)−ℓ(y): py,w=vd+terms of strictly smaller degree and py,w∈vd Z[v−2]; every py,w has integer coefficients and fixed parity d mod 2.

Facts & Assumptions

Given: n≥1, the normalized Hecke algebra Hv(n), its bar involution, and the Laurent coefficients rx,y of the bar images in the standard basis.

[F1]

The standard elements Hy form an A=Z[v±1]-basis of Hv(n) (The normalized type-A Hecke algebra and its bar involution, The standard basis of the generic type-A Hecke algebra).

[F2]

The bar is a semilinear algebra involution with v‾=v−1 (The Hecke bar involution is well defined).

[F3]

The coefficients satisfy rx,y=0 unless x≤y, ry,y=1, and both matrix identities RRˉ=RˉR=I; for x≤y, their degree bounds, parity, and top coefficient are as stated in the R-coefficient theorem (The R-coefficient recursion, support, degree bounds and inversion).

[F4]

The A-linear anti-automorphism ♭ commutes with bar and sends Hy to Hy−1 (Reversal anti-involution commutes with the Hecke bar).

[F5]

Bruhat order on Sn is a finite graded order, strict inequalities raise length, and inversion preserves the order (Basic properties of the Bruhat order on Sn).

Proof

technique · construct the triangular bar-fixed element by descending induction in the finite Bruhat order, then use its uniqueness and coefficient comparison
1.1F2F3F5algebra

Construct the coefficients. Fix w and descend on d=ℓ(w)−ℓ(x) over the finite lower Bruhat ideal {x:x≤w}, starting with pw,w=1. Suppose x<w and py,w has been constructed for every x<y≤w, satisfying py,w=∑y≤z≤wry,zpz,w‾. Put ax:=∑x<y≤wrx,ypy,w‾. Then ax‾=∑x<y≤wrx,y‾py,w=∑x<y≤z≤wrx,y‾ry,zpz,w‾=−∑x<z≤wrx,zpz,w‾=−ax. The second equality uses the induction equations; for x<z, the identity RˉR=I makes the sum over x≤y≤z zero, and its omitted diagonal term is rx,x‾rx,z=rx,z. Write ax=∑m∈Zγmvm. Anti-invariance gives γ−m=−γm and γ0=0. Define px,w:=∑m>0γmvm. Then px,w∈vZ[v] and px,w−px,w‾=ax. The induction is finite and uses no choice principle.

2.1F1F2F3F5step 1.1algebra

Bar invariance and the coefficient equations. Set H‾w:=∑y≤wpy,wHy. The coefficient of Hx in H‾w‾ is ∑x≤y≤wrx,ypy,w‾. For x=w this is 1; for x<w it is px,w‾+ax=px,w by step 1.1. If x≰w, no y≤w can satisfy x≤y, so support from [F3] gives coefficient zero. Thus H‾w‾=H‾w and px,w=∑x≤y≤wrx,ypy,w‾, which is the bar-duality formula.

3.1F1F2F3step 2.1algebra

Uniqueness. If two bar-invariant elements satisfy the triangular condition, their difference is a bar-fixed sum h=∑y<wcyHy with each cy∈vZ[v]. If h≠0, choose a Bruhat-maximal x in its finite support. The coefficient of Hx in h‾ is cx‾: no supported y>x contributes, and support of rx,y requires x≤y. Since h=h‾, cx=cx‾; but vZ[v] and v−1Z[v−1] intersect only in 0, a contradiction. Thus the element is unique. The construction also gives pw,w=1 and py,w=0 unless y≤w.

3.2F1F5step 2.1algebra

Basis. The transition from (Hw) to (H‾w) is unitriangular on the finite Bruhat poset: each H‾w=Hw+∑y<wpy,wHy. A finite unitriangular matrix over A is invertible, so (H‾w)w∈Sn is an A-basis.

3.3F3step 1.1step 2.1algebra

Degree, leading term, and parity. Induct on d=ℓ(w)−ℓ(x), with pw,w=1. For x<w, the equation in step 1.1 has ax=∑x<y≤wrx,ypy,w‾. By [F3] and induction, every term has exponents congruent to d modulo 2. The term y=w is rx,w, whose highest term is vd with coefficient 1. For each y<w, put d1=ℓ(y)−ℓ(x) and d2=ℓ(w)−ℓ(y)≥1, so d1+d2=d; the highest degree of rx,ypy,w‾ is at most d1−1≤d−2, since py,w∈vZ[v]. Therefore ax has highest term vd with coefficient 1 and only exponents of parity d. As px,w is its positive-degree part by step 1.1, it follows that px,w=vd+ terms of strictly smaller degree and px,w∈vdZ[v−2]. This proves the degree and parity clauses.

4.1F4F5step 3.1algebra∎

Inverse-index symmetry. By [F4], ♭(H‾w) is bar-fixed. By [F5], inversion preserves Bruhat order, so this element has the form Hw−1+∑y<wpy,wHy−1 with lower terms in vZ[v]. Uniqueness from step 3.1 gives ♭(H‾w)=H‾w−1. Comparing coefficients yields py−1,w−1=py,w.

Remarks

The triangular coefficients, degree bounds, parity and basis identities are proved here without coefficientwise positivity. The later local Soergel character and filtration-multiplicity argument proves positivity for these same uniquely normalized elements.

Depends on

Used by

Dependency tree · two levels

14 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