Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck pass
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 three-term Rouquier braid equivalence in type A2

Example

In type A2 (n=3, s=s1, t=s2) the example writes the two 8-term complexes FsFtFs and FtFsFt explicitly, applies the decompositions BsBtBs≅Bsts⊕Bs and BtBsBt≅Bsts⊕Bt together with BsBs≅Bs(1)⊕Bs(−1) and BtBt≅Bt(1)⊕Bt(−1), exhibits the contractible summands (with extra bimodule Bs respectively Bt) and their contracting homotopies, and identifies the surviving common complex built from Bsts; the explicit chain maps then realize FsFtFs≃FtFsFt with no shift. All terms, the shifts of Bsts, and the differentials of the surviving complexes are displayed.

Facts & Assumptions

Given: The adjacent simple reflections s=s1, t=s2 of S3, the complexes Fs,Ft of The positive and negative Rouquier generator complexes, and the rank-two longest bimodule Bsts=R⊗RS3R(3) of The rank-two longest type-A Soergel bimodule.

[F1]

Rank one. Bs⊗RBs≅Bs(1)⊕Bs(−1) and Bt⊗RBt≅Bt(1)⊕Bt(−1), split by the middle-slot idempotents attached to R=Rs⊕αsRs and R=Rt⊕αtRt; the summands are im(e+)≅B∙(1) and im(e−)≅B∙(−1). (The rank-one Soergel bimodule square splits)

[F2]

Rank two. BsBtBs≅Bsts⊕Bs and BtBsBt≅Bsts⊕Bt with no additional shift. (Rank-two type-A Soergel bimodule decompositions, The rank-two longest type-A Soergel bimodule)

[F3]

Gaussian elimination. An invertible differential block φ:U→V in a fixed biproduct decomposition of two adjacent terms can be cancelled, leaving a homotopy equivalent reduction and a contractible two-term complex [U→φV]. (Gaussian elimination splits a contractible two-term complex)

[F4]

Totalization. The signed tensor totalization of three two-term complexes is concentrated in cohomological degrees 0,1,2,3, with the terms obtained by choosing one term from each factor and the Koszul differential; a unit term contributes its factor R(±1) in the corresponding cohomological degree. (Bounded graded bimodule complexes and signed tensor totalization)

[F5]

The three-term relation is FsFtFs≃FtFsFt with no grading shift. The specific splitting and maps used in this example will be checked locally below. (Rouquier complexes satisfy the three-term braid relation)

Verification

technique · direct
1.1F4givenalgebra

Put S=Bs, T=Bt, L=Bsts. The terms of K=FsFtFs in degrees 0,1,2,3 are STS, U⊕V⊕W=(TS)(1)⊕(SS)(1)⊕(ST)(1), A⊕B⊕C=S(2)⊕T(2)⊕S(2), and R(3). The complex K′ has this list with s,t exchanged. With ms,mt denoting multiplication, dK0=(ms⊗1⊗1,1⊗mt⊗1,1⊗1⊗ms),dK2=(ms,−mt,ms), and dK1=(−mt⊗1ms⊗10−1⊗ms0ms⊗10−1⊗ms1⊗mt). In particular every component of d1d0 cancels in pairs, and the same holds for d2d1.

1.2F1givenalgebra

Write x=x1, y=x2, z=x3, βs=x−y, βt=y−z and Ds(f)=(f−s(f))/(2βs); these are coordinate roots, rather than the balanced roots used for negative generators. Define J(r⊗r′)=−r⊗βt⊗1⊗r′−r⊗1⊗βt⊗r′,p(r⊗f⊗g⊗r′)=rDs(fg)⊗r′. The coefficient operator Ds is Rs-linear, so p is balanced across the outer Rs dividers and middle multiplication is Rt-balanced. Unit insertion into SS is balanced, and βt⊗1+1⊗βt is central in T because R=Rt⊕βtRt and βt2∈Rt; hence J is a bimodule map. The shifts make both maps degree zero. The identity s(βt)=βt+βs gives Ds(βt)=−1/2 and pJ=1S.

2.1F1F2step 1.2algebra

The map j:L→STS, j(r⊗r′)=r⊗1⊗1⊗r′, is balanced since RS3 slides across all dividers, and pj=0. To identify its image, expand the second middle slot in the Rt-basis {1,z} and slide invariant coefficients into the first middle slot; expand that slot in the Rs-basis {1,x} and slide coefficients left. Since z∈Rs slides right, STS is generated as a bimodule by g0=1⊗1⊗1⊗1 and gx=1⊗x⊗1⊗1. For e=Jp and u=x+y−z, balancing gives (1−e)g0=g0,(1−e)gx=12(ug0+g0u). Indeed p(gx)=12(1⊗1) and the two middle βt tensors sum to ug0+g0u−2gx. Therefore ker⁡p=im⁡(1−e)=im⁡j. By F2 and pJ=1, L and ker⁡p have equal finite dimensions in every graded degree, so j is an isomorphism onto ker⁡p. Thus the specific splitting is K0=j(L)⊕J(S).

3.1F1F3step 1.1step 1.2step 2.1

Split V=(SS)(1)=V+⊕V−=S(2)⊕S by F1 using the coordinate middle root βs, a unit multiple of the balanced root. Projection to V− is r⊗f⊗r′↦rDs(f)⊗r′, whose composite with the V component of dK0 is p. It is the identity on J(S) and zero on j(L). Cancel the identity pair S→V− by F3. The surviving L components into U,V+,W are the outer-unit inclusions with signs +,+,+.

4.1F3step 1.1step 3.1algebra

The second pivot is V+→A=1S(2), while its component into C is −1S(2). Gaussian elimination deletes this pair and replaces the old C row by the sum of the old C and A rows. In degrees 0,1,2,3 the survivor is H:L→dH0(TS)(1)⊕(ST)(1)→dH1S(2)⊕T(2)→dH2R(3), with dH0=(jts,jst),dH1=(−mt⊗11⊗mt−1⊗msms⊗1),dH2=(ms,−mt), where jts(r⊗r′)=r⊗1⊗r′ and likewise for jst. These are the remaining U,W components of the preceding differential and C,B components of the following one.

5.1step 1.2step 2.1step 3.1step 4.1algebra

Apply steps 1.2–4.1 to K′ with s,t exchanged. Here Dt(βs)=−1/2; the complement calculation is transported by x↔z, negating both coordinate roots and leaving Jp unchanged. Reorder its survivor H′ into the displayed order for H. Its differentials are dH′0=dH0, dH′1=−dH1, dH′2=−dH2, by exchanging the rows and columns of the displayed middle matrix. Thus the degreewise map q=(1,1,−1,1):H→H′ is a chain isomorphism. Every term and map has the same written internal shifts.

6.1F3F5step 3.1step 4.1step 5.1∎

For a pivot block (abc1), the Gaussian chain isomorphism T has components Tn=(10c1), Tn+1=(1−b01) and identity elsewhere. Its inclusion, projection and homotopy are ι=T−1in⁡, π=pr⁡T, h=T−1kT, where k sends the pivot target back to its source by the identity and vanishes elsewhere. Compose the two eliminations by i=ι1ι2, p=π2π1, h=h1+ι1h2π1, and similarly for K′. F3 gives pi=1H and 1K−ip=dh+hd, and the primed identities. All entries are the neighboring blocks displayed above. Thus the explicit chain maps Φ=i′qp:K→K′,Ψ=iq−1p′:K′→K satisfy ΨΦ=ip and ΦΨ=i′p′, with the written contractions. This verifies the relation of F5 with no grading shift.

Depends on

Used by

Nothing in the library uses this result yet.

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