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).
The basis over the parabolic invariant ring, with , , is proved in The rank-two longest type-A Soergel bimodule. Its reduction modulo positive-degree invariants has relations , .
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 natural map , , is balanced and has degree zero: a parabolic invariant slides across all three dividers. Its injectivity will follow from the explicit perfect trace pairing below, rather than by an assumed description of the complement.
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 .
Injectivity of the large-summand map. On put , a map of degree into the symmetric invariant ring. Explicitly, its value is the alternating sum of the six permuted inputs divided by : expanding the three operators gives this identity, and the alternating numerator is divisible by each of these distinct linear factors. Therefore it is symmetric and invariant-ring-linear. It sends to (successively the three operators give ) and kills polynomials of degree less than . The Gram determinant of in the six-element basis of [F5] is homogeneous of degree zero: the sum of the six basis degrees is , so every determinant term has degree . Evaluate at zero positive-degree invariants. Complementary degrees pair by in degrees and by the matrix in degrees , using and ; all noncomplementary pairings vanish. The determinant is nonzero. Thus the original determinant is a nonzero constant, and is a perfect pairing over the invariant ring. On the unshifted commutative tensor algebra underlying , successive rank-one traces give a right--linear map of degree . Indeed a rank-one trace sends to in the right-coefficient convention, and iterating gives . Termwise multiplication consequently gives equal to the scalar extension of the perfect pairing, for . If , all these pairings vanish, and perfection forces . Hence is injective.
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.
Its image lies in the complementary summand. The split projection from step 4.1 kills , because the middle polynomial entering is . By bimodule linearity it kills every . With the section , the identity shows , so . Thus injects into that complement.
Write for the degree of a homogeneous left- basis generator. The triple tensor has rank , while the split small summand has rank . Thus the complement has Hilbert series equal to the Hilbert series of times , precisely the series of the source of by the proved six-element basis. In each degree these vector spaces have equal finite dimension. The injection of step 5.1 is therefore surjective degree by degree, and is an isomorphism onto .
Conclusion: the injection and Hilbert-series comparison in the preceding injectivity and Hilbert-series calculations prove that 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
- Bott–Samelson words related by a braid need not be isomorphic bimodules Counterexample
- The type-A diagrammatic Soergel category and its candidate bimodule functor Definition
- The coinvariant algebra of S₃ as the Soergel bimodule of the longest element Example
- The rank-two Bott-Samelson bimodule BₛBₜ: character, decomposition and the braid relation Example
- The three-term Rouquier braid equivalence in type A2 Example
- The type A₂ rank-two Soergel decomposition Example
- Rouquier complexes satisfy the three-term braid relation Lemma
- The type-A diagrammatic relations hold for Soergel bimodules Lemma
- Simultaneous induction: Soergel's conjecture, hard Lefschetz and the Hodge-Riemann relations hold for all elements Theorem
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)