Skip to main content

Section 5.43 Session 27: Examples of universal constructions, Part 11

Example 5.43.1. Exercise 9: (Part 1/?).

For any map XfY...
Solution.
I don’t know if this will become relevant, but I’ve got this overwhelming urge to complete the diagram above this problem:
My intuition suggests that the existence of a retraction like r in the diagram depends whether or not YX. I think that’s conceptually related to the “dual” of this exercise.
I think there’s also an implication that the result I’m looking for follows from the “universal property of products”. This was defined over a (possibly empty) set of indices I where each i in I defines a (possibly duplicated) object Ci in the category C.

Definition 5.43.2.

A product is an object P together with maps Pp1Ci (one for each i), having the universal property:
Given any object X and any maps XfiCi (one for each i), there is exactly one map XpP such that pip=fi for each i in I.
In this hypothetical category C with initial object S and terminal object T, there should be unique maps α,β where SαXfYβT satisfy the associative property. Let’s start enumerating these objects Ci of our category: C0=S, C1=X, C2=Y, C3=T.
By the universalized definition of product, for any X there should be a unique object P and map XfP, and maps PpiCi for each i such that pif=fi for every XfiCI. Since this product is also an object in the category, let’s call it C4=S×X×Y×T. What if we just need to iterate over all of these Ci to handle the cases where X=Y and XY at the same time?
Let’s start with X=C0=S. Any map Xf0C0 would have to the unique map S1SS. Likewise, any Xf1C1 would be the unique map SX, Xf2C2 would be the unique map SY, Xf3C3 would be the unique map ST, Xf4C4 would be the unique map SX×Y.
Let’s move on X=C1=X. If any map Xf0C0 existed, that would imply that X is itself an intial object. We could then used the uniqueness of the inverse map C1C0 to uniquely define the rest of the maps we’re looking for through precomposition with the maps we saw previously. In fact, I think we can go one step further and assume that no CiC0 exists for any i>0.
Assuming that no map XC0 exists, then it seems reasonable to conclude that the only way Pp1X can satisfy p1p=f1 for all Xf1X is if p1p=1X for all X. I think this partially explains the wildcard notation of ? in the definition of Γ=?,f.
The existence of some XfY necessarily means we have maps TxiXfYyi¯T. I’m thinking we could have take the product XX×X that maps xi to the pair xi,xi. and then somehow compare this with the projection map XX×Y that pairs each xi with the respective yi=fxi. I’m thinking we can do this by “stepping out” somehow through a shared map XX×(X+Y).
I’m starting to get a little lost at this point, so I think I’ll try to spend some more time on this later.