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.
Rouquier generator complexes have canonical derived graph models
Statement
For every the generator complexes of The positive and negative Rouquier generator complexes are canonically isomorphic in the bounded derived category to shifts of standard graph bimodules: the isomorphisms being induced by the quasi-isomorphisms below. More generally, for a signed word with product and exponent sum , where is the iterated signed tensor totalization and is the standard graph bimodule. All isomorphisms are obtained from the comparison system of Canonical comparisons between standard graph tensor products and do not depend on the chosen words beyond their permutation product and exponent sum, with the displayed graph models and fixed generator maps understood.
Facts & Assumptions
Given: A simple reflection , the bimodule with generators (degree ) and , , the element , and the complexes of The positive and negative Rouquier generator complexes.
The two exact sequences. The multiplication is a surjective degree-zero bimodule map with and , and with a graded sub-bimodule generated in degree ; the map is injective and the quotient is generated by the image of with right action , so that it is isomorphic to ; here satisfies and (Standard graph bimodules, support filtrations and characters, The positive and negative Rouquier generator complexes).
Two canonical chain maps. The assignment defines a degree-zero bimodule map , concentrated in cohomological degree ; it is a chain map because . The assignment defines the twisted multiplication , , a degree-zero bimodule map with ; on the quotient it induces the identification with and defines a chain map , concentrated in cohomological degree . (Standard graph bimodules, support filtrations and characters, Canonical comparisons between standard graph tensor products)
Cohomology of the generator complexes. , , and , ; both complexes are otherwise concentrated in the displayed degrees. [F1]
Localization. The localization functor sends quasi-isomorphisms to isomorphisms, and tensor totalization with a bounded complex of bimodules flat on the tensoring side preserves quasi-isomorphisms. Here all generator complexes and graph models are flat on both sides: the former have finite-free terms and the latter are twisted rank-one regular modules. Consequently the tensor comparisons used below are compatible with localization (The localization functor sends quasi isomorphisms to isomorphisms, Derived category of an abelian category, Bounded above flat tensor complexes preserve quasi isomorphisms).
Multiplication of graph bimodules. The balanced assignment , , is a degree-zero isomorphism of graded bimodules with inverse ; shifts satisfy (Canonical comparisons between standard graph tensor products, Standard graph bimodules, support filtrations and characters).
Proof
The map of [F2] is a chain map between the complexes concentrated in degree and in degrees : the only condition is that the composite of with the differential vanishes, which holds since by [F1]. It is a bimodule map: for one has and by [F1], and -linearity on the left is clear.
Comparing with [F3], induces the identity identification (up to the unit ) and there are no other cohomology groups on either side; hence is a quasi-isomorphism, and so is between and .
By [F4] the quasi-isomorphisms become isomorphisms in , giving and .
For a signed word, tensoring the isomorphisms of step 3.1 over and using that the totalization of bimodule complexes is compatible with localization in each variable [F4], together with the shift computation and the multiplication isomorphism of [F5] iterated over the word, gives in .
With the generator maps fixed, tensor their derived isomorphisms (using for a positive letter and for a negative letter), then compose with the graph multiplication of [F5]. This specifies the word map to with its full shift retained; no replacement of by the length of a reduced permutation word is made. Associativity of graph multiplication makes this construction compatible with the canonical rebracketings. Comparisons between different word models are obtained by composing their specified isomorphisms through this common target when their permutation and exponent agree.
Remarks
This is Rouquier's §3.2.1 and §3.2.4 identification of the generators with the standard graph bimodules, in the library normalization: the unit scalar and the shifts are the exact dictionary entries, so no unit factors are dropped. The word statement is proved here because the later uniqueness and decategorification arguments use the identification in as a consequence of the comparison system. The statement is a derived-category statement; it does not assert that is a homotopy equivalence, and no homotopy-category identification is made here.
Depends on
- The positive and negative Rouquier generator complexes
- Canonical comparisons between standard graph tensor products
- Standard graph bimodules, support filtrations and characters
- Derived category of an abelian category
- The localization functor sends quasi isomorphisms to isomorphisms
- Bounded above flat tensor complexes preserve quasi isomorphisms
Used by
Dependency tree · two levels
25 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
- Raphaël Rouquier, Categorification of the braid groups, arXiv:math/0409593v1 (30 September 2004), §3 "The 2-braid group" (standard reference, not scraped)
- Eugene Gorsky, Oscar Kivinen, José Simental, Algebra and geometry of link homology: Lecture Notes from the IHES 2021 Summer School, Bull. London Math. Soc. 55 (2023) 537-591, §3.1 (standard reference, not scraped)