To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

# 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 written

P = X ×f, Z, g Y.

Usually the morphisms f and g are omitted from the notation, and then the pullback is written

P = X ×Z Y.

The pullback 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 in X, y in 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.

The dual concept of the pullback is the pushout.

• 1/5
Views:
2 797
11 232
18 655
2 570
359
• Category Theory For Beginners: Understanding Pullbacks
• Category Theory II 3.1: Examples of Limits and Colimits
• Shifrin Math 3510 Day27: Pullback
• Paolo Perrone: "The rise of quantitative category theory"
• Category Theory - Lecture 2 Part 2

## Universal property

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.[1] That is, for any other such triple (Q, q1, q2) where q1 : Q → X and q2 : Q → Y are morphisms with f q1 = g q2, there must exist a unique u : Q → P such that

${\displaystyle p_{1}\circ u=q_{1},\qquad p_{2}\circ u=q_{2}.}$

This situation is illustrated in the following commutative diagram.

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.

## Examples

### Commutative rings

In the category of commutative rings (with identity), the pullback is called the fibered product. Let A, B, and C be commutative rings (with identity) and α : AC and β : BC (identity preserving) ring homomorphisms. Then the pullback of this diagram exists and is given by the subring of the product ring A × B defined by

${\displaystyle A\times _{C}B=\left\{(a,b)\in A\times B\;{\big |}\;\alpha (a)=\beta (b)\right\}}$

along with the morphisms

${\displaystyle \beta '\colon A\times _{C}B\to A,\qquad \alpha '\colon A\times _{C}B\to B}$

given by ${\displaystyle \beta '(a,b)=a}$ and ${\displaystyle \alpha '(a,b)=b}$ for all ${\displaystyle (a,b)\in A\times _{C}B}$. We then have

${\displaystyle \alpha \circ \beta '=\beta \circ \alpha '.}$

### Groups and modules

In complete analogy to the example of commutative rings above, one can show that all pullbacks exist in the category of groups and in the category of modules over some fixed ring.

### Sets

In the category of sets, the pullback of functions f : X → Z and g : Y → Z always exists and is given by the set

${\displaystyle X\times _{Z}Y=\{(x,y)\in X\times Y|f(x)=g(y)\}=\bigcup _{z\in f(X)\cap g(Y)}f^{-1}[\{z\}]\times g^{-1}[\{z\}],}$

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

Alternatively one may view the pullback in Set asymmetrically:

${\displaystyle X\times _{Z}Y\cong \coprod _{x\in X}g^{-1}[\{f(x)\}]\cong \coprod _{y\in Y}f^{-1}[\{g(y)\}]}$

where ${\displaystyle \coprod }$ is the disjoint 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 binary products and equalizers; equivalently, all finite limits exist in a category with terminal object and pullbacks (by the fact that binary product = pullback on the terminal object, and that an equalizer is a pullback involving binary product).

#### Graphs of functions

A specific example of a pullback is given by the graph of a function. Suppose that ${\displaystyle f\colon X\to Y}$ is a function. The graph of f is the set ${\displaystyle \Gamma _{f}=\{(x,f(x))\colon x\in X\}\subseteq X\times Y.}$ The graph can be reformulated as the pullback of f and the identity function on Y. By definition, this pullback is ${\displaystyle X\times _{f,Y,1_{Y}}Y=\{(x,y)\colon f(x)=1_{Y}(y)\}=\{(x,y)\colon f(x)=y\}\subseteq X\times Y,}$ and this equals ${\displaystyle \Gamma _{f}}$.

### Fiber bundles

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 (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. This is also the case in the category of differentiable manifolds. A special case is the pullback of two fiber bundles E1, E2B. In this case E1 × E2 is a fiber bundle over B × B, and pulling back along the diagonal map BB × B gives a space homeomorphic (diffeomorphic) to E1 ×B E2, which is a fiber bundle over B. The pullback of two smooth transverse maps into the same differentiable manifold is also a differentiable manifold, and the tangent space of the pullback is the pullback of the tangent spaces along the differential maps.

### Preimages and intersections

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.

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 two positive integers m and n is just the pair ${\displaystyle \left({\frac {\operatorname {lcm} (m,n)}{m}},{\frac {\operatorname {lcm} (m,n)}{n}}\right)}$, where the numerators are both the least common multiple of m and n. The same pair is also the pushout.

## Properties

• In any category with a terminal object T, the pullback X ×T Y is just the ordinary product X × Y.[2]
• 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.[3]
• Isomorphisms are also stable, and hence, for example, X ×X YY for any map Y → X (where the implied map X → X is the identity).
• In an abelian category all pullbacks exist,[4] and they preserve kernels, in the following sense: if
is a pullback diagram, then the induced morphism ker(p2) → ker(f) is an isomorphism,[5] 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:
${\displaystyle {\begin{array}{ccccccc}&&&&0&&0\\&&&&\downarrow &&\downarrow \\&&&&L&=&L\\&&&&\downarrow &&\downarrow \\0&\rightarrow &K&\rightarrow &P&\rightarrow &Y\\&&\parallel &&\downarrow &&\downarrow \\0&\rightarrow &K&\rightarrow &X&\rightarrow &Z\end{array}}}$
Furthermore, in an abelian category, if X → Z is an epimorphism, then so is its pullback P → Y, and symmetrically: if Y → Z is an epimorphism, then so is its pullback P → X.[6] In these situations, the pullback square is also a pushout square.[7]
• There is a natural isomorphism (A×CBB DA×CD. Explicitly, this means:
• if maps f : AC, g : BC and h : DB are given and
• the pullback of f and g is given by r : PA and s : PB, and
• the pullback of s and h is given by t : QP and u : QD ,
• then the pullback of f and gh is given by rt : QA and u : QD.
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.
${\displaystyle {\begin{array}{ccccc}Q&{\xrightarrow {t}}&P&{\xrightarrow {r}}&A\\\downarrow _{u}&&\downarrow _{s}&&\downarrow _{f}\\D&{\xrightarrow {h}}&B&{\xrightarrow {g}}&C\end{array}}}$
• Any category with pullbacks and products has equalizers.

## Weak pullbacks

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.

## Notes

1. ^ Mitchell, p. 9