nLab
exhaustive category

Exhaustive categories

Idea

A category is exhaustive if it has colimits of (transfinite) sequences of monomorphisms which interact well with pullbacks.

Definition

Given a transfinite sequence

A 0A 1 A_0 \to A_1 \to \cdots

(continuing through A αA_\alpha for all α<κ\alpha\lt\kappa, where κ\kappa is some limit ordinal) for which each transition map A αA βA_\alpha \to A_\beta is a monomorphism, if A κA_\kappa is a colimit of this sequence (a transfinite composition) we call it a transfinite union.

A category CC is exhaustive if one, hence both, of the following two equivalent conditions hold.

  1. CC has transfinite unions which are stable under pullback and for which the coprojections A αA κA_\alpha \to A_\kappa are also monomorphisms.

  2. CC has transfinite unions, and given any diagram

    B 0 B 1 B κ A 0 A 1 A κ \array{ B_0 & \to & B_1 & \to & \cdots & \to & B_\kappa\\ \downarrow && \downarrow &&&& \downarrow\\ A_0 & \to & A_1 & \to & \cdots & \to & A_\kappa\\ }

    in which the bottom row is a transfinite union and for each α<β<κ\alpha\lt\beta\lt\kappa, the square

    B α B β A α A β \array{ B_\alpha & \to & B_\beta \\ \downarrow && \downarrow \\ A_\alpha & \to & A_\beta }

    is a pullback (hence B αB βB_\alpha \to B_\beta is also monic), then the top row is a transfinite union (i.e. a colimit diagram) if and only if for all α<κ\alpha\lt\kappa the square

    B α B κ A α A κ \array{ B_\alpha & \to & B_\kappa \\ \downarrow && \downarrow \\ A_\alpha & \to & A_\kappa }

    is a pullback. (In other words, transfinite unions are van Kampen colimits.)

Note that half of the second condition is simply that the colimits in the first condition are stable under pullback. One may obtain various weaker notions by restricting the allowable values of κ\kappa.

We will prove the equivalence of these two characterizations in Propositions 1 and 2 below.

Examples

  • The category Set is easily verified to be exhaustive.

  • Since limits and colimits in presheaf categories are pointwise, any presheaf category [D op,Set][D^{op},Set] is also exhaustive.

  • Since the condition involves only colimits and finite limits, it is preserved by any left exact localization. Thus, every Grothendieck topos is exhaustive.

Properties

We first prove the equivalence of the above two definitions.

Proposition

In a category which satisfies the second definition above, given a transfinite union

A 0A 1A κ A_0 \to A_1 \to \cdots \to A_\kappa

(so that A αA βA_\alpha \to A_\beta is monic for all α<β<κ\alpha\lt\beta\lt\kappa), the coprojections A αA κA_\alpha\to A_\kappa are also monic.

Proof

For a fixed α\alpha, consider the diagram

A 0 A 1 A α A α A α A 0 A 1 A α A α+1 A κ \array{ A_0 & \to & A_1 & \to & \cdots & \to & A_\alpha & \to & A_\alpha & \to & \cdots & \to & A_\alpha\\ \downarrow && \downarrow &&&& \downarrow && \downarrow &&&& \downarrow\\ A_0 & \to & A_1 & \to & \cdots & \to & A_\alpha & \to & A_{\alpha+1} & \to & \cdots & \to & A_\kappa\\ }

It is easy to see that each intermediate square is a pullback, and of course the top row is a colimit. Thus, in particular the square

A α A α A α A κ\array{ A_\alpha & \to & A_\alpha \\ \downarrow && \downarrow\\ A_\alpha & \to & A_\kappa}

is a pullback, i.e. A αA κA_\alpha\to A_\kappa is monic.

Proposition

Suppose CC satisfies the first condition above, i.e. it has pullback-stable transfinite unions for which the coprojections are also monic. Then CC also satisfies the second condition above.

Proof

It remains to show that given a diagram

B 0 B 1 B κ f 0 f 1 f κ A 0 A 1 A κ \array{ B_0 & \to & B_1 & \to & \cdots & \to & B_\kappa\\ \downarrow^{f_0} && \downarrow^{f_1} &&&& \downarrow^{f_\kappa}\\ A_0 & \to & A_1 & \to & \cdots & \to & A_\kappa\\ }

in which both rows are transfinite compositions of monomorphisms and the squares

B α B β f α f β A α A β \array{ B_\alpha & \to & B_\beta \\ \downarrow^{f_\alpha} && \downarrow^{f_\beta} \\ A_\alpha & \to & A_\beta }

are pullbacks, also the squares

B α B κ f α f κ A α A κ \array{ B_\alpha & \to & B_\kappa \\ \downarrow^{f_\alpha} && \downarrow^{f_\kappa} \\ A_\alpha & \to & A_\kappa }

are pullbacks.

Fix an α<κ\alpha\lt\kappa, and suppose given g:XB κg\colon X\to B_\kappa such that f κgf_\kappa g factors through A αA_\alpha; we want to show that gg factors through B αB_\alpha. Pulling back the BB-colimit along gg and the AA-colimit along f κgf_\kappa g, we obtain another morphism of transfinite unions:

g *B 0 g *B 1 X 1 X (f κg) *A 0 (f κg) *A 1 X \array{ g^*B_0 & \to & g^*B_1 & \to & \cdots & \to & X\\ \downarrow && \downarrow &&&& \downarrow^{1_X}\\ (f_\kappa g)^* A_0 & \to & (f_\kappa g)^* A_1 & \to & \cdots & \to & X\\ }

and it is easy to verify, by the pasting law for pullbacks, that each square

g *B β g *B γ f β f γ (f κg) *A β (f κg) *A γ \array{ g^* B_\beta & \to & g^* B_\gamma \\ \downarrow^{f_\beta} && \downarrow^{f_\gamma} \\ (f_\kappa g)^* A_\beta & \to & (f_\kappa g)^* A_\gamma }

is a pullback for β<γ<κ\beta\lt\gamma\lt\kappa. However, since f κgf_\kappa g factors through A αA_\alpha, the morphism (f κg) *A β(f κg) *A γ(f_\kappa g)^* A_\beta \to (f_\kappa g)^* A_\gamma is split epic whenever α<β<γ\alpha\lt\beta\lt\gamma, hence (since it is also monic) an isomorphism. Thus, in this case so is its pullback g *B βg *B γg^* B_\beta \to g^* B_\gamma. Since the coprojections into a transfinite composite of a sequence that eventually consists of isomorphisms are also eventually isomorphisms, g *B αXg^* B_\alpha \to X is an isomorphism; hence gg factors through B αB_\alpha as desired.

Exhaustiveness also interacts well with other exactness properties:

Proposition

If an exhaustive category is also finitary extensive, then it is infinitary extensive.

Proof

A coproduct of cardinality κ\kappa can be constructed using transfinite compositions and finite coproducts:

α<0A α α<1A α α<2A α α<κA α \sum_{\alpha\lt 0} A_\alpha \to \sum_{\alpha\lt 1} A_\alpha \to \sum_{\alpha\lt 2} A_\alpha \to \cdots \to \sum_{\alpha\lt \kappa} A_\alpha

Finitary extensivity implies that all the transition maps are monic, so that these transfinite composites exist in an exhaustive category. Pullback-stability of coproducts follows easily from pullback-stability of transfinite unions and of finite coproducts. Finally, it is known (see extensive category) that if finite coproducts exist and are disjoint, then any infinite coproducts which exist are also disjoint.

Colimits in an exhaustive category preserve finite limits.

Lemma

In an exhaustive category, if XX is the κ\kappa-indexed transfinite union of a sequence (A α) α<κ(A_\alpha)_{\alpha\lt\kappa} and also a sequence (B α) α<κ(B_\alpha)_{\alpha\lt\kappa}, then it is also the transfinite union of the sequence (A αB α) α<κ(A_\alpha\cap B_\alpha)_{\alpha\lt\kappa} (the intersection being taken as subobjects of XX).

Proof

Since transfinite unions are stable under pullback, XX is the colimit of the (κ×κ)(\kappa\times\kappa)-indexed diagram (A αB β) α<κ,β<κ(A_\alpha\cap B_\beta)_{\alpha\lt\kappa, \beta\lt\kappa}. But κ\kappa is a filtered category, so its diagonal functor is final.

Proposition

In an exhaustive category, given a pullback diagram of κ\kappa-indexed transfinite sequences of monomorphisms:

(A α B α C α D α) α<κ \left(\array{ A_\alpha & \to & B_\alpha \\ \downarrow && \downarrow\\ C_\alpha & \to & D_\alpha }\right)_{\alpha\lt\kappa}

the induced square of colimits:

A κ B κ C κ D κ \array{ A_\kappa & \to & B_\kappa \\ \downarrow && \downarrow\\ C_\kappa & \to & D_\kappa }

is also a pullback.

Proof

Define PP so that the following square is a pullback:

P f B κ g C κ D κ \array{ P & \overset{f}{\to} & B_\kappa \\ ^g\downarrow && \downarrow\\ C_\kappa & \to & D_\kappa }

Since pullbacks preserve transfinite unions, PP is the transfinite union of the sequnece (f *B α) α<κ(f^* B_\alpha)_{\alpha\lt\kappa} and also the sequence (g *C α) α<κ(g^* C_\alpha)_{\alpha\lt\kappa}. Thus, by Lemma 1, PP is also the transfinite union of (f *B αg *C α) α<κ(f^* B_\alpha\cap g^* C_\alpha)_{\alpha\lt\kappa}. However, using the fact that the inclusions D αD κD_\alpha \to D_\kappa are monic, it is straightforward to verify that

f *B αg *C αB α× D αC αA α.f^* B_\alpha\cap g^* C_\alpha \cong B_\alpha \times_{D_\alpha} C_\alpha \cong A_\alpha.

Thus, PP is the transfinite union of (A α) α<κ(A_\alpha)_{\alpha\lt\kappa}, hence PA κP\cong A_\kappa.

Corollary

In an exhaustive category, transfinite unions preserve monomorphisms. That is, given a transformation (A αB α) α<κ(A_\alpha \to B_\alpha)_{\alpha\lt\kappa} of transfinite sequences of monomorphisms which is pointwise monic, also the induced map on colimits A κB κA_\kappa\to B_\kappa is monic.

References

  • The name “exhaustive category” is a coinage; there seems to be no established name in the literature for this exactness property. See this MO question.

Revised on February 23, 2013 07:46:53 by Mike Shulman (192.16.204.218)