Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
1 to 4 of 4
Reposted from Math Overflow
Let with its cartesian monoidal structure.
Let be a -functor, and let be another -functor. Let be an object, and let .
Let be the left adjoint of the pullback -functor induced by (That is to say, for a V-functor , the functor is the left Kan extension of along ).
Then is a functor .
Why is the following true:
In terms of the pushout diagram
where and are the canonical injections:
We have an isomorphism of -functors
I think we can do something like this:
We have a diagram
Then we take the left Kan extension of by , but by one of the many variations of Yoneda’s lemma (computing via coends, this follows from Yoneda reduction), this is exactly .
Then it’s enough to show that the composite
(with the natural map ) has the required universal property, that is, that it is initial among fillers of the Kan extension diagram:
which is where I’m not sure how to proceed.
I just noticed that this is closely related to the calculus of exact squares and mates.
I bet that there’s some theorem that proves that pushout squares in -Cat are exact, since my question is equivalent to:
Is the natural Beck-Chevalley transformation an isomorphism?
Well, arbitrary pushout squares aren’t exact even when V=Set. Consider the pushout of discrete categories 1←2→1, which is 1. I don’t think you can fix that by taking homotopy pushouts either. But cocomma squares are, I believe, always exact for any V, although I could be misremembering.
Ah, thanks! You’re right. My original question was too generalized from the original source (therefore false). I e-mailed Lurie, and the answer hinges on some additional information (i.e. that the point p in my first post is a weak strict sink (or whatever the right term is) in the following sense: and for all (description is evil, but the point is adjoined formally in a strict way as well (up to equality)).
1 to 4 of 4