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 and a simple reflection with (a right descent), the indecomposable , the generator , the hypothesis (so ), and the deformed operator on (The deformed Lefschetz operator L_zeta on B_x B_s).
Under the comparison lemma gives , the decomposition with no other summands, and the following structure of : its lowest degree is one-dimensional, is finite free as a right -module, and is self-dual (Indecomposable labels, characters and filtration ranks agree after real scalar extension).
In the decomposition the four maps , , , satisfy and give the inclusions and projections of an -bimodule decomposition of ; moreover acts on by an injective map and (Soergel generators and Bott–Samelson products are finite free on both sides, The deformed Lefschetz operator L_zeta on B_x B_s).
In the Hecke algebra the right-descent multiplication is when , and the character of is (Multiplication by a generator in the Kazhdan–Lusztig basis).
Statement
Let over and let be a right descent, . Assume . Then there is a graded -bimodule and an isomorphism . Consequently ; choosing the decomposition in the middle tensor factor, the reduced operator has, with respect to the resulting identification , the matrix where the scalar off-diagonal entry is a degree-two map . The construction requires no singular-category classification or character conjecture beyond . If also holds and , this matrix satisfies centered hard Lefschetz; at it fails centered hard Lefschetz.
Proof
A genuine bimodule section. Put , so . The actual bimodule decomposition of [F1] gives . The multiplication counit , , is an -bimodule map. The bottom degree of is the single line , on which is nonzero. Only the unshifted summand in this decomposition has that degree, so 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 . On the bottom line , because and that line in is one dimensional.
The twisted counit. Define by . It is balanced over , left -linear and right--semilinear. Since the section in step 1.1 is genuinely right--linear, is degree zero, left -linear and right--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 .
The involution property of . Since is right--semilinear and degree zero, is an ordinary degree-zero -bimodule endomorphism of , hence a scalar by ; its scalar is because acts as the identity on the one-dimensional bottom degree by step 2.1. Hence .
The descent isomorphism. For one has , because for every ; consequently for every . Define . Every splits as into an invariant and an anti-invariant part, and an anti-invariant (that is, ) lies in , say ; since right multiplication by is injective by [F2] and with gives and hence , we get and the anti-invariant part of is . Therefore as -bimodules, and the multiplication map induces an isomorphism ; this proves the descent isomorphism.
The matrix of . Use the proved descent to write . Splitting the middle factor by gives the bimodule isomorphism , with structure maps of [F2] satisfying . In this basis, middle multiplication by has entries , , and , and the operators of multiplication by on the two outer factors contribute the same diagonal on and . All entries except the off-diagonal have positive polynomial degree in and vanish after the right reduction; the off-diagonal entry has the constant term and contributes the degree-two map ; hence, after reduction, is the displayed matrix.
Hard Lefschetz for . Assume , so the reduced module is a direct sum of centered -strings with and ; on each string, left multiplication by is the standard nilpotent Jordan block. In the two-dimensional middle factor with basis of degrees and , , the operator on the string tensor acts by and (indices out of range zero), after normalizing the nonzero scalar to by rescaling ; for of the compatible parity , in centered degree the source basis and the corresponding target basis exhibit as a matrix with diagonal entries and , lower-left entry , and upper-right entry , which is invertible; at the map sends to , nonzero by the normalization . The operator on each string is thus an isomorphism in every centered degree, and on the direct sum of strings satisfies hL. Positivity of uses and strict dominance of .
Failure at and conclusion. At the matrix of step 5.1 is diagonal with respect to the decomposition . The bottom class sits in the first summand in degree and satisfies because ; the opposite class in of degree is nonzero by self-duality and dimension symmetry. Hence is not injective on in the centered grading and centered hL fails at , even though the two individual shifted copies of have their own strings centered at . 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 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 through the comparison lemma, not of an imported singular-descent theorem.
- The off-diagonal entry is a scalar because the middle tensor factor is two-dimensional with a one-dimensional off-diagonal block; no further structure of 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
- Elias-Williamson, The Hodge theory of Soergel bimodules (arXiv:1212.0791v2, final version; Ann. of Math. 180 (2014) 1089-1136) (standard reference, not scraped)
- Riche, La theorie de Hodge des bimodules de Soergel (d'apres Soergel et Elias-Williamson), Seminaire Bourbaki no. 1139 (arXiv:1711.02464, Octobre 2017) (standard reference, not scraped)