Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 v∈Bn choose a signed word t(v) representing it, taking t(1) to be the empty word, and put Gv:=F(t(v)), with G1:=R. For the action on Kb(R-grmod), set F1=Id⁡ and, for v≠1, set Fv:=Gv⊗R−. For v,w∈Bn let mv,w ⁣:Gv⊗RGw⟶Gvw 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 mv,w is γt(v)t(w), t(vw) in the normalization of Derived comparisons give unique normalized homotopy maps. Let m1 ⁣:G1→R be the identity of the unit complex. For v,w≠1, the compositor μv,w:FvFw⇒Fvw is induced by associating Gv⊗R(Gw⊗R−) to (Gv⊗RGw)⊗R− and then applying mv,w⊗R−, followed by the left-unit identification R⊗R−≅Id⁡ when vw=1. If either index is 1, use the canonical tensor unit identifications, so the compositor is the identity after those identifications; set u:F1⇒Id⁡ to the identity. Then (Fv,μv,w,u) is a coherent action of Bn on Kb(R-grmod) in the sense of Coherent action of a group on a category: the functors are the exact left tensor functors Gv⊗R− for v≠1, with the identity functor at 1, 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 0; both unit triangles hold by the canonical tensor unit identifications. Equivalently, v↦(Fv,μv,w,u) is a monoidal functor from the discrete strict monoidal category (Bn,⋅) to the strict monoidal category of endofunctors of Kb(R-grmod). The construction uses one chosen word per braid and no other choice; no choice principle is needed.

Facts & Assumptions

Given: A choice v↦t(v) of signed word for each braid v∈Bn, the word complexes Gv=F(t(v)), and the maps γ of Derived comparisons give unique normalized homotopy maps.

[F1]

Well-definedness of the mv,w. For any two choices of words for the same braid the normalized maps agree up to the transitive system, and for the concatenated words t(v)t(w) and t(vw) the class γt(v)t(w),t(vw) is the unique homotopy class with the prescribed derived image; hence mv,w 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)

[F2]

The relations. The generator complexes satisfy Fi⊗RFi−1≃R, 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)

[F3]

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)

[F4]

The model of a coherent action. A coherent action consists of functors Fg with F1=id, chosen compositors μf,g:FfFg⇒Ffg and a unit u satisfying the pentagon and the two unit triangles. (Coherent action of a group on a category)

Proof

technique · direct
1.1F1F2F3

For v,w∈Bn the composite Gv⊗RGw=F(t(v))⊗RF(t(w)) is a word complex for the concatenated word t(v)t(w), which represents vw; by [F2] it is canonically compared to Gvw=F(t(vw)), so the class mv,w of the statement exists as the normalized comparison and is a homotopy equivalence. If v,w≠1, associativity identifies FvFw with (Gv⊗RGw)⊗R−; tensoring mv,w with the input complex gives the compositor, followed by the left-unit identification when vw=1. If an index is 1, the canonical unit identification gives the identity compositor.

2.1F1F2step 1.1

The maps mv,w are compatible with replacing the representatives: if av:Gv→G~v are their normalized comparisons, then avwmv,w=m~v,w(av⊗aw), after canonical reassociation. Both sides have the same derived graph multiplication, so normalized uniqueness proves this equality in the correctly typed Hom space.

3.1F1F3step 2.1

Pentagon: after the associativity and unit identifications in [F3], the two composites from FvFwFu to Fvwu are induced by the two composites of normalized maps m from Gv⊗RGw⊗RGu to Gvwu. Their derived images are both the triple graph multiplication, so uniqueness in internal degree 0 makes them agree. This also covers unit indices, where the compositor is the canonical unit identification.

3.2F3F4step 2.1

Unit triangles: since t(1) is empty, the normalized comparisons mv,1 and m1,v are the identity under the right and left tensor unit isomorphisms, respectively. With F1=Id⁡ and u=id, these identifications give separately μv,1=Fvu and μ1,v=uFv, including v=1. Thus both unit axioms of [F4] hold.

4.1F2F4step 1.1step 2.1step 3.1step 3.2∎

By steps 1.1, 2.1, 3.1 and 3.2 the functors Fv and compositors μv,w satisfy the pentagon and both unit triangles of [F4]. Since each Gv has finite free terms on both sides, Gv⊗R− is exact on bounded complexes of finite graded projectives and descends to the derived category; the identity functor at 1 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

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