Pullback (category theory)
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. The pullback is often written
- P = X ×Z Y
and comes equipped with two natural morphisms P → X and P → Y. The pullback of two morphisms f and g need not exist, but if it does, it is essentially uniquely defined by the two morphisms. In many situations, X ×Z Y may intuitively be thought of as consisting of pairs of elements (x,y) with x∈X and y∈Y and f(x) = g(y). For the general definition, a universal property is used, which essentially expresses the fact that the pullback is the "most general" way to complete the two given morphisms to a commutative square.
Explicitly, a 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
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
As with all universal constructions, a 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 X → Z ← Y, there is a unique isomorphism between A and B respecting the pullback structure.
Pullback and product
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.
In the category of commutative rings (with identity), denoted CRing, the pullback is called the fibered product. Let
- A, B, C ∈ Ob(CRing),
- α : A → C ∈ Hom(CRing),
- β : B → C ∈ 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.
Another example of a pullback comes from the theory of fiber bundles: given a bundle map π : E → B and a continuous map f : X → B, the pullback (formed in the category of topological spaces with continuous maps) X ×B E is a fiber bundle over X called the pullback bundle. The associated commutative diagram is a morphism of fiber bundles.
Preimages and intersections
Preimages of sets under functions can be described as pullbacks as follows:
Suppose f : A → B, B0 ⊆ B. Let g be the inclusion map B0 ↪ B. 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.
Because of this example, in a general category the pullback of a morphism f and a monomorphism g can be thought of as the "preimage" under f of the subobject specified by g. Similarly, pullbacks of two monomorphisms can be thought of as the "intersection" of the two subobjects.
Least common multiple
Consider the multiplicative monoid of positive integers Z+ as a category with one object. In this category, the pullback of 2 positive integers m and n is just the pair (LCM(m, n)/, LCM(m, n)/), where the numerators are both the least common multiple of m and n. The same pair is also the pushout.
- In any category with a terminal object T, the pullback X ×T Y is just the ordinary product X × Y.
- Monomorphisms are stable under pullback: if the arrow f in the diagram is monic, then so is the arrow p2. Similarly, if g is monic, then so is p1.
- Isomorphisms are also stable, and hence, for example, X ×X Y ≅ Y for any map Y → X (where the implied map X → X is the identity).
- In an abelian category all pullbacks exist, and they preserve kernels, in the following sense: if
- is a pullback diagram, then the induced morphism ker(p2) → ker(f) is an isomorphism, and so is the induced morphism ker(p1) → ker(g). Every pullback diagram thus gives rise to a commutative diagram of the following form, where all rows and columns are exact:
- There is a natural isomorphism (A×CB)×B D ≅ A×CD. Explicitly, this means:
- if maps f : A → C, g : B → C and h : D → B are given and
- the pullback of f and g is given by r : P → A and s : P → B, and
- the pullback of s and h is given by t : Q → P and u : Q → D ,
- then the pullback of f and gh is given by rt : Q → A and u : Q → D.
- Graphically this means that two pullback squares, placed side by side and sharing one morphism, form a larger pullback square when ignoring the inner shared morphism.
- Any category with pullbacks and products has equalizers.
- Adámek, p. 197.
- Adámek, Jiří, Herrlich, Horst, & Strecker, George E.; (1990). Abstract and Concrete Categories (4.2MB PDF). Originally publ. John Wiley & Sons. ISBN 0-471-60922-6. (now free on-line edition).
- Cohn, Paul M.; Universal Algebra (1981), D. Reidel Publishing, Holland, ISBN 90-277-1213-1 (Originally published in 1965, by Harper & Row).