By the definition of as initial objects, for every object of there is exactly one -map and one -map .
Since are both "initial objects" in , they must also be "objects" in . By setting or , it follows that there needs to be exactly one map and exactly one map .
Now consider an arbitrary initial object in . By the definition of initial objects, any in must have exactly one -map . Since is itself an object in , it follows that there is precisely one map . Since there must by an identity map for any domain in the category, it follows that this unique map must necessarily be the identity map .
By the same reasoning, any map must be the unique map and any map must be the unique map . Since the composition is a map , it follows that . Similarly, the composition formed by is a map . It follows that .
Having established that both and , the maps and are inverses of each other. Consequently, these two maps define an isomorphism between and .
Example5.3.2.Exercise 8:.
In each of ,, and ...
Solution.
In each of ,, and ...
We’re given that is an initial object and is a map. We’re attempting to show that (a) for every we have and that (b) itself is initial.
By defining as an intial object, we know that for any object in the category there is exactly one map . Since is itself an object of the category, there is exactly one map . Furthermore, every domain needs an identity map, so the only possible map we could possibly have is the identity map .
Consider the compositions and . In the first case, we have defining a map . Since there is precisely one such map, it must be the unique identity map . Likewise, must also be the same map . It follows that .
If we assume , then there needs to exist some "point" with . However, the property of being an initial object in the category says that we must have exactly one map . It follows from uniqueness of that we have a unique composition .
In the category , the "points" of are maps which correspond to each element of and "point to" themselves. That means that each of the compositions and are effectively a map from . Since there can only be exactly one such map (the identity map on that single element ), these compositions must be the same map. By precomposing with our maps we see that and are both effectively the identity map . This contradicts our choice of . The uniqueness of a map ensures the uniqueness of the composition , making an initial object with the sole map being the identity .
In the category , our "points" are the elements fixed under the operation . Here a point is a map such that . In this situation, we also know so the following compositions should all result in "the same map":
In the category , we need to preserve source and target relations. Namely, for any point we need amd . However, there’s precisely one map from , so and both need to evaluate to the same object. We essentially have an equivalence between the following compositions:
I’m a little uncertain about the rigor of these solutions. Hopefully the follow-up questions will give me more to go on.
Example5.3.3.Exercise 9:.
Define the category of pointed sets...
Solution.
In this category, an object is a map in and a map from to is a map in for which . We’re given the following external diagram:
Figure5.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 . As a terminal object of , there is exactly one -map for any object of .
Our choice of defined an object as a map . Our definition of a terminal object implies that there is a unique map I’ll call with the property that satisfies .
Now, what happens if we were to also have an initial object in ? That would imply for that every object of we have exactly one -map . Since our objects of are limited to maps , our object would also need to exist as some map . Given how we’ve defined our terminal object, there should be exactly one map . If we compose this unique map with the unique map , we get a unique map . 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 once more to show is the same as our unique map . Having both a unique map and a unique map should be sufficient to show the uniqueness of the map .
So why does part (b) fail in this case? If were itself an initial object, then there would be exactly one map . Since we need to have an identity map from , the unique map would need to the same as the composition . 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 , separate from our map , means that the composition formed by would be a different map from . The lack of uniqueness would disqualify as an initial object.
Example5.3.5.Exercise 10:.
Let be a fixed 2-point set...
Solution.
This time we define a category of bipointed objects, with the objects being -maps and maps being the -maps satistfying . We’re also given the following diagram:
Figure5.3.6.Given Diagram for Article 4 Exercise 9
First, we want to show that the initial object in is actually the identity map . In other words, we need to prove that for any object in there is exactly one map from .
If every object in is some map , then consider the composition . Our category has defined our maps as those maps in satisfying the relation . By assigning and , it follows that which is only true if it holds for every element in the domain . If that we call the objects of then both and need to hold true for every in . If is an object in , that structure preservation must also apply to the map . The relations and ensure this is a valid map in .
Maybe what I need to be doing here is establishing an isomorphism between the elements and with the "null map" and "identity map on objects of ". We know there is precisely one -map and precisely one from . If we have a two element-set , then assigning and creates an unique isomorphism such that and .
In the category , a map exists between any sets and except in the case where and . If we choose and , then we know from the non-existence of a map in that we couln’t possibly have one in . In other words, we have a unique map , a unique map , a unique map , and exactly zero maps .
If is a subset of , a map is guaranteed to exist. If we know no map exists, there needs to exist at least one element in that is not in . The set of those two elements and need to be isomorphic to the set .
I think this is relevant because it provides us a way to define an "antipodal" map in . There is a unique map defined by and . Composing swaps the roles of and . This mirrors the relationship between and statements under logical negation.
Perhaps this provides an answer the second half of the exercise. Knowing that , the existence of the antipodal map provides a second map to the initial object by way of the composition .
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
making it lot clearer what my 3 points "point" to. If I add a "null map" to my category, a map with {'domain': [], 'codomain': [], 'map': {}}, and a unique map , then I can think of my 3 points as being isomorphic to the maps
by precomposing my "points" with that unique map .
I’m not sure where I’m going with this anymore, so lets keep moving forward.
Example5.3.7.Exercise 11:.
Show that in the category ...
Solution.
Let start by assuming we have some object which is NOT an initial object in . That means there is either no map or more than one map . We know that we’re assured to at least have an identity map , so we can rule out the first case and focus on the second. Let’s call these maps , and we know we must at least two such maps .
A terminal object in would have the property that for any in there is exactly one map . Clearly , so we can assume is a terminal object. If we also have a second map such that , then we can apply on the left again:
I think I’m starting to see where we’re going with this. By asserting that and are different maps, and knowing that is the identity map, we know these maps must satisfy ,,. But there’s one more combination, and the composition above suggests that . 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 and each of the maps respectively.
We’ve already shown " is not initial" implies the existence of two distinct endomaps with with isomorphisms between them and the terminal object . Having these isomorphisms and allows us compositions and . I think we can make the claim that there exists at least "one point" in defined by this unique map , which I think is techinically just the map itself.
We can say is terminal because . We can say in by the identity property of .
So why would this fail in the categories or ? It probably has something to do with the structure preservation in those categories.
Consider the endomap on the one point set . This set technically has two distinct "objects": the point and the map . A "point" in needs to satisfy , which is not true of our map for all objects by virtue of it being necessarily distinct from the identity map.
For maps in , they need to preserve source and target relations. Namely, preserve and . Our terminal objects here are "loops". Maybe can embed our object by defining and . Since we’ve defined such that , this would essentially give us and .
I’m picturing the case in as needing to preserve the source and target of the endomap on one point. In order to preserve source and target of , both the source and target must be the unique point . 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 from the two point set dotarrow to the one point set loop, there couldn’t possibly be an isomorphism with the unique terminal object .