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 and the generators be as in The Soergel bimodule of a simple reflection. For a word in the simple reflections, i.e. a sequence with , put the iterated balanced tensor product of graded -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 we put , the regular graded -bimodule; this is the unit of the tensor product, so the two conventions agree and . The word is reduced when has length . The notation retains the chosen word even when that word is reduced: two reduced words for the same can give nonisomorphic Bott–Samelson bimodules. The word-independent indecomposable summand indexed by is constructed later; it is not the whole in general. The freeness of each 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 the empty word is the only word and only is present. The word itself is never claimed to be visible from the isomorphism type of : 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
- The rank-two longest type-A Soergel bimodule Definition
- The type-A diagrammatic Soergel category and its candidate bimodule functor Definition
- The type-A Soergel category SBimₙ Definition
- Frobenius biadjunction for the type-A Soergel generators Lemma
- The rank-one Soergel bimodule square splits Lemma
- Double leaves form graded R-bases of type-A diagrammatic Hom spaces Theorem
- Evaluated double leaves form bases of type-A Soergel bimodule homs Theorem
- Rank-two type-A Soergel bimodule decompositions Theorem
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
- Elias–Williamson, Soergel Calculus, §§3, 5–7 (standard reference, not scraped)
- Libedinsky, Gentle Introduction to Soergel Bimodules I, §§2–5 (standard reference, not scraped)