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.
Rank-two type-A Soergel bimodule decompositions
Statement
Let , put , and write . Then there are degree-zero isomorphisms of graded -bimodules with no additional grading shift on any summand, where is the rank-two longest bimodule of The rank-two longest type-A Soergel bimodule. On split Grothendieck classes the two decompositions read and .
Facts & Assumptions
Given: Adjacent indices , the simple reflections , , the coordinate roots and , the coordinate Demazure operator , and the graded -bimodules . The two roots and the second dot used in the four maps below are in the coordinate (length) normalization of The standard type-A reflection realization and its polynomial ring, written only inside this item; they are not the balanced roots of that item, and the diagrammatic generator normalization developed later on this page uses the balanced root: . The coordinate operator is related to the balanced one by . Thus the root insertions and Demazure contractions acquire a factor when written in the balanced normalization, while multiplication and unit insertion do not. Since , the zig-zag composite changes from to . Accordingly, if bars denote the balanced maps, the balanced idempotent is ; this is the same endomorphism as the coordinate idempotent . The decomposition is therefore normalization-independent, although identifying these maps with the fixed six-valent diagrammatic generator requires this translation.
with , left action and right action , the graded left -module isomorphism ; the coordinate operator is -linear and satisfies for (The standard type-A reflection realization and its polynomial ring, The Soergel bimodule of a simple reflection).
is finite free of rank two as a left -module and as a right -module (Soergel generators and Bott–Samelson products are finite free on both sides).
is free over with basis : every has a unique expression with , and ; the action of on is given by and fixes for (The standard type-A reflection realization and its polynomial ring).
for the parabolic of the three coordinates , and as a graded left -module ; the Bott–Samelson bimodule of the word is (The rank-two longest type-A Soergel bimodule, The Bott–Samelson bimodule of a word).
Imported identification (Libedinsky, §4.4.1, for the rank-two example with and ): for the idempotent of step 3.1 the image is generated as an -bimodule by the -tensor of , and is generated as an -bimodule by together with ; the two-sided ideal of relations here is the balanced one of (The rank-two longest type-A Soergel bimodule).
Proof
The four maps: define -bimodule maps by , by , by and by , and let be the same constructions for .
Degrees: and have degree and have degree : an element of of degree is an element of of degree by , so has degree in , and have degree in because and has degree , and lowers degrees by .
Balancedness of the four maps: and are visibly balanced in the middle slots; is balanced because is -linear, so and for , whence and .
The adjoint is well defined: a map out of the regular bimodule must send to the same element through and , so it suffices that commutes with . Every is with by [F3], and elements of slide across the tensor divider and commute with . For the remaining generator , one has and ; these are equal because . Thus for every , and is a well-defined -bimodule map of degree because has degree .
The large summand: by [F5] is generated as an -bimodule by inside ; the assignment is a well-defined degree-zero -bimodule map from because an element is both - and -invariant and therefore slides across both dividers of . It is surjective onto because the bimodule generated by is the set of finite sums of elements with , the images of finite sums of .
The composite identity: for the adjacent pair, because exchanges and and fixes every other coordinate, so . Applying to , the successive images are under , then under the middle-slot insertion , then under the middle-slot multiplication , and finally under ; hence .
The idempotent: with the identities understood in the sense of tensor slots (as in the sources), let ; then by step 2.1, so is an idempotent, and it is homogeneous of degree by step 1.2.
The splitting and its small summand: is an idempotent orthogonal to , so the graded bimodule splits as . The composite identity of step 2.1 makes a left inverse to , so without a separate injectivity or surjectivity claim; the comparison has degree zero by step 1.2.
Graded dimension count: let record the degree of a homogeneous free left- generator. By [F1] and [F2], and each have graded left- rank , and their tensor product has rank . By step 4.1 the Hilbert series of the complementary summand is the Hilbert series of times . This is also the Hilbert series of from [F4]. Thus the surjection of step 1.5 compares -vector spaces of equal finite dimension in every degree.
Conclusion: a graded surjection that is a comparison of finite-dimensional -vector spaces of equal dimension in each degree is an isomorphism, so with a degree-zero identification; combined with step 4.1 this gives . The second decomposition is the same argument with and interchanged, the identity being symmetric, so . ∎
Depends on
- The type-A Soergel category $\mathrm{SBim}_n$
- The rank-two longest type-A Soergel bimodule
- Soergel generators and Bott–Samelson products are finite free on both sides
- The Soergel bimodule $B_i$ of a simple reflection
- The standard type-A reflection realization and its polynomial ring
- The Bott–Samelson bimodule of a word
Used by
Dependency tree · two levels
12 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
- Libedinsky, Gentle Introduction to Soergel Bimodules I, §4.3–4.4, PDF pp. 22–26 (standard reference, not scraped)
- Elias–Williamson, Soergel Calculus, §3.4 and p. 6, PDF pp. 5–6, 24–27 (standard reference, not scraped)