User:Michiexile/MATH198/Lecture 6
From HaskellWiki
Michiexile (Talk | contribs) |
Michiexile (Talk | contribs) |
||
Line 112: | Line 112: | ||
For the case of monoids and sets, this means that if we take our generating set, and map it into the set of elements of another monoid, this generates a unique mapping of the corresponding monoids. | For the case of monoids and sets, this means that if we take our generating set, and map it into the set of elements of another monoid, this generates a unique mapping of the corresponding monoids. | ||
+ | |||
+ | This is all captured by a similar kind of diagrams and uniquely existing maps argument as the previous object or morphism properties were defined with. We'll show the definition for the example of monoids. | ||
+ | |||
+ | '''Definition''' A ''free'' monoid on a generating set <math>X</math> is a monoid <math>F(X)</math> such that there is an inclusion <math>i_X: X\to UF(X)</math> and for every function <math>X\to U(M)</math> for some other monoid <math>M</math>, there is a unique homomorphism <math>g:F(X)\to M</math> such that <math>f=U(g) i_X</math>, or in other words such that this diagram commutes: | ||
+ | |||
+ | [[Image:FreeMonoid.png]] | ||
+ | |||
+ | We can construct a map <math>\phi:Hom_{Mon}(F(X),M) \to Hom_{Set}(X,U(M))</math> by <math>\phi: g\mapsto U(g)\circ i_X</math>. The above definition says that this map is an isomorphism. | ||
===Adjunctions=== | ===Adjunctions=== | ||
Line 117: | Line 125: | ||
Modeling on the way we construct free and forgetful functors, we can form a powerful categorical concept, which ends up generalizing much of what we've already seen - and also leads us on towards monads. | Modeling on the way we construct free and forgetful functors, we can form a powerful categorical concept, which ends up generalizing much of what we've already seen - and also leads us on towards monads. | ||
+ | We draw on the definition above of free monoids to give a preliminary definition. This will be replaced later by an equivalent definition that gives more insight. | ||
+ | |||
+ | '''Definition''' A pair of functors, | ||
+ | |||
+ | [[Image:AdjointPair.png]] | ||
+ | |||
+ | is called an ''adjoint pair'' or an ''adjunction'', with <math>F</math> called the ''left adjoint'' and <math>U</math> called the ''right adjoint'' if there is natural transformation <math>\eta: 1\to UF</math>, and for every <math>f:A\to U(B)</math>, there is a unique <math>g: F(A)\to B</math> such that the diagram below commutes. | ||
+ | |||
+ | [[Image:AdjointDefinition.png]] | ||
+ | The natural transformation <math>\eta</math> is called the ''unit'' of the adjunction. | ||
Revision as of 00:00, 28 October 2009
IMPORTANT NOTE: THESE NOTES ARE STILL UNDER DEVELOPMENT. PLEASE WAIT UNTIL AFTER THE LECTURE WITH HANDING ANYTHING IN, OR TREATING THE NOTES AS READY TO READ.
Contents |
1 Useful limits and colimits
With the tools of limits and colimits at hand, we can start using these to introduce more category theoretical constructions - and some of these turn out to correspond to things we've seen in other areas.
Possibly among the most important are the equalizers and coequalizers (with kernel (nullspace) and images as special cases), and the pullbacks and pushouts (with which we can make explicit the idea of inverse images of functions).
One useful theorem to know about is:
Theorem The following are equivalent for a category C:
- C has all finite limits.
- C has all finite products and all equalizers.
- C has all pullbacks and a terminal object. Also, the following dual statements are equivalent:
- C has all finite colimits.
- C has all finite coproducts and all coequalizers.
- C has all pushouts and an initial object.
For this theorem, we can replace finite with any other cardinality in every place it occurs, and we will still get a valid theorem.
====Equalizer, coequalizer==== Consider the equalizer diagram:
A limit over this diagram is an object C and arrows to all diagram objects. The commutativity conditions for the arrows defined force for us fp_{A} = p_{B} = gp_{A}, and thus, keeping this enforced equation in mind, we can summarize the cone diagram as:
Now, the limit condition tells us that this is the least restrictive way we can map into A with some map p such that fp = gp, in that every other way we could map in that way will factor through this way.
As usual, it is helpful to consider the situation in Set to make sense of any categorical definition: and the situation there is helped by the generalized element viewpoint: the limit object C is one representative of a subobject of A that for the case of Set contains all .
Hence the word we use for this construction: the limit of the diagram above is the equalizer of f,g. It captures the idea of a maximal subset unable to distinguish two given functions, and it introduces a categorical way to define things by equations we require them to respect.
One important special case of the equalizer is the kernel: in a category with a null object, we have a distinguished, unique, member 0 of any homset given by the compositions of the unique arrows to and from the null object. We define the kernel Ker(f) of an arrow f to be the equalizer of f,0. Keeping in mind the arrow-centric view on categories, we tend to denot the arrow from Ker(f) to the source of f by ker(f).
In the category of vector spaces, and linear maps, the map 0 really is the constant map taking the value 0 everywhere. And the kernel of a linear map is the equalizer of f,0. Thus it is some vector space W with a map such that fi = 0i = 0, and any other map that fulfills this condition factors through W. Certainly the vector space fulfills the requisite condition, nothing larger will do, since then the map composition wouldn't be 0, and nothing smaller will do, since then the maps factoring this space through the smaller candidate would not be unique.
Hence, just like we might expect.
Dually, we get the coequalizer as the colimit of the equalizer diagram.
A coequalizer has to fulfill that i_{B}f = i_{A} = i_{B}g. Thus, writing q = i_{B}, we get an object with an arrow (actually, an epimorphism out of B) that identifies f and g. Hence, we can think of as catching the notion of inducing equivalence classes from the functions.
This becomes clear if we pick out one specific example: let be an equivalence relation, and consider the diagram
where r_{1} and r_{2} are given by the projection of the inclusion of the relation into the product onto either factor. Then, the coequalizer of this setup is an object X / R such that whenever x˜_{R}y, then q(x) = q(y).
1.1 Pullbacks
The preimage f^{ − 1}(T) of a subset along a function is a maximal subset such that for every .
We recall that subsets are given by (equivalence classes of) monics, and thus we end up being able to frame this in purely categorical terms. Given a diagram like this:
where i is a monomorphism representing the subobject, we need to find an object V with a monomorphism injecting it into U such that the map factors through T. Thus we're looking for dotted maps making the diagram commute, in a universal manner.
The maximality of the subobject means that any other subobject of U that can be factored through T should factor through V.
Suppose U,V are subsets of some set W. Their intersection is a subset of U, a subset of V and a subset of W, maximal with this property.
Translating into categorical language, we can pick representatives for all subobjects in the definition, we get a diagram with all monomorphisms:
where we need the inclusion of into W over U is the same as the inclusion over V.
Definition A pullback of two maps is the limit of these two maps, thus:
By the definition of a limit, this means that the pullback is an object D with maps , and , such that any other such object factors through this.
For the diagram , with one representative monomorphism for the subobject, we get precisely the definition above for the inverse image.
For the diagram with both map monomorphisms representing their subobjects, the pullback is the intersection.
1.2 Pushouts
Often, especially in geometry and algebra, we construct new structures by gluing together old structures along substructures. Possibly the most popularly known example is the Möbius band: we take a strip of paper, twist it once and glue the ends together.
Similarily, in algebraic contexts, we can form amalgamated products that do roughly the same.
All these are instances of the dual to the pullback:
Definition A pushout of two maps is the co-limit of these two maps, thus:
Hence, the pushout is an object D such that C maps to the same place both ways, and so that, contingent on this, it behaves much like a coproduct.
2 Free and forgetful functors
Recall how we defined a free monoid as all strings of some alphabet, with concatenation of strings the monoidal operation. And recall how we defined the free category on a graph as the category of paths in the graph, with path concatenation as the operation.
The reason we chose the word free to denote both these cases is far from a coincidence: by this point nobody will be surprised to hear that we can unify the idea of generating the most general object of a particular algebraic structure into a single categorical idea.
The idea of the free constructions, classically, is to introduce as few additional relations as possible, while still generating a valid object of the appropriate type, given a set of generators we view as placeholders, as symbols. Having a minimal amount of relations allows us to introduce further relations later, by imposing new equalities by mapping with surjections to other structures.
One of the first observations in each of the cases we can do is that such a map ends up being completely determined by where the generators go - the symbols we use to generate. And since the free structure is made to fulfill the axioms of whatever structure we're working with, these generators combine, even after mapping to some other structure, in a way compatible with all structure.
To make solid categorical sense of this, however, we need to couple the construction of a free algebraic structure from a set (or a graph, or...) with another construction: we can define the forgetful functor from monoids to sets by just picking out the elements of the monoid as a set; and from categories to graph by just picking the underlying graph, and forgetting about the compositions of arrows.
Now we have what we need to pinpoint just what kind of a functor the free widget generated by-construction does. It's a functor , coupled with a forgetful functor such that any map in C induces one unique mapping in D.
For the case of monoids and sets, this means that if we take our generating set, and map it into the set of elements of another monoid, this generates a unique mapping of the corresponding monoids.
This is all captured by a similar kind of diagrams and uniquely existing maps argument as the previous object or morphism properties were defined with. We'll show the definition for the example of monoids.
Definition A free monoid on a generating set X is a monoid F(X) such that there is an inclusion and for every function for some other monoid M, there is a unique homomorphism such that f = U(g)i_{X}, or in other words such that this diagram commutes:
We can construct a map by . The above definition says that this map is an isomorphism.
3 Adjunctions
Modeling on the way we construct free and forgetful functors, we can form a powerful categorical concept, which ends up generalizing much of what we've already seen - and also leads us on towards monads.
We draw on the definition above of free monoids to give a preliminary definition. This will be replaced later by an equivalent definition that gives more insight.
Definition A pair of functors,
is called an adjoint pair or an adjunction, with F called the left adjoint and U called the right adjoint if there is natural transformation , and for every , there is a unique such that the diagram below commutes.
The natural transformation η is called the unit of the adjunction.
- Free and forgetful
- Curry and uncurry
4 Homework
- Prove that an equalizer is a monomorphism.
- Prove that a coequalizer is an epimorphism.
- Prove that given any relation , its completion to an equivalence relation is the kernel of the coequalizer of the component maps of the relation
- Prove that if the right arrow in a pullback square is a mono, then so is the left arrow. Thus the intersection as a pullback really is a subobject.
- Prove that if both the arrows in the pullback 'corner' are mono, then the arrows of the pullback cone are all mono.
- What is the pullback in the category of posets?
- What is the pushout in the category of posets?