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 complexes form a coherent braid group action
Statement
For every braid choose a signed word representing it, taking to be the empty word, and put , with . For the action on , set and, for , set . For let be the unique homotopy class whose derived image is the graph-multiplication comparison, transported through the associativity and unit isomorphisms of Bounded bimodule tensor is associative, unital, and compatible with cones; equivalently is in the normalization of Derived comparisons give unique normalized homotopy maps. Let be the identity of the unit complex. For , the compositor is induced by associating to and then applying , followed by the left-unit identification when . If either index is , use the canonical tensor unit identifications, so the compositor is the identity after those identifications; set to the identity. Then is a coherent action of on in the sense of Coherent action of a group on a category: the functors are the exact left tensor functors for , with the identity functor at , and both composites of every pentagon have the same derived image, namely the same associative graph multiplication, so the pentagon commutes by uniqueness in degree ; both unit triangles hold by the canonical tensor unit identifications. Equivalently, is a monoidal functor from the discrete strict monoidal category to the strict monoidal category of endofunctors of . The construction uses one chosen word per braid and no other choice; no choice principle is needed.
Facts & Assumptions
Given: A choice of signed word for each braid , the word complexes , and the maps of Derived comparisons give unique normalized homotopy maps.
Well-definedness of the . For any two choices of words for the same braid the normalized maps agree up to the transitive system, and for the concatenated words and the class is the unique homotopy class with the prescribed derived image; hence is independent of the auxiliary choices of the words used to define the concatenation, by transitivity. (Normalized comparison isomorphisms are transitive, Derived comparisons give unique normalized homotopy maps)
The relations. The generator complexes satisfy , the three-term relation and far commutativity, so the word complex attached to any two words for the same braid is independent of the word up to the canonical comparisons. (Opposite Rouquier generator complexes are homotopy inverse, Rouquier complexes satisfy far commutativity, Rouquier complexes satisfy the three-term braid relation)
Associativity and units of the tensor. The balanced tensor totalization is associative and unital up to canonical chain isomorphisms satisfying the pentagon and unit triangles, and compatible with cones. (Bounded bimodule tensor is associative, unital, and compatible with cones)
The model of a coherent action. A coherent action consists of functors with , chosen compositors and a unit satisfying the pentagon and the two unit triangles. (Coherent action of a group on a category)
Proof
For the composite is a word complex for the concatenated word , which represents ; by [F2] it is canonically compared to , so the class of the statement exists as the normalized comparison and is a homotopy equivalence. If , associativity identifies with ; tensoring with the input complex gives the compositor, followed by the left-unit identification when . If an index is , the canonical unit identification gives the identity compositor.
The maps are compatible with replacing the representatives: if are their normalized comparisons, then , after canonical reassociation. Both sides have the same derived graph multiplication, so normalized uniqueness proves this equality in the correctly typed Hom space.
Pentagon: after the associativity and unit identifications in [F3], the two composites from to are induced by the two composites of normalized maps from to . Their derived images are both the triple graph multiplication, so uniqueness in internal degree makes them agree. This also covers unit indices, where the compositor is the canonical unit identification.
Unit triangles: since is empty, the normalized comparisons and are the identity under the right and left tensor unit isomorphisms, respectively. With and , these identifications give separately and , including . Thus both unit axioms of [F4] hold.
By steps 1.1, 2.1, 3.1 and 3.2 the functors and compositors satisfy the pentagon and both unit triangles of [F4]. Since each has finite free terms on both sides, is exact on bounded complexes of finite graded projectives and descends to the derived category; the identity functor at is exact as well. Thus these data define the asserted coherent braid group action. The representative system can be specified without a choice axiom: order the finite signed alphabet and take the shortest, then lexicographically least word in each nonempty braid class. The construction uses this system or any given representative system.
Depends on
- Coherent action of a group on a category
- Normalized comparison isomorphisms are transitive
- Bounded bimodule tensor is associative, unital, and compatible with cones
- Opposite Rouquier generator complexes are homotopy inverse
- Rouquier complexes satisfy far commutativity
- Rouquier complexes satisfy the three-term braid relation
- The Rouquier complex of a braid word
- Derived comparisons give unique normalized homotopy maps
Used by
Dependency tree · two levels
41 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)