Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 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 Bott–Samelson bimodule of a word

Definition

Let R and the generators Bi=R⊗RsiR(1) be as in The Soergel bimodule Bi of a simple reflection. For a word i‾=(i1,…,ir) in the simple reflections, i.e. a sequence with 1≤ik≤n−1, put Bi‾:=Bi1⊗RBi2⊗R⋯⊗RBir, the iterated balanced tensor product of graded (R,R)-bimodules, carrying the total internal grading, the outer left action on the first factor and the outer right action on the last factor. For the empty word r=0 we put B∅:=R, the regular graded (R,R)-bimodule; this is the unit of the tensor product, so the two conventions agree and B(i)=Bi. The word i‾ is reduced when si1⋯sir∈Sn has length r. The notation Bi‾ retains the chosen word even when that word is reduced: two reduced words for the same w can give nonisomorphic Bott–Samelson bimodules. The word-independent indecomposable summand indexed by w is constructed later; it is not the whole Bi‾ in general. The freeness of each Bi‾ on both sides is proved in Soergel generators and Bott–Samelson products are finite free on both sides. Every element of a Bott–Samelson product is a finite sum of tensors of homogeneous elements, with degrees adding.

Trivial conventions. If n≤1 the empty word is the only word and only B∅=R is present. The word itself is never claimed to be visible from the isomorphism type of Bi‾: two words related by a Coxeter braid move need not give isomorphic bimodules, and the rank-two decompositions of the adjacent triple products are the point where this is computed on this page.

Depends on

Used by

Dependency tree · two levels

5 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