Compact Domains
A set 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 .
Examples of compact sets: closed intervals , closed balls , and closed rectangles . Non-compact examples: open intervals , all of , half-open intervals .
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
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 exists by compactness
Quiz
Which of the following sets is compact?
A closed subset of 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 .
- Forgetting to check boundedness when verifying compactness.