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

Sequential Compactness

Graduate Depth 78 in the knowledge graph ☐ I know this ☆ Set as goal
2topics build on this
372prerequisites beneath it
See this on the map →
Compact Spaces and Open CoversConvergence in Topological Spaces+2 more→→Sequential Compactness in Metric Spaces
sequential-compactness convergent-subsequences

Core Idea

A space is sequentially compact if every sequence has a convergent subsequence. In metric spaces, sequential compactness is equivalent to compactness, but in general topology they differ. Sequential compactness characterizes compactness using sequences, the more intuitive notion from calculus.

Explainer

You already know that compactness — defined via open covers — is one of the most powerful properties a topological space can have. But the open cover definition is notoriously abstract: a space is compact if every open cover has a finite subcover. It tells you what compactness does (any covering has a finite reduction), but it doesn't say anything about how individual points or sequences behave. Sequential compactness offers a different perspective using the language of sequences, which is more directly intuitive for anyone who has studied calculus.

A space X is sequentially compact if every sequence (xₙ) in X has a convergent subsequence — a subsequence (xₙₖ) that converges to some point in X. Think about what this means in ℝ: the Bolzano-Weierstrass theorem says every bounded sequence in ℝ has a convergent subsequence. The closed interval [0, 1] is sequentially compact because no sequence in [0, 1] can escape to infinity, and by Bolzano-Weierstrass, some subsequence must converge — and since [0, 1] is closed, the limit must land back in [0, 1]. The open interval (0, 1) is not sequentially compact: the sequence 1/n converges to 0, which is outside (0, 1), so no subsequence converges within the space.

In metric spaces, sequential compactness and compactness are equivalent — they capture the same property in two different vocabularies. This equivalence is not obvious to prove; it requires showing that in a metric space, having the Bolzano-Weierstrass property (convergent subsequences) is the same as having no infinite open cover that can't be reduced to a finite one. The proof goes through the concept of total boundedness (the space can be covered by finitely many ε-balls for any ε > 0) and uses the metric structure in an essential way. This is why the equivalence breaks down in general topological spaces — without a metric, sequences don't capture the full complexity of the topology. There exist compact spaces that are not sequentially compact, and sequentially compact spaces that are not compact, in the general topological setting.

The practical value of sequential compactness is that it gives you a hands-on tool for proving things about compact metric spaces. To show a function achieves its maximum on a compact metric space, you can take a maximizing sequence (f(xₙ) → sup f) and extract a convergent subsequence (xₙₖ → x*) — then continuity shows f(x*) = sup f. To show a set is compact, you can produce convergent subsequences from arbitrary sequences. Many existence proofs in analysis follow exactly this pattern: take a sequence of approximate solutions, extract a convergent subsequence, and identify the limit as an exact solution. Sequential compactness makes these arguments rigorous.

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 → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → De Morgan's Laws → Negation of Quantified Statements → Proof by Contradiction → Topological Spaces: Definition and Examples → Open Sets in Topological Spaces → Neighborhoods and Open Sets → Open Sets in Topological Spaces → Basis for a Topology → Neighborhoods and Local Properties → Limit Points and Convergence → Sequential Compactness

Longest path: 79 steps · 372 total prerequisite topics

Prerequisites (4)

Leads To (1)