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

Open Covers and Finite Subcovers

Graduate Depth 80 in the knowledge graph ☐ I know this ☆ Set as goal
2topics build on this
439prerequisites beneath it
See this on the map →
Open Sets in Topological SpacesCompact Sets+1 more→→Sequential Compactness in Metric Spaces
open-covers compactness

Core Idea

An open cover of K is a collection {Uᵢ} of open sets with K ⊆ ⋃ Uᵢ. A space is compact if every open cover has a finite subcover. Open covers encode 'global' properties: compact spaces cannot be covered by infinitely many 'small' open sets. Compactness is preserved by continuous images and closed subsets of compact spaces.

Explainer

You already know what open sets are — sets where every point has a neighborhood entirely contained within the set. An open cover of a set K is simply a collection of open sets whose union contains K: think of it as a collection of "patches" that together cover all of K, where each patch is allowed to overlap with others. There is no restriction on how many patches you use or how large they are; an open cover can be infinite, even uncountably so.

Compactness is the property that no matter how profligate your initial covering, you can always thin it down to finitely many patches. Formally: K is compact if every open cover of K has a finite subcover — a finite sub-collection that still covers K. This sounds technical, but the intuition is powerful: compact spaces have "no room to escape to infinity or to the boundary." The canonical example to hold in mind is the contrast between (0, 1) and [0, 1] in ℝ. Cover (0, 1) by the intervals (1/n, 1) for n = 2, 3, 4, … Each interval is open, and their union is (0, 1). But no finite sub-collection covers (0, 1) — every finite sub-collection misses points near 0. So (0, 1) is not compact. Cover [0, 1] by the same collection and add (−0.1, 0.1): now the point 0 is covered, and 1 is always covered. By the Heine–Borel theorem, [0, 1] is compact — any open cover reduces to a finite one.

The abstract definition may seem harder to use than Heine–Borel (closed and bounded in ℝⁿ implies compact), but it is essential for working in general topological spaces where no metric exists. The key theorem you should internalize: continuous images of compact spaces are compact. If f: K → Y is continuous and K is compact, then f(K) is compact. One spectacular consequence is the extreme value theorem: a continuous function on a compact space attains its maximum and minimum, because the image is compact (and compact subsets of ℝ are closed and bounded, hence contain their supremum and infimum). Closed subsets of compact spaces are compact for the same reason: restrict any open cover of the closed subset to an open cover of the whole compact space, extract a finite subcover, and restrict back. These two preservation theorems are the main tools for applying compactness in practice.

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 → Open Covers and Finite Subcovers

Longest path: 81 steps · 439 total prerequisite topics

Prerequisites (3)

Leads To (1)