Compactness in Euclidean Spaces

Welcome, students! 🌟 In this lesson, we will explore one of the most important ideas in topology: compactness in Euclidean spaces. Compactness is a property that helps mathematicians decide when a set behaves nicely, especially when dealing with sequences, continuous functions, and limits. In everyday terms, compact sets are the ones that are “small enough” and “complete enough” to avoid escaping to infinity or having holes in a topological sense.

What you will learn

By the end of this lesson, students, you should be able to:

• explain the main ideas and terminology behind compactness in Euclidean spaces,
• use the open-cover definition of compactness,
• recognize compact subsets of $\mathbb{R}^n$,
• connect compactness to closed and bounded sets,
• understand why compactness matters in the broader study of topology.

A powerful fact in Euclidean spaces is this: compactness can be checked using familiar geometric ideas. In $\mathbb{R}^n$, compact sets are exactly the sets that are both closed and bounded. This result is one of the most useful bridges between abstract topology and concrete geometry. 📏

The open-cover definition of compactness

Compactness begins with open sets. Recall that an open cover of a set $K$ is a collection of open sets whose union contains $K$. In symbols, if $K \subseteq \bigcup_{\alpha \in A} U_\alpha$ and each $U_\alpha$ is open, then $\{U_\alpha\}_{\alpha \in A}$ is an open cover of $K$.

A set $K$ is compact if every open cover of $K$ has a finite subcover. That means from possibly many open sets, we can choose just finitely many that still cover the whole set.

This is the key definition:

$$

K \text{ is compact} $\iff$ \text{every open cover of } K \text{ has a finite subcover.}

$$

Why is this important? Because compactness turns an infinite-looking problem into a finite one. Suppose a set is covered by infinitely many open regions. If the set is compact, you never need all of them at once; finitely many are enough. This is one reason compactness is so useful in analysis and topology.

A simple picture

Imagine a city map covered by many overlapping weather zones. If the city is compact, then no matter how many zones cover it, a finite number of zones already cover the whole city. If the city were not compact, you might need endlessly many zones to cover every point. 🌍

Compact subsets of $\mathbb{R}^n$

In Euclidean spaces, compactness has a beautiful characterization. The most famous result is the Heine–Borel theorem:

$$

K \subseteq \mathbb{R}^n \text{ is compact } $\iff$ K \text{ is closed and bounded.}

$$

This theorem is one of the major reasons Euclidean spaces are so friendly. Instead of checking every possible open cover directly, you can often use the easier geometric test of closedness and boundedness.

What does bounded mean?

A set $K \subseteq \mathbb{R}^n$ is bounded if all its points lie inside some large ball. Formally, there exists a number $M > 0$ such that

$$

\|x\| \le M \quad \text{for all } x $\in$ K.

$$

So bounded means the set does not stretch off to infinity.

What does closed mean?

A set is closed if it contains all its limit points. Another way to think about it is that the complement of the set is open. Closed sets include their boundary points. For example, the interval $[0,1]$ is closed, while $(0,1)$ is not closed because it misses the endpoints $0$ and $1$.

Example: compact and non-compact sets

• The interval $[0,1]$ is compact in $\mathbb{R}$ because it is closed and bounded.
• The interval $(0,1)$ is bounded but not closed, so it is not compact.
• The set $[0,\infty)$ is closed but not bounded, so it is not compact.
• The closed disk $\{(x,y) \in \mathbb{R}^2 : x^2 + y^2 \le 1\}$ is compact.
• The open disk $\{(x,y) \in \mathbb{R}^2 : x^2 + y^2 < 1\}$ is not compact.

These examples show that in Euclidean spaces, both conditions matter. Missing even one boundary point or letting the set extend endlessly can destroy compactness.

Why closed and bounded is enough in Euclidean spaces

students, you may wonder why closed and bounded is enough only in Euclidean spaces. The reason is tied to the special structure of $\mathbb{R}^n$. Euclidean spaces are complete and have a well-behaved metric structure. A crucial supporting fact is that in $\mathbb{R}^n$, every bounded sequence has a convergent subsequence. This is called the Bolzano–Weierstrass property.

Compactness and sequence behavior are deeply connected. In metric spaces, compactness is equivalent to sequential compactness, meaning every sequence has a convergent subsequence whose limit lies in the set. In $\mathbb{R}^n$, this matches the closed-and-bounded description perfectly.

A sequence example

Consider the sequence

$$

x_n = $\left(1$ + $\frac{1}{n}$,\, 2 - $\frac{1}{n}$$\right)$.

$$

All the points lie inside a bounded region, and the sequence converges to $(1,2)$. If a set contains all its limit points and traps all such sequences inside itself, it behaves compactly. This is why closedness matters: the limit of a convergent sequence must stay in the set.

A non-compact sequence example

Now consider the sequence $x_n = n$ in $\mathbb{R}$. This sequence is unbounded, so it has no convergent subsequence in $\mathbb{R}$. The set $\{n : n \in \mathbb{N}\}$ is not compact because it is not bounded.

Compactness prevents this kind of escape to infinity. 🚀

How compactness helps with continuous functions

Compactness is not just a property to memorize. It gives strong results for continuous functions. If $f$ is continuous and $K$ is compact, then $f(K)$ is compact. In Euclidean spaces, this means the image of a compact set under a continuous function is again closed and bounded.

This has important consequences:

• A continuous function on a compact set always attains a maximum and minimum value.
• Continuous functions on compact sets are automatically bounded.

For example, if $f(x) = x^2$ on $[0,1]$, then $f$ is continuous and $[0,1]$ is compact. So $f$ must have a maximum and a minimum on that interval. Indeed,

$$

$\min_{x \in [0,1]}$ x^2 = 0, \qquad $\max_{x \in [0,1]}$ x^2 = 1.

$$

This is extremely useful in real-world modeling. If a quantity such as temperature, cost, or distance is represented by a continuous function on a compact domain, then extreme values are guaranteed to exist.

Recognizing compactness in practice

When you meet a set in $\mathbb{R}^n$, ask two questions:

1. Is it bounded?
2. Is it closed?

If both answers are yes, then the set is compact. This quick test is often the easiest way to use compactness in Euclidean spaces.

Example 1: A line segment

The set $[2,5] \subseteq \mathbb{R}$ is compact because it is closed and bounded.

Example 2: A square

The set $[0,1] \times [0,1] \subseteq \mathbb{R}^2$ is compact. It is a closed and bounded rectangle.

Example 3: A half-open interval

The set $[0,1)$ is bounded, but it is not closed, so it is not compact. Even though it looks small, missing one endpoint is enough to fail compactness.

Example 4: An infinite ray

The set $[3,\infty)$ is closed, but not bounded, so it is not compact.

These examples show a common theme: compactness in Euclidean spaces balances two ideas at once — no missing limit points and no infinite spreading.

Connection to Compactness I

This lesson fits into the larger topic of Compactness I by focusing on compactness in the special and important case of Euclidean spaces. The open-cover definition is the general starting point. From there, Euclidean spaces give us extra tools and a powerful characterization.

In more general topological spaces, compactness may be harder to check. But in $\mathbb{R}^n$, the Heine–Borel theorem gives a practical method. That is why compactness in Euclidean spaces is such a central topic: it connects abstract topological language with concrete geometric intuition.

Compactness also prepares you for later ideas such as continuity, uniform continuity, convergence, and the behavior of functions on closed intervals and closed regions. Understanding compactness here gives you a strong foundation for the rest of topology. 🧠

Conclusion

students, compactness in Euclidean spaces is one of the most important ideas in topology because it provides a clean and useful criterion: in $\mathbb{R}^n$, a set is compact exactly when it is closed and bounded. The open-cover definition explains what compactness means in general, while the Heine–Borel theorem makes it easy to identify compact subsets in Euclidean spaces. Compact sets are powerful because they control infinite behavior, guarantee finite subcovers, and make continuous functions behave well.

As you continue studying topology, remember this central lesson: compactness turns large, complicated situations into manageable ones. That is why it appears again and again across mathematics.

Study Notes

• A set $K$ is compact if every open cover of $K$ has a finite subcover.
• In $\mathbb{R}^n$, the Heine–Borel theorem says $K$ is compact iff $K$ is closed and bounded.
• Bounded means the set fits inside some ball $\{x : \|x\| \le M\}$.
• Closed means the set contains all of its limit points.
• Examples of compact sets: $[0,1]$, $[2,5]$, closed disks, closed rectangles.
• Examples of non-compact sets: $(0,1)$, $[0,\infty)$, $\mathbb{R}$, open disks.
• Compactness prevents points from “escaping to infinity” and prevents missing boundary limits.
• In metric spaces, compactness is closely related to sequential compactness.
• Continuous images of compact sets are compact.
• Continuous functions on compact sets attain maximum and minimum values.