Compactness in General Topology

Compactness is one of the most powerful and unifying concepts in topology, transforming local properties into global ones and guaranteeing the existence of crucial mathematical objects. While its definition is deceptively simple, its consequences are profound, underpinning results from calculus to functional analysis and providing a framework for understanding finite-like behavior in infinite spaces. Mastering compactness is essential for any serious study of analysis, geometry, or higher mathematics.

The Finite Subcover Property: The Core Definition

The foundational idea of compactness is a generalization of the notion of a "finite" set to the topological realm. An open cover of a topological space $X$ is a collection of open sets whose union contains $X$. A subcover is a subcollection of these sets that still covers $X$.

A topological space $X$ is called compact if every open cover of $X$ has a finite subcover. In other words, no matter how you try to blanket the space with open sets, you can always accomplish the task using only finitely many of them. This definition is purely topological, meaning it depends only on the open-set structure of $X$.

This property is incredibly strong. It doesn't just say some covers have finite subcovers; it says all of them do. To build intuition, consider the real line $\mathbb{R}$. The open cover $\{(-n,n):n\in \mathbb{N}\}$ has no finite subcover, because any finite collection $\{(-n_1,n_1),...,(-n_k,n_k)\}$ would be bounded by $M=\max (n_1,...,n_k)$, leaving points like $M+1$ uncovered. Hence, $\mathbb{R}$ is not compact. In contrast, the essence of compactness is a kind of "boundedness" combined with a notion of being "closed" or complete, which the Heine-Borel theorem makes precise for familiar Euclidean spaces.

The Heine-Borel Theorem: Compactness in Euclidean Space

For subspaces of ${\mathbb{R}}^n$ with the standard topology, the abstract finite subcover property translates into a concrete, checkable condition. The Heine-Borel Theorem states: A subset $K$ of ${\mathbb{R}}^n$ is compact if and only if it is closed and bounded.

This theorem bridges the gap between analysis and topology. The "bounded" condition prevents the space from "stretching out to infinity," avoiding covers like the one for $\mathbb{R}$ mentioned earlier. The "closed" condition ensures the set contains all its limit points, preventing you from "punching a hole" that could be exploited to create an open cover with no finite subcover. For example, the closed interval $[0,1]$ is compact by Heine-Borel. The open interval $(0,1)$ is bounded but not closed; the open cover $\{(1/n,1):n\in \mathbb{N}\}$ has no finite subcover, confirming it is not compact.

The power of this equivalence is immense. It allows us to recognize compact sets in ${\mathbb{R}}^n$ instantly (e.g., a sphere, a cube, a finite set of points) and to import all the powerful theorems about compact spaces to these familiar objects.

Tychonoff's Theorem: Compactness Under Products

One of the most significant and profound results in general topology is Tychonoff's Theorem. It addresses a natural question: If you take a product of spaces, is the product compact? The theorem affirms: The product of any collection (finite or infinite) of compact spaces is compact in the product topology.

This is a non-obvious and deeply powerful result. For finite products, it can be proven from the open cover definition. However, for infinite products, the proof necessarily relies on the Axiom of Choice (or an equivalent principle like Zorn's Lemma), highlighting the theorem's foundational strength. Tychonoff's Theorem is a central tool in analysis and functional analysis. For instance, it guarantees that an infinite product of closed intervals like $[0,1]\times [0,1]\times ...$ (the Hilbert cube) is compact, a fact used in proving fundamental results about spaces of functions.

Major Applications and Consequences

The utility of compactness lies in the powerful theorems it enables. Here are three cornerstone applications:

1. Existence of Maxima and Minima: A fundamental result in analysis states that a continuous real-valued function on a compact space attains its maximum and minimum values. The proof elegantly uses compactness: the image of the compact set under the continuous function is compact in $\mathbb{R}$, hence closed and bounded by Heine-Borel. Being bounded implies the supremum and infimum exist, and being closed forces these bounds to be contained within the image—they are actually attained. This theorem is why we can guarantee a continuous function on a closed interval $[a,b]$ has absolute extrema.

2. Sequential Compactness and Convergence: In metric spaces (and more generally, spaces with a countable basis), compactness is equivalent to sequential compactness: every sequence has a convergent subsequence. This is an indispensable tool in analysis for proving convergence when direct methods fail. You first show your sequence lies in a compact set, extract a convergent subsequence, and then use other arguments to show the limit has the desired properties. This technique is ubiquitous in calculus of variations and differential equations.

3. Foundations in Functional Analysis: Compactness is the key ingredient in defining compact operators, which generalize finite-dimensional linear maps. The famous Arzelà-Ascoli Theorem gives a condition for compactness in function spaces (specifically, equicontinuous and uniformly bounded families of functions). These ideas are critical for solving integral equations and analyzing spectral theory, forming the bedrock for many modern techniques in applied mathematics.

Common Pitfalls

1. Confusing Boundedness with Compactness: In a general metric space, a compact set is always closed and bounded, but the converse is not generally true. The Heine-Borel theorem applies only to ${\mathbb{R}}^n$ with the standard topology. In an infinite-dimensional space like ${\ell }^2$, the closed unit ball is closed and bounded but not compact. The property that "closed and bounded implies compact" is a special feature of finite-dimensional Euclidean spaces.

1. Misapplying the Finite Subcover Logic: A common error is to think you need to find a finite subcover for a specific cover to prove compactness. To prove a space is compact, you must take an arbitrary open cover and show it admits a finite subcover. Conversely, to disprove compactness, you only need to exhibit one specific open cover that lacks a finite subcover (as with $(0,1)$).

1. Equating Compactness with Completeness: A compact metric space is complete, but completeness does not imply compactness. For example, the real line $\mathbb{R}$ is complete (all Cauchy sequences converge) but not compact. Compactness is a much stronger global condition.

1. Overlooking the Topological Nature: Compactness is a topological property, preserved under continuous images. However, it is not preserved under continuous pre-images. A continuous function maps a compact set to a compact set, but the inverse image of a compact set under a continuous function need not be compact (e.g., $f:\mathbb{R}\to \{0\}$, $f^{-1}(\{0\})=\mathbb{R}$).

Summary

• Compactness is defined by the finite subcover property: every open cover has a finite subcover. This encapsulates a form of finiteness for topological spaces.
• The Heine-Borel Theorem provides a concrete characterization in ${\mathbb{R}}^n$: compact sets are precisely those that are closed and bounded.
• Tychonoff's Theorem is a fundamental result stating arbitrary products of compact spaces remain compact, a theorem with deep consequences in analysis.
• Compactness guarantees that continuous real-valued functions attain maximum and minimum values, provides tools for extracting convergent subsequences (sequential compactness in metric spaces), and is essential in functional analysis for defining compact operators and understanding function spaces.
• Key distinctions to remember: compactness is strictly stronger than both closedness + boundedness (outside ${\mathbb{R}}^n$) and completeness; it is preserved under continuous images but not pre-images.