Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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 bases of S2 and S3

Facts & Assumptions

Given: The one-based permutation groups S2,S3, with composition as functions; left si swaps values i,i+1. Write α=v−v−1 and Cw=H‾w.

[F1]

The standard elements form a basis, Hsi2=1−αHsi, and the normalized bar assignment sends Hsi to Hsi+α (The normalized type-A Hecke algebra and its bar involution).

[F2]

The bar assignment descends to a multiplicative semilinear involution of the quotient Hecke algebra (The Hecke bar involution is well defined).

[F3]

A bar-fixed element in Hw+∑y<wvZ[v]Hy is uniquely Cw=H‾w, and these elements form a basis (Existence and uniqueness of the Kazhdan–Lusztig basis).

[F4]

The coefficients satisfy py,w=vℓ(w)−ℓ(y)Py,w(v−2) and μ(y,w)=[v]py,w (Kazhdan–Lusztig polynomials in the classical q-normalization).

[F5]

Multiplication by Cs is the descent scalar or the ascent sum with lower s-descent terms (Multiplication by a generator in the Kazhdan–Lusztig basis).

[F6]

Bruhat order has the reduced-subword characterization and is graded by inversion length (Basic properties of the Bruhat order on Sn).

[F7]

The R-coefficient ry,w is the coefficient of Hy in the standard-basis expansion of Hw‾ (Bruhat intervals and the R-coefficients).

Example

Work in the normalization of The normalized type-A Hecke algebra and its bar involution, write permutations in one-line notation, and put q=v−2 as in Kazhdan–Lusztig polynomials in the classical q-normalization. (a) In S2: rid,21=v−v−1, H‾id=Hid, H‾21=H21+vHid, Pid,21(q)=1, μ(id,21)=1 and H‾212=(v+v−1)H‾21. (b) In S3 the bar images of the standard basis are H132‾=H132+(v−v−1)H123,H213‾=H213+(v−v−1)H123, H231‾=H231+(v−v−1)(H132+H213)+(v2−2+v−2)H123, H312‾=H312+(v−v−1)(H132+H213)+(v2−2+v−2)H123, H321‾=H321+(v−v−1)(H231+H312)+(v2−2+v−2)(H132+H213)+(v3−2v+2v−1−v−3)H123, the Kazhdan–Lusztig basis is H‾123=H123,H‾132=H132+vH123,H‾213=H213+vH123, H‾231=H231+v(H132+H213)+v2H123,H‾312=H312+v(H132+H213)+v2H123, H‾321=H321+v(H231+H312)+v2(H132+H213)+v3H123, all Py,w(q) with y≤w equal 1, and μ(y,w)=1 exactly when y⋖w is a cover of the Bruhat order on S3 (the eight covers (123,132), (123,213), (132,231), (132,312), (213,231), (213,312), (231,321), (312,321) in one-line notation). (c) Multiplication checks: H‾212=(v+v−1)H‾21 and, in the case sw>w with one μ-edge, H‾132H‾231=H‾321+H‾132 (here s2⋅231=321 and s2⋅132=123<132, so the sum in Multiplication by a generator in the Kazhdan–Lusztig basis has the single term μ(132,231)=1).

Verification

1.1F1F2F3F4F7algebra

Rank one. By [F1, F2], H21‾=H21+α and Hid‾=Hid; by [F7], this gives rid,21=α=v−v−1. Since α+v−1=v, C:=H21+vHid is bar-fixed. It is triangular below H21, so uniqueness [F3] gives C21=C and Cid=Hid. From H212=1−αH21 in [F1], C212=(H21+v)2=1+(v+v−1)H21+v2=(v+v−1)(H21+v). Its off-diagonal coefficient is pid,21=v, so [F4] gives Pid,21=1 and μ(id,21)=1.

1.2F1F2algebra

Every bar image in S3. Put X=H213 and Y=H132. The reduced words give H231=XY, H312=YX and H321=YXY. By [F1, F2], their bar images are computed by expanding (X+α)(Y+α) and its reverse for the two length-two images, and (Y+α)(X+α)(Y+α) for the length-three word, replacing Y2 by 1−αY. The latter gives H321+α(H231+H312)+α2(X+Y)+(α3+α)H123. Since α2=v2−2+v−2 and α3+α=v3−2v+2v−1−v−3, these are exactly all the displayed bar images. Multiplicativity computes the images directly; it does not assert that Hw‾ itself is bar-fixed.

1.3F1F2F3F6algebra

The six KL elements. Put A=X+v and B=Y+v. By [F1, F2], both are bar-fixed, and AB=H231+v(H213+H132)+v2H123,BA=H312+v(H132+H213)+v2H123. A direct expansion gives BAB=H321+v(H231+H312)+v2H213+(1+v2)H132+(v+v3)H123, so subtracting B=H132+vH123 gives exactly the displayed C321. Each of 1,A,B,AB,BA,BAB−B is bar-fixed and has top coefficient 1 with lower coefficients in vZ[v]; all lower indices are below its top by [F6]. Thus uniqueness [F3] identifies all six elements.

2.1F4F6step 1.3algebra

Polynomials and covers. Reading the expansions in step 1.3 gives py,w=vℓ(w)−ℓ(y) for every y≤w, so [F4] gives Py,w=1 and μ(y,w)=[v]py,w is 1 exactly at length difference one. By the reduced-subword criterion [F6], the Bruhat ranks in S3 are {123}, {132,213}, {231,312}, and {321}, and each element in one of these layers is below every element in the next layer. Hence the covers are precisely the two edges from 123, the four edges from rank one to rank two, and the two edges into 321; these are exactly the eight pairs listed. Grading rules out other covers.

3.1F5F6step 1.1step 2.1algebra∎

The ascent multiplication check. The subword criterion [F6] gives [id,231]={123,132,213,231}. Left s2 sends 231 to 321, whereas it sends 132 to 123 and 213 to 312; thus among the strict lower indices only 132 has a left s2-descent. Step 2.1 gives μ(132,231)=1, so [F5] yields C132C231=C321+C132. For comparison, left s1 sends 231 to 132<231, and the descent formula gives C213C231=(v+v−1)C231. The rank-one square was already proved in step 1.1.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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