Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Opposite Rouquier generator complexes are homotopy inverse

Statement

Fi⊗RFi−1≃R≃Fi−1⊗RFi in Kb(Re-grmod), where R denotes the unit complex concentrated in cohomological degree 0 with zero differential. Explicitly, the signed tensor totalization of Fi and Fi−1 has terms Bi(−1) ⟶ Bi⊗RBi⊕R ⟶ Bi(1) in cohomological degrees −1,0,1; the rank-one splitting Bi⊗RBi≅Bi(1)⊕Bi(−1) exhibits two successive invertible differential blocks. Gaussian elimination splits off two contractible two-term complexes, leaving R in degree 0. The same argument with the factors exchanged gives Fi−1⊗RFi≃R. All scalars occurring in the contractions are units εi±1,2±1∈Q, so the homotopy classes do not depend on the signs of the chosen normalization.

Facts & Assumptions

Given: A simple reflection si, the bimodule Bi=R⊗RsiR(1) with the generators u=1⊗1 of degree −1 and w0=1⊗(αi/2) of degree 1, the generator complexes Fi=[Bi→εiR(1)], Fi−1=[R(−1)→ηiBi] of The positive and negative Rouquier generator complexes.

[F1]

The rank-one splitting. The invariant decomposition R=Rsi⊕αiRsi in the middle tensor factor gives a degree-zero bimodule isomorphism Bi⊗RBi≅Bi(1)⊕Bi(−1). The first summand is represented by r⊗1⊗r′ and the second by r⊗αi⊗r′. This is the middle-invariant and middle-αi decomposition of The rank-one Soergel bimodule square splits. The outer factors form R⊗RsiR; in particular the outer actions of αi need not be equal.

[F2]

The totalization. The signed tensor totalization K=Fi⊗RFi−1 has terms K−1=Bi(−1), K0=Bi⊗RBi⊕R, K1=Bi(1) and Koszul differential d(x⊗y)=dF(x)⊗y+(−1)px⊗dG(y); in particular d−1(x)=εi(x)+x⊗ηi(1) for x∈Bi(−1) and d0 is εi on the first tensor factor of Bi⊗RBi and −ηi on the R-summand (Bounded graded bimodule complexes and signed tensor totalization, The positive and negative Rouquier generator complexes).

[F3]

Gaussian elimination. If a cochain differential has an invertible block φ:U→V with respect to fixed biproduct decompositions Xn=A⊕U, Xn+1=B⊕V, then X≃Xˉ for the reduction Xˉ obtained by deleting U,V and replacing dn by its Schur complement, and X≅Xˉ⊕K with K=[U→φV] a contractible two-term complex (Gaussian elimination splits a contractible two-term complex, An invertible cochain differential block and its candidate reduction).

[F4]

Contractibility. A two-term complex [X→φY] with φ invertible is contractible, and homotopy equivalent complexes have the same homotopy class; ≃ is transitive (Complexes, homotopies and contractibility in an additive category).

Proof

technique · direct
1.1F2

The terms of K are as in [F2]: over degree −1 only Bi⊗R(−1)≅Bi(−1) contributes, over degree 0 the two summands Bi⊗Bi and R(1)⊗R(−1)≅R, and over degree 1 only R(1)⊗Bi≅Bi(1).

1.2F1F2algebra

Write E=R⊗RsiR⊗RsiR, suppressing the common internal shifts, and denote the three copies of αi by a,b,c. Let S=R⊗RsiR refer to the outer factors. Since b2=c2 and every invariant balances, E=S⊕Sb as an outer bimodule. The map 1⊗ηi sends a source element x to x(b+c). Because (b−c)(b+c)=0, its value is also x(a,c)(b+c): this is immediate on the right Rsi-basis 1,αi of the source and hence for every x. Its projection to the Sb summand is therefore the identity S→Sb under the shifted identification [F1]. This is the invertible block Bi(−1)→Bi(−1) of d−1. No equality between the outer a and c is used.

2.1F2F3step 1.2

Apply Gaussian elimination [F3] to that block. It removes the degree −1 term and the middle-αi summand, leaving a complex with Bi(1)⊕R in degree 0 and Bi(1) in degree 1. Its degree-zero differential is the restriction of the original d0 to the surviving summands: the preceding cancellation changes only the coordinates associated with the eliminated block, and d0d−1=0 ensures that its eliminated column is zero in the new coordinates.

3.1F1F2F3F4step 2.1

On the middle-invariant summand, εi⊗1 sends r⊗1⊗r′ to r⊗r′. Hence the block Bi(1)→Bi(1) of the remaining differential is the identity. A second application of [F3] cancels it and leaves only R in degree 0. Both canceled two-term complexes are contractible by [F4], so Fi⊗RFi−1≃R.

4.1F1F2F4step 3.1algebra∎

Taking the opposite bimodule interchanges left and right actions and reverses the order of a tensor product. On complexes, the identification (X⊗RY)op≅Yop⊗RXop sends a term of cohomological bidegree (p,q) with the sign (−1)pq; direct substitution in the signed tensor differential verifies that it is a chain isomorphism. Reversing the two factors of Bi preserves multiplication and the symmetric element αi⊗1+1⊗αi, so Fiop≅Fi and (Fi−1)op≅Fi−1. Applying this additive operation to the equivalence just proved gives Fi−1⊗RFi≃R.

Remarks

The proof follows the route of GKS Lemma 3.11: the tensor product is the displayed three-term complex, its four-term middle term splits by the rank-one square, and two successive Gaussian eliminations cancel the two contractible two-term pieces; the two surviving directions are R in degree 0. The two pivots use the middle-factor invariant decomposition; the two outer actions of αi are kept distinct. The ground field Q makes the invariant decomposition available and all normalization scalars invertible. Rouquier's alternative proof of Lemma 3.3 uses the adjoint pairs attached to the split sequence 0→Rsi→R→Rsi(2)→0 and Proposition 2.1 of the same paper; that route is not used here.

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