- - | (A1, ..., Ak-1, RAk,B1, B2, ..., Bl), | | ..., | |(A1, ..., Ak-1, B1, ..., Bl-1, RAk,Bl),| | . | | . | . | . | | (RA1,B1, B2, ..., Bl, A2, ..., Ak), | | ..., | | (B1, ..., Bl-1, RA1,Bl, A2, ..., Ak) | - -
Theorem The arrows RA,B form part of the data for a (somewhat weak or strict) braiding on br(C, Z, R, S).
Because a (somewhat weak or strict) braiding on a (strict) monoidal 2-category gives a (weak or strict) Zamolodchikov system on C consisting of all objects of C, the arrows RA,B (, the 2-arrows R~(A|B,C) and R~(A,B|C)) and the 2-arrows SA,B,C = RA,RB,C = RRA,B,C [hmpz], the theorem completes the lowest-dimensional part of the
Conjecture There is a triadjunction
<--
br: ZA2-Cat BM2-Cat :za
-->
which restricts to a triequivalence between (strict) monoidal 2-categories
with a (weak or strict) Zamolodchikov system on all non-unit objects and
(somewhat weak or strict) braided monoidal 2-categories
in which the arrows and 2-arrows are generated by the
RA,B's and RA,RB,C's.
A more extensive abstract of this talk is available as a ps-file.