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: theory: category theory

Topic: Pullbacks of Cartesian-closed categories


view this post on Zulip Bernd Losert (Oct 06 2024 at 10:55):

Say you have two concrete categories (A, U) and (B, V) over some category X and you take the pullback of U and V. If A and B are Cartesian-closed, I was wondering if the pullback is also Cartesian-closed.

One problem I immediately ran into when trying to prove this was that the pullback is too strict and it's better to work with weak pullbacks to avoid issues with equality when you only have isomorphisms.

However, I haven't been able to make any progress. Can't think of an obvious counterexample either.

I'm particularly interested in the pullback of Pos (partially ordered sets and monotone functions) and Conv (convergence spaces and continuous functions) with respect to the forgetful functors into Set. Both of them are Cartesian-closed and I feel that the pullback (call it PosConv, which consists of partially ordered convergence spaces and monotone continuous maps), should also be Cartesian closed.

view this post on Zulip Vincent Moreau (Oct 06 2024 at 11:17):

In general, if you do not assume anything on the functors U : A → X and V : B → X, then you won't get a good property on the pullback: already, basic properties like the existence of a terminal object may fail. For instance, for any categories A and B, consider X = A + B and U and V be the two canonical inclusions, which are faithful. Then, the pullback is going to be empty, and also the version of the pullback where you take isomorphisms instead of equalities.

view this post on Zulip Vincent Moreau (Oct 06 2024 at 11:19):

On the other extreme, if you assume X to also be cartesian closed and the functors U : A → X and V : B → X to respect finite products and exponentials, then the pullback is a CCC, and actually it is a sub-CCC of the product A × B.

view this post on Zulip Vincent Moreau (Oct 06 2024 at 11:22):

I am not knowledgeable about convergence spaces, but what I can say is that the functor Pos → Set which sends a poset on its underlying set preserves finite products, but not exponentials, so it is an in-between situation. If the other one Conv → Set also preserves finite products, then the pullback has finite products.

view this post on Zulip Bernd Losert (Oct 06 2024 at 11:32):

Thanks for the reply. Conv is like a CCC-version of Top. In any case V : Conv → Set will not preserve exponentials either since V(BA)V(B^A) will be a subset of VBVAVB^{VA}, just like in the Pos case.

view this post on Zulip Bernd Losert (Oct 06 2024 at 11:33):

So I guess the "in-between" situation is kind of special and has to be handled on an adhoc basis, i.e. I can't just apply a result from category theory to conclude yes/no.

view this post on Zulip Vincent Moreau (Oct 06 2024 at 11:33):

I agree