Alphabeta Math
Pipeline-generated
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.

✓ 4 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Rouquier Complexes and Categorical Braid Relations — Examples

1 · Prerequisites

2 · Summary

The four entries make the categorical braid relations concrete in the smallest nontrivial cases. For the positive word σ1σ2∈B3 the Rouquier complex F(σ1σ2) is displayed as the three-term complex [B1⊗RB2→B1(1)⊕B2(1)→R(2)] with its two differentials written out, and the identity d1d0=0 is checked on every simple tensor. The four left-basis tensors of B1⊗RB2 are u1⊗u2, u1⊗(1⊗α2), (1⊗α1)⊗u2 and (1⊗α1)⊗(1⊗α2), where ui=1⊗1; their internal degrees are −2,0,0,2, and the cohomological and internal degrees of the generators of every term are recorded.

The type A2 example writes the two eight-term complexes FsFtFs and FtFsFt explicitly, uses the decompositions BsBtBs≅Bsts⊕Bs and BtBsBt≅Bsts⊕Bt together with BsBs≅Bs(1)⊕Bs(−1) and the analogous splitting for Bt, exhibits the contractible summands with their contracting homotopies, and identifies the common surviving complex built from Bsts, so the three-term braid equivalence FsFtFs≃FtFsFt is realised by explicit chain maps with no shift.

The relation-loop example takes the braid σ1σ2σ1=σ2σ1σ2∈B3 and three signed words for it, including one obtained by appending a cancelling pair, and verifies that the normalized comparison maps compose around the resulting loop: the displayed derived composites satisfy cu,wct,u=ct,w and cw,tct,w=1Mt, where Mt is the tensor graph model for t. Their unique normalized degree-zero lifts give γu,w∘γt,u=γt,w and the inverse composite γw,t∘γt,w=1F(t).

The counterexample closes the page by separating decategorification from homotopy type. The zero-differential complex Zi=[Bi→0R(1)] has the same alternating class as the generator complex Fi, namely [Bi]−[R(1)], but H0(Zi)=Bi is free of rank two as a left R-module while H0(Fi)=Rsi(−1) is free of rank one, and H1(Zi)=R(1)≠0 while H1(Fi)=0; hence the two complexes are not homotopy equivalent, and equal classes in the split Grothendieck ring do not by themselves prove that two complexes are homotopy equivalent.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passOpen item page →

The Rouquier complex of a positive three-strand braid

Example

For the positive word σ1σ2∈B3 the Rouquier complex is F(σ1σ2)=[  B1⊗RB2→d0B1(1)⊕B2(1)→d1R(2)  ] with cohomological degrees 0,1,2 and differentials d0(x⊗y)=(x⋅ε2(y), ε1(x)⋅y),d1(a⊗r, s⊗b)=ε1(a)r−s ε2(b), under the evident identifications B1⊗RR(1)=B1(1), R(1)⊗RB2=B2(1) and R(1)⊗RR(1)=R(2); the example checks d1d0=0 on the four left-basis tensors u1⊗u2, u1⊗(1⊗α2), (1⊗α1)⊗u2, and (1⊗α1)⊗(1⊗α2) of B1⊗RB2, where ui=1⊗1 and records the cohomological and internal degree of every generator.

Facts & Assumptions

Given: The adjacent simple reflections s1,s2 of S3, the bimodules B1,B2 with the generators ui=1⊗1 of degree −1 and 1⊗αi of degree 1, and the complexes F1=[B1→ε1R(1)], F2=[B2→ε2R(1)] of The positive and negative Rouquier generator complexes.

[F1]

Generators and products. Bi has the left R-basis (1⊗1,1⊗αi) of degrees −1 and 1; the multiplication εi sends 1⊗1↦1 and 1⊗αi↦αi, and satisfies εi(r⊗r′)=rr′ (The positive and negative Rouquier generator complexes).

[F2]

Totalization. The signed tensor totalization of F1 and F2 has cohomological degree terms F0⊗G0=B1⊗RB2, F0⊗G1⊕F1⊗G0=B1(1)⊕B2(1) and F1⊗G1=R(2), with Koszul differential d(x⊗y)=dF(x)⊗y+(−1)px⊗dG(y) for x∈Fp (Bounded graded bimodule complexes and signed tensor totalization).

Verification

technique · direct
1.1F1F2

The degree-0 term is B1⊗RB2, of cohomological degree 0; the degree-1 term is F0⊗G1⊕F1⊗G0=B1⊗RR(1)⊕R(1)⊗RB2≅B1(1)⊕B2(1); the degree-2 term is R(1)⊗RR(1)≅R(2). The four basis monomials u1⊗u2, u1⊗(1⊗α2), (1⊗α1)⊗u2, (1⊗α1)⊗(1⊗α2) of B1⊗RB2 have internal degrees −2,0,0,2; the basis ui,1⊗αi of Bi(1) has degrees −2,0; and the generator of R(2) has degree −2.

2.1F2step 1.1

Under the identifications of step 1.1 the Koszul differentials are d0(x⊗y)=(x⋅ε2(y), ε1(x)⋅y)∈B1(1)⊕B2(1) and d1(a,s)=ε1(a)−ε2(s) computed in R(2), i.e. d1(a⊗r,s⊗b)=ε1(a)r−sε2(b) in the notation of the display; the minus sign is the Koszul sign on the differential from bidegree (1,0) to (1,1), where the first factor R(1) sits in cochain degree 1.

3.1F1step 2.1

For every simple tensor x⊗y∈B1⊗RB2 one computes d1d0(x⊗y)=ε1(x)ε2(y)−ε1(x)ε2(y)=0: the first component of d0(x⊗y) contributes ε1(x)ε2(y) and the second contributes the same product with the Koszul sign −1, so the two cancel. Since the differentials are balanced and R-bilinear, this extends to all elements, so d1d0=0.

4.1step 1.1step 3.1∎

The degree bookkeeping of step 1.1 shows that d0 and d1 are homogeneous of internal degree zero on the displayed generators, hence on all elements; this records the cohomological and internal degree of every generator of the three terms and completes the verification of the displayed formula.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passOpen item page →

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.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Normalized comparison maps around a relation loop

Example

Take the braid v=σ1σ2σ1=σ2σ1σ2∈B3 and three signed words representing it, for instance t=(1,2,1) and w=(2,1,2), together with the word u=(1,2,1,2,2−1) obtained from t by appending a cancelling pair; the three normalized maps γt,u,γu,w,γt,w form a loop in the expression graph, and the example verifies γu,w∘γt,u=γt,w by computing the three derived images ct,u,cu,w,ct,w and checking cu,wct,u=ct,w in Hom⁡Db(Rπ(v)(−3),Rπ(v)(−3))=Q⋅id. Here π(v)=s1s2s1∈S3 is the permutation projection and the common internal shift is (−3), since every word has signed exponent 3. The two comparison composites are displayed and each has its unique normalized degree-zero lift.

Facts & Assumptions

Given: The three signed words t=(1,2,1), u=(1,2,1,2,2−1), w=(2,1,2) of B3, their word complexes, and the normalized maps γ and derived comparisons c of Derived comparisons give unique normalized homotopy maps and Canonical comparisons between standard graph tensor products.

[F1]

Same braid. t, u and w all represent the braid v=σ1σ2σ1=σ2σ1σ2; u is obtained from t by adjoining the letters σ2σ2−1, whose product is the identity, so the product of u is v; the equality t=w is an Artin relation (The braid group by Artin presentation). The graph word tensors use their permutation projections and the comparison system of Canonical comparisons between standard graph tensor products.

[F2]

Uniqueness and dimension. For any two of these words, the homotopy Hom space is one-dimensional in internal degree 0 and the homotopy comparison is the unique element lifting the derived map c. (Derived comparisons give unique normalized homotopy maps)

[F3]

Transitivity. γu,wγt,u=γt,w and, in the derived category, cu,wct,u=ct,w. (Normalized comparison isomorphisms are transitive, Canonical comparisons between standard graph tensor products)

Verification

technique · direct
1.1F1F2

The three words represent the same braid by [F1], so the three maps γt,u,γu,w,γt,w are defined as elements of one-dimensional degree-zero homotopy Hom spaces; their derived images are the comparisons ct,u,cu,w,ct,w, each obtained by composing the multiplication maps from the shifted graph word tensors through Rπ(v)(−3).

2.1F1F2F3step 1.1algebra

Let Mt,Mu,Mw be the three tensor graph models and μa:Ma→Rπ(v)(−3) their iterated multiplication maps, with shifts adding to (−3). The cancelling pair in u contributes Rs2(−1)⊗RRs2(1)≅R, by b⊗c↦b s2(c), and its inverse sends 1↦1⊗1. Thus the typed comparisons are ct,u=μu−1μt:Mt→Mu, cu,w=μw−1μu:Mu→Mw and ct,w=μw−1μt:Mt→Mw. In particular cu,wct,u=μw−1μuμu−1μt=μw−1μt=ct,w,cw,tct,w=μt−1μwμw−1μt=1Mt. Transporting each comparison by its source and target multiplication maps gives the identity of the common graph model.

3.1F2F3step 2.1∎

Since cu,wct,u=ct,w by step 2.1 and the derived images of the two sides of the claim are these comparisons, and since the homotopy Hom space is one-dimensional in degree 0 by [F2], the composite γu,wγt,u has the same derived image as γt,w and therefore coincides with it. The two displayed composites therefore have the asserted unique normalized degree-zero lifts.

Remarks

The loop is nondegenerate: the three words are pairwise distinct, and u differs from t by a cancelling pair rather than being equal to it, so the composites displayed are computed by nontrivial comparisons. The identity obtained after transporting ct,u to the common graph model and the typed equality cu,wct,u=ct,w are the worked special case of the comparison system's transitivity.

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Equal Euler classes do not by themselves prove homotopy-equivalent complexes

Statement refuted

The following statement is refuted: two bounded complexes with terms in SBimn and the same alternating class in K0split(SBimn) are homotopy equivalent (equivalently, the Euler or Hecke class determines the homotopy type).

Facts & Assumptions

Given: A simple reflection si, the bimodule Bi=R⊗RsiR(1) with generators u=1⊗1 of degree −1 and w0=1⊗δi, δi=αi/2, the standard graph bimodule Rsi of Standard graph bimodules, support filtrations and characters, and the two-term complexes Zi=[Bi→ 0 R(1)] and Fi=[Bi→εiR(1)] of The positive and negative Rouquier generator complexes.

[F1]

Equal classes. χ(Fi)=[Bi]−[R(1)] in K0split(SBimn); the alternating class is the alternating sum of the term classes, so the zero-differential complex with the same two terms in the same cohomological degrees has the same class χ(Zi)=[Bi]−[R(1)], and under the identification Φ of the split Grothendieck ring with the Hecke algebra this class corresponds to Hi−v. (Euler classes of Rouquier complexes are homotopy invariant and multiplicative, Decategorification of a Rouquier complex is the Hecke braid generator)

[F2]

Cohomology of the generator complex. H0(Fi)=ker⁡εi≅Rsi(−1) and H1(Fi)=coker⁡εi=0, all other cohomology of Fi being zero. (Rouquier generator complexes have canonical derived graph models)

[F3]

Cohomology of the zero-differential complex. For the bounded complex Zi with zero differential, H0(Zi)=Bi, H1(Zi)=R(1) and all other cohomology is zero. (Cohomology object of a cochain complex)

[F4]

Left R-ranks. Bi is finite free of rank two as a left R-module, while Rsi and its shifts are free of rank one as left R-modules; an isomorphism of graded bimodules restricts to an isomorphism of left R-modules, and isomorphic free modules have equal rank. (The Soergel bimodule Bi of a simple reflection, Standard graph bimodules, support filtrations and characters)

[F5]

Invariance of cohomology. Homotopy equivalent complexes have isomorphic cohomology objects, because homology factors through the homotopy category. (Homology factors uniquely through the homotopy category, Complexes, homotopies and contractibility in an additive category)

Counterexample

As a counterexample take the zero-differential complex Zi:=[  Bi→ 0 R(1)  ] with Bi in cohomological degree 0 and R(1) in degree 1, and the Rouquier generator complex Fi=[Bi→εiR(1)]. Both have the same alternating class χ(Zi)=χ(Fi)=[Bi]−[R(1)]∈K0split(SBimn),Φ(χ(Zi))=Φ(χ(Fi))=Hi−v∈HSn, but H0(Zi)=Bi and H1(Zi)=R(1), whereas H0(Fi)=Rsi(−1) and H1(Fi)=0. Since Bi is free of rank two as a left R-module while Rsi(−1) is free of rank one, the two complexes are not quasi-isomorphic and hence, by homotopy invariance of cohomology, not homotopy equivalent. Thus the decategorification map loses the differential data already at the level of the generators.

Proof technique: direct.

1.1F1

The classes agree. By [F1] the generator complex has class χ(Fi)=[Bi]−[R(1)], and Zi has the same two terms in the same cohomological degrees with zero differential, so its alternating class is the same alternating sum, χ(Zi)=[Bi]−[R(1)]=χ(Fi); under Φ both correspond to Hi−v.

1.2F2F3F4

The cohomology differs. By [F3] H0(Zi)=Bi and H1(Zi)=R(1), whereas by [F2] H0(Fi)≅Rsi(−1) and H1(Fi)=0; in particular H1(Zi) is nonzero while H1(Fi)=0, and the two left R-modules H0(Zi) and H0(Fi) have different ranks.

2.1F4F5step 1.1step 1.2∎

They are not homotopy equivalent. By [F4] the left R-module Bi has rank two while Rsi(−1) has rank one, so H0(Zi)≇H0(Fi); independently H1(Zi)≇H1(Fi). If Zi and Fi were homotopy equivalent, [F5] would make their cohomology objects isomorphic, a contradiction; hence Zi≄Fi although their classes agree, which refutes the statement.

Remarks

The counterexample uses no choice. The same phenomenon is why the derived comparisons and the homotopy-category comparisons of this page must not be conflated: in the derived category the Rouquier complexes become isomorphic to shifted graph models, while in the homotopy category the differentials carry information that the alternating class forgets already for the generators. The statement refuted is the general claim; the example above does not refute the weaker statement that two complexes with equal class and equal cohomology are homotopy equivalent, which is not claimed here in either direction.

Sources