Alphabeta Math
LemmaStatement: 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.

Right-descent Soergel bimodules descend to simple invariants under the character hypothesis

Facts & Assumptions

Given: An element x∈Sn and a simple reflection s with xs<x (a right descent), the indecomposable M=BxR, the generator BsR=S⊗SsS(1), the hypothesis S(x) (so ch⁡(M)=H‾x), and the deformed operator Lζ on MBs (The deformed Lefschetz operator L_zeta on B_x B_s).

[F1]

Under S(x) the comparison lemma gives End⁡0(M)=R, the decomposition MBs=M(1)⊕M(−1) with no other summands, and the following structure of M: its lowest degree −ℓ(x) is one-dimensional, M is finite free as a right S-module, and M is self-dual (Indecomposable labels, characters and filtration ranks agree after real scalar extension).

[F2]

In the decomposition S=Ss⊕(αs/2)Ss the four maps ι1(r)=r, ι2(r)=(αsr)/2, π1(r)=(r+s(r))/2, π2(r)=∂s(r) satisfy πa∘ιb=δab and give the inclusions and projections of an Ss-bimodule decomposition of S; moreover αs acts on S by an injective map and s(αs)=−αs (Soergel generators and Bott–Samelson products are finite free on both sides, The deformed Lefschetz operator L_zeta on B_x B_s).

[F3]

In the Hecke algebra the right-descent multiplication is H‾xH‾s=(v+v−1)H‾x when xs<x, and the character of Bs is H‾s (Multiplication by a generator in the Kazhdan–Lusztig basis).

Statement

Let M=BxR over S and let s be a right descent, xs<x. Assume S(x). Then there is a graded (S,Ss)-bimodule N and an isomorphism M≅N⊗SsS. Consequently MBs=M(1)⊕M(−1); choosing the decomposition S=Ss⊕(αs/2)Ss in the middle tensor factor, the reduced operator Lζ has, with respect to the resulting identification MBs=M(1)⊕M(−1), the matrix Lζ=(ρ⋅(−)0ζρ(αs∨)ρ⋅(−)), where the scalar off-diagonal entry is a degree-two map M(1)→M(−1). The construction requires no singular-category classification or character conjecture beyond S(x). If hL(x) also holds and ζ>0, this matrix satisfies centered hard Lefschetz; at ζ=0 it fails centered hard Lefschetz.

Proof

technique · construct the descent isomorphism from a split counit, then compute the matrix and the Lefschetz strings
1.1givenF1F2

A genuine bimodule section. Put U=M⊗SsS, so MBs=U(1). The actual bimodule decomposition of [F1] gives U≅M⊕M(−2). The multiplication counit c:U→M, c(b⊗r)=br, is an S-bimodule map. The bottom degree of U is the single line M−ℓ(x)⊗1, on which c is nonzero. Only the unshifted summand M in this decomposition has that degree, so c restricts to a nonzero degree-zero endomorphism of that summand. By [F1] it is a nonzero scalar, hence invertible. Compose its inverse with the actual bimodule inclusion to obtain a degree-zero bimodule section σ:M→U. On the bottom line σ(b)=b⊗1, because cσ=1 and that line in U is one dimensional.

2.1step 1.1F1F2

The twisted counit. Define cs:U→Ms by cs(b⊗r)=b s(r). It is balanced over Ss, left S-linear and right-s-semilinear. Since the section σ in step 1.1 is genuinely right-S-linear, t=csσ:M→M is degree zero, left S-linear and right-s-semilinear. It is the identity on the bottom line by step 1.1. This argument uses the actual bimodule summand, rather than the generally non-right-linear map b↦b⊗1.

3.1step 2.1F1

The involution property of t. Since t is right-s-semilinear and degree zero, t2 is an ordinary degree-zero S-bimodule endomorphism of M, hence a scalar by End⁡0(M)=R; its scalar is 1 because t2 acts as the identity on the one-dimensional bottom degree by step 2.1. Hence t2=idM.

4.1step 2.1step 3.1F1F2

The descent isomorphism. For u∈U one has cs(u)−c(u)∈Mαs, because s(r)−r∈αsS for every r∈S; consequently t(m)−m∈Mαs for every m∈M. Define N:={m∈M:t(m)=m}. Every m splits as m=12(m+t(m))+12(m−t(m)) into an invariant and an anti-invariant part, and an anti-invariant m (that is, t(m)=−m) lies in Mαs, say m=nαs; since right multiplication by αs is injective by [F2] and t(m)=−m with s(αs)=−αs gives t(nαs)=t(n)s(αs)=−t(n)αs and hence t(n)=n, we get n∈N and the anti-invariant part of m is Nαs. Therefore M=N⊕Nαs as (S,Ss)-bimodules, and the multiplication map induces an isomorphism N⊗SsS→M; this proves the descent isomorphism.

5.1step 1.1step 2.1step 4.1F2algebra

The matrix of Lζ. Use the proved descent M=N⊗SsS to write MBs=N⊗SsS⊗SsS(1). Splitting the middle factor by S=Ss⊕(αs/2)Ss gives the bimodule isomorphism MBs≅M(1)⊕M(−1), with structure maps ι1,ι2,π1,π2 of [F2] satisfying πaιb=δab. In this basis, middle multiplication by ρ has entries π1(ρ), π1(αsρ)/2, ρ(αs∨) and ∂s(αsρ)/2, and the operators of multiplication by ρ on the two outer factors contribute the same diagonal ρ⋅(−) on M(1) and M(−1). All entries except the off-diagonal ρ(αs∨) have positive polynomial degree in ρ and vanish after the right reduction; the off-diagonal entry has the constant term ρ(αs∨) and contributes the degree-two map ζρ(αs∨):M(1)→M(−1); hence, after reduction, Lζ is the displayed matrix.

6.1step 5.1F1algebra

Hard Lefschetz for ζ>0. Assume hL(x), so the reduced module M‾ is a direct sum of centered ρ-strings u0,…,um with deg⁡uj=−m+2j and ρuj=uj+1; on each string, left multiplication by ρ is the standard nilpotent Jordan block. In the two-dimensional middle factor with basis v−,v+ of degrees −1,+1 and e(v−)=ζρ(αs∨)v+, e(v+)=0, the operator e=Lζ on the string tensor ⨁juj⊗{v−,v+} acts by ek(ujv−)=uj+kv−+k uj+k−1v+ and ek(ujv+)=uj+kv+ (indices out of range zero), after normalizing the nonzero scalar ζρ(αs∨) to 1 by rescaling v+; for 0≤k≤m−1 of the compatible parity k≡m+1(mod2), in centered degree −k the source basis u(m+1−k)/2v−, u(m−1−k)/2v+ and the corresponding target basis exhibit ek as a matrix with diagonal entries 1 and 1, lower-left entry k, and upper-right entry 0, which is invertible; at k=m+1 the map sends u0v− to (m+1)umv+, nonzero by the normalization ζρ(αs∨)>0. The operator on each string is thus an isomorphism in every centered degree, and Lζ on the direct sum of strings satisfies hL. Positivity of ζρ(αs∨) uses ζ>0 and strict dominance of ρ.

7.1step 5.1step 6.1F1F3∎

Failure at ζ=0 and conclusion. At ζ=0 the matrix of step 5.1 is diagonal with respect to the decomposition MBs=M(1)⊕M(−1). The bottom class b∈M‾−ℓ(x) sits in the first summand in degree −ℓ(x)−1 and satisfies ρℓ(x)+1b=0 because M‾ℓ(x)+2=0; the opposite class in M(−1) of degree ℓ(x)+1 is nonzero by self-duality and dimension symmetry. Hence ρℓ(x)+1 is not injective on MBs‾ in the centered grading and centered hL fails at ζ=0, even though the two individual shifted copies of M‾ have their own strings centered at ±1. Steps 1.1-5.1 prove the descent isomorphism and the matrix, step 6.1 the positive-parameter hard Lefschetz, and this step the failure at zero; no singular-category classification or character conjecture beyond S(x) is used.

Remarks

  • The section σ is obtained from the actual bimodule decomposition and the scalar counit restriction on its unshifted summand, so the construction is genuinely a consequence of S(x) through the comparison lemma, not of an imported singular-descent theorem.
  • The off-diagonal entry is a scalar ζρ(αs∨) because the middle tensor factor is two-dimensional with a one-dimensional off-diagonal block; no further structure of N enters the computation of the matrix.

Depends on

Used by

Dependency tree · two levels

24 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