# User:Michiexile/MATH198/Lecture 2

### From HaskellWiki

Michiexile (Talk | contribs) |
Michiexile (Talk | contribs) |
||

Line 1: | Line 1: | ||

+ | ===Morphisms and objects=== | ||

+ | |||

+ | Some morphisms and some objects are special enough to garner special names that we will use regularly. | ||

+ | |||

+ | * Isomorphisms and existence of inverses. | ||

+ | * Epi- and mono-morphisms and cancellability. | ||

+ | ** Examples in concrete categories. | ||

+ | ** Monomorphisms and subobjects: | ||

+ | *** Factoring through. Equivalence relation by mutual factoring. | ||

+ | *** Subobjects as equivalence classes of monomorphisms. | ||

+ | ** Splitting and the existence of inverses. | ||

+ | * Terminal and initial objects. | ||

+ | ** Constants. Pointless sets. | ||

+ | |||

+ | |||

+ | |||

+ | |||

+ | |||

+ | |||

==Morphisms== | ==Morphisms== | ||

The arrows of a category are called ''morphisms''. This is derived from ''homomorphisms''. | The arrows of a category are called ''morphisms''. This is derived from ''homomorphisms''. |

## Revision as of 16:55, 8 September 2009

## Contents |

### 1 Morphisms and objects

Some morphisms and some objects are special enough to garner special names that we will use regularly.

- Isomorphisms and existence of inverses.
- Epi- and mono-morphisms and cancellability.
- Examples in concrete categories.
- Monomorphisms and subobjects:
- Factoring through. Equivalence relation by mutual factoring.
- Subobjects as equivalence classes of monomorphisms.

- Splitting and the existence of inverses.

- Terminal and initial objects.
- Constants. Pointless sets.

## 2 Morphisms

The arrows of a category are called *morphisms*. This is derived from *homomorphisms*.

Some arrows have special properties that make them extra helpful; and we'll name them:

- Endomorphism
- A morphism with the same object as source and target.
- Monomorphism
- A morphism that is left-cancellable. Corresponds to injective functions. We say that
*f*is a monomorphism if for any*g*_{1},*g*_{2}, the equation*f**g*_{1}=*f**g*_{2}implies*g*_{1}=*g*_{2}. In other words, with a concrete perspective,*f*doesn't introduce additional relations when applied. - Epimorphism
- A morphism that is right-cancellable. Corresponds to surjective functions. We say that
*f*is an epimorphism if for any*g*_{1},*g*_{2}, the equation*g*_{1}*f*=*g*_{2}*f*implies*g*_{1}=*g*_{2}.

Note, by the way, that cancellability does not imply the existence of an inverse. Epi's and mono's that have inverses realizing their cancellability are called *split*.

- Isomorphism
- A morphism is an isomorphism if it has an inverse. Split epi and split mono imply isomorphism. Specifically, is an isomorphism if there is a such that
*f**g*= 1_{w}and*g*= 1_{v}. - Automorphism
- An automorphism is an endomorphism that is an isomorphism.

## 3 Objects

In a category, we use a different name for the vertices: *objects*. This comes from the roots in describing concrete categories - thus while objects may be actual mathematical objects, but they may just as well be completely different.

Just as with the morphisms, there are objects special enough to be named. An object *v* is

*Initial*- if
*[v,w]*has exactly one element for all other objects*w*. *Terminal*- if
*[w,v]*has exactly one element for all other objects*w*. *A Zero object*- if it is both initial and terminal.

All initial objects are isomorphic. If *i*_{1},*i*_{2} are both initial, then there is exactly one map and exactly one map . The two possible compositions are maps and . However, the initiality condition holds even for the morphism set *[v,v]*, so in these, the only existing morphism is and respectively. Hence, the compositions have to be this morphism, which proves the statement.

## 4 Dual category

The same proof carries over, word by word, to the terminal case. This is an illustration of a very commonly occurring phenomenon - dualization.