Linear Algebra
12.198 min read

Compact Domains

A set DRnD \subseteq \mathbb{R}^n is compact if it is closed (contains all its limit points) and bounded (fits inside a ball of finite radius). Compact sets are geometrically the "finite" or "closed and bounded" subsets of Rn\mathbb{R}^n.

Examples of compact sets: closed intervals [a,b][a,b], closed balls {x:xr}\{\mathbf{x} : \|\mathbf{x}\| \leq r\}, and closed rectangles [a1,b1]××[an,bn][a_1,b_1] \times \cdots \times [a_n,b_n]. Non-compact examples: open intervals (a,b)(a,b), all of Rn\mathbb{R}^n, half-open intervals [a,b)[a,b).

Compactness is important for optimization because it ensures the existence of global minima and maxima (Extreme Value Theorem). Without compactness, a continuous function can fail to achieve its minimum or maximum on the domain.

Formal View

Definition 12.8 — Compact Set
A set DRnD \subseteq \mathbb{R}^n is compact if it is both closed and bounded. Equivalently (Heine-Borel theorem), DD is compact iff every sequence in DD has a convergent subsequence whose limit is in DD.

Why This Matters

Compact domains guarantee the existence of solutions to optimization problems, making them highly desirable in theory.

  • Constrained optimization over closed and bounded feasible regions
  • Worst-case analysis: finding the maximum error over a compact uncertainty set
  • Function approximation: best polynomial approximation over [a,b][a,b] exists by compactness

Quiz

Question 1

Which of the following sets is compact?

Question 2

A closed subset of Rn\mathbb{R}^n is always compact.

Common Mistakes

  • Confusing "closed" with "compact" — closed and bounded are both needed.
  • Thinking open sets can be compact — open sets are not closed and hence not compact in Rn\mathbb{R}^n.
  • Forgetting to check boundedness when verifying compactness.