Blog Archive

Thursday, March 12, 2026

Zero, Pullback, Intersection

How do you prove that the intersection of two normal subgroups — or two ideals — is again normal? The naive approach is to verify the condition directly: take g∈G, x∈N∩M, and check that gxg−1∈N∩M. It works, but it feels like brute force. You are essentially running the same verification twice, once for N and once for M, with no insight into why the result is true. The real reason is simpler: normal subgroups and ideals are kernels, and kernels are pullbacks of the zero object...

Let C be a category with finite limits. Consider a morphism

u:A→B.

We can induce a pair of adjoint functors

Σu:C/A→C/B⊣u∗.

Here Σu(p:X→A)=u∘p:X→B, while u∗ is defined via the pullback square. That is, u∗(q:Y→B)=p:X→A.

image-20260312102518637

Let us check the adjointness:

HomC/B(Σu(f),g)≅HomC/A(f,u∗(g)).

This is just the universal property of the pullback. Hence u∗ preserves limits:

u∗(S×BT)≅u∗(S)×Au∗(T).

Corollary. Let C=Set, and let S,T be two subobjects of B. Then

u∗(S×BT)≅u∗(S∩T)≅u∗(S)×Au∗(T)≅u∗(S)∩u∗(T),

where u∗ is just u−1.

If C has a zero object, then we have ker⁡(f,g)=ker⁡(f)∩ker⁡(g). This follows from the fact that ker⁡(f:X→Y) is just the pullback of 0→Y along f.

Now consider ker⁡(f,g)=(f,g)∗(0→Y×Z), where πY:Y×Z→Y and πZ:Y×Z→Z. We have

(0→Y×Z)≅πY∗(0→Y)×Y×ZπZ∗(0→Z).

Then

(f,g)∗(0→Y×Z)≅(f,g)∗(πY∗(0→Y)×Y×ZπZ∗(0→Z))≅(f,g)∗(πY∗(0→Y))×X(f,g)∗(πZ∗(0→Z)),

and by pseudofunctoriality of pullback,

(f,g)∗∘πY∗=(πY∘(f,g))∗=f∗,(f,g)∗∘πZ∗=(πZ∘(f,g))∗=g∗.

Hence

(f,g)∗(πY∗(0→Y))×X(f,g)∗(πZ∗(0→Z))≅f∗(0→Y)×Xg∗(0→Z),

i.e.

ker⁡(f,g)=ker⁡(f)∩ker⁡(g).◼

Popular Posts