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

P→iX↓j↓uY→vZ.

Thus

ui=vj.

Since A is additive, finite products and finite coproducts coincide. Hence X⊕Y is a biproduct. Define

s=(i−j):P→X⊕Y,

and

d=[u v]:X⊕Y→Z.

By commutativity of the square,

ds=[u v](i−j)=ui−vj=0.

So every commutative square canonically gives a complex

P→(i−j)X⊕Y→[u v]Z.

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


Proposition

Let

P→iX↓j↓uY→vZ

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

0⟶P→(i−j)X⊕Y→[u v]Z⟶0

is short exact.

Equivalently,

P→X↓↓Y→Z is bicartesian⟺(i−j)=ker⁡[u v],[u v]=coker(i−j).

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


Pullback as kernel

We first prove:

The square is a pullback⟺(i−j):P→X⊕Y is a kernel of [u v]:X⊕Y→Z.

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

X→uZ←vY

can be described as the equalizer of the two morphisms

uπX, vπY:X×Y→Z,

where

πX:X×Y→X,πY:X×Y→Y

are the product projections.

Since we are in an abelian category,

X×Y≅X⊕Y.

Under this identification, the two maps become

uπX, vπY:X⊕Y→Z.

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

Eq(f,g)=ker⁡(f−g).

Therefore the pullback of

X→uZ←vY

is the kernel of

uπX−vπY:X⊕Y→Z.

But

uπX−vπY=[u −v].

Hence the pullback is

ker⁡[u −v].

Now the original square gives a morphism

(ij):P→X⊕Y.

Indeed,

[u −v](ij)=ui−vj=0.

Thus the original square is a pullback precisely when

(ij):P→X⊕Y

is a kernel of

[u −v]:X⊕Y→Z.

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

(i−j):P→X⊕Y

and the map

[u v]:X⊕Y→Z.

Let

τ=idX⊕(−idY):X⊕Y→X⊕Y.

This is an isomorphism. Moreover,

τ(ij)=(i−j),

and

[u v]τ=[u −v].

Therefore,

(ij)=ker⁡[u −v]⟺(i−j)=ker⁡[u v].

Hence the square is a pullback if and only if

(i−j):P→X⊕Y

is a kernel of

[u v]:X⊕Y→Z.

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]:X⊕Y→Z is a cokernel of (i−j):P→X⊕Y.

So we obtain both halves:

pullback⟺(i−j)=ker⁡[u v],

and

pushout⟺[u v]=coker(i−j).

Remark.

P→iX↓↓u0⟶Z.⟺0→P→iX→uZ→0 exact

Remark: Why a pullback is an equalizer over a product

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

X→uZ←vY.

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×Y→X,πY:X×Y→Y

be the product projections. From these we get two morphisms

uπX, vπY:X×Y→Z.

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

E→eX×Y

is the equalizer of

uπX, vπY:X×Y→Z.

Define

pX=πXe:E→X,pY=πYe:E→Y.

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

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

Thus E gives a cone over the cospan

X→uZ←vY.

Now let T be any object with morphisms

x:T→X,y:T→Y

such that

ux=vy.

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

⟨x,y⟩:T→X×Y

such that

πX⟨x,y⟩=x,πY⟨x,y⟩=y.

The compatibility condition ux=vy says exactly that

uπX⟨x,y⟩=vπY⟨x,y⟩.

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

r:T→E

such that

er=⟨x,y⟩.

Composing with the product projections gives

pXr=πXer=πX⟨x,y⟩=x,

and

pYr=πYer=πY⟨x,y⟩=y.

Thus every compatible pair of maps T→X and T→Y factors uniquely through E. This is exactly the pullback universal property.

Therefore

X×ZY≅Eq(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×ZY≅ker⁡(uπX−vπY).

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

No comments:

Post a Comment

Popular Posts