Alphabeta Math
LemmaStatement: 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.

Soergel generators and Bott–Samelson products are finite free on both sides

Statement

For each simple reflection si the graded (R,R)-bimodule Bi is free of rank two as a left R-module and free of rank two as a right R-module, with left basis {1⊗1, 1⊗αi} and right basis {1⊗1, αi⊗1}, both of degrees −1 and 1; and every Bott–Samelson tensor product Bi1⊗R⋯⊗RBir is finite free as a left R-module and finite free as a right R-module.

Facts & Assumptions

Given: The ring R=Q[x1,…,xn] graded by deg⁡xi=2, a simple reflection si with invariant ring Rsi, the anti-invariant element αi of the balanced normalization of The standard type-A reflection realization and its polynomial ring, so that si(αi)=−αi and αi=±(xi−xi+1), and the bimodule Bi=R⊗RsiR(1). Replacing αi by −αi negates the displayed basis elements and changes nothing else, so every statement below is also true with the coordinate root xi−xi+1 in place of αi.

[F1]

Bi=R⊗RsiR(1) is a graded (R,R)-bimodule with left action r′(r⊗r′′)=r′r⊗r′′, right action (r⊗r′′)r′=r⊗r′′r′, shifted so that (Bi)d=(R⊗RsiR)d+1, and 2 is invertible in Q, so that R=Rsi⊕αiRsi (The Soergel bimodule Bi of a simple reflection).

Proof

1.1F1

The decomposition R=Rsi⊕αiRsi is a direct sum of graded (Rsi,Rsi)-submodules, because the averaging idempotent e=12(1+si) satisfies e2=e, sie=esi=e and ker⁡e=(1−e)R=R(1−e) with 1−e=12(1−si); applied to any f this gives f=e(f)+(1−e)(f) with e(f)∈Rsi and (1−e)(f)=12(f−si(f))=12αi∂i(f)=δi∂i(f)∈αiRsi, by the formula ∂i(f)=αi−1(f−si(f)) and δi=αi/2.

2.1F1step 1.1

Left side: tensoring the decomposition of step 1.1 over Rsi in the right tensor slot gives the decomposition R⊗RsiR=(R⊗RsiRsi)⊕(R⊗RsiαiRsi) of graded left R-modules (the left action multiplies the first slot), with summands {r⊗1:r∈R} and {r⊗αir′:r∈R, r′∈Rsi}: the first is isomorphic to R as a graded left R-module through r⊗1↦r with inverse r↦r⊗1, and the second is free of rank one as a left R-module with generator 1⊗αi, hence isomorphic to R through r⊗αir′↦rr′ (well defined by the balanced relation r⊗αir′=(rr′)⊗αi for r′∈Rsi, and left R-linear because r′′(r⊗αir′)=r′′r⊗αir′), with inverse t↦t⊗αi. Hence the elements 1⊗1 and 1⊗αi form a graded left R-basis, of degrees 0 and 2 before the shift.

2.2F1step 1.1

Right side: since αiRsi⊆R is also an (Rsi,Rsi)-sub-bimodule, tensoring the decomposition of step 1.1 in the left tensor slot gives the decomposition R⊗RsiR=(Rsi⊗RsiR)⊕(αiRsi⊗RsiR) of graded right R-modules (the right action multiplies the second slot); the first summand is the set of elements r′⊗r with r′∈Rsi and is isomorphic to R through 1⊗r↦r with inverse r↦1⊗r, and the second summand is the set of elements αir′⊗r=αi⊗r′r with r′∈Rsi, free of rank one as a right R-module with generator αi⊗1 and isomorphic to R through αi⊗r↦r. Hence 1⊗1 and αi⊗1 form a graded right R-basis, again of degrees 0 and 2; note that 1⊗αi=(1⊗1)⋅αi is αi times the first basis element and is not a right-basis element.

3.1F1step 2.1step 2.2

Applying the external shift (1), which lowers degrees by one and preserves freeness with the same ranks, gives Bi≅R(−1)⊕R(1) as a graded left R-module and as a graded right R-module, with left basis 1⊗1 of degree −1 and 1⊗αi of degree 1 and right basis 1⊗1 of degree −1 and αi⊗1 of degree 1; in particular Bi is finite free of rank two on each side.

4.1F1step 3.1

Tensor products: if M is finite free as a left R-module with basis m1,…,ma and N is finite free as a left R-module with basis n1,…,nb, expand the second factor in its left basis first: N≅⨁qRnq as a left R-module, hence M⊗RN≅⨁qM as a left R-module via m⊗∑qrqnq↦(mrq)q. Expanding each copy of M in its left basis gives the left basis mp⊗nq; the inverse sends the (p,q)-th basis vector to that tensor. For right freeness, expand the first factor in its right basis and then the second factor in its right basis. These side-correct identifications respect homogeneous degrees, so an iterated tensor product of the Bi is finite free of rank 2r on each side.

5.1step 3.1step 4.1∎

Therefore Bi is free of rank two on both sides and every Bott–Samelson product Bi1⊗R⋯⊗RBir is finite free on both sides, with left and right bases obtained by tensoring the two-element bases of the factors and with degrees the sums of the factor degrees.

Depends on

Used by

Dependency tree · two levels

6 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