A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Heine-Borel Theorem

Graduate Depth 79 in the knowledge graph ☐ I know this ☆ Set as goal
4topics build on this
428prerequisites beneath it
See this on the map →
Compactness via Open CoversCompact Sets and the Heine-Borel Theorem→→Open Covers and Finite SubcoversTychonoff's Theorem
compactness characterization

Core Idea

In ℝⁿ with standard topology, a set is compact iff it is closed and bounded. This theorem does not generalize to all metric spaces (e.g., [0,∞) is closed but not compact), showing that compactness is truly a topological concept, not merely about boundedness.

Explainer

You already know the abstract definition of compactness: a space is compact if every open cover has a finite subcover. That definition is powerful but opaque — given an arbitrary set in ℝⁿ, checking every possible open cover is infeasible. The Heine-Borel Theorem replaces this with a concrete geometric test: in ℝⁿ with its standard topology, a set K is compact if and only if it is closed and bounded. Closed means K contains all its limit points. Bounded means K fits inside some ball of finite radius. Both conditions are straightforward to verify.

Why do both conditions matter? Bounded alone is insufficient: the open interval (0, 1) is bounded, but the open cover {(1/n, 1) : n ≥ 2} has no finite subcover — the left endpoint 0 is the problem, and it's a limit point missing from the set. Closed alone is also insufficient: the entire real line ℝ is closed, but cover it with open intervals (−n, n) for n = 1, 2, 3, …; no finite subcollection covers all of ℝ. The combination — closed and bounded — is what traps sequences and covers simultaneously: boundedness prevents escape to infinity, and closedness ensures limit points are included.

The proof strategy illustrates the deep connection to Bolzano-Weierstrass. One direction (compact → closed and bounded) is relatively easy: compactness implies sequential compactness, which forces the set to contain its limit points (hence closed) and prohibits sequences escaping to infinity (hence bounded). The other direction (closed and bounded → compact) proceeds by enclosing K in a large closed box, showing the box is compact via iterated bisection, and noting that K as a closed subset of a compact set is itself compact.

The theorem's scope is limited to ℝⁿ, and this is no accident. In the space C([0,1]) of continuous functions with the sup norm, the closed unit ball {f : ‖f‖∞ ≤ 1} is closed and bounded but not compact — you can construct sequences of continuous functions with no convergent subsequence. Compactness is a topological property, not a geometric one, and "closed and bounded" is a special feature of finite-dimensional Euclidean space. In higher-dimensional and infinite-dimensional settings, you must work directly from the cover definition or use sequential compactness, which is why the abstract definition was necessary to learn first.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Multiplying Binomials (FOIL) → Factoring Trinomials → Factoring Completely → Introduction to Rational Expressions → Simplifying Radical Expressions → Operations with Radicals → Complex Numbers Introduction → Operations with Complex Numbers → Solving Quadratic Equations by Completing the Square → Quadratic Formula Review and Applications → Graphing Quadratic Functions: Vertex and Intercepts → Quadratic Inequalities → Polynomial Functions: Degree and Leading Coefficient → Weierstrass Approximation Theorem → Bolzano-Weierstrass Theorem → Heine-Borel Theorem → Uniform Continuity on Compact Sets → Compact Sets and the Heine-Borel Theorem → Heine-Borel Theorem

Longest path: 80 steps · 428 total prerequisite topics

Prerequisites (2)

Leads To (2)