Blog Archive

Tuesday, June 9, 2026

Bicartesian squares (both pull-back and push-out) and Short exact sequences

Table of Contents Bicartesian Squares and Short Exact Sequences in an Abelian CategoryPropositionPullback as kernelThe c

 

Bicartesian Squares and Short Exact Sequences in an Abelian Category

Let A be an abelian category. Consider a commutative square

PiXjuYvZ.

Thus

ui=vj.

Since A is additive, finite products and finite coproducts coincide. Hence XY is a biproduct. Define

s=(ij):PXY,

and

d=[u v]:XYZ.

By commutativity of the square,

ds=[u v](ij)=uivj=0.

So every commutative square canonically gives a complex

P(ij)XY[u v]Z.

The main point is that this complex is short exact precisely when the original square is bicartesian.


Proposition

Let

PiXjuYvZ

be a commutative square in an abelian category. Then the square is bicartesian if and only if the associated sequence

0P(ij)XY[u v]Z0

is short exact.

Equivalently,

PXYZ is bicartesian(ij)=ker[u v],[u v]=coker(ij).

We prove the kernel half. The cokernel half follows by the duality principle.


Pullback as kernel

We first prove:

The square is a pullback(ij):PXY is a kernel of [u v]:XYZ.

The conceptual reason is simple:

pullback=equalizer over a product,

and in an additive category,

equalizer=kernel of a difference.

Let us spell this out.

The pullback of the cospan

XuZvY

can be described as the equalizer of the two morphisms

uπX, vπY:X×YZ,

where

πX:X×YX,πY:X×YY

are the product projections.

Since we are in an abelian category,

X×YXY.

Under this identification, the two maps become

uπX, vπY:XYZ.

In an additive category, the equalizer of two morphisms f,g:AB is the kernel of their difference:

Eq(f,g)=ker(fg).

Therefore the pullback of

XuZvY

is the kernel of

uπXvπY:XYZ.

But

uπXvπY=[u v].

Hence the pullback is

ker[u v].

Now the original square gives a morphism

(ij):PXY.

Indeed,

[u v](ij)=uivj=0.

Thus the original square is a pullback precisely when

(ij):PXY

is a kernel of

[u v]:XYZ.

This is almost the desired statement. The only difference is the sign convention. We want the map

(ij):PXY

and the map

[u v]:XYZ.

Let

τ=idX(idY):XYXY.

This is an isomorphism. Moreover,

τ(ij)=(ij),

and

[u v]τ=[u v].

Therefore,

(ij)=ker[u v](ij)=ker[u v].

Hence the square is a pullback if and only if

(ij):PXY

is a kernel of

[u v]:XYZ.

This proves the kernel half.


The cokernel half by duality

Now apply the duality principle.

Passing to the opposite category reverses all arrows. Under this operation:

  • pullback pushout,

  • kernel cokernel,

and biproducts remain biproducts.

Therefore the dual of the previous statement is:

The square is a pushout[u v]:XYZ is a cokernel of (ij):PXY.

So we obtain both halves:

pullback(ij)=ker[u v],

and

pushout[u v]=coker(ij).

Remark.

PiXu0Z.0PiXuZ0 exact

Remark: Why a pullback is an equalizer over a product

Let C be a category with binary products and equalizers. Consider a cospan

XuZvY.

Its pullback is usually denoted by

X×ZY.

The key observation is that a point of the pullback should be thought of as a pair consisting of one piece of data in X and one piece of data in Y, subject to the compatibility condition that their images in Z agree.

Categorically, the object that first collects arbitrary pairs of data from X and Y is the product

X×Y.

Let

πX:X×YX,πY:X×YY

be the product projections. From these we get two morphisms

uπX, vπY:X×YZ.

The first sends a pair to its X-component and then into Z; the second sends the same pair to its Y-component and then into Z. The compatible pairs are precisely those for which these two morphisms agree.

Therefore the pullback should be the equalizer

Eq(uπX,vπY)X×Y.

Let us verify this by the universal property.

Suppose

EeX×Y

is the equalizer of

uπX, vπY:X×YZ.

Define

pX=πXe:EX,pY=πYe:EY.

Since e equalizes uπX and vπY, we have

upX=uπXe=vπYe=vpY.

Thus E gives a cone over the cospan

XuZvY.

Now let T be any object with morphisms

x:TX,y:TY

such that

ux=vy.

By the product universal property, the pair (x,y) determines a unique morphism

x,y:TX×Y

such that

πXx,y=x,πYx,y=y.

The compatibility condition ux=vy says exactly that

uπXx,y=vπYx,y.

Hence the morphism x,y:TX×Y equalizes uπX and vπY. By the equalizer universal property, there exists a unique morphism

r:TE

such that

er=x,y.

Composing with the product projections gives

pXr=πXer=πXx,y=x,

and

pYr=πYer=πYx,y=y.

Thus every compatible pair of maps TX and TY factors uniquely through E. This is exactly the pullback universal property.

Therefore

X×ZYEq(uπX, vπY).

In words:

pullback=compatible pairs=equalizer inside the product.

In an additive category, equalizers can be written as kernels of differences. Hence, if the category is additive, this becomes

X×ZYker(uπXvπY).

This is the step used above when we identify the pullback with a kernel.

No comments:

Post a Comment

Popular Posts