<<

MATH 101A: I PART A: THEORY 27

9. Universal objects and limits I explained how universal constructions were all examples of initial or terminal objects in some . I also explained that these are equivalent if we reverse arrows. 9.1. initial and terminal objects.

Definition 9.1. Suppose that is a category. Then an object X0 of is called initial if for any objeCct Y of there is a unique C C f : X0 Y . Similarly, X Ob( ) is called terminal if for any object → ∞ ∈ C W of there is a unique morphism f : W X . If X0 is both initial and terminalC it is called a . → ∞ Example 9.2. In ns, the category of sets, the empty is initial and any one point setE is terminal. In the ∅ e is both initial and terminal.{∗} So, the is the zero object.{ } Theorem 9.3. Initial and terminal objects are unique up to isomor- phism if they exist. This is trivial but we went through it carefully because, as we will see later, it implies the uniqueness of any universal object.

Proof. Suppose that there are two initial objects X0, X1. Then X initial !f : X X 0 ⇒ ∃ 0 → 1 X1 initial !g : X1 X0 X initial ⇒ ∃Any two→ X X are equal. 0 ⇒ 0 → 0 Therefore, g f = id . Similarly, f g = id . Therefore, X X . X0 X1 0 ∼= 1 The uniquenes◦ s of terminal objects is similar◦ (and also follows from the next theorem). ! Definition 9.4. If is any category, its opposite category op is “the same thing with arrowsC reversed.” By this I mean that C (1) Ob( op) = Ob( ). The opposite category has the same objects. HoweverC , we putC a little “op” as a superscript to indicate that we are considering the object as being in op. So, if X Ob( ) then Xop is X considered as an object ofC op. ∈ C op op C (2) Mor op (X , Y ) = Mor (Y, X). The morphism sets are equal. But theC morphism f : Y C X in is written → C f op : Xop Y op → in op. C op (3) idXop = (idX ) . (Identities are the same.) (4) f op gop = (g f)op. (Composition is reversed.) ◦ ◦ 28 MATH 101A: ALGEBRA I PART A: GROUP THEORY

For example, when we say that f op : Gop Hop → is a morphism in psop, we do not mean that we have created new objects called Gop andG Hop. All this means is that we have an ordinary group homomorphism f : H G. → The purpose is to change the description of the objects. Theorem 9.5. X is an initial (resp. terminal) object of if and only if Xop is a terminal (resp. initial) object of op. C C 9.2. products as terminal objects. If Xα, α I is a family of ob- jects in , I created a new category so that a termina∈ l object of is C B B the same as the product of the objects Xα in . The objects of the new category consist ofC B (1) an object Y of and (2) morphisms f :CY X for all α I. α → α ∈ I wrote the element as: (Y, (fα)α I ). If (Z, (gα)) is another object in then a morphism ∈ B (Y, (f )) (Z, (g )) α → α is defined to be a morphism φ : Y Z in so that fα = gα φ for all α I. In other words, the following→diagramC commutes for eac◦ h α. ∈ Xα > O fα || || gα || || / Y φ Z Proposition 9.6. If (Z, (g )) is terminal in then Z = X . α B ∼ α Proof. (Z, (gα)) is terminal implies φ : Y Z is unique whic! h implies → that Z = Xα. ! 9.3. gener!al limits. A categorical product is the limit of a diagram with no arrows. We need to generalize this construction to create more general limits. We will do this now in an arbitrary category and next week we will look in the category of groups and sets and specialize to particular diagrams.

Definition 9.7. A diagram D is a category is a set of objects Xα, α I and a set of morphisms between these objeCcts. ∈ I couldn’t think of a good way to index the arrows in general. It depends on the diagram. MATH 101A: ALGEBRA I PART A: GROUP THEORY 29

Example 9.8. Here are some important examples of diagrams. (1) X (2) G ? > ?? f || ?? ! || ?? || ? >|| Z N ? BB  BB  BB  g BB  Y e { } (3) D = X1, X2, X3 (no arrows). (4) { } f f f 3 G 2 G 1 G · · · −→ 2 −→ 1 −→ 0 (5) X, Y with two morphisms f, g : X Y . → Definition 9.9. If D is a diagram in a category then the category of objects over D which we write as /D has objectsC consisting of C (1) one object Y of and (2) morphisms g : CY X going from Y to each object in the α → α diagram D so that, for any morphism f : Xα Xβ in C, f g = g . → ◦ α β If (Y, (gα)) is a terminal object in /D, then Y is called the limit of the diagram D. C Being a terminal object, the limit of a diagram is unique up to iso- morphism if it exists. For the special case when the diagram has no arrows, the limit is the product.