Commutative Algebra/Functors, natural transformations, universal arrows

From testwiki
Revision as of 08:27, 13 June 2016 by imported>Mathmensch (Mathmensch moved page Commutative Algebra/Functors and natural transformations to Commutative Algebra/Functors, natural transformations, universal arrows: topic added)
(diff) ← Older revision | Latest revision (diff) | Newer revision β†’ (diff)
Jump to navigation Jump to search

Functors

Definitions

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

Template:TextBox

Template:TextBox

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

Template:TextBox

Example 2.6:

Let π’ž be the category of all fields and π’Ÿ the category of all rings. We define a functor

F:π’žπ’Ÿ

as follows: Each object 𝔽 of π’ž shall be sent to the ring R𝔽 consisting of addition and multiplication inherited from the field, and whose underlying set are the elements

S𝔽{1𝔽+1𝔽++1𝔽n times|nβ„•0}{1𝔽1𝔽1𝔽n times|nβ„•},

where 1𝔽 is the unit of the field 𝔽. Any morphism f:𝔽𝔾 of fields shall be mapped to the restriction fS𝔽; note that this is well-defined (that is, maps to the object associated to 𝔾 under the functor F), since both

f(1𝔽+1𝔽++1𝔽)=f(1𝔽)+f(1𝔽)++f(1𝔽)=1𝔾+1𝔾++1𝔾

and

f(1𝔽1𝔽1𝔽)=f(1𝔽)f(1𝔽)f(1𝔽)=1𝔾1𝔾1𝔾,

where 1𝔾 is the unit of the field 𝔾.

We further define a functor

G:π’žπ’Ÿ,

sending each field 𝔽 to its associated prime field 𝔽prime, seen as a ring, and again restricting morphisms, that is sending each morphism f:𝔽𝔾 to f𝔽prime (this is well-defined by the same computations as above and noting that f, being a field morphism, maps inverses to inverses).

In this setting, the maps

η𝔽:R𝔽𝔽prime,

given by inclusion, form a natural transformation from F to G; this follows from checking the commutative diagram directly.

Universal arrows

Template:TextBox

Template:BookCat