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

Sequential Compactness in Metric Spaces

Graduate Depth 81 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
459prerequisites beneath it
See this on the map →
Open Covers and Finite SubcoversCauchy Sequences in Metric Spaces+1 more→→Compact Metric Spaces and Characterizations
sequential-compactness metric-spaces

Core Idea

A space is sequentially compact if every sequence has a convergent subsequence. In metric spaces, sequential compactness and compactness are equivalent (by Bolzano-Weierstrass). In general spaces they differ; infinite products can be compact but not sequentially compact (Tychonoff). This equivalence makes metric spaces special.

Explainer

You know that a space is compact in the open-cover sense when every open cover has a finite subcover. This is a powerful but abstract global condition. Sequential compactness approaches the same idea operationally: a metric space is sequentially compact if every infinite sequence in it has a subsequence that converges to a point in the space. The Bolzano-Weierstrass theorem from calculus — every bounded sequence in ℝ has a convergent subsequence — is the prototype: a closed bounded interval in ℝ is sequentially compact.

In a general topological space, these two notions diverge. Uncountable products with the product topology (Tychonoff spaces) can be compact by Tychonoff's theorem while failing to be sequentially compact. But in the concrete setting of metric spaces they coincide: a metric space is compact if and only if it is sequentially compact. The proof that sequential compactness implies compactness uses the metric structure in an essential way — specifically, the notion of total boundedness (for every ε > 0, the space can be covered by finitely many ε-balls) and the Lebesgue number lemma (every open cover of a sequentially compact metric space has a Lebesgue number δ > 0, meaning every ball of radius δ is contained in some cover element).

Why does the equivalence matter? Sequential compactness is often much easier to verify directly. For subsets of ℝⁿ, the Heine-Borel theorem characterizes compact sets as exactly the closed and bounded ones — and the argument runs through sequential compactness: bounded sequences in ℝⁿ have convergent subsequences (by applying Bolzano-Weierstrass coordinate by coordinate), and closedness ensures the limit stays in the set. For infinite-dimensional function spaces, sequential compactness is harder to achieve and the Arzelà-Ascoli theorem provides the right criterion: a family of functions is sequentially compact in the uniform metric iff it is uniformly bounded and equicontinuous.

The broader lesson is that in metric spaces you have three equivalent formulations of compactness — open-cover compactness, sequential compactness, and complete plus totally bounded. Each is the right tool for different arguments. Open covers work for abstract topological results (continuous images of compact sets are compact). Sequential compactness is natural for analysis (proving continuous functions on compact metric spaces attain their extrema). Complete plus totally bounded is useful in function spaces. In metric spaces, you can freely switch between these descriptions to use whichever makes the proof cleanest.

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 → Sequential Compactness in Metric Spaces

Longest path: 82 steps · 459 total prerequisite topics

Prerequisites (3)

Leads To (1)