Open-Cover Definition of Compactness

students, imagine trying to cover a park with blankets so that every spot is shaded 🌳. If the park is small enough, maybe only a few blankets are needed. In topology, we study a similar idea using open sets and covers. This lesson introduces the open-cover definition of compactness, one of the most important ideas in Compactness I.

What you will learn

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

explain what an open cover is and why it matters,
describe the open-cover definition of compactness,
use examples to decide whether a set is compact,
connect compactness to later ideas such as compact subsets and compactness in Euclidean spaces,
recognize how open covers help us understand “smallness” in a topological sense.

The main idea is simple but powerful: compactness says that if a set can be covered by open sets, then only finitely many of those open sets are actually needed. That finite nature is what makes compact sets behave well in mathematics 📘.

What is an open cover?

In topology, we often work with a space $X$ and a subset $K \subseteq X$. An open set is a set that belongs to the topology of $X$. In the usual topology on $\mathbb{R}$, open intervals like $(0,1)$ are open sets.

An open cover of a set $K$ is a collection of open sets whose union contains $K$.

Formally, if $\{U_\alpha\}_{\alpha \in A}$ is a collection of open sets in $X$, then it is an open cover of $K$ if

$$K \subseteq \bigcup_{\alpha \in A} U_\alpha.$$

This means every point of $K$ lies in at least one of the open sets in the collection.

Real-world picture

Think of $K$ as a row of houses and each open set as a delivery zone for a mail carrier 🚚. If every house is inside at least one delivery zone, then the collection of zones covers the street. An open cover is just a mathematical version of that idea.

Example 1: An open cover of an interval

Let $K = [0,1]$ inside $\mathbb{R}$. Consider the collection

$$\left\{\left(-\frac{1}{n}, 1+\frac{1}{n}\right) : n \in \mathbb{N}\right\}.$$

Each set in this collection is open, and together they cover $[0,1]$. In fact, every point of $[0,1]$ lies in each of these open intervals, so this is an open cover.

Example 2: Another open cover

The interval $[0,1]$ is also covered by the two open sets

$$(-1, 0.6) \quad \text{and} \quad (0.4, 2).$$

Their union contains all of $[0,1]$, because points from $0$ to $0.6$ are in the first set, and points from $0.4$ to $1$ are in the second set. This is also an open cover.

The open-cover definition of compactness

Now we come to the key definition.

A set $K$ is compact if every open cover of $K$ has a finite subcover.

That means: whenever you cover $K$ with possibly many open sets, you can always choose only finitely many of them and still cover all of $K$.

Formally, if $\{U_\alpha\}_{\alpha \in A}$ is an open cover of $K$, then there exist indices $\alpha_1, \alpha_2, \dots, \alpha_n$ such that

$$K \subseteq U_{\alpha_1} \cup U_{\alpha_2} \cup \cdots \cup U_{\alpha_n}.$$

This finite selection is called a finite subcover.

Why this is important

This definition captures a strong kind of “boundedness” and “completeness” in topology, but it does so without using distances directly. It works in general topological spaces, not just in number lines or coordinate spaces. That is why compactness is such a central idea in topology.

Important detail

The word “every” matters. To prove a set is compact, you must show that no matter how someone chooses an open cover, a finite subcover always exists. To prove a set is not compact, it is enough to find one open cover with no finite subcover.

How to use the definition in practice

When students checks compactness from the open-cover definition, the task usually looks like this:

Start with an arbitrary open cover of the set.
Show that a finite number of the open sets are enough.
Conclude the set is compact.

This style of proof is common in topology because the definition itself is universal.

Example 3: Why $(0,1)$ is not compact

Consider the open cover of $(0,1)$ given by

$$\left\{\left(\frac{1}{n}, 1\right) : n \in \mathbb{N}\right\}.$$

Each set is open, and their union is $(0,1)$, because every point $x \in (0,1)$ is greater than $\frac{1}{n}$ for some large enough $n$.

But no finite number of these intervals covers all of $(0,1)$. If you choose finitely many, say

$$\left(\frac{1}{n_1}, 1\right), \left(\frac{1}{n_2}, 1\right), \dots, \left(\frac{1}{n_k}, 1\right),$$

the smallest lower bound among them is still some positive number $\frac{1}{N}$. Then points very close to $0$, such as $\frac{1}{2N}$, are not covered. So $(0,1)$ is not compact.

This example shows how an open cover can reveal that a set is “too open at the edge” to be compact.

Example 4: Why a finite set is compact

Suppose $K = \{a_1, a_2, \dots, a_m\}$ is a finite set in any topological space.

Take any open cover of $K$. Since each point $a_i$ must be in at least one open set, choose one open set containing each point. That gives at most $m$ open sets, so a finite subcover exists.

Thus every finite set is compact. This is one of the easiest compactness facts to remember ✅.

Compact subsets and the big picture

The open-cover definition is not just a standalone idea. It is the starting point for the study of compact subsets.

A compact subset is simply a subset that is compact with respect to the topology of the surrounding space. For example, $[0,1]$ is a compact subset of $\mathbb{R}$ with the usual topology.

The open-cover definition also connects to compactness in Euclidean spaces. In $\mathbb{R}^n$, a famous result says that a set is compact if and only if it is closed and bounded. This is a deep and useful theorem, but it depends on the open-cover definition as the main idea.

So when you later see claims like “closed and bounded sets in $\mathbb{R}^n$ are compact,” remember that the real engine underneath is the open-cover definition.

Common mistakes and how to avoid them

students, here are some common errors students make:

confusing an open cover with a single open set,
forgetting that the cover must include the whole set,
thinking that compact means “small” in a size sense only,
checking only one cover instead of every open cover,
assuming a finite subcover must be unique.

A finite subcover only needs to exist; it does not have to be the only one.

Another useful point: compactness depends on the topology. The same set can be compact in one topology and not compact in another. That is why topology studies compactness as a structural property rather than just a geometric one.

Conclusion

The open-cover definition is the heart of compactness in topology. It says that a set is compact if every open cover has a finite subcover. This idea helps us identify sets that behave nicely, such as finite sets and closed bounded sets in $\mathbb{R}^n$. It also prepares you for later lessons on compact subsets and compactness in Euclidean spaces.

If you remember only one sentence, let it be this: compactness means that no matter how many open sets are used to cover a set, only finitely many are ever needed in the end 🌟.

Study Notes

An open cover of a set $K$ is a collection of open sets whose union contains $K$.
A set $K$ is compact if every open cover of $K$ has a finite subcover.
The definition uses the form $$K \subseteq \bigcup_{\alpha \in A} U_\alpha.$$
To prove compactness, start with an arbitrary open cover and find a finite subcover.
To prove a set is not compact, give one open cover with no finite subcover.
Every finite set is compact.
The interval $(0,1)$ is not compact in the usual topology on $\mathbb{R}$.
In $\mathbb{R}^n$, compact sets are exactly the sets that are closed and bounded.
Compactness is a topological property, so it depends on the topology being used.
The open-cover definition is the foundation for later results in Compactness I.