Category Theory
Zulip Server
Archive

You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.


Stream: learning: reading & references

Topic: Inverting to adjoint isomorphisms


view this post on Zulip Fernando Yamauti (Jan 14 2025 at 19:45):

Hi. Does anyone know if anyone has already studied free inversions of arrows into adjoint isomorphisms?

More precisely, it's known that the walking isomorphism of (,n)(\infty, n)-categories is not contractible, but it's variant with more additional data, the walking adjoint isomorphism, is supposed to always be contractible (https://arxiv.org/abs/2303.00567). On the other side, it seems that it's always the case one can individually upgrade isomorphisms to adjoint ones.

Now, one can consider a variant of localisation for some class of 11-cells WW in a (,n)(\infty, n)-category CC, C[Wadj]C [W^{-adj}], such that every arrow in WW becomes, instead, an adjoint isomorphism.

Has anyone ever studied before this variant of localisation? I'm particularly interested in conditions guaranteeing C[Wadj]C[W1]C [W^{-adj}] \cong C [W^{-1}] (maybe that's almost never the case, though).

view this post on Zulip Mike Shulman (Jan 14 2025 at 22:18):

The standard meaning of C[W1]C[W^{-1}] will always be equivalent to your C[Wadj]C[W^{-\mathrm{adj}}], because it refers to forcing 1-cells to have the property of being an isomorphism rather than the structure of a non-adjoint isomorphism.

view this post on Zulip Fernando Yamauti (Jan 14 2025 at 22:42):

Mike Shulman said:

The standard meaning of C[W1]C[W^{-1}] will always be equivalent to your C[Wadj]C[W^{-\mathrm{adj}}], because it refers to forcing 1-cells to have the property of being an isomorphism rather than the structure of a non-adjoint isomorphism.

I'm confused. I feel like I'm overseeing something extremely trivial. Let's restrict everything to (2,1)(2, 1)-cats. Shouldn't Δ1[Δ1]\Delta^1[\Delta^{-1}] and Δ1[Δadj]\Delta^1[\Delta^{-adj}] be respectively the walking isomorphism and the walking adjoint isomorphism? If so, the latter is always supposed to be equivalent to the terminal category, while the former cannot satisfy so according to Prop. 1.3.2 of the aforementioned paper...

view this post on Zulip Mike Shulman (Jan 15 2025 at 15:00):

No, as I said, Δ1[(Δ1)1]\Delta^1[(\Delta^1)^{-1}] means Δ1\Delta^1 with the morphism freely forced to have the property of being an isomorphism, which is equivalent to having the structure of an adjoint isomorphism.

view this post on Zulip Fernando Yamauti (Jan 15 2025 at 18:01):

Mike Shulman said:

No, as I said, Δ1[(Δ1)1]\Delta^1[(\Delta^1)^{-1}] means Δ1\Delta^1 with the morphism freely forced to have the property of being an isomorphism, which is equivalent to having the structure of an adjoint isomorphism.

Hmm... Let me see if I've got it. So the point is that every pair of 11-cells ff and gg together with 22-cells fg1fg \cong 1 and gf1gf \cong 1 can be modified to another one by changing the 22-cells so that the triangle identities are true. And that doesn't contradict the non-contractibility of the walking iso because liftings from an isomorphism datum to an adjoint isomorphism datum are not unique (if they were unique, the walking iso would be equivalent to the walking adjoint iso). Did I interpret your reply properly?

But, then, it seems that the usual localisation formula, where one takes pushouts along coproducts of the inclusions into walking isos Δ1Δiso1\Delta^{1} \rightarrow \Delta^{1}_{\text{iso}} can be instead computed using Δ1Δadj-iso11\Delta^{1} \rightarrow \Delta^{1}_{\text{adj-iso}} \cong 1... I'm skeptic that's always the case. Maybe I'm overseeing something again?

view this post on Zulip Mike Shulman (Jan 15 2025 at 18:12):

Fernando Yamauti said:

But, then, it seems that the usual localisation formula, where one takes pushouts along coproducts of the inclusions into walking isos Δ1Δiso1\Delta^{1} \rightarrow \Delta^{1}_{\text{iso}}

I don't know where you saw that, but that is not the correct localization formula when working with nn-categories for n>1n>1; you do have to use the walking adjoint isomorphism. My point was that this is what is generally meant by the notation C[W1]C[W^{-1}].

view this post on Zulip Mike Shulman (Jan 15 2025 at 18:14):

In other words, the version where you force things to become non-adjoint isomorphisms is the one that's a "variant" of localization, which I doubt anyone has studied very much.

view this post on Zulip Fernando Yamauti (Jan 15 2025 at 18:47):

Mike Shulman said:

I don't know where you saw that, but that is not the correct localization formula when working with nn-categories for n>1n>1; you do have to use the walking adjoint isomorphism. My point was that this is what is generally meant by the notation C[W1]C[W^{-1}].

Wait. I recall seeing written somewhere (I'm still trying to find it) that the simplicial localisation of a 11-cat could be computed using homotopy pushouts (in the Joyal model structure) along (the nerve of) inclusions of Δ1\Delta^1's into walking 11-isomorphisms (everything is a 11-cat here). That can't be correct then?

view this post on Zulip Mike Shulman (Jan 15 2025 at 18:51):

Ah! The nerve of the "walking isomorphism" 1-category is the walking adjoint (,1)(\infty,1)-isomorphism! This is kind of magic, but it's true.

view this post on Zulip Fernando Yamauti (Jan 15 2025 at 19:28):

Mike Shulman said:

Ah! The nerve of the "walking isomorphism" 1-category is the walking adjoint (,1)(\infty,1)-isomorphism! This is kind of magic, but it's true.

So that's the source of all my confusion until now! Btw, is that a general pattern? That is: for whatever geometric nerve from (m,m)(m, m)-cats and any nn, should it always be the case that applying the nerve and truncating to the homotopy (n,n)(n, n)-cat sends the "walking iso" mm-cat to the "walking adjoint iso" nn-cat? That seems to work for the Duskin nerve...

view this post on Zulip Mike Shulman (Jan 15 2025 at 19:43):

I would say that this operation should send the walking adjoint isomorphism mm-category to the walking adjoint isomorphism nn-category. It's just that for 1-categories, there is no difference between isomorphisms and adjoint isomorphisms.

view this post on Zulip Fernando Yamauti (Jan 15 2025 at 20:10):

Mike Shulman said:

I would say that this operation should send the walking adjoint isomorphism mm-category to the walking adjoint isomorphism nn-category. It's just that for 1-categories, there is no difference between isomorphisms and adjoint isomorphisms.

Ah! Ok. Thanks. Duh! Of course, if the triangle identities are not true, then there's no 33-cell in the Duskin nerve filling the boundary of the tetrahedron with two degenerated faces and one face for the (co)unity. So nothing weird happens as expected and all the usual nerves are good models for inclusions into higher dimensions (which should always be conservative, so no non-contractible object can become contractible).

view this post on Zulip Fernando Yamauti (Jan 16 2025 at 18:39):

Let me just add something that summarise why Δ1[(Δ1)1]Δadj-iso1\Delta^1 [(\Delta^{1})^{-1}] \cong \Delta^1_{\text{adj-iso}}. @Mike Shulman , let me know if I'm not spilling any bullshit.

The point is: if a ⁣:Δ1Ca \colon \Delta^1 \rightarrow C defines an arrow that happens to be invertible, then the space of choices of liftings of aa along the canonical inclusion Δ1Δiso1\Delta^1 \rightarrow \Delta^1_{\text{iso}} is not contractible, while there is exactly one unique lifting of aa (up to contractible space of choices) Δadj-iso1C\Delta^1_{\text{adj-iso}} \rightarrow C along the inclusion Δ1Δadj-iso1\Delta^1 \rightarrow \Delta^1_{\text{adj-iso}}. And all that is simply equivalent to the contractibility of Δadj-iso1\Delta^1_{\text{adj-iso}}!

That clarifies a fundamental misunderstanding I had regarding localisations of higher stuff.

view this post on Zulip Mike Shulman (Jan 16 2025 at 19:00):

Yes, that's right.