−Table of Contents
Categories
Abbreviation: Cat
Definition
A \emph{category} is a structure C=⟨C,∘,dom,cod⟩ of type ⟨2,1,1⟩ such that C is a class,
⟨C,∘⟩ is a (large) partial semigroup
dom amd cod are total unary operations on C such that
dom(x) is a left unit: dom(x)∘x=x
cod(x) is a right unit: x∘cod(x)=x
if x∘y exists then dom(x∘y)=dom(x) and cod(x∘y)=cod(y)
x∘y exists iff cod(x)=dom(y)
Remark: The members of C are called \emph{morphisms}, ∘ is the partial operation of \emph{composition}, dom is the \emph{domain} and cod is the \emph{codomain} of a morphism.
The set of objects of C is the set ObjC={dom(x)|x∈C}. For a,b∈C the set of homomorphism from a to b is Hom(a,b)={c∈C|dom(c)=a and cod(c)=b}.
Morphisms
Let C and D be categories. A morphism from C to D is a function h:C→D that is a homomorphism: h(dom(c))=domh(c), h(cod(c))=codh(c) and h(c∘d)=h(c)∘h(d) whenever c∘d is defined.
Morphisms between categories are called \emph{functors}.
Examples
Example 1: The category of function on sets with composition.
In fact, most of the classes of mathematical structures in this database are categories.
Basic results
dom(dom(x))=dom(x)=cod(dom(x))
cod(cod(x))=cod(x)=dom(cod(x))
Properties
Finite members
$\begin{array}{lr}
f(1)= &1\\ f(2)= &3\\ f(3)= &11\\ f(4)= &55\\ f(5)= &329\\ f(6)= &2858\\ f(7)= &\\ f(8)= &\\ f(9)= &\\ f(10)= &\\
\end{array}$