Pullback (category theory)

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In category theory, a branch of mathematics, a pullback (also called a fiber product, fibre product, fibered product or Cartesian square) is the limit of a diagram consisting of two morphisms f : X → Z and g : Y → Z with a common codomain; it is the limit of the cospan XZY. The pullback is often written

P = X ×Z Y.

The categorical dual of a pullback is a called a pushout. Remarks opposite to the above apply: the pushout is a coproduct with additional structure.

Universal property[edit]

Explicitly, the pullback of the morphisms f and g consists of an object P and two morphisms p1 : P → X and p2 : P → Y for which the diagram

Categorical pullback.svg

commutes. Moreover, the pullback (P, p1, p2) must be universal with respect to this diagram. That is, for any other such triple (Q, q1, q2) for which the following diagram commutes, there must exist a unique u : Q → P (called a mediating morphism) such that

Categorical pullback (expanded).svg

As with all universal constructions, the pullback, if it exists, is unique up to isomorphism. In fact, given two pullbacks (A, a1, a2) and (B, b1, b2) of the same cospan, there is a unique isomorphism between A and B respecting the pullback structure.

Weak pullbacks[edit]

A weak pullback of a cospan X → Z ← Y is a cone over the cospan that is only weakly universal, that is, the mediating morphism u : Q → P above is not required to be unique.

Pullback and product[edit]

The pullback is similar to the product, but not the same. One may obtain the product by "forgetting" that the morphisms f and g exist, and forgetting that the object Z exists. One is then left with a discrete category containing only the two objects X and Y, and no arrows between them. This discrete category may be used as the index set to construct the ordinary binary product. Thus, the pullback can be thought of as the ordinary (Cartesian) product, but with additional structure. Instead of "forgetting" Z, f, and g, one can also "trivialize" them by specializing Z to be the terminal object (assuming it exists). f and g are then uniquely determined and thus carry no information, and the pullback of this cospan can be seen to be the product of X and Y.


Commutative rings[edit]

The category of commutative rings admits pullbacks.

In the category of commutative rings (with identity), denoted CRing, the pullback is called the fibered product. Let

A, B, C ∈ Ob(CRing),
α : AC ∈ Hom(CRing),
β : BC ∈ Hom(CRing).

So A, B, and C are commutative rings with identity and α and β are ring homomorphisms. Then the pullback of this diagram is the subring of the Cartesian product A × B defined by

along with the morphisms

given by and for all , for which


In the category of sets, a pullback of f and g is given by the set

together with the restrictions of the projection maps π1 and π2 to X ×Z Y.

Alternatively one may view the pullback in Set asymmetrically:

where is the disjoint (tagged) union of sets (the involved sets are not disjoint on their own unless f resp. g is injective). In the first case, the projection π1 extracts the x index while π2 forgets the index, leaving elements of Y.

This example motivates another way of characterizing the pullback: as the equalizer of the morphisms f ∘ p1, g ∘ p2 : X × Y → Z where X × Y is the binary product of X and Y and p1 and p2 are the natural projections. This shows that pullbacks exist in any category with binary products and equalizers. In fact, by the existence theorem for limits, all finite limits exist in a category with a terminal object, binary products and equalizers.

Fiber bundles[edit]

Another example of a pullback comes from the theory of fiber bundles: given a bundle map π : EB and a continuous map f : X → B, the pullback X ×B E is a fiber bundle over X called the pullback bundle. The associated commutative diagram is a morphism of fiber bundles.

Categories with a terminal object[edit]

In any category with a terminal object T, the pullback X ×T Y is just the ordinary product X × Y.[1]


Preimages of sets under functions can be described as pullbacks as follows:

Suppose f : AB, B0B. Let g be the inclusion map B0B. Then a pullback of f and g (in Set) is given by the preimage f−1[B0] together with the inclusion of the preimage in A

f−1[B0] ↪ A

and the restriction of f to f−1[B0]

f−1[B0] → B0.


  • Whenever X ×Z Y exists, then so does Y ×Z X and there is an isomorphism X ×Z YY ×Z X.
  • Monomorphisms are stable under pullback: if the arrow f above is monic, then so is the arrow p2. For example, in the category of sets, if X is a subset of Z, then, for any g : Y → Z, the pullback X ×Z Y is the inverse image of X under .
  • Isomorphisms are also stable, and hence, for example, X ×X YY for any map Y → X.
  • Any category with pullbacks and products has equalizers.

See also[edit]


  1. ^ Adámek, p. 197.


External links[edit]

  • Interactive web page which generates examples of pullbacks in the category of finite sets. Written by Jocelyn Paine.
  • pullbacks on the N-Category Lab.