5
$\begingroup$

The Hammock localization $L^H \mathcal{C}$ of a relative category $(\mathcal{C},\mathcal {W})$ is a simplicial category defined by Dwyer and Kan as a way to compute the $\infty$-categorical localization or ordinary category, simpler than using what they call the "standard localization" (which boils down to localizing the bar resolution of $\mathcal{C}$).

It looks like a fairly natural construction, yet a little artificial as well. But I was thinking about it today and it strike me that it really feel like there should be a nice universal property. I'm really curious if the following is known, false, or if something like this is true.

Proposition: For any relative category $\mathcal{C}$, the simplicial category $L^H \mathcal{C}$ is the hom-wise nerve of a strict $2$-category, and it is the free strict $2$-category equipped with a functor $\mathcal{C} \to L^H\mathcal{C}$, such that each arrow $f$ in $\mathcal{W}$ has a right adjoint $f_*$ in $L^H\mathcal{C}(X,Y)$, and the canonical isomorphism $(fg)_* \simeq g_* f_*$ is actually an identity.

To be clear, what I claim in the first part is that each Hom-simplicial set of $L^H \mathcal{C}$ is a nerve, so that it can be identified with a strict 2-category.

Note: I no longer believe this to be the case in general - it probably is only true for some nice categories, like categories free on graphs. But I still want to understand this better!

$\endgroup$
3
  • 4
    $\begingroup$ Remark 3.2.5 in Riehl–Verity “Homotopy coherent adjunctions and the formal theory of monads” says that the hammock localization of a category with two objects and a single nonidentity arrow is the simplicial category Adj given by the free adjunction. $\endgroup$ Commented Sep 24, 2023 at 6:02
  • 3
    $\begingroup$ There attributed to Karol Szumilo $\endgroup$ Commented Sep 24, 2023 at 12:13
  • 3
    $\begingroup$ The paper adjoining adjoints by Dawson, Pare, and Pronk gives an explicit construction of the free strict 2-category generated by adding a right adjoint to each morphism of a 1-category. The 2-cells, called "fences", look somewhat like hammocks, and they do mention the similarity. $\endgroup$ Commented Sep 25, 2023 at 23:30

1 Answer 1

3
$\begingroup$

A connection between Dwyer–Kan hammock localizations and adjoints in 2-categories certainly exists. As already mentioned in the comments, as early as 2002, Dawson–Paré–Pronk in “Adjoining adjoints” made essentially the same type of an observation. In particular, the hammock localization of a category with two objects and a single nonidentity arrow is the simplicial category Adj given by the free adjunction. (Another written proof can be found in Riehl–Verity “Homotopy coherent adjunctions and the formal theory of monads”, Remark 3.2.5.)

That being said, one observation that makes establishing such a connection more difficult than it seems (but does not necessarily preclude it) is that simplicial sets of morphisms in a hammock localization need not be nerves of categories.

Counterexamples can be exhibited using free constructions. Consider a category with objects $\{0,1,2,3,A,B,F,G\}$, morphisms generated by $f:0→1$, $g:1→2$, $h:2→3$, $u:0→A$, $v:B→3$, weak equivalences $p:A→2$, $q:1→B$, $w:F→A$, $x:B→G$, with relations $pu=gf$, $vq=hg$.

Then the following two hammocks from~0 to~3, given by 1-simplices in the simplicial set of morphisms from~0 to~3, cannot be composed.

The first hammock is as follows.

  • The top row is $u:0→A$, $w:A←F$, $hpw:F→3$.
  • The middle vertical maps are $p:A→2$, $pw:F→2$.
  • The bottom row is $gf:0→2$, $\def\id{{\rm id}}\id:2←2$, $h:2→3$.

The second hammock is as follows.

  • The top row is $f:0→1$, $\id:1←1$, $hg:1→3$.
  • The middle vertical maps are $xq:1→G$, $q:1→B$.
  • The bottom row is $xqf:0→G$, $x:G←B$, $v:B→3$.

These two hammocks have matching source and target because of the following chain of equivalent rows:

  • $(gf:0→2,\id:2←2,h:2→3)$;
  • $(gf:0→2,h:2→3)$;
  • $(hgf:0→3)$;
  • $(f:0→1,hg:1→3)$;
  • $(f:0→1,\id:1←1,hg:1→3)$.

These two hammocks cannot be composed: any potential compositon hammock would have to decompose $u$ as a composition of morphisms that pass through an object weakly equivalent to 1, which is impossible.

$\endgroup$
8
  • $\begingroup$ Thanks, I'll need a bit of time to digest this completely, but just reading it, I'm confused by something: The second hammock seems like it is not a hammock, it has two successive column going to the right (the definition of Hammock impose that adjacent column go in opposite direction). It is not super clearly said in the nLab page, but this is very explicit in Dwyer and Kan's paper. Anyway, I'll go think about this more... $\endgroup$ Commented Sep 24, 2023 at 18:39
  • $\begingroup$ Ok, after more thought, I don't think that example works and I don't immediately see how to fix it (every time I replace the second thing by a Hammock I get a composition), but I'm starting to feel like the uniqueness of composition might fail in some cases and hence that you're general point is probably valid - I need to think more about this! $\endgroup$ Commented Sep 24, 2023 at 19:36
  • $\begingroup$ @SimonHenry: I fixed the second hammock by adding another zigzag. $\endgroup$ Commented Sep 24, 2023 at 20:57
  • $\begingroup$ @Dimitri I think These two can be composed. The composite 2-cell has 5 column, with the middle line doing $f: 0 \to 1$, $1 : 1 \leftarrow 1$, $g: 1 \to 2$, $1: 2 \leftarrow 2$ ,$h:2 \to 3$ $\endgroup$ Commented Sep 24, 2023 at 23:04
  • 1
    $\begingroup$ @SimonHenry: If I understood your maps correctly, the vertical morphisms from the first row to the second row would have to include the morphism f, which is not a weak equivalence. For example, in the top row, the first morphism is id:0→0 and in the second row the first morphism is f:0→1, so the first vertical morphism necessarily has to be f:0→1, which is not a weak equivalence and therefore does not yield a legitimate hammock. $\endgroup$ Commented Sep 25, 2023 at 15:37

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .