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 the graded -bimodule is free of rank two as a left -module and free of rank two as a right -module, with left basis and right basis , both of degrees and ; and every Bott–Samelson tensor product is finite free as a left -module and finite free as a right -module.
Facts & Assumptions
Given: The ring graded by , a simple reflection with invariant ring , the anti-invariant element of the balanced normalization of The standard type-A reflection realization and its polynomial ring, so that and , and the bimodule . Replacing by negates the displayed basis elements and changes nothing else, so every statement below is also true with the coordinate root in place of .
is a graded -bimodule with left action , right action , shifted so that , and is invertible in , so that (The Soergel bimodule of a simple reflection).
Proof
The decomposition is a direct sum of graded -submodules, because the averaging idempotent satisfies , and with ; applied to any this gives with and , by the formula and .
Left side: tensoring the decomposition of step 1.1 over in the right tensor slot gives the decomposition of graded left -modules (the left action multiplies the first slot), with summands and : the first is isomorphic to as a graded left -module through with inverse , and the second is free of rank one as a left -module with generator , hence isomorphic to through (well defined by the balanced relation for , and left -linear because ), with inverse . Hence the elements and form a graded left -basis, of degrees and before the shift.
Right side: since is also an -sub-bimodule, tensoring the decomposition of step 1.1 in the left tensor slot gives the decomposition of graded right -modules (the right action multiplies the second slot); the first summand is the set of elements with and is isomorphic to through with inverse , and the second summand is the set of elements with , free of rank one as a right -module with generator and isomorphic to through . Hence and form a graded right -basis, again of degrees and ; note that is times the first basis element and is not a right-basis element.
Applying the external shift , which lowers degrees by one and preserves freeness with the same ranks, gives as a graded left -module and as a graded right -module, with left basis of degree and of degree and right basis of degree and of degree ; in particular is finite free of rank two on each side.
Tensor products: if is finite free as a left -module with basis and is finite free as a left -module with basis , expand the second factor in its left basis first: as a left -module, hence as a left -module via . Expanding each copy of in its left basis gives the left basis ; the inverse sends the -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 is finite free of rank on each side.
Therefore is free of rank two on both sides and every Bott–Samelson product 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
- The Bott–Samelson bimodule of a word 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
- Frobenius biadjunction for the type-A Soergel generators Lemma
- The rank-one Soergel bimodule square splits Lemma
- The type-A character recursion under simple Soergel tensoring Lemma
- Rank-two type-A Soergel bimodule decompositions Theorem
- The type-A Soergel Hom formula Theorem
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
- Elias–Williamson, Soergel Calculus, §§3, 5–7 (standard reference, not scraped)
- Soergel, Kazhdan–Lusztig-Polynome und unzerlegbare Bimoduln, §§5–6 (standard reference, not scraped)