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 Soergel bimodule of a simple reflection
Definition
The bimodule. Keep the ring with , the simple reflections and the invariants of The standard type-A reflection realization and its polynomial ring, and recall that is a graded -bimodule and that shifts are defined as in Associative graded algebras, bimodules, and internal shifts. For put the balanced tensor product (The tensor product from the additive group underlying the free -module on , elementary tensors, and finite tensor sums) of the -bimodule with the -bimodule , equipped with the total internal grading of the tensor product and then shifted so that In the notation of Elias–Williamson the shift has , so ; in the library convention this is , i.e. for every integer . Both conventions appear on this page, and every shifted formula is read through this dictionary; when no ambiguity is possible we write .
The two outer actions. The left -action is and the right -action is ; both descend to the balanced tensor product, they commute, they are homogeneous of degree , and they satisfy -linearity on the relevant side, so is a graded -bimodule over -balanced tensors. Explicitly, the -bimodule is generated by the two elements and , which are homogeneous of degrees and respectively: is a degree- element of and the external shift moves degrees by .
Elementary structure. Since is invertible in , we have the decomposition (the averaging idempotent and its complement), so as a graded left -module and again as a graded right -module and is finite free of rank two on each side. The Demazure operator of The standard type-A reflection realization and its polynomial ring is -linear and surjective onto , and for , a fact used when the exact sequences of are displayed later on this page.
Small . For or there are no simple reflections and no . The only word is the empty word, with bimodule ; the additive graded Bott–Samelson category contains all finite direct sums of shifts of and all degree-zero bimodule maps between them.
Depends on
Used by
- Standard graph bimodules, support filtrations and characters Definition
- The Bott–Samelson bimodule of a word Definition
- The rank-two longest type-A Soergel bimodule Definition
- The type-A diagrammatic Soergel category and its candidate bimodule functor Definition
- The rank-one Soergel category Example
- The type A₂ rank-two Soergel decomposition Example
- Bott–Samelson bimodules carry delta and nabla support filtrations Lemma
- Distant Soergel generators commute Lemma
- Frobenius biadjunction for the type-A Soergel generators Lemma
- Soergel generators and Bott–Samelson products are finite free on both sides Lemma
- The rank-one Soergel bimodule square splits Lemma
- The type-A character recursion under simple Soergel tensoring Lemma
- The type-A diagrammatic relations hold for Soergel bimodules Lemma
- Rank-two type-A Soergel bimodule decompositions Theorem
Dependency tree · two levels
13 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)