Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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 R- and Kazhdan–Lusztig recursions on a small singular interval

Facts & Assumptions

Given: One-based S4, b=1324=s2, w=3412=s2s1s3s2, and q=v−2. Put α=v−v−1.

[F1]

Bruhat order is graded by inversion length, has the reduced-subword characterization and prefix-rank criterion, and satisfies the lifting implication: if y≤z, sy>y, and sz<z, then y≤sz (Basic properties of the Bruhat order on Sn).

[F2]

The R-coefficient ry,z is defined as the coefficient of Hy in Hz‾ (Bruhat intervals and the R-coefficients).

[F3]

Py,z has constant term 1 on comparable pairs, degree at most (ℓ(z)−ℓ(y)−1)/2 for y<z, and py,z=vℓ(z)−ℓ(y)Py,z(v−2); μ vanishes for even length differences (Kazhdan–Lusztig polynomials in the classical q-normalization).

[F4]

The KL left descent recursion uses c=1 when sy<y, with correction indices y≤u≤sz having su<u and μ(u,sz)≠0 (The Kazhdan–Lusztig polynomial descent recursion).

[F5]

The chain-defined inverse coefficients satisfy qx,z′=−∑x≤u<zqx,u′pu,z for x<z, with diagonal 1; their matrix is the two-sided inverse of (px,z) (Inverse Kazhdan–Lusztig polynomials, The Kazhdan–Lusztig inversion formula).

[F9]

The R-coefficients vanish unless y≤z, have diagonal rz,z=1, obey the left descent recursion, and have leading and trailing terms vℓ(z)−ℓ(y) and sgn⁡(y)sgn⁡(z)v−(ℓ(z)−ℓ(y)) on comparable pairs (The R-coefficient recursion, support, degree bounds and inversion).

Example

In S4, written in one-line notation, let b:=s2=1324 and w:=s2s1s3s2=3412 (a reduced word of length 4; the two middle generators commute). (a) The interval [b,w] has exactly ten elements: 1324; 1342,1423,2314,3124; 1432,2413,3142,3214; and 3412. (b) For comparable pairs in this interval the only Kazhdan–Lusztig polynomial different from 1 is Pb,w(q)=1+q; so μ(b,w)=1, and (b,w) is a μ-pair with ℓ(w)−ℓ(b)=3>1: μ-pairs need not be covers. All other μ-pairs inside the interval are covers, and all ry,z for y,z∈[b,w] are the corresponding Laurent polynomials read off from The R-coefficient recursion, support, degree bounds and inversion. (c) The descent recursion of The Kazhdan–Lusztig polynomial descent recursion at y=b, w and s=s2 (a left descent of w, with sw=2413 and sb=1234=id, so c=1) reads Pb,w(q)=Pid,2413(q)+qPb,2413(q)− ⁣ ⁣ ⁣∑b≤z≤2413s2z<z, μ(z,2413)≠0 ⁣ ⁣ ⁣μ(z,2413) q(4−ℓ(z))/2Pb,z(q); the sum is empty because [b,2413]={1324,1423,2314,2413} and its only element with s2z<z is 1324, for which μ(1324,2413)=0; since Pid,2413=Pb,2413=1, the recursion returns Pb,w=1+q, in agreement with (b). (d) The inverse Kazhdan–Lusztig polynomial of Inverse Kazhdan–Lusztig polynomials is qb,w′=−v−v3, while qb,1342′=qb,1423′=qb,2314′=qb,3124′=−v and qb,1432′=qb,2413′=qb,3142′=qb,3214′=v2; the matrix identity ∑zqx,z′pz,w=δx,w of The Kazhdan–Lusztig inversion formula holds on the ten-point interval. In particular the inverse coefficients are not all nonnegative even though all py,z are.

Verification

1.1F1algebra

The full interval. The displayed word for w has inversion length 4, so it is reduced. Its reduced subwords of lengths 0,1,2,3,4 give respectively 1234; 1324,2134,1243; 1342,1423,2314,3124,2143; 1432,2413,3142,3214; and 3412. The four excluded elements 1234,2134,1243,2143 have no reduced subword s2, so they are not above b; the other ten are. For an explicit order check, write a=1342=s2s3, c=1423=s3s2, d=2314=s1s2, f=3124=s2s1, and A=1432=s2s3s2, C=2413=s1s3s2, D=3142=s2s1s3, F=3214=s2s1s2. The reduced-subword criterion gives the intermediate covers a<A,D; c<A,C; d<C,F; f<D,F; each rank-two element is also above b=s2, and each rank-three element is below w. These are all cover incidences between adjacent ranks, so all other comparisons are their transitive consequences.

2.1F1F3step 1.1algebra

The correction interval. Left s2 gives s2w=2413 and s2b=1234. Step 1.1 gives [b,2413]={b,1423,2314,2413}. Their left s2 products are respectively 1234,1432,3214,3412, of lengths 0,3,3,4, whereas the original lengths are 1,2,2,3. Thus only b has that descent, and μ(b,2413)=0 by its even length gap. In particular 1342 is excluded: R1342(3,2)=1<2=R2413(3,2).

2.2F1F2F9step 1.1algebra

All the R-coefficients. By [F9], noncomparable pairs have ry,z=0, diagonal entries are 1, and every comparable coefficient is nonzero because its leading term is vℓ(z)−ℓ(y). For a cover, the degree range and parity in [F9] leave only the terms v and −v−1, so ry,z=α. For a comparable pair of gap two, induct on ℓ(y) and choose a left descent s of z. If sy<y, the recursion gives ry,z=rsy,sz; this coefficient is nonzero, so [F9] implies sy≤sz, and induction gives ry,z=α2. If sy>y, then rsy,sz=0: its indices have equal length, and equality would force y=z. By the lifting implication in [F1], y≤sz, so the other recursion term is αry,sz=α2. Thus every gap-two pair in S4 has coefficient α2. The only gap-three pair in [b,w] is (b,w). Since s2 is a left descent of both, rb,w=r1234,2413. For 2413, s1 is a left descent, so r1234,2413=r2134,1423+αr1234,1423. The first term is zero because 1423=s3s2 has no reduced subword s1; the second is α⋅α2. Hence rb,w=α3=v3−3v+3v−1−v−3. This determines every coefficient for pairs in the displayed interval.

3.1F1F3F4step 1.1step 2.1algebra

The sole nonconstant polynomial. By [F3], all comparable pairs of gap at most two have P=1, so the only possibly nonconstant pair within the interval is (b,w). To evaluate P1234,2413, apply [F4] with left s1 to 2413=s1s3s2, obtaining lower top s3s2=1423. No element below 1423 has left s1-descent: its subwords are 1234,1243,1324,1423, with no inversion between the values 1,2. Also s1≰1423. Hence P1234,2413=qP2134,1423+P1234,1423=0+1. Now use [F4] at (b,w,s2): step 2.1 makes its correction sum empty, c=1, and Pb,2413=1, so Pb,w=1+q. Therefore pb,w=v3+v and μ(b,w)=1. Every other comparable distinct pair has py,z=vℓ(z)−ℓ(y), so its nonzero μ occurs exactly on covers.

4.1F1F3F5step 1.1step 3.1algebra∎

Inverse entries and both matrix products. Step 3.1 gives diagonal p=1, cover entries v, and gap-two entries v2. Each gap-two interval in step 1.1 has two intermediate elements. Thus [F5] gives inverse entries 1,−v,v2 at gaps 0,1,2. At the sole gap-three pair there are four elements at each intermediate rank, so qb,w′=−(v3+v)−4(−v)v2−4v2v=−v3−v. This gives every entry of the inverse matrix, including every displayed value in part (d). For Q′P, the off-diagonal entries at gaps one and two are −v+v=0 and v2−2v2+v2=0; at gap three the entry is (v3+v)−4v3+4v3−(v3+v)=0. For PQ′, these entries are v−v=0, v2−2v2+v2=0, and −(v3+v)+4v3−4v3+(v3+v)=0. Diagonal entries are 1 and noncomparable entries are zero by support, so both matrix products are the identity. Although all p-entries in this finite example are nonnegative, its cover inverse entries and qb,w′ are negative. Every calculation is finite and uses no choice principle.

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