Skip to main content

Section 5.3 Article 4: Universal Mapping Properties, Part 3

We pick up this week with "Initial Objects". Now, let’s get started! (pun intended)

Example 5.3.1. Exercise 7:.

If S1,S2 are both initial...
Solution.
By the definition of S1,S2 as initial objects, for every object X of C there is exactly one C-map S1X and one C-map S2X.
Since S1,S2 are both "initial objects" in C, they must also be "objects" in C. By setting X=S1 or X=S2, it follows that there needs to be exactly one map S1S2 and exactly one map S2S1.
Now consider an arbitrary initial object S in C. By the definition of initial objects, any X in C must have exactly one C-map SX. Since S is itself an object in C, it follows that there is precisely one map SS. Since there must by an identity map for any domain in the category, it follows that this unique map SS must necessarily be the identity map 1S.
By the same reasoning, any map S1S1 must be the unique map 1S1 and any map S2S2 must be the unique map 1S2. Since the composition S1S2S1 is a map S1S1, it follows that S1S2S1=1S1. Similarly, the composition formed by S2S1S2 is a map S2S2. It follows that S2S1S2=1S2.
Having established that both S1S2S1=1S1 and S2S1S2=1S2, the maps S1S2 and S2S1 are inverses of each other. Consequently, these two maps define an isomorphism between S1 and S2.

Example 5.3.2. Exercise 8:.

In each of S, S, and S...
Solution.
In each of S, S, and S...
We’re given that 0 is an initial object and Xf0 is a map. We’re attempting to show that (a) for every Xg0 we have g=f and that (b) X itself is initial.
By defining 0 as an intial object, we know that for any object X in the category there is exactly one map 0ϕXX. Since 0 is itself an object of the category, there is exactly one map 0ϕ00. Furthermore, every domain needs an identity map, so the only possible map ϕ0:00 we could possibly have is the identity map ϕ0=10.
Consider the compositions fϕX and gϕX. In the first case, we have 0ϕXXf0 defining a map 00. Since there is precisely one such map, it must be the unique identity map 10. Likewise, 0ϕXXg0 must also be the same map 10. It follows that fϕX=gϕX=10.
If we assume fg, then there needs to exist some "point" 1xX with fxgx. However, the property of 0 being an initial object in the category says that we must have exactly one map 01. It follows from uniqueness of 01 that we have a unique composition 01xX.
In the category S, the "points" of X are maps which correspond to each element of X and "point to" themselves. That means that each of the compositions 01xXf0 and 01xXg0 are effectively a map from 00. Since there can only be exactly one such map 00 (the identity map 10 on that single element ), these compositions must be the same map. By precomposing with our maps f,g we see that Xf01xX and Xg01xX are both effectively the identity map 1X. This contradicts our choice of fg. The uniqueness of a map 01xXf0 ensures the uniqueness of the composition 01xX1XXf0, making X an initial object with the sole map XX being the identity 1X.
In the category S, our "points" are the elements Xα fixed under the operation α. Here a point is a map 1xXα such that αx=x. In this situation, we also know fDα=αfA so the following compositions should all result in "the same map":
01xXf0
01xXαXDfD0
01xXfAXAα0
In the category S, we need to preserve source and target relations. Namely, for any point 1xX we need fDsx=sfAx amd fDtx=tfAx. However, there’s precisely one map from 01, so s and t both need to evaluate to the same object. We essentially have an equivalence between the following compositions:
01xXf0
01xXsXDfD0
01xXtXDfD0
01xXfAXDs0
01xXfAXDt0
I’m a little uncertain about the rigor of these solutions. Hopefully the follow-up questions will give me more to go on.

Example 5.3.3. Exercise 9:.

Define the category 1/S of pointed sets...
Solution.
In this category, an object is a map 1x0X in S and a map from 1x0X to 1y0Y is a map XfY in S for which fx0=y0. We’re given the following external diagram:
Figure 5.3.4. Given Diagram for Article 4 Exercise 9
We’re asked to show that "any terminal object is also initial" and that "part (b) of the previous exercise is false".
Let’s start by assuming we have some "terminal object" in this category. We’ll call this object 1. As a terminal object of C, there is exactly one C-map X1 for any object X of C.
Our choice of C defined an object as a map 1x0X. Our definition of a terminal object implies that there is a unique map I’ll call x0¯ with the property that satisfies 1x0Xx0¯1=11.
Now, what happens if we were to also have an initial object 0 in C? That would imply for that every object X of C we have exactly one C-map 0X. Since our objects of C are limited to maps 1X, our object 0 would also need to exist as some map 1x0X. Given how we’ve defined our terminal object, there should be exactly one map Xx0¯1. If we compose this unique map x0¯ with the unique map 01, we get a unique map 0Xx0¯1. It follows that any initial object is necessarily a terminal object.
That’s close to what we’ve been asked to prove, but not quite. We were asked to prove every terminal object is initial, and instead proved the converse. I think we might actually need to compose with x0 once more to show 0Xx0¯1x0X is the same as our unique map 0X. Having both a unique map 0X and a unique map X1 should be sufficient to show the uniqueness of the map 0X1.
So why does part (b) fail in this case? If X were itself an initial object, then there would be exactly one map XX. Since we need to have an identity map 1X from XX, the unique map 0X would need to the same as the composition 0X1XX. This is a problem because two maps can only be the same map if the domains and codomains match. The existence of a unique map 1y0Y, separate from our map 1x0X, means that the composition formed by 0XfY would be a different map from 0X. The lack of uniqueness would disqualify X as an initial object.

Example 5.3.5. Exercise 10:.

Let 2 be a fixed 2-point set...
Solution.
This time we define a category 2/S of bipointed objects, with the objects being S-maps 2x¯X and maps being the S-maps satistfying fx¯=y¯. We’re also given the following diagram:
Figure 5.3.6. Given Diagram for Article 4 Exercise 9
First, we want to show that the initial object 0 in 2/S is actually the identity map 12. In other words, we need to prove that for any object X in 2/S there is exactly one map from 12X.
If every object in 2/S is some map 2x¯X, then consider the composition 2fx¯Y. Our category has defined our maps f as those maps in S satisfying the relation fx¯=y¯. By assigning f=1X and Y=X, it follows that 1Xx¯=x¯ which is only true if it holds for every element in the domain 2. If that we call the objects of 2={0,1} then both 1Xx¯0=x¯0 and 1Xx¯1=x¯1 need to hold true for every X in C. If 2 is an object in C, that structure preservation must also apply to the map f=12. The relations 120=0 and 121=1 ensure this is a valid map in 2/S.
Maybe what I need to be doing here is establishing an isomorphism between the elements 0 and 1 with the "null map" and "identity map on objects of C". We know there is precisely one C-map {}{} and precisely one from X1XX. If we have a two element-set 2={0,1}, then assigning 0={}{} and 1=X1XX creates an unique isomorphism 2s{,1X}r2 such that rs=12 and sr=1{,1X}.
In the category S, a map XfY exists between any sets X and Y except in the case where Y= and X. If we choose X=2 and Y=, then we know from the non-existence of a map XfY in S that we couln’t possibly have one in 2/S. In other words, we have a unique map , a unique map 1, a unique map 11, and exactly zero maps 1.
If Y is a subset of X, a map is guaranteed to exist. If we know no map exists, there needs to exist at least one element in y0=fx0Y that is not in X. The set of those two elements y0 and x0 need to be isomorphic to the set 2.
I think this is relevant because it provides us a way to define an "antipodal" map in C. There is a unique map 2α2 defined by α0=1 and α1=0. Composing αs swaps the roles of and 1X. This mirrors the relationship between and statements under logical negation.
Perhaps this provides an answer the second half of the exercise. Knowing that 0=12, the existence of the antipodal map 2α2 provides a second map to the initial object by way of the composition αα=12.
I keep thinking back to the minimal categories I was playing with in Python last week. In the course of my experimentation, one of the things I tried was defining my objects of my BinaryCategory to be [[0],[1,2]] instead of [[0],[0,1]]. Doing so changes the representation of my "point" maps from
{'domain': [0], 'codomain': [0], 'map': {0: 0}}, {'domain': [0], 'codomain': [0, 1], 'map': {0: 0}}, {'domain': [0], 'codomain': [0, 1], 'map': {0: 1}}]
to
{'domain': [0], 'codomain': [0], 'map': {0: 0}}, {'domain': [0], 'codomain': [1, 2], 'map': {0: 1}}, {'domain': [0], 'codomain': [1, 2], 'map': {0: 2}}]
making it lot clearer what my 3 points "point" to. If I add a "null map" to my category, a map 0 with {'domain': [], 'codomain': [], 'map': {}}, and a unique map 1, then I can think of my 3 points as being isomorphic to the maps
[{'domain': [], 'codomain': [0], 'map': {}}, {'domain': [], 'codomain': [1], 'map': {}}, {'domain': [], 'codomain': [2], 'map': {}}]
by precomposing my "points" 1X with that unique map 1.
I’m not sure where I’m going with this anymore, so lets keep moving forward.

Example 5.3.7. Exercise 11:.

Show that in the category S...
Solution.
Let start by assuming we have some object X which is NOT an initial object in S. That means there is either no map XX or more than one map XX. We know that we’re assured to at least have an identity map 1X, so we can rule out the first case and focus on the second. Let’s call these maps XeiX, and we know we must at least two such maps e0e1.
A terminal object S in S would have the property that for any X in S there is exactly one map XS. Clearly X1XXS=XS, so we can assume e0=1X is a terminal object. If we also have a second map e1 such that Xe1XS=XS, then we can apply e1 on the left again:
Xe1Xe1XS=Xe1XS
I think I’m starting to see where we’re going with this. By asserting that e0 and e1 are different maps, and knowing that e0 is the identity map, we know these maps must satisfy e0e0=e0, e1e0=e1, e0e1=e1. But there’s one more combination, and the composition above suggests that e1e1=e1. Since we proved ealier that all terminal objects are isomorphic, having two distinct maps like this allows us to create an isomorphism between the terminal object S and each of the maps e0,e1 respectively.
We’ve already shown "X is not initial" implies the existence of two distinct endomaps e0,e1:XX with with isomorphisms between them and the terminal object S. Having these isomorphisms e0s0r0S and e1s1r1S allows us compositions e0r1s0e1 and e1r0s1e0. I think we can make the claim that there exists at least "one point" in X defined by this unique map e1e0, which I think is techinically just the map e1 itself.
We can say e1 is terminal because e1e1=e1. We can say e0 in X by the identity property of C.
So why would this fail in the categories S or S? It probably has something to do with the structure preservation in those categories.
Consider the endomap on the one point set 1. This set technically has two distinct "objects": the point 1 and the map 11. A "point" in Xα needs to satisfy αx=x, which is not true of our map e1 for all objects by virtue of it being necessarily distinct from the identity map.
For maps in S, they need to preserve source and target relations. Namely, preserve fDs=sfA and fDt=tfA. Our terminal objects here are "loops". Maybe can embed our object e1 by defining s=1X and t=e1. Since we’ve defined e1 such that e1e1=e1, this would essentially give us e1s=e11X=e1 and e1t=e1e1=e1.
I’m picturing the case in S as needing to preserve the source and target of the endomap on one point. In order to preserve source and target of 1, both the source and target must be the unique point 1. However, this space technically has two unique objects. As we "loop" through the point, we alternate between "dot" and "arrow". Since there’s no retraction in S from the two point set {dot,arrow} to the one point set {loop}, there couldn’t possibly be an isomorphism with the unique terminal object S.