Compactness and open covers

Try

The interval (0,1) is bounded in its usual metric but not compact. The relatively open sets (1/n,1), for integers n≥2, cover it, yet every finite selection misses some points near zero.

Compactness is not a claim that every cover is finite. It says that from every open cover, one can select finitely many members still covering the space. The quantifier over all covers is the demanding part.

Predict

Predict whether every finite space is compact even when its topology is non-Hausdorff. Choose one covering set for each point; only finitely many choices are needed. No separation axiom enters.

Predict whether an infinite space can be compact without being Hausdorff. The cofinite topology provides one: a single nonempty covering set leaves only finitely many points uncovered.

Experiment

Compare cover mechanisms.

Space	Compact?	Mechanism
Finite space with any topology	Yes	One cover member per point
Usual (0,1)	No	Cover approaching missing endpoint
Infinite cofinite space	Yes	One open leaves a finite remainder
Infinite discrete space	No	Singleton cover has no finite subcover

These examples show why finiteness, boundedness and compactness must not be treated as synonyms.

Understand

An open cover of X is a family of open subsets whose union is X. Compactness requires a finite subfamily with the same covering property. For a subset K of a larger space, compactness means compactness in its subspace topology; equivalently, every cover by ambient-open sets has a finite subcover on K.

A family of sets has the finite intersection property when every finite subfamily has nonempty intersection. Compactness is equivalent to saying that every family of closed sets with this property has nonempty total intersection. To prove it, take complements. An empty total closed intersection gives an open cover; a finite subcover is an empty finite closed intersection. Negating those statements gives both directions.

This formulation explains nested compact-set arguments without sequences. For a family of closed sets in a compact space, finite compatibility already forces global compatibility. No countable indexing is required.

The cofinite example illustrates compactness directly. Given an open cover of a nonempty space, choose one nonempty member U. Its complement is finite. Select one cover member for each remaining point, producing a finite subcover with U. In an infinite discrete space, the singleton cover cannot be reduced because each point is covered only by its own singleton.

Heine–Borel identifies compact subsets of Euclidean space with closed and bounded sets, but that is a theorem about a particular topology and metric. The abstract definition contains neither distances nor coordinates.

Apply

Give the no-finite-subcover argument for (0,1) explicitly. A finite selection of the sets (1/n,1) lies inside the one with largest selected n and misses sufficiently small positive points. Merely observing that the cover was written as an infinite list is not a proof.

Repair “Every decreasing family of nonempty closed sets has nonempty intersection.” Compactness of the ambient space, or an appropriate compact member, is needed. In R, the closed sets [n,∞) are nested and nonempty but have empty intersection.

Continue

The next lesson studies how compactness moves through maps and interacts with Hausdorff separation. Optional depth: prove that a finite union of compact subspaces is compact by extracting a finite subcover on each piece and combining the finitely many selections.