Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Existence and uniqueness of the parabolic Kazhdan–Lusztig bases

Statement

Retain the notation of The parabolic Hecke module and the antispherical standard basis and Standard bases, right actions and bar involutions on the parabolic Hecke modules. For every x∈JW there is a unique Cx∈MJ and a unique Dx∈NJ with (i) Cx‾=Cx and Dx‾=Dx, and (ii) Cx∈mx+∑y<xvZ[v] my and Dx∈nx+∑y<xvZ[v] ny, the sums over the lower Bruhat ideal of x inside JW. The sets {Cx}x∈JW and {Dx}x∈JW are A-bases of MJ and NJ. No coefficientwise positivity is asserted.

Facts & Assumptions

Given: The modules MJ,NJ with their standard bases {mx},{nx} indexed by JW, and the bar involutions of Standard bases, right actions and bar involutions on the parabolic Hecke modules; A=Z[v±1].

[F1]

{mx:x∈JW} and {nx:x∈JW} are A-bases of MJ and NJ (Standard bases, right actions and bar involutions on the parabolic Hecke modules (1)).

[F2]

The bar is an A-antilinear involution with my‾=my+∑x<yax,ymx and ny‾=ny+∑x<ybx,ynx, where the sums range over the lower Bruhat ideal of y inside JW and ax,y,bx,y∈A (Standard bases, right actions and bar involutions on the parabolic Hecke modules (3)).

[F3]

Bruhat order on Sn is a finite graded partial order: y<x implies ℓ(y)<ℓ(x), and lower ideals are finite, so the sets {y∈JW:y≤x} are finite and admit induction on length (The Bruhat order on Sn by rank inequalities, Basic properties of the Bruhat order on Sn (b),(e)).

[F4]

A=Z[v±1] and vZ[v]∩v−1Z[v−1]={0} (The normalized type-A Hecke algebra and its bar involution).

[F5]

The ordinary Kazhdan--Lusztig triangular construction over a finite Bruhat ideal, with bar-duality matrix R satisfying RˉR=I, diagonal one and lower-triangular support, produces the unique bar-fixed elements with the prescribed triangular support and shows they form a basis (Existence and uniqueness of the Kazhdan–Lusztig basis, step 1.1 of its proof).

Proof

technique · direct: run the triangular bar-fixed induction of [Existence and uniqueness of the Kazhdan–Lusztig basis](/item/thm-existence-and-uniqueness-of-the-kazhdan-lusztig-basis) over the finite lower Bruhat ideal inside ${}^JW$, for the two modules simultaneously
1.1F1F2algebra

The coefficient matrices. Define rx,y∈A for x,y∈JW by my‾=∑x≤yrx,ymx, so rx,y=ax,y for x<y, ry,y=1, and rx,y=0 when x≰y; define sx,y analogously from ny‾=∑x≤ysx,ynx. Applying bar to my‾=∑x≤yrx,ymx and using my‾‾=my gives my=∑x≤yrx,y‾ mx‾=∑x′≤y(∑x:x′≤x≤yrx,y‾rx′,x)mx′; by [F1] the coefficient of mx′ is δx′,y, that is, RRˉ=I for the unitriangular matrix R=(rx,y). A finite unitriangular matrix is invertible, so also RˉR=I; the same identities hold for S=(sx,y).

2.1F1F2F4F5step 1.1algebra

Construction of the coefficients. Fix w∈JW and increase d=ℓ(w)−ℓ(x) over the finite lower ideal Iw={x∈JW:x≤w} of [F3], starting with cw,w=1. Suppose x<w and cy,w has been constructed for every y∈Iw with x<y≤w, satisfying cy,w=∑y≤z≤wry,zcz,w‾; note that all cited labels lie in Iw. Put ax:=∑x<y≤wrx,ycy,w‾. Then ax‾=∑x<y≤wrx,y‾cy,w=∑x<y≤z≤wrx,y‾ry,zcz,w‾=−∑x<z≤wrx,zcz,w‾=−ax, where the middle equality substitutes the induction equations and the third uses RˉR=I from step 1.1: the sum over x≤y≤z is zero for x<z, and its omitted diagonal term is rx,x‾rx,z=rx,z. Write ax=∑m∈Zγmvm; anti-invariance under v↦v−1 gives γ−m=−γm, hence γ0=0. Define cx,w:=∑m>0γmvm, so cx,w∈vZ[v] and cx,w−cx,w‾=ax. The induction is finite and uses no choice principle.

3.1F1F2step 2.1algebra

Bar invariance and the coefficient equations. Set Cw:=∑y∈Iwcy,wmy. The coefficient of mx in Cw‾ is ∑x≤y≤wrx,ycy,w‾. For x=w this is cw,w‾=1=cw,w; for x<w it is cx,w‾+ax=cx,w by step 2.1, and for x∉Iw the support of rx,y makes the coefficient zero (x≤y≤w would put x∈Iw). Hence Cw‾=Cw and the coefficient equation cx,w=∑x≤y≤wrx,ycy,w‾ holds for every x≤w∈JW; this proves the existence, the bar invariance and the triangular support Cw∈mw+∑y<wvZ[v]my of (i),(ii). Repeating the identical construction with the matrix S in place of R produces Dw∈nw+∑y<wvZ[v]ny with Dw‾=Dw.

4.1F1F4step 3.1algebra

Uniqueness. Suppose h=∑y<wcymy∈MJ is bar-fixed with every cy∈vZ[v]. If h≠0, choose a Bruhat-maximal x in its finite support Iw∖{w}. The coefficient of mx in h‾ is cx‾: no y>x is supported, and rx,y≠0 requires x≤y. Since h=h‾ and the my are independent, cx=cx‾; but bar maps vZ[v] into v−1Z[v−1], so the common value lies in vZ[v]∩v−1Z[v−1]={0} by [F4], a contradiction. Hence h=0: the bar-fixed element with the prescribed triangular support is unique, and likewise in NJ.

5.1F1step 3.1step 4.1algebra∎

Bases. The transition from (mx)x∈JW to (Cx)x∈JW is unitriangular over the finite Bruhat order (each Cx=mx+∑y<xcy,xmy), so it is invertible over A; hence {Cx} is an A-basis of MJ. The same holds for {Dx} in NJ. This proves the theorem for both modules.

Remarks

The construction is the ordinary Kazhdan--Lusztig triangular induction run over the finite poset (JW,≤) with the induced bar-duality matrix; the only inputs are the bar involution, the top coefficient one of the induced bar, and the lower-triangular support. Only the listed facts, hence no coefficientwise positivity, degree or parity statement, enter; those are not asserted here.

Depends on

Used by

Dependency tree · two levels

20 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