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

Minimal positive Rouquier complexes are linear under the lower Soergel induction

Facts & Assumptions

Given: A symmetric group Sn with simple reflections si, the real type-A Soergel category of The real type-A Soergel category by scalar extension with its normalized indecomposables BwR and balanced tensor products; the positive Rouquier generator complexes Fs=[BsR→S(1)] with inverses Fs−1=[S(−1)→BsR] (The positive and negative Rouquier generator complexes) and the Rouquier complex Fx‾ of a word (The Rouquier complex of a braid word); an element x∈Sn with a fixed reduced expression x‾=s1⋯sm of length m=ℓ(x), the minimal subcomplex Fx⊆⊕Fs1⋯Fsm (Minimal complexes and the perverse truncations in the real type-A Soergel category), and the hypothesis S(y) for every y≤x.

[F1]

Fs is invertible in Kb with two-sided homotopy inverse Fs−1, so tensoring with Fs is an equivalence of Kb; the normalized indecomposable BwR is indecomposable and End⁡0(BwR) is a finite-dimensional local R-algebra; for a reduced word the Rouquier complex is well defined up to canonical homotopy equivalence and all its terms are finite free on both sides; if x=ys with ℓ(x)=ℓ(y)+1 then FyFs is a Rouquier complex for x (Opposite Rouquier generator complexes are homotopy inverse, The Rouquier complex is well defined up to canonical homotopy equivalence, Indecomposable labels, characters and filtration ranks agree after real scalar extension, The Rouquier complex of a braid word).

[F2]

If xs>x and S(y) holds for all y<xs, then BxBs=Bxs⊕⨁y<xsByay with ay∈Z≥0 and no internal shifts, the top summand Bxs occurring with multiplicity one; if xs<x and S(x) holds then BxBs=Bx(1)⊕Bx(−1); and End⁡0(BwR)=R for every w with S(w) (Indecomposable labels, characters and filtration ranks agree after real scalar extension).

[F3]

The locally proved support character is additive and has ch⁡(M(d))=vdch⁡(M); its right generator recursion is ch⁡(MBs)=ch⁡(M)H‾s (The type-A character recursion under simple Soergel tensoring). Top-support classification gives the unique unshifted Bx summand of a reduced word for x. A positive word-complex term in cohomological degree i>0 is a sum of words obtained by omitting i letters, hence has no x graph (Indecomposable type-A Soergel bimodules are classified by their normalized top support, The Rouquier complex of a braid word).

[F4]

The standard basis {Hw} and the Kazhdan-Lusztig basis {H‾w} are Z[v±1]-bases of the Hecke algebra of The normalized type-A Hecke algebra and its bar involution; right multiplication by a generator is HwHs=Hws when ℓ(ws)=ℓ(w)+1 and HwHs=Hws+(v−1−v)Hw when ℓ(ws)<ℓ(w); the expansion H‾w=∑y≤why,wHy has hw,w=1, hy,w=0 unless y≤w, and hy,w∈vℓ(w)−ℓ(y)Z[v−2], so that every monomial vd occurring in hy,w satisfies d≡ℓ(w)−ℓ(y)(mod2) and hy,w∈vZ[v] for y<w (The type-A Kazhdan–Lusztig basis has elementary triangular bar properties, Kazhdan–Lusztig polynomials in the classical q-normalization).

[F5]

Perverse bimodules are those whose character is a nonnegative integer combination of the H‾w; p-split bimodules are the finite direct sums of internal shifts of perverse bimodules; summands of perverse (resp. p-split) bimodules are perverse (resp. p-split); a minimal complex lies in pK≥0b (resp. pK≤0b) if and only if every indecomposable summand Bw(k) in cohomological degree i satisfies k≤i (resp. k≥i); both classes are closed under extensions in distinguished triangles; and the positive Rouquier complexes are Δ-split, with Γ≥yFx/Γ>yFx≅Δx for y=x and 0 for y≠x in the homotopy category of graded bimodules (Minimal complexes and the perverse truncations in the real type-A Soergel category, Radical quotients, minimal complexes and perverse filtrations in the Soergel category, Positive Rouquier complexes are Delta-split).

[F6]

Under S(z) and S(u) the graded rank of Hom⁡(BzR,BuR) is the trace-form value (H‾z,H‾u), which lies in vZ[v] for z≠u and in 1+vZ[v] for z=u; hence Hom⁡0(BzR,BuR)=0 for z≠u, Hom⁡0(BzR,BzR)=R, and every nonzero degree-zero endomorphism of BzR is an isomorphism (The type-A Soergel Hom formula, The Hecke trace form, its values on the Kazhdan-Lusztig basis, and the standard pairing).

Statement

Assume S(y) for all y≤x, and let Fx be a minimal Rouquier complex of a reduced expression of x. Then:

(1) 0Fx≅BxR;

(2) for every i≥1, iFx≅⨁z<xBzR(i)mz,i with mz,i∈Z≥0, so that Fx lies in pK≤0b∩pK≥0b and is linear: every indecomposable summand of iFx carries the internal shift exactly i;

(3) the multiplicities satisfy the parity vanishing mz,i=0 unless i≡ℓ(x)−ℓ(z)(mod2), and consequently, writing the standard basis element as Hx=∑z≤xgz,xH‾z (the inverse Kazhdan-Lusztig coefficients), one has gx,x=1, gz,x=∑i(−1)imz,ivi, and (−1)ℓ(x)−ℓ(z)gz,x∈Z≥0[v±1].

The statement is conditional exactly on S(y) for y≤x; it uses neither S(x′) for x′>x nor the final character theorem, and it is the induction step of the simultaneous induction.

Proof

technique · induction on the length; the perverse lower bound is propagated through the stupid filtration, the upper bound and the labels through the shift-propagation lemma, and the coefficients through inversion of the unitriangular Kazhdan-Lusztig transition matrix
1.1givenF1F3F5

Base of the induction. [base] For x=e the Rouquier complex is the unit S concentrated in cohomological degree 0, so 0Fe=S=Be, there is no term of index i≥1, both perverse bounds hold trivially, and the only nonzero inverse coefficient is ge,e=1; for x=si the complex Fsi=[BsiR→S(1)] has 0Fsi=Bsi and 1Fsi=S(1)=BeR(1) and no other term, so me,1=1 with ℓ(si)−ℓ(e)=1≡1(mod2), Bsi is perverse by S(si) and S(1) is the shift of the perverse unit, so Fsi∈pK≥0b∩pK≤0b and gsi,si=1, ge,si=−v.

2.1givenstep 1.1F1

Induction hypothesis and the last letter. [ih] Fix x≠e, write x‾=s1⋯sm with m≥1 and put y=s1⋯sm−1, s=sm, so that x=ys with ℓ(x)=ℓ(y)+1; the hypothesis S(≤x) contains S(≤y), and we assume the three assertions of the statement for y: 0Fy=By, iFy=⨁z<yBz(i)mz,iy for i≥1, and Fy∈pK≥0b∩pK≤0b. By [F1], Fx≅FyFs in Kb.

3.1step 2.1F1F2F6

Descent contraction. Let z and a simple reflection s satisfy zs<z and S(z); then BzFs≅Bz(−1) in Kb. Indeed, by [F2] the two-term complex BzFs has terms BzBs=Bz(1)⊕Bz(−1) in degree 0 and Bz(1) in degree 1, with differential d=(δ,η) where δ∈End⁡0(Bz(1))=End⁡0(Bz)=R by [F2] and [F6]. If δ=0 then BzFs is the direct sum of the two nonzero complexes [Bz(1)→0] and [Bz(−1)→ η Bz(1)], contradicting the indecomposability of BzFs, which is the image of the indecomposable Bz under the equivalence −⊗Fs; hence δ≠0 is an isomorphism, homological Gaussian elimination cancels the contractible two-term complex Bz(1)≅Bz(1), and the remainder is Bz(−1) concentrated in degree 0.

3.2step 2.1F1F3F4

Top support and the Euler character. Every positive-degree term of the word complex omits at least one letter, so no such term has the x graph by [F3]. The degree-zero term is its reduced word, whose top summand is exactly Bx unshifted and once. Gaussian minimalization cannot remove it, since no target term has its label. Thus in the minimal complex mx,00=1 and every other mx,ki is zero, by actual support rather than alternating cancellation. Character additivity makes its Euler character unchanged by removing a contractible pair. The generator recursion and shift rule in [F3] give ch⁡(FzFs)=ch⁡(Fz)(H‾s−v) degree by degree. Iterating along the reduced word therefore gives Euler character Hx. Under the stated S(≤x), expanding each actual summand character in the KL basis yields ∑i,k(−1)imw,kivk=gw,x. This equality is used only for the Euler coefficients, after the support proof of the top multiplicity.

4.1step 3.1F2F5

Ascent perverse bound. Let z≤y and a simple reflection s satisfy zs>z; then BzFs∈pK≥0b. Indeed, S(u) holds for every u<zs, because u<zs≤x implies u<x; so [F2] gives the unshifted decomposition BzBs=Bzs⊕⨁u<zsBuau, whose summands are perverse by S(zs) and S(u), while the second term Bz(1) of BzFs=[BzBs→Bz(1)] is the internal shift of the perverse Bz sitting in cohomological degree 1; thus the chosen representative has p-split terms and satisfies τ<0(BzBs)=0 and τ<−1(Bz(1))=0, which is membership in pK≥0b by [F5].

4.2step 3.2F2F4F5F6

Shift propagation. Assume S(≤x) and let Fx be minimal. If iFx contains a summand Bz(j) with z<x, then i−1Fx contains a summand Bz′(j′) with z′>z and j′<j. First, components of the differential into summands of shift k<j vanish: a degree-zero map Bz(j)→Bu(k) is an element of Hom⁡k−j(Bz,Bu), which is zero for k<j since the graded Hom space has no negative-degree part by [F6]; components with k=j are zero for u≠z by [F6] and are scalars for u=z, and a nonzero scalar component would make Bz(j) a contractible summand of the minimal complex, so all such components vanish as well; hence d(Bz(j)) lies in the sum of the summands of i+1Fx with shift k>j. Second, if a summand Bu(k) of i−1Fx maps nontrivially to Bz(j), then k<j: a degree-zero map Bu(k)→Bz(j) lies in Hom⁡j−k(Bu,Bz), which vanishes for j<k, and for j=k it vanishes for u≠z and is a scalar for u=z, the nonzero case again being excluded by minimality. Third, apply the support cutoff Γ≥z/>z and reduce its free graph modules modulo R+. Since z<x, its complex is contractible by [F5], hence this reduced finite-dimensional complex is exact. The chosen top layer Δz(j) of Bz(j) is a nonzero homogeneous basis vector. Every outgoing target has shift k>j, and its z layer has shift k+d with d≥0 by KL triangularity. A map from the chosen generator into it consequently has positive-degree coefficient, so vanishes after reduction. The chosen vector is a cycle and must therefore be an incoming boundary. Some incoming component has a nonzero constant coefficient onto it, so some Bz′(j′) in degree i−1 has a z layer with j′+d=j. The underlying differential component is nonzero, and the preceding Hom estimate gives j′<j. Since d=0 for label z itself, this requires z′>z. This proves shift propagation without using an Euler identity to recover multiplicities.

5.1step 4.1step 2.1F1F5ih

The perverse lower bound for Fx. Use the stupid filtration w≥kFy of the minimal complex Fy, with distinguished triangles w≥k+1Fy→w≥kFy→kFy[−k]→ and w≥ℓ(y)+1Fy=0; tensoring with the invertible Fs preserves distinguished triangles. We prove (w≥kFy)Fs∈pK≥0b by descending induction on k: for k=ℓ(y)+1 the object is 0; assume it for k+1. By [ih] and step 2.1, kFy is a direct sum of summands Bz(k) with z≤y (with z=y only for k=0), so (kFy)Fs[−k] is a direct sum of copies of (BzFs)(k)[−k]. If zs>z then BzFs∈pK≥0b by step 4.1, and its internal shift (k) and homological shift [−k] place every summand Bu(ℓ) occurring in cohomological degree i into degree i+k with internal shift ℓ+k≤i+k, so (BzFs)(k)[−k]∈pK≥0b; if zs<z then step 3.1 gives BzFs≅Bz(−1), so (BzFs)(k)[−k]≅Bz(k−1)[−k], a perverse object with internal shift k−1 in cohomological degree k, again in pK≥0b. Extension closure of pK≥0b in the tensored triangles gives (w≥kFy)Fs∈pK≥0b, and at k=0 we obtain FyFs∈pK≥0b; by step 2.1 this is Fx∈pK≥0b.

6.1step 4.2step 5.1F5

The top term and the perverse upper bound. If 0Fx contained a summand Bz(j) with z<x, then step 4.2 with i=0 would produce a summand of −1Fx=0, which is impossible; hence every summand of 0Fx has label x, and by step 3.2 (mx,00=1 and mx,k0=0 for k≠0) we get 0Fx=Bx, which proves (1). Now suppose i≥1 and iFx has a summand Bz(k) with k<i; if z=x this contradicts mx,ki=0 from step 3.2, so z<x, and step 4.2 produces a summand Bz′(k′) of i−1Fx with k′<k<i. This summand is again of the forbidden type: if z′=x then mx,k′i−1=0 whenever i−1≥1, while for i−1=0 it contradicts 0Fx=Bx because k′<0; otherwise z′<x and step 4.2 applies again. Iterating this descent in the homological degree we reach a summand of 0Fx with negative internal shift, contradicting 0Fx=Bx. Hence every summand of iFx has internal shift ≥i for i≥1, which together with Fx∈pK≥0b from step 5.1 gives Fx∈pK≤0b; since for i≥1 the label x does not occur by step 3.2, we obtain iFx=⨁z<xBz(i)mz,i with mz,i:=mz,ii, which is (2).

7.1step 6.1F4algebra

Inversion of the Kazhdan-Lusztig transition matrix. Let the two bases be related by H‾w=∑y≤why,wHy and Hw=∑y≤wgy,wH‾y as in [F4]; substituting the first expansion into the second gives ∑y≤z≤why,zgz,w=δy,w. Hence gw,w=1 and, for y<w, gy,w=−∑y<z≤why,zgz,w. We prove gy,w∈vℓ(w)−ℓ(y)Z[v−2] by descending induction on ℓ(w)−ℓ(y): for y=w this is 1∈v0Z[v−2], and for y<w each hy,z lies in vℓ(z)−ℓ(y)Z[v−2] by [F4] and each gz,w with y<z≤w lies in vℓ(w)−ℓ(z)Z[v−2] by the hypothesis of the induction, so each product lies in vℓ(w)−ℓ(y)Z[v−2] and the finite sum does too.

8.1step 7.1step 3.2discharge-induction: step 2.1∎

Parity and positivity of the inverse coefficients. By step 3.2 and step 6.1 the multiplicities appearing in gz,x=∑i(−1)imz,ivi are exactly the multiplicities of the linear complex Fx, and by step 7.1 we have gz,x∈vℓ(x)−ℓ(z)Z[v−2]; therefore the coefficient (−1)imz,i of vi can be nonzero only when i≡ℓ(x)−ℓ(z)(mod2), which is the parity clause of (3). For such i the sign (−1)ℓ(x)−ℓ(z)+i equals +1, so (−1)ℓ(x)−ℓ(z)gz,x=∑i(−1)ℓ(x)−ℓ(z)+imz,ivi∈Z≥0[v±1], and the coefficients are the nonnegative multiplicities mz,i. This proves (3) and, with (1) and (2), completes the induction.

Remarks

  • The theorem is the linearity statement inside the simultaneous induction of the page: it is proved under S(≤x) only and is never used to justify an earlier item. Its role downstream is to supply the linear minimal complex whose first differentials drive the hard-Lefschetz theorems.
  • Step 4.2 is the local rendering of Elias-Williamson Lemma 6.11; the two shift estimates and the cancellation in the Δ-split cutoff complex are its complete argument, and the positivity clause of (3) is the inverse Kazhdan-Lusztig positivity of Remark 6.10, obtained here without assuming positivity of the Kazhdan-Lusztig polynomials.

Depends on

Used by

Dependency tree · two levels

64 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