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.
Curve complexes intertwine the braid generators
Statement
Assume AC, used only for the induction over braid words, which reads a braid as a boundary-fixed mapping class acting on bigraded curves (Basic arcs, admissible curves and the standard normal form, with its Artin completeness and smooth comparison); each local intertwining isomorphism is a finite computation. For every and every admissible bigraded curve there is an isomorphism in where is the preferred lift of the half twist along acting on bigraded curves; the inverse-generator analogue holds as well. Consequently, for every braid presented by a word, the last isomorphism using for the normalized bigradings of the basic arcs.
Facts & Assumptions
Given: The complex of an admissible bigraded curve, the twist complex , the half twist along and its preferred lift , and a braid word .
is a bounded complex of finite graded projectives, the assignment is invariant under normal-form moves and the deck action acts by shifts (The complex of an admissible bigraded curve, The curve complex is a complex and is invariant under normal-form moves).
The functors satisfy for , , , and for ; these are the corner computations behind the Temperley–Lieb relations (Corner computations: the U_i satisfy the Temperley-Lieb relations).
For a bigraded -string of , the inclusion of graded modules is a direct summand in each degree, and the functor applied to it gives an inclusion of complexes whenever the crossings of support the differential components (Signed totalization of graded A_m-bimodule actions, The complex of an admissible bigraded curve).
The half twist acts on bigraded curves by the preferred lift , and the normal form of is obtained from that of by the local moves of Proposition 3.17, which change each -string to its half-twisted form and leave the rest fixed (Basic arcs, admissible curves and the standard normal form, The elementary geometric half twist, its support disc, and its opposite).
is the cone of the map induced by , and belongs to for every (The twist complexes R_i and R_i^{-1}, Signed totalization of graded A_m-bimodule actions).
For a word the complex is the iterated tensor product of the factors , and its functor is the composite (The complex of a braid word).
The positive and negative generator complexes are two-sided inverse up to bimodule homotopy, and their tensor functors preserve those homotopies (The generator complexes are mutually inverse).
Literature input. Khovanov–Seidel Proposition 4.4, Cases 1–5 (printed pp. 38–44) gives the string comparisons relative to the complement ; printed pp. 38–40 explain how the local homotopies extend. For type II, equations (4.7)–(4.8) and the map on printed p. 43 give , together with negation of the attached right tail. The source URL and exact section are in references.
Proof
Decomposition into -strings. Let be an admissible bigraded curve in normal form and fix . The direct sum decomposition of the graded module into its summands over crossings restricts, over the subsets of crossings lying in a single -string , to a direct sum decomposition . Applying , all summands with die by [L2], and for a composable pair of crossings in different -strings the induced map is zero: either one of the two crossings has , or both lie on and the differential is right multiplication by , which kills [L2]; hence as complexes.
The local intertwiners. For each of the finitely many types of bigraded -strings the source's case-by-case computation (the local lemmas and Cases 1-5 of the proof) writes as plus contractible two-term summands with explicit contracting homotopies: for a string of type this is the computation ; for the types the summand is acyclic; for the types the complex splits off acyclic complexes and the central folding is isomorphic to after the indicated sign isomorphisms, as displayed in the source comparisons [F1]. Those comparisons are relative to the outside complement . In particular, the type-II comparison sends to and negates the entire attached right tail (printed p. 43); it is not simply an identity on all outside summands. Composing these relative homotopy equivalences string by string, and step 1.1 gives .
The inverse-generator analogue. Apply step 2.1 to : it gives . Tensor with and use from [L7]. Thus . No additional inverse case computation is needed.
Induction over braid words. Let be a word. By [L6] the functor is the composite of the factors; inducting over the length of the word using steps 2.1 and 3.1 (and the composition of the induced natural isomorphisms) gives for the action of the braid on bigraded curves through the preferred lifts, which is well defined by the braid/mapping-class dictionary and uses AC exactly there. Applying this to and using that the basic arc has no essential segments, so that is a single summand for the normalized bigradings, gives .
Conclusion. The generator complexes intertwine the half-twist action on bigraded curves, and consequently the braid-word complexes intertwine the braid action; the last isomorphism identifies with the complex of the twisted basic arc. The local computations are finite and AC is used only in the final word induction.
Depends on
- The complex of an admissible bigraded curve
- Basic arcs, admissible curves and the standard normal form
- The Axiom of Choice
- The curve complex is a complex and is invariant under normal-form moves
- The twist complexes R_i and R_i^{-1}
- The generator complexes are mutually inverse
- The complex of a braid word
- The elementary geometric half twist, its support disc, and its opposite
- Braid group as boundary-fixed punctured-disk mapping classes
- Corner computations: the U_i satisfy the Temperley-Lieb relations
- Signed totalization of graded A_m-bimodule actions
Used by
Dependency tree · two levels
60 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.