Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
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.

Rank-two type-A Soergel bimodule decompositions

Statement

Let 1≤i≤n−2, put s:=si, t:=si+1 and write BiBi+1Bi:=Bi⊗RBi+1⊗RBi. Then there are degree-zero isomorphisms of graded (R,R)-bimodules Bi⊗RBi+1⊗RBi≅Bi,i+1,i⊕Bi,Bi+1⊗RBi⊗RBi+1≅Bi,i+1,i⊕Bi+1, with no additional grading shift on any summand, where Bi,i+1,i is the rank-two longest bimodule of The rank-two longest type-A Soergel bimodule. On split Grothendieck classes the two decompositions read [BiBi+1Bi]=[Bi,i+1,i]+[Bi] and [Bi+1BiBi+1]=[Bi,i+1,i]+[Bi+1].

Facts & Assumptions

Given: Adjacent indices 1≤i≤n−2, the simple reflections s=si, t=si+1, the coordinate roots αs=xi−xi+1 and αt=xi+1−xi+2, the coordinate Demazure operator ∂sβ(f):=(f−s(f))/αs, and the graded (R,R)-bimodules Bs,Bt,Bi,i+1,i. The two roots and the second dot Zs=αs⊗1+1⊗αs used in the four maps below are in the coordinate (length) normalization βs,βt of The standard type-A reflection realization and its polynomial ring, written αs,αt only inside this item; they are not the balanced roots αsbal=εsβs of that item, and the diagrammatic generator normalization developed later on this page uses the balanced root: Δs=12(αsbal⊗1+1⊗αsbal)=εs12Zs. The coordinate operator is related to the balanced one by ∂rbal=εr∂rβ. Thus the root insertions μra and Demazure contractions κr acquire a factor εr when written in the balanced normalization, while multiplication μr and unit insertion κra do not. Since εsεt=−1, the zig-zag composite changes from −id⁡ to +id⁡. Accordingly, if bars denote the balanced maps, the balanced idempotent is ebal:=μˉtaκsaκˉsμt; this is the same endomorphism as the coordinate idempotent e=−μtaκsaκsμt. The decomposition is therefore normalization-independent, although identifying these maps with the fixed six-valent diagrammatic generator requires this translation.

[F1]

Bs=R⊗RsR(1) with (Bs)d=(R⊗RsR)d+1, left action r′(r⊗r′′)=r′r⊗r′′ and right action (r⊗r′′)r′=r⊗r′′r′, the graded left R-module isomorphism Bs≅R(−1)⊕R(1); the coordinate operator ∂sβ(f)=(f−s(f))/αs is Rs-linear and satisfies ∂sβ(αsh)=2h for h∈Rs (The standard type-A reflection realization and its polynomial ring, The Soergel bimodule Bi of a simple reflection).

[F2]

Bs is finite free of rank two as a left R-module and as a right R-module (Soergel generators and Bott–Samelson products are finite free on both sides).

[F3]

R is free over Rs with basis {1,αs}: every f∈R has a unique expression f=f++αsf− with f±∈Rs, f+=12(f+s(f)) and f−=12∂sβ(f); the action of Sn on R is given by (w⋅f)(x1,…,xn)=f(xw(1),…,xw(n)) and st fixes xa for a∉{t,t+1} (The standard type-A reflection realization and its polynomial ring).

[F4]

Bi,i+1,i=R⊗RWi,i+1R(3) for the parabolic Wi,i+1=⟨s,t⟩≅S3 of the three coordinates xi,xi+1,xi+2, and as a graded left R-module Bi,i+1,i≅R(−3)⊕R(−1)⊕2⊕R(1)⊕2⊕R(3); the Bott–Samelson bimodule of the word is Bi,i+1,i‾=R⊗RsR⊗RtR⊗RsR(3) (The rank-two longest type-A Soergel bimodule, The Bott–Samelson bimodule of a word).

[F5]

Imported identification (Libedinsky, §4.4.1, for the rank-two example with s↔si and r↔si+1): for the idempotent e of step 3.1 the image im⁡(1−e) is generated as an R-bimodule by the 1-tensor 1⊗:=1⊗1⊗1⊗1 of Bi,i+1,i‾, and BsBtBs is generated as an R-bimodule by 1⊗ together with 1⊗xi⊗1⊗1; the two-sided ideal of relations here is the balanced one of Bi,i+1,i‾ (The rank-two longest type-A Soergel bimodule).

Proof

1.1

The four maps: define R-bimodule maps μs:Bs→R by μs(p⊗q)=pq, μsa:R→Bs by μsa(1)=αs⊗1+1⊗αs, κs:Bs⊗RBs→Bs by κs(p⊗q⊗h)=12p ∂sβ(q)⊗h and κsa:Bs→Bs⊗RBs by κsa(p⊗q)=p⊗1⊗q, and let μt,μta be the same constructions for t.

F1
1.2

Degrees: μs and μsa have degree +1 and κs,κsa have degree −1: an element of Bs of degree d is an element of R⊗RsR of degree d+1 by Bs=R⊗RsR(1), so pq has degree d+1 in R, αs⊗1 and 1⊗αs have degree 1 in Bs because deg⁡αs=2 and 1⊗1 has degree −1, and ∂sβ lowers degrees by 2.

F1
1.3

Balancedness of the four maps: μs and κsa are visibly balanced in the middle slots; κs is balanced because ∂sβ is Rs-linear, so ∂sβ(rsq)=rs∂sβ(q) and ∂sβ(qrs)=∂sβ(q)rs for rs∈Rs, whence p∂sβ(rsq)⊗h=prs∂sβ(q)⊗h and p∂sβ(qrs)⊗h=p∂sβ(q)⊗rsh.

F1
1.4

The adjoint μsa is well defined: a map out of the regular bimodule R must send f to the same element through f⋅μsa(1) and μsa(1)⋅f, so it suffices that Zs:=αs⊗1+1⊗αs commutes with R. Every f is f++αsf− with f±∈Rs by [F3], and elements of Rs slide across the tensor divider and commute with Zs. For the remaining generator αs, one has αsZs=αs2⊗1+αs⊗αs and Zsαs=αs⊗αs+1⊗αs2; these are equal because αs2∈Rs. Thus fZs=Zsf for every f, and μsa(f):=fZs is a well-defined R-bimodule map of degree +1 because Zs has degree 1.

F1F3
1.5

The large summand: by [F5] im⁡(1−e) is generated as an R-bimodule by 1⊗ inside Bi,i+1,i‾=R⊗RsR⊗RtR⊗RsR(3); the assignment p⊗q↦p⊗1⊗1⊗q is a well-defined degree-zero R-bimodule map from R⊗RWi,i+1R(3) because an element g∈RWi,i+1 is both s- and t-invariant and therefore slides across both dividers of 1⊗. It is surjective onto im⁡(1−e) because the bimodule generated by 1⊗ is the set of finite sums of elements p 1⊗q with p,q∈R, the images of finite sums of p⊗q.

F4F5
2.1

The composite identity: for the adjacent pair, s(αt)=αt+αs because s exchanges xi and xi+1 and fixes every other coordinate, so ∂sβ(αt)=(αt−s(αt))/αs=−1. Applying κs∘μt∘μta∘κsa to p⊗q∈Bs, the successive images are p⊗1⊗q under κsa, then p⊗αt⊗1⊗q+p⊗1⊗αt⊗q under the middle-slot insertion μta, then 2p⊗αt⊗q under the middle-slot multiplication μt, and finally 12⋅2p ∂sβ(αt)⊗q=−(p⊗q) under κs; hence κs∘μt∘μta∘κsa=−id⁡Bs.

F1F3step 1.1
3.1

The idempotent: with the identities understood in the sense of tensor slots (as in the sources), let e:=−μta∘κsa∘κs∘μt∈End⁡R-R(BsBtBs); then e2=μtaκsa(κsμtμtaκsa)κsμt=μtaκsa(−id⁡)κsμt=e by step 2.1, so e is an idempotent, and it is homogeneous of degree 0 by step 1.2.

step 1.2step 2.1
4.1

The splitting and its small summand: 1−e is an idempotent orthogonal to e, so the graded bimodule splits as BsBtBs=im⁡(e)⊕im⁡(1−e). The composite identity of step 2.1 makes −κsμt a left inverse to μtaκsa, so im⁡(e)=im⁡(μtaκsa)≅Bs without a separate injectivity or surjectivity claim; the comparison has degree zero by step 1.2.

step 1.2step 2.1step 3.1
5.1

Graded dimension count: let u record the degree of a homogeneous free left-R generator. By [F1] and [F2], Bs and Bt each have graded left-R rank u−1+u, and their tensor product BsBtBs has rank (u−1+u)3. By step 4.1 the Hilbert series of the complementary summand is the Hilbert series of R times (u−1+u)3−(u−1+u)=u−3+2u−1+2u+u3. This is also the Hilbert series of Bi,i+1,i≅R(−3)⊕R(−1)⊕2⊕R(1)⊕2⊕R(3) from [F4]. Thus the surjection of step 1.5 compares k-vector spaces of equal finite dimension in every degree.

F1F2F4step 4.1step 1.5
6.1

Conclusion: a graded surjection that is a comparison of finite-dimensional k-vector spaces of equal dimension in each degree is an isomorphism, so im⁡(1−e)≅R⊗RWi,i+1R(3)=Bi,i+1,i with a degree-zero identification; combined with step 4.1 this gives BiBi+1Bi≅Bi,i+1,i⊕Bi. The second decomposition is the same argument with s and t interchanged, the identity ∂tβ(αs)=−1 being symmetric, so Bi+1BiBi+1≅Bi,i+1,i⊕Bi+1. ∎

F4step 4.1step 5.1

Depends on

Used by

Dependency tree · two levels

12 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