Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

The type A2 rank-two Soergel decomposition

Example

Take n=3 and i=1, so that R=Q[x1,x2,x3], that s=s1 and t=s2 are the two adjacent simple reflections, and that W1,2=⟨s,t⟩=S3 acts by permuting x1,x2,x3. Put αs=x1−x2, αt=x2−x3, δs=αs/2, δt=αt/2, and let us=1⊗1, ws=1⊗δs be the rank-one basis of Bs, with ut,wt the corresponding basis of Bt. Then:

  1. The two Demazure values that carry the rank-two calculus. For the adjacent pair, s(αt)=x1−x3=αt+αs and t(αs)=x1−x3=αs+αt, so ∂sβ(αt)=αt−s(αt)αs=−1,∂tβ(αs)=αs−t(αs)αt=−1, while ∂sβ(αs)=2, ∂tβ(αt)=2 and ∂sβ(δs)=1, ∂tβ(δt)=1. All roots and Demazure operators in this example are in the coordinate normalization αs=βs=x1−x2, αt=βt=x2−x3 of The standard type-A reflection realization and its polynomial ring, so the off-diagonal values just computed are ∂sβ(βt)=∂tβ(βs)=−1; in the balanced normalization ∂rbal=εr∂rβ and each root insertion and Demazure contraction of color r gains the factor εr, while multiplication and unit insertion are unchanged. As εsεt=−1, the zig-zag changes from −id⁡ to +id⁡; the balanced idempotent uses the corresponding positive composite and equals the coordinate idempotent. The two graphs Gr(s),Gr(t) of the adjacent reflections meet in codimension two: s−1t=st is a 3-cycle whose fixed space is the line x1=x2=x3, of dimension one in the ambient space of dimension three.
  2. The four maps on the rank-one bases. With μs:Bs→R, μsa:R→Bs, κs:Bs⊗RBs→Bs and κsa:Bs→Bs⊗RBs the maps μs(p⊗q)=pq,μsa(1)=αs⊗1+1⊗αs,κs contracts the middle slot by 12∂sβ,κsa(p⊗q)=p⊗1⊗q, and μt,μta the same constructions for t; that is, κs sends p⊗q⊗h to 12p ∂sβ(q)⊗h and κsa inserts the unit 1∈Rs in the middle slot (κsa(1⊗1)=1⊗1⊗1). Under (a⊗b)⊗(c⊗d)↦a⊗bc⊗d, the evaluations on the four left-R basis tensors of Bs⊗RBs are κs(us⊗us)=0,κs(us⊗ws)=0,κs(ws⊗us)=12us,κs(ws⊗ws)=12ws. Moreover κsa(us)=us⊗us and κsa(ws)=us⊗ws. The dot evaluations are μt(ut)=1, μt(wt)=δt and μta(1)=αtut+2wt, so μtμta(1)=2αt.
  3. The zig-zag identity. Evaluating the composite κs∘μt∘μta∘κsa on a general element p⊗q∈Bs gives, step by step, p⊗1⊗q ⟼ p⊗αt⊗1⊗q+p⊗1⊗αt⊗q ⟼ 2p⊗αt⊗q ⟼ 12⋅2 p ∂sβ(αt)⊗q=−(p⊗q), so κs∘μt∘μta∘κsa=−id⁡Bs; this is the first of the two matrix identities, verified here on the basis (us,ws) by claim 1 and claim 2.
  4. The idempotent and the second identity. With e:=−μta∘κsa∘κs∘μt∈End⁡R-R(Bs⊗RBt⊗RBs) the identity of claim 3 gives e2=μtaκsa(κsμtμtaκsa)κsμt=e, so e is a degree-zero idempotent endomorphism; consequently 1−e is an idempotent orthogonal to e and B1⊗RB2⊗RB1=im⁡(e)⊕im⁡(1−e), which is the second matrix identity together with the splitting it produces.
  5. The two decompositions and their rank count. For n=3 the rank-two decomposition theorem applies to the pair s,t: the summand im⁡(1−e) is isomorphic to B1,2,1=R⊗RS3R(3) and im⁡(e) to B1, so B1B2B1≅B1,2,1⊕B1,B2B1B2≅B1,2,1⊕B2, the second decomposition being the s↔t instance. The ranks match: R is a free RS3-module on six generators of degrees 0,2,2,4,4,6, so B1,2,1 is free of graded dimension d−3+2d−1+2d1+d3 and B1 of graded dimension d−1+d1 in the notation R(a)e=Re+a, while B1B2B1 is free of graded dimension (d−1+d1)3; and indeed (d−1+d1)3−(d−1+d1)=d−3+3d−1+3d1+d3−(d−1+d1)=d−3+2d−1+2d1+d3.

Facts & Assumptions

Given: The ring R=Q[x1,x2,x3] graded by deg⁡xi=2, the adjacent simple reflections s=s1, t=s2 with coordinate roots αs=x1−x2, αt=x2−x3 and halves δs,δt, the coordinate Demazure operators ∂sβ,∂tβ, the invariant rings Rs,Rt,RS3, and the bimodules Bs,Bt,B1,2,1.

[F1]

R is a graded commutative Q-algebra with S3 acting by place permutation, αs∨=αs, s(v)=v−⟨v,αs⟩αs∨ gives the transposition of x1,x2, and the Demazure operator ∂sβ(f)=(f−s(f))/αs is well defined with values in Rs, is Rs-linear and is surjective onto Rs with ∂sβ(αsh)=2h for h∈Rs; moreover R is free over Rs with basis {1,αs}, every f having the unique expression f=g+αsh, g=12(f+s(f)), h=12∂sβ(f) (The standard type-A reflection realization and its polynomial ring).

[F2]

Substitution Tk↦ek for k=1,2,3 is an isomorphism of Q-algebras Q[T1,T2,T3]→Q[x1,x2,x3]S3 onto the symmetric polynomials, so RS3 is a polynomial ring in the elementary symmetric polynomials of degrees 2,4,6 (Fundamental theorem of symmetric polynomials: unique expression as a polynomial in e1,…,en).

[F3]

Bs=R⊗RsR(1) is the balanced tensor product with left action r′(r⊗r′′)=r′r⊗r′′, right action (r⊗r′′)r′=r⊗r′′r′, shift (Bs)d=(R⊗RsR)d+1 and Bs≅R(−1)⊕R(1); the images us=1⊗1 and ws=1⊗δs of degrees −1 and +1 form a graded left R-basis of Bs (The Soergel bimodule Bi of a simple reflection).

[F4]

The rank-one calculus: us=1⊗1 and ws=1⊗δs form a graded left R-basis of Bs with right action us⋅g=g+us+g−ws and ws⋅g=δs2g−us+g+ws for the decomposition g=g++δsg− with g±∈Rs and g+=12(g+s(g)), and the sub-bimodules R(δsus±ws) are R(−1) and Rs(−1); the analogous statements hold with s replaced by t (Standard graph bimodules, support filtrations and characters).

[F5]

Bs and Bt are free of rank two on each side, and every Bott–Samelson product Bi1⊗R⋯⊗RBir is finite free on each side, with left basis obtained by tensoring the two-element left bases of the factors and with degrees the sums of the factor degrees (Soergel generators and Bott–Samelson products are finite free on both sides).

[F6]

B1,2,1=R⊗RS3R(3) for the parabolic S3=⟨s1,s2⟩ of the three coordinates x1,x2,x3; it is a free graded R-module of rank six on each side with homogeneous basis degrees 2ℓ(w)−3, w∈S3, and R is free over RS3 with R≅⨁w∈S3RS3(−2ℓ(w)), so that as a graded left R-module B1,2,1≅R(−3)⊕R(−1)⊕2⊕R(1)⊕2⊕R(3) (The rank-two longest type-A Soergel bimodule).

[F7]

For adjacent i,i+1 and the bimodules BiBi+1Bi=Bi⊗RBi+1⊗RBi there are degree-zero isomorphisms BiBi+1Bi≅Bi,i+1,i⊕Bi and Bi+1BiBi+1≅Bi,i+1,i⊕Bi+1 with no additional grading shift on any summand, and the proof produces an idempotent e∈End⁡R-R(BiBi+1Bi) with im⁡(e)≅Bi and im⁡(1−e)≅Bi,i+1,i through the four maps μt,μta,κs,κsa (Rank-two type-A Soergel bimodule decompositions).

Proof

1.1

The adjacent Demazure values: s exchanges x1 and x2 and fixes x3, so s(αt)=s(x2−x3)=x1−x3=αt+αs and ∂sβ(αt)=(αt−αt−αs)/αs=−1 by [F1]; symmetrically t exchanges x2 and x3 and fixes x1, so t(αs)=t(x1−x2)=x1−x3=αs+αt and ∂tβ(αs)=(αs−αs−αt)/αt=−1, while ∂sβ(αs)=2 and ∂tβ(αt)=2 by [F1] with h=1, so ∂sβ(δs)=∂tβ(δt)=1.

F1F3
2.1

The evaluations of the four maps: the four tensors us⊗us, us⊗ws, ws⊗us, ws⊗ws correspond respectively to 1⊗1⊗1, 1⊗1⊗δs, 1⊗δs⊗1, 1⊗δs⊗δs. Contracting their middle polynomial by 12∂sβ gives 0,0,12us,12ws, using step 1.1. Unit insertion sends us,ws to us⊗us,us⊗ws. Multiplication gives μt(ut)=1, μt(wt)=δt, so μt(αtut+2wt)=2αt. These are exactly the well-typed evaluations of claim 2.

F3F4F7step 1.1
3.1

The zig-zag: applying the four maps in the order κsa,μta,μt,κs to p⊗q∈Bs produces p⊗1⊗q, then p⊗αt⊗1⊗q+p⊗1⊗αt⊗q, then 2p⊗αt⊗q by the middle-slot multiplication μt, and finally, applying κs with its factor 12, the element 2⋅12 p ∂sβ(αt)⊗q=p ∂sβ(αt)⊗q=−(p⊗q) by step 1.1; since p⊗q was arbitrary in the free left R-module Bs, κs∘μt∘μta∘κsa=−id⁡Bs. This is the first matrix identity, checked on the basis (us,ws) through the evaluations of step 2.1.

F3F5step 1.1step 2.1
4.1

The idempotent: following the construction of [F7], put e:=−μta∘κsa∘κs∘μt on Bs⊗RBt⊗RBs; then e2=μtaκsa(κsμtμtaκsa)κsμt=μtaκsa(−id⁡)κsμt=e by step 3.1, so e is an idempotent, and it has degree zero because the four maps, ordered as μt,μta,κs,κsa, are homogeneous of degrees +1,+1,−1,−1: the μ maps have degree +1 and the κ maps have degree −1 of The type-A diagrammatic Soergel category and its candidate bimodule functor, so their degrees sum to zero by step 2.1; hence 1−e is an idempotent orthogonal to e and the graded bimodule of endomorphisms splits BsBtBs=im⁡(e)⊕im⁡(1−e). This is the second matrix identity and the splitting it produces.

F4F5F7step 3.1
5.1

The summands: by [F7] applied to the adjacent pair s,t the summand im⁡(1−e) is isomorphic to B1,2,1=R⊗RS3R(3) and im⁡(e) to Bs, with degree-zero identifications and no extra shift, because the comparison maps of that theorem are the composites of the four maps used here; hence B1B2B1≅B1,2,1⊕B1, and applying the same statement with s and t interchanged gives B2B1B2≅B1,2,1⊕B2, the parabolic W1,2 being symmetric in s and t.

F6F7step 4.1
6.1

The rank count: by [F5] B1B2B1 is free as a left R-module with the tensor basis of the left bases (us,ws), (ut,wt), (us,ws), so its graded dimension is (d−1+d1)3 in the notation R(a)e=Re+a for the graded dimension of a shift of R; by [F2] the invariant ring is the polynomial ring Q[e1,e2,e3] on generators of degrees 2,4,6, and by [F6] B1,2,1 is free of graded dimension d−3+2d−1+2d1+d3, using the six generators of R over RS3 in degrees 0,2,2,4,4,6 shifted by −3; and B1 is free of graded dimension d−1+d1; the identity (d−1+d1)3−(d−1+d1)=d−3+2d−1+2d1+d3 holds by expanding (d−1+d1)3=d−3+3d−1+3d1+d3, so the ranks of the two sides of step 5.1 agree in every degree, as in the dimension count of [F7].

F2F5F6F7step 5.1
7.1

Conclusion: for n=3 the adjacent pair s=s1, t=s2 has ∂sβ(αt)=∂tβ(αs)=−1, the four rank-two maps take the explicit values of step 2.1 on the tensor basis, the two matrix identities hold by steps 3.1 and 4.1, and the rank-two decomposition theorem gives B1B2B1≅B1,2,1⊕B1 and B2B1B2≅B1,2,1⊕B2 with matching graded ranks as computed in step 6.1. All objects involved are finite free graded R-modules with displayed homogeneous bases, so no choice principle is used. ∎

F6F7step 1.1step 6.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

21 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