nLab
compactness and stable closure

Compactness and stable closure

Introduction

This page is dedicated to proving the equivalence of two notions of compactness, one being the classical open-cover formulation, and the other a “stable closure” condition (the property that ”X1 is a closed map” is stable under pullback).

Compactness implies stable closure

One direction is a very classical and straightforward fact, proved in every textbook on general topology.

Proposition

If X is compact, then for any space Y the projection π:X×YY is a closed map.

Proof

Let CX×Y be a closed subset, and suppose that y does not belong to π(C). We want to find an open neighborhood of y that does not intersect π(C), or so that X×V does not intersect C. Consider the collection 𝒞 of all open UX for which there exists an open VY containing y, such that U×V does not intersect C. Since yπ(C), for any xX we have (x,y)C, and since C is closed in the product topology, there exist V containing y and U containing x such that U×V does not intersect C. Therefore, 𝒞 covers X, so it has a finite subcover U i. For each of the finitely many i there is a corresponding V i such that U i×V i does not intersect C, and the intersection of the V i is a neighborhood of y which does not intersect π(C).

Stable closure implies compactness

The converse statement requires more ingenuity to prove. A preliminary observation is that the proof above was a bit convoluted because it was phrased throughout in terms of complements of closed sets; this suggests it would be convenient to reformulate the condition of being a closed map directly in terms of open sets:

Proposition

A map f:XY is closed iff fU is open in Y for every open U in X. Here fU is defined by the adjunction condition

f 1(B)UiffB fUf^{-1}(B) \subseteq U \qquad iff \qquad B \subseteq \forall_f U

for every BY.

Proof

The traditional formulation is that fC is closed in Y whenever C is closed in X, which is the same as that f¬U=¬ fU is closed in Y whenever U is open in X, i.e., fU is open in Y whenever U is open in X.

In the case of a projection map f=π:X×YY, this says

{yY:X×{y}U}\{y \in Y: X \times \{y\} \subseteq U\}

is open in Y whenever U is open in X×Y.

Next, a slight reformulation of the concept of compactness. Recall that a collection of subsets of X is directed if every finite subcollection has an upper bound. Then, a space X is compact if every directed open cover Σ of X contains X.

Theorem

If π:X×YY is a closed map for every space Y, then X is compact.

Proof

Let Σ be a directed open cover of X. Define a space Y as follows: the points of Y are open sets of X (so the underlying set of Y is the topology 𝒪(X)), and the open sets of Y are upward-closed subsets W of 𝒪(X) such that ΣW is nonempty whenever W is nonempty.

Claim

This is a topology.

Proof

Clearly such W are closed under arbitrary unions. If W and W are open and UΣW and UΣW, then any upper bound of U and U in Σ belongs to both W and W since these are upward-closed.

Moreover, whenever U belongs to Σ, the principal up-set prin(U)={V𝒪(X):UV is open in Y.

Now consider the set E={(x,U)X×Y:xU}. Claim: this is open in X×Y. Proof: for every (x,U)E, there exists UΣ such that xU (because Σ is a cover), and then for U=UU, the set U×prin(U) is an open set which contains (x,U), and U×prin(U)E because for every (y,V)U×prin(U), we have yV.

By the open-set reformulation of the closed map condition, the set

{VY:X×{V}E}\{V \in Y: X \times \{V\} \subseteq E\}

is open in Y, so this set is upward-closed and intersects Σ, so that X×{V}E for some VΣ. But then V is all of X! So XΣ for any directed open cover Σ; therefore X is compact.

Reference

The proof of the theorem above was extracted from

  • Martin Escardo, Intersections of compactly many open sets are open, 2009 (pdf)

See also this exchange at Math Overflow, where the question was raised as to whether the axiom of choice (or possibly a weaker choice principle like the ultrafilter theorem) is required to prove the equivalence of these two notions of compactness (examination of the proofs above show it is not).

Revised on October 17, 2010 07:32:19 by Toby Bartels (98.19.58.126)