Personal tools

User:Michiexile/MATH198/Lecture 2

From HaskellWiki

Jump to: navigation, search

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 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 g1,g2, the equation fg1 = fg2 implies g1 = g2. 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 g1,g2, the equation g1f = g2f implies g1 = g2.

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, f:v\to w is an isomorphism if there is a g:w\to v such that fg = 1w and g = 1v.
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 i1,i2 are both initial, then there is exactly one map i_1\to i_2 and exactly one map i_2\to i_1. The two possible compositions are maps i_1\to i_1 and i_2\to i_2. However, the initiality condition holds even for the morphism set [v,v], so in these, the only existing morphism is 1_{i_1} and 1_{i_2} 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.