Next: Pushouts Up: Pullback Previous: Pullback
Examples of Pullback
- If A, C, D and B were sets, then
with maps
, (
) and
, (
) satisfies the conditions of being a pullback
Proof
Given a set E with maps
and
, then the map
, (
) would make the diagram
commute. In fact we have the following identities for all
:
and
.
Moreover l is unique since, given any other map
such that
and
, then for all
the following hold :
l(e)=(j(e),i(e))=(h(m(e)),k(m(e)))=m(e)=(h(a,b),k(a,b))=(a,b).
Therefore l is unique - Pullback exists in any (functor 3.2) category of presheaves
.
In fact, if
, then
is a pullback in
iff
is a pullback in set. This implies that
The fact that a pullback in
is defined in terms of a pullback in Sets implies that the former always exists since the latter does. In fact, given any object
and any three functors 3.2 X, Y, Z, it is always possible to construct (in Set) a diagram as the one above. This implies that it is always possible to define a functor 3.2
which assigns, for each
an object P(C) (a set), and for each arrow
in
the unique arrow
in
which makes the following cube a pullback in
Cecilia Flori 2007-02-04