[Math] What are “maps” between proper classes

ct.category-theorylo.logic

When defining a functor (between categories), I am usually told that it assigns to each object of the source category an object of the target category. I do not find this very satisfactory since we are dealing with proper classes here. Judging by the definition, it must be possible to have the concept of a "map" between proper classes. I would like to know what exactly that is and how it is defined.

I have attempted to read some books on set theory in search for an answer, but they all treat classes very briefly and never mention the possibility of having anything like a map between two of them. I would be just as happy if you could point me to a book where this is explained.

Best Answer

http://en.wikipedia.org/wiki/Ordered_pair#Morse_definition

Definition:
A relation $R$ is functional if and only if for all ordered pairs $\langle x,z\rangle$ and $\langle y,w\rangle$ in $R$, if $x=y$ then $z=w$.

Definition: If $R$ is a relation, $\operatorname{Range}(R) = \{y : (\exists x)(\langle x,y\rangle \in R)\}$.

Definition: A map is an ordered pair $\langle R,C\rangle$ such that $R$ is a functional relation and $\operatorname{Range}(R) \subseteq C$.

Related Question