0NBC
Proof. For a lasagna diagram (as in Figure 2) we define a homomorphism
|
|
|
as follows. We first choose points and and then a properly embedded 1-complex , disjoint from
, such that the underlying graph of is a tree and the endpoints of the 1-complex are
. Choose a small closed tubular neighborhood of , also disjoint from . The
complement of in is diffeomorphic to with some
embedded surface . We will view as a bordism between two links in two copies of
. One copy is identified with , which contains the link . The other
copy is the remainder of the boundary, and can be expressed as the boundary connect sum of the
3-balls , connected along the tree . The 3-ball contains
the split disjoint union of the links . Khovanov–Rozansky homology for links in 3-balls gives us a
map
|
|
|
which, together with the monoidality maps from §4.3, specifies a map
|
|
|
|
Here the first and last maps are the ‘evaluation’ isomorphisms discussed below Definition 4.12,
and we highlight that the monoidality map depends on the tree .
We must check that the overall map above does not depend on the choices of and . This is
straightforward, so we merely sketch the argument. Isotoping the points does not change the
map, by the same argument that showed that is well-defined for links in 3-spheres; see
§4.2. Isotoping disjointly from clearly does not affect the map.
Changing the combinatorics of the underlying tree of can be done in such a way that varies
continuously and remains far from , and so does not affect the map. Isotoping through
does not affect the map, thanks to the sweep-around property (see
Theorem 1.1 above). Thus is well-defined.
Next we must show compatibility with the operad composition. For this we consider three lasagna diagrams:
- •
with output boundary , with input boundaries , surface , and tree ,
- •
with output boundary , with input boundaries
along with , surface , and tree
- •
, the result of gluing inside , with outer boundary , input boundary ,
surface , and tree .
Compatibility with the operad composition now boils down to the claim:
|
|
|
as maps
|
|
|
We compare these two homomorphisms on the level of 3-ball link homologies, that is, with respect to a fixed choice
of basepoints and , and we suppress associators. On this level is determined by the homomorphism
| (5.1) |
|
|
|
where denotes the boundary connect sum of the 3-balls for along the tree , and the first map is provided by
lax monoidality. On the other hand, the homomorphism is determined by the composite
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Here we write for the boundary connect sum of the 3-balls
for that is determined by , and
for the boundary connect sum of the for
along . After commuting the map induced by past the second
monoidality map, we arrive at
| (5.2) |
|
|
|
Since the link cobordism is isotopic to ,
the functoriality of implies that the maps in (5.1) and (5.2) are equal. This proves the claim.
∎