View source for Commutative Algebra/Functors, natural transformations, universal arrows

== Functors ==

=== Definitions ===

There are two types of functors, covariant functors and contravariant functors. Often, a covariant functor is simply called a functor.

{{TextBox| M=0 | W=100% | BG=#FFFFFF |1='''Definition 2.1''':

Let <math>\mathcal C, \mathcal D</math> be two categories. A ''' covariant functor''' <math>F: \mathcal C \to \mathcal D</math> associates
*to each object <math>A</math> of <math>\mathcal C</math> an object <math>F(A)</math> of <math>\mathcal D</math>, and
*to each morphism <math>f: A \to B</math> in <math>\mathcal C</math> a morphism <math>F(f): F(A) \to F(B)</math>,
such that the following rules are satisfied:
#For all objects <math>A</math> of <math>\mathcal C</math> we have <math>F(1_A) = 1_{F(A)}</math>, and
#for all morphisms <math>f: A \to B</math> and <math>g: B \to C</math> of <math>\mathcal C</math> we have <math>F(g \circ f) = F(g) \circ F(f)</math>.}}

{{TextBox| M=0 | W=100% | BG=#FFFFFF |1='''Definition 2.2''':

Let <math>\mathcal C, \mathcal D</math> be two categories. A ''' contravariant functor''' <math>F: \mathcal C \to \mathcal D</math> associates
*to each object <math>A</math> of <math>\mathcal C</math> an object <math>F(A)</math> of <math>\mathcal D</math>, and
*to each morphism <math>f: A \to B</math> in <math>\mathcal C</math> a morphism <math>F(f): F(B) \to F(A)</math>,
such that the following rules are satisfied:
#For all objects <math>A</math> of <math>\mathcal C</math> we have <math>F(1_A) = 1_{F(A)}</math>, and
#for all morphisms <math>f: A \to B</math> and <math>g: B \to C</math> of <math>\mathcal C</math> we have <math>F(g \circ f) = F(f) \circ F(g)</math>.}}

=== Forgetful functors ===

I'm not sure if there is a precise definition of a forgetful functor, but in fact, believe it or not, the notion is easily explained in terms of a few examples.

'''Example 2.3''':

Consider the category of groups with homomorphisms as morphisms. We may define a functor sending each group to it's underlying set and each homomorphism to itself as a function. This is a functor from the category of groups to the category of sets. Since the target objects of that functor lack the group structure, the group structure has been ''forgotten'', and hence we are dealing with a forgetful functor here.

'''Example 2.4''':

Consider the category of rings. Remember that each ring is an Abelian group with respect to addition. Hence, we may define a functor from the category of rings to the category of groups, sending each ring to the underlying group. This is also a forgetful functor; one which forgets the multiplication of the ring.

== Natural transformations ==

{{TextBox| M=0 | W=100% | BG=#FFFFFF |1='''Definition 2.5''':

Let <math>\mathcal C, \mathcal D</math> be categories, and let <math>F, G: \mathcal C \to \mathcal D</math> be two functors. A '''natural transformation''' is a family of morphisms in <math>\mathcal D</math> <math>\eta_X: F(X) \to G(X)</math>, where <math>X</math> ranges over all objects of <math>\mathcal C</math>, that are compatible with the images of morphisms <math>f: X \to Y</math> of <math>\mathcal C</math> by the functors <math>F</math> and <math>G</math>; that is, the following diagram commutes:
:[[File:Natural_transformation.svg|200px]]}}

'''Example 2.6''':

Let <math>\mathcal C</math> be the category of all fields and <math>\mathcal D</math> the category of all rings. We define a functor
:<math>F: \mathcal C \to \mathcal D</math>
as follows: Each object <math>\mathbb F</math> of <math>\mathcal C</math> shall be sent to the ring <math>R_{\mathbb F}</math> consisting of addition and multiplication inherited from the field, and whose underlying set are the elements
:<math>S_{\mathbb F} \{\overbrace{1_{\mathbb F} + 1_{\mathbb F} + \cdots + 1_{\mathbb F}}^{n\text{ times}} | n \in \mathbb N_0\} \cup \{\overbrace{- 1_{\mathbb F} - 1_{\mathbb F} - \cdots - 1_{\mathbb F}}^{n\text{ times}} | n \in \mathbb N\}</math>,
where <math>1_{\mathbb F}</math> is the unit of the field <math>\mathbb F</math>. Any morphism <math>f: \mathbb F \to \mathbb G</math> of fields shall be mapped to the restriction <math>f \restriction_{S_{\mathbb F}}</math>; note that this is well-defined (that is, maps to the object associated to <math>\mathbb G</math> under the functor <math>F</math>), since both
:<math>f(1_{\mathbb F} + 1_{\mathbb F} + \cdots + 1_{\mathbb F}) = f(1_{\mathbb F}) + f(1_{\mathbb F}) + \cdots + f(1_{\mathbb F}) = 1_{\mathbb G} + 1_{\mathbb G} + \cdots + 1_{\mathbb G}</math>
and
:<math>f(-1_{\mathbb F} - 1_{\mathbb F} - \cdots - 1_{\mathbb F}) = -f(1_{\mathbb F}) - f(1_{\mathbb F}) - \cdots - f(1_{\mathbb F}) = -1_{\mathbb G} - 1_{\mathbb G} - \cdots - 1_{\mathbb G}</math>,
where <math>1_{\mathbb G}</math> is the unit of the field <math>\mathbb G</math>.

We further define a functor
:<math>G: \mathcal C \to \mathcal D</math>,
sending each field <math>\mathbb F</math> to its associated [[w:prime field|prime field]] <math>\mathbb F_\text{prime}</math>, seen as a ring, and again restricting morphisms, that is sending each morphism <math>f: \mathbb F \to \mathbb G</math> to <math>f \restriction_{\mathbb F_\text{prime}}</math> (this is well-defined by the same computations as above and noting that <math>f</math>, being a field morphism, maps inverses to inverses).

In this setting, the maps
:<math>\eta_{\mathbb F}: R_{\mathbb F} \to \mathbb F_\text{prime}</math>,
given by inclusion, form a natural transformation from <math>F</math> to <math>G</math>; this follows from checking the commutative diagram directly.

== Universal arrows ==

{{TextBox| M=0 | W=100% | BG=#FFFFFF |1='''Definition 2.7 (universal arrows)''':

Let <math>\mathcal C, \mathcal D</math> be categories, let <math>F: \mathcal C \to \mathcal D</math> be a functor, let <math>Y</math> be an object of <math>\mathcal D</math>. A '''universal arrow''' is a morphism <math>g: Y \to F(X)</math>, where <math>X</math> is a fixed object of <math>\mathcal C</math>, such that for any other object <math>Z</math> of <math>\mathcal C</math> and morphism <math>h: Y \to F(Z)</math> there exists a unique morphism <math>f: X \to Z</math> such that the diagram
:
commutes.}}

{{BookCat}}