advanced26 min studyLesson 62 in Mathematics

Compactness and connectedness

Separate finite-cover control from the impossibility of splitting a space into disjoint open regions.

On this page

What you’ll understand

  • Use open covers to distinguish compact from merely bounded sets.
  • State the finite-dimensional limit of the closed-and-bounded criterion.
  • Use continuous images to reason about connectedness and extrema.

A local estimate around every point does not automatically become one estimate valid everywhere. Compactness often supplies the missing finite reduction: an arbitrarily large collection of neighborhoods covering the space can be replaced by finitely many of them. Connectedness answers another question, asking whether the space splits into separate open pieces. Neither property determines the other. Understanding their different roles clarifies why continuous functions attain extrema on some domains and why intermediate-value arguments survive far beyond ordinary intervals.

Compactness is defined through covers

An open cover of a space is a family of open sets whose union contains every point. The space is compact when every such cover has a finite subcover. The word every makes this a global property. For the interval (0,1), the sets (1/n,1)(1/n,1) for integers n≥2 form an open cover in its subspace topology. Any finite selection has a largest n and misses sufficiently small positive points. Boundedness therefore does not establish compactness.

In finite-dimensional Euclidean space with its usual topology, the Heine-Borel theorem says that a subset is compact exactly when it is closed and bounded. The ambient-space qualification is essential. In an infinite-dimensional Hilbert space, the closed unit ball is bounded and closed but not norm-compact: orthonormal unit vectors remain distance √2 apart and have no norm-convergent subsequence. In metric spaces compactness is equivalent to sequential compactness, and also to completeness plus total boundedness. Boundedness alone is weaker than total boundedness.

K⊂Rn compact⟺K is closed and bounded(n<∞)K\subset\mathbb R^n\text{ compact}\quad\Longleftrightarrow\quad K\text{ is closed and bounded}\qquad(n<\infty)
This equivalence uses the ordinary Euclidean topology and finite dimension. It is not a general theorem about closed bounded subsets of all metric spaces.↔ Scroll wide equations horizontally.

Connectedness rules out a separation

A separation writes a space as the union of two disjoint, nonempty subsets that are both open in that space. Connected spaces admit no such separation. The phrase in that space refers to the subspace topology: the intervals [0,1] and [2,3] are open relative to their union, despite not being open in the entire real line. Their union is disconnected. Intervals in the real line are connected because a hypothetical separation would contradict the order-completeness underlying intermediate-value arguments.

A path is a continuous map from [0,1] into a space with specified endpoints. Path-connectedness implies connectedness because an interval cannot cross a separation continuously. The converse fails for general topological spaces. It does hold for connected manifolds, which are locally path-connected. This distinction prevents a drawing from doing too much work: a complicated connected set need not supply a continuous route between every pair of its points, even when its points appear to crowd together.

X=U∪V,U∩V=∅,U,V≠∅,U,V open in XX=U\cup V,\quad U\cap V=\varnothing,\quad U,V\ne\varnothing,\quad U,V\text{ open in }X
A decomposition satisfying all four conditions is a separation. Connectedness means that no such pair U,V exists.↔ Scroll wide equations horizontally.

Continuous maps preserve both properties

A continuous image of a compact space is compact: pull an open cover backward, take a finite subcover in the domain, and push the resulting coverage forward. A continuous image of a connected space is connected: a separation of the image would pull back to a separation of the domain. These are different proofs with the same useful strategy of working with preimages. A continuous real-valued function on a nonempty compact space consequently attains both a maximum and a minimum.

For a compact interval, the extreme-value theorem and intermediate-value theorem combine to make the image a closed interval. Removing compactness may lose attained endpoints; removing connectedness may leave gaps. For example, the identity on (0,1) has a connected image but no maximum. A function on two isolated points has a compact image but need not assume intermediate values. Before invoking a theorem, identify which hypothesis performs the desired job instead of treating all pleasant domain properties as interchangeable.

An attained range with a turning point

Find the image of [−1,2] under f(x)=x2f(x)=x^2, explaining both its endpoints and the absence of gaps.

  1. The domain is closed and bounded in the real line, so it is compact. It is also an interval, so it is connected. The polynomial f is continuous.

  2. For every input in the domain, 0≤x2≤40\le x^2\le4. The lower bound occurs at x=0 and the upper bound at x=2; checking only endpoint values 1 and 4 would miss the minimum.

  3. Continuity preserves connectedness, so the image contains every value between its attained extremes. It is exactly [0,4], rather than a disconnected set containing only the values seen at a few sampled inputs.

The result

Compactness accounts for attained extrema; connectedness accounts for the intervening values. The image is [0,4].

Explore the model

Interactive lab

Interactive lab · function

Separate a value from a global claim

Set a=1 in the quadratic plot and move x through the visible interval. Predict the minimum before looking at the tangent readout; then compare points on opposite sides of zero. The lab displays values of one continuous function. Finite sampled positions neither prove compactness of a domain nor establish the absence of gaps in every continuous image.

Separate a value from a global claimThis lab uses only y = ax². Playback traces the curve within the fixed integration interval from 0 to x; it does not estimate numerical error or change the chosen point. Current readings: y at chosen x: 0.608; Tangent slope · 2ax: 1.35; Signed area · ax³/3: 0.182. All parameters are adjustable with the labeled controls below.−2.4−1.201.22.4−9−4.504.59xy(x, ax²)
y = ax²TangentSigned integral
y at chosen x
0.608
Tangent slope · 2ax
1.35
Signed area · ax³/3
0.182
t = 0 s

This lab uses only y = ax². Playback traces the curve within the fixed integration interval from 0 to x; it does not estimate numerical error or change the chosen point. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forUse domain hypotheses to justify the whole range; a cursor only verifies particular values.

Check your understanding

Which claim correctly distinguishes compactness in finite and infinite dimensions?

Try it yourself

Classify K=[0,1]∪[2,3] in the real line as compact or not, and connected or not. Give a reason for each answer.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

Use Heine-Borel for one property and relative open sets for the other.

Compare with the solution

K is closed and bounded, so it is compact. It is disconnected: intersecting K with (−1,3/2) gives [0,1], while intersecting it with (3/2,4) gives [2,3]. These are disjoint nonempty relatively open subsets covering K. Compactness does not prevent this separation.

Take it with you

  • Compactness turns every open cover into finite coverage.
  • Closed and bounded is a compactness criterion only in the appropriate finite-dimensional setting.
  • Connectedness controls gaps, while compactness controls global finite reduction and attained extrema.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.