Definitions

Def: A category C consists of the following data:

  • a collection of objects

  • for any pair of objects A and B, a collection of morphisms

  • for any morphism and any morphism , we have a morphism called the compoisiton of g and f

  • for any object A, we have called the identity morphism on A
    such that the following hold:

  • composition is associative

  • it is unital? for any we have

Given a category C:
We write for its collection of objects
”its not objects that matter its the morphisms that matter”
If is a morphism from A to B, we indicate this by writing
The A is called domain and B is called co domain of f.
We also write for the collection of morphisms from A to B
is also for the same, we drop the subscript m

Since composition is associative, we drop the brackets.

collection? and not set? why?
Remark: For category C, the collections Ob(C) and C(A,B) they do not have to be sets. they can be large, like : collection of all sets, we do not have sets of all sets (self reference, paradox!)

When Ob(C) is a set and C(A,B) is a set for any pair of objects A,B \in Ob(C), then we say C is small category
If C(A,B) is a set for every , then we say that C is a locally small category
For a locally small category C, we say that C(A,B) is a hom-set. (also known as external hom)

Examples

Set

The category Set is defined to be the category whose objects are sets and whose morphisms are functions between them.

  • Ob(Set) is the collection of all sets.

  • Given two sets, X and Y, we define the ext hom / hom set

  • the identity morphism is given by the identity funtion on X

Remark : Set is locally small , but it is not small.

Partial Order

The category Pos is defined to be the category whose objects are partially ordered sets (poset), and morphisms are monotone functions between them.

  • Ob(Pos) are the posets

  • given two posets , we define

Natural nos, matrices

let Mat be the category with

  • Ob(Mat) are the natural numbers

  • Hom(n,m) = { A is a matrix}

  • the identity morphism : identity matrix

  • composition : matrix multiplication

Mat is a small category.

Monoid

Every monoid can be seen as a 1 - object category
Define M to be the following category

  • It has only one object, lets call it

  • , i.e. the morphisms are the elements of M

  • the identity os defined as 1

  • composition : monoid operation

If M is a small, then M is small.
if M is not small, then M is not locally small.

Remark: This course will stick to locally small categories
sadge

Monomorphism

f : is a monomorphism iff for all objects A, every pair of morphisms g,h , we have that

examples

Set, monomorphisms coincide with injective functions

Epimorphism

In sets, they are the surjective functions, why?
f surjective implies epi
suppose f not surjective, then it is possible that the domain of the compositions are a subset of A and not equal to A, so on the intersection of these domains, g and h will be equal but not overall.

Isomorphism

—

the inverse is unique.

questions

every object has a unique identity morphism.

trivial.

Functor

between categories. morphism between categories,
A Functor F from a category C to category D, is given by the following data

  • a map on objects ,

  • a map on morphisms that sends morphisms on C to morphisms on D ( goes to )

  • F preserves identities

  • F preserves composition

Notation:
We often FA instead of F(A)
Ff instead of F(f)

examples

Power Set Functor P: Set → Set

verify.

forgetful functors

Opposite Category

did not write here