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 rank-two longest type-A Soergel bimodule
Definition
The parabolic. Keep with , the simple reflections and the invariants of The standard type-A reflection realization and its polynomial ring, and let . Put the parabolic subgroup generated by the two adjacent simple reflections and its invariant ring. The two generators act as adjacent transpositions on the three indicated coordinates and fix every other coordinate, so their restriction is an isomorphism by the generation clause of Type-A reduced words and the Coxeter presentation; the subgroup permutes the three coordinates and fixes every other coordinate, so is the ring of polynomials in that are invariant under all permutations of the three, with all other adjoined as invariants. The element is the longest element of , of length .
The bimodule. Define the balanced tensor product of the -bimodule with the -bimodule , with the total grading of the tensor product shifted by the external shift of The Soergel bimodule of a simple reflection, that is It is the rank-two longest type-A Soergel bimodule attached to . Equivalently in the internal notation of the library, and when and it is . The Bott–Samelson bimodule of the word is in the notation of The Bott–Samelson bimodule of a word.
Remark
(a) Why "longest". For adjacent the rank-two parabolic is finite of type , so by the description of the -valent vertex of Elias–Williamson (p. 6) the indecomposable bimodule indexed by the longest element of the parabolic occurs as a direct summand with multiplicity one in each of the two Bott–Samelson bimodules and ; the rank-two decomposition theorem of this page identifies that summand explicitly as , so that . The reader should not read this remark as a proof: the summand identification is the content of the next item on this page.
(b) The underlying rank. The ring is free as an -module of rank ; this is the classical Chevalley theorem for the rank-two parabolic, and in the case it is the isomorphism of -modules used in the source. Consequently , whose grading is shifted by , is a free graded -module of rank six on each side, with homogeneous basis degrees in the convention , ; as a graded left -module
(c) The rank-one analogue. For the parabolic of the single simple reflection is with longest element of length . Its analogous invariant-ring formula is of The Soergel bimodule of a simple reflection. This is the rank-one generator, not an instance of the rank-two notation , since two adjacent simple reflections do not exist for .
(d) Degenerate indices. For there is no pair of adjacent simple reflections, is undefined, and the notation is not used; the objects of the type-A Soergel categories of this page are then generated by the single (or by alone when ).
(e) Imported facts of Libedinsky used by the decomposition theorem. The rank-two decomposition theorem of this page imports the computation of Libedinsky's §4.4 for the triple product of the rank-two parabolic generated by ; in the type-A notation of this item, with , and the three coordinates , its content is the following. For the idempotent constructed from that computation, the image is generated as an -bimodule by the -tensor , and is generated as an -bimodule by together with . Moreover there is a graded homomorphism of -bimodules whose image is the sub-bimodule generated by the -tensor; since both sides are isomorphic to as graded left -modules, this homomorphism is an isomorphism onto . These four statements are quoted from Libedinsky, §4.4.1 and §4.4.2, and are used in the decomposition theorem of this page, not proved here.
Depends on
Used by
Dependency tree · two levels
11 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.4 and p. 6, PDF pp. 5–6, 24–27 (standard reference, not scraped)
- Libedinsky, Gentle Introduction to Soergel Bimodules I, §4.2, PDF pp. 21–24 (standard reference, not scraped)