Intro to categories, part II, limits:
matt's mention of limits refers to a generalization of products and sums.
I.e. notice that the exercise above was to show that the "sum" of two sets is their disjoint union. but what about their actual union? is that a sum of some kind?
It is a sum "with amalgamation", i.e. with overlaps between the two summands.
so here the data consists of the two sets S, T plus their intersection I, as a further set.
then there are inclusion maps from I into each set, I-->S, and I-->T. then a sum of S and T that respects those inclusions would be an object X plus, let's see, a pair of maps I guess S-->X, and T-->X. as before, but now also we want the two compositions I--S-->X and I-->T-->X to be equal.
this is precisely the case if X = S union T, and the maps S-->X and T-->X are both inclusions.
In this case X is a sort of limit of the system of maps {I-->S, I-->T}. Notice there is a family of sets here, I,S,T, and two sets are connected by a map if and only if there is an inclusion between them. Thinking of set inclusion as a partial order on all sets, this means the maps are indexed by a partially ordered set.
To push the same idea further we just change the partially ordered index set to an arbitrary one.
I.e. suppose we have a whole family of maps {Ai-->Aj} indexed by some partially ordered set of indices {i}.
Then a limit would be an object X with a map Ai-->X from each of our sets, plus the requirement that whenever two sets Ai,Aj are connected by a map Ai-->Aj, i.e. whenever i <= j (or vice versa, I can never remember),
then the composition Ai-->Aj-->X, equals the map Ai-->X.
gee, somehow i made this l;ook a little different from the model case above of unions, but so what.
you wil notice that if the Ai are all sets and the maps Ai-->Aj are all inclusions of subsets, that then the union X of all the Ai satisfies this rule, where all the maps Ai-->X are inclusions.
this is called "direct limit", and the analogous generalization of a product is called an "inverse limit".
check that when the Ai-->Aj are again all inclusions that the inverse limit is the intersection of all the Ai. (with some appropriate conventions on the partial order).
Now to really go round the bend, if I is any category, i.e. any collection of all objects having the same structure, and their morphisms, and if C is any other category, there is for each... [good heavens i can't even remember this myself, i'll have to read my own book...ok i think i got it.].
OK, note that a category is like a partially ordered set. i.e. some objects have maps between them, some do not, and when there are maps X-->Y, and Y-->Z, their composition gives a map X-->Z. (transitivity of ordering)
A system of objects indexed by a partially ordered set is just a functor on this category. so we want to be able to define the limit of any functor defined on a partially ordered set, so we might as well define the notion of limit of any functor defined on any category. {After all part of the fun of category theory is to make it so general the only application is to confuse and frighten the uninitiated.]
So let I and C be categories and consider the category of all functors from I to C, called Fun(I,C). [Don't tell anyone, but this is to be thought of as the collection of all systems of elements of C, indexed by elements of the partially ordered set I.]
Now notice there is a functor from C to Fun(I,C) called the "constant functor", which takes an element X in C to the functor sending every element of I to X. I.e. this is the constsnt indexed system where all the indexed objects are the same object and all the maps are the identity isomorphism of that object.
This defines a kind of "stupid functor" c:C-->Fun(I,C).
(using the word "stupid" is also calculated to frighten away more of the people still hanging around hoping to understand something.)
Now a direct limit construction is an "adjoint" of this constant functor,
i.e. it is a functor
lim:Fun(I,C)-->C, such that whenever {Xi} is a functor in Fun(I,C), then
lim({Xi}) is an object X in C, such that for every element Y of C,
the following two families of morphisms are equivalent:
Hom({Xi},c(Y)) = Hom(X,Y).
i.e. there is a family of morphisms Xi-->X, respecting the compositions Xi00>Xj,
hence anyone morphism X-->Y, yields the compositions Xi-->X-->Y, hence a compatible family of morphisms Xi-->Y, which is a 1-1 correspondence between the morphisms in the sets above.
I.e. "compatible" families of morphisms from the system {Xi} to Y, is the same as one morphism from the object X-->Y. That is what it means to say X = lim({Xi}).
whew! I have never used this definition except to try to intimidate people, but maybe someone else has another use for it. (Someone who understands it better than I do for example, could use this opportunity to expose me as a categorical fraud.)
[Obviously I like this subject, but also regard it somewhat lightly, as a bit of a joke, but one with significant consequences.
I.e. the subject is actually easy, but has been made to look hard in the literature, and I wish to reveal that this should be poo - pooed as much as posible in order to maintain enough dignity to actually master it.
as sylvanus p thompson so famously said of infinitesimal calculus:
"what one fool can do, another can".