Processing math: 100%

Pullback . category theory

Collection

context F:(azb)C
definition Fa×FzFb,π:=limF

Here we consider a functor F from the category azb, consisting of three object and two non-identity arrows fa and fb, to a category C.


Universal property

For readability, let's write AFa,BFb,ZFz,αfa and βfb.

(In the picture we have XFa,YFb,ZFz,ffa,gfb and the pullback object is PX×ZY.)

Consider two arrows γ:C[X,A] and δ:C[X,B], which fulfill the structural condition αγ=βδ. I.e. when forwarded to Z via α, resp. β, they collapse into a single arrow.

Such two arrows γ,δ can be partially glued together, in the sense that they can both be written as a unique arrow u (with codomain A×ZB) followed by the projections πa,πb.

Discussion

The pullback object A×ZB is the full solution to the equation posed by α and β. In Set, it's literally the set of pairs x,yA×ZBA×B, for which α(x)=β(y).

When the category contains a terminal object 1 (where α and β are trivial arrows and form a trivial condition), we have A×1BA×B.

The universal property says that all other solution embed in this object, in this is what is meant by full solution.

Special cases
  • If πa is an iso, then A×ZBA. As A is already the pullback, it alone fully determines the “full solution”.
  • If moreover πb is an iso too, the projections, we can consider the equivalent pullback with πb=πa=1A. The universal property now says that arrows γ,δ can be wholly glued together: Up to iso, αγ=βδγ=δ.
  • In Set, if α=β, the pullback definition says that its elements x,y fulfill α(x)=α(y), i.e. here the pullback object is the full collection of pairs of term with give the same α value. If moreover πa is iso, any x determines an x,y and hence an y and the universal property translates to α(x)=α(y)x=y. This is just the definition of an injection.
  • Back to a general category. If the pullback of α along itself (α=β) is such that a projection πa is iso, we call α a monomorphism. The associated condition reads αγ=αδγ=δ.

(In the picture, f is α and g,f are our γ,δ.)

Examples

A finite pullback in Set that I just made up:

  • Generally: If F(fb) is the inclusion of a subset FbFz in Fz, the pullback is iso to (i.e. in bijection with) F(f1a)Fb. Further, if F(fa) is an inclusion too, this is in bijection with FaFb. If the subset-interpretation doesn't apply, the function F(fb) from Fb to Fz should be viewed as defining fibre bundle over Fz and the pullback gives a fibre bundle from Fa×FzFb to Fa.
  • A concrete example: Let

Fa={2,4,6,8}, Fb={10,20}, Fz={77,88,99}

F(fa)(2)=77, F(fa)(4)=77, F(fa)(6)=88, F(fa)(8)=99

F(fb)(10)=88, F(fb)(20)=77

Then

Fa×FzFb={2,20,4,20,6,10}

and π are projections like for the product.

Two more prominent examples:

  • If M is a manifold, p:BM is a fibre bundle over M and f:XY is an embedding of another manifold X into Y, the the pullback object is a fibre bundle over X, namely the differential geometric pullback.
  • In Set, if the “central object” is Ω={0,1}, the right function comes from a singleton 1 and if the left function χ:XΩ is a characteristic function, then a pullback object is a subset of X: It's defined as collection of arguments where the characteristic function agrees that the value is 1. This works also for more general “fuzzy” Ω. These Ω are the “objects of truth values” and are called subobject classifiers.

Digression: The exponential object BA is a prominent example of an object which isn't a limit, but it can be specifies via universal morphism construction. For sets or types, that's the function space AB and for propositions it's the implication. If a category has product, exponential object and a terminal object, then it's called Cartesian closed. A Cartesian closed category with subobject classifier is a topos. We see now how a topos is a general kind of set theory, and simultaneously defines an internal logic.

Reference

Context

Refinement of

Link to graph
Log In
Improvements of the human condition