Overview

A pullback, also called a fiber product, combines two objects over a common target. An ordinary product allows any pair of coordinates; a pullback permits only pairs with the same image in that target. This construction expresses fibers, intersections and changes of base in a common language.

The same name also appears in operations on functions and differential forms. Those are related constructions but are not definitions of the categorical universal property discussed here.

Prerequisites

Know categories, binary products and unique factorization. Set maps give the basic model. Topological examples need subspace and product topologies. In other categories, first identify which morphisms are permitted.

Definition and conventions

Given f:A→Cf:A\to C and g:B→Cg:B\to C, a pullback is an object PP with maps p:P→Ap:P\to A, q:P→Bq:P\to B satisfying fp=gqfp=gq. For every object XX and maps a:X→Aa:X\to A, b:X→Bb:X\to B with fa=gbfa=gb, there must be a unique h:X→Ph:X\to P such that ph=aph=a and qh=bqh=b.

The notation is P=A×CBP=A\times_C B. The projections and commutativity equation are part of the data. A commutative square alone is not necessarily a pullback square.

In sets the construction is

A×CB={(a,b)∈A×B:f(a)=g(b)}.A\times_C B=\{(a,b)\in A\times B:f(a)=g(b)\}.

This formula is a model in a particular category, not a replacement for the abstract definition.

Intuition

Imagine two descriptions that carry the same kind of label in CC. The fiber product matches descriptions precisely when their labels agree. If one map describes a family over a parameter space, pulling back along another parameter map substitutes the new parameters and retains the corresponding fibers.

In contrast to an unrestricted product, a pullback can be empty even when both source objects are nonempty: their images may have no common label.

Examples and non-examples

Let C={0,1}C=\{0,1\}, let A={a1,a2,a3}A=\{a_1,a_2,a_3\} have labels 0,0,10,0,1, and let B={b1,b2}B=\{b_1,b_2\} have labels 0,10,1. Their product has six pairs but their pullback has just three:

(a1,b1),(a2,b1),(a3,b2).(a_1,b_1),\quad(a_2,b_1),\quad(a_3,b_2).

For any matching pair of maps from XX, the unique map into these three pairs is x↦(a(x),b(x))x\mapsto(a(x),b(x)), verifying universality directly.

For inclusions A,B⊆CA,B\subseteq C, the pullback is naturally identified with the intersection A∩BA\cap B. For a point c∈Cc\in C, pulling A→CA\to C back along the singleton map selecting cc gives the fiber f−1(c)f^{-1}(c).

A useful non-example takes A=B=CA=B=C to be singletons and PP to have two elements. The square commutes, but a singleton has two possible lifts into PP. Thus the square fails uniqueness even though it contains no contradictory equations.

Important properties

Pullbacks are unique up to the unique isomorphism preserving both projections. When a terminal object 11 exists, A×1BA\times_1 B is a product. Pullback along a composite can be performed in two stages: the two resulting objects classify exactly the same compatible tuples, giving a canonical isomorphism.

In topological spaces, use the indicated subset of A×BA\times B with its subspace topology. The product universal property and the subspace criterion verify the required continuity. For smooth manifolds, the set-theoretic fiber product need not be a manifold; transversality is a standard sufficient hypothesis, not an automatic property of all smooth maps.

Connections and further reading

Pullbacks are limits of cospans. They organize base change of bundles and, in algebraic geometry, fiber products of schemes. The opposite construction is a pushout. Riehl, §3.1, develops the categorical definition and examples before more general results about limits.