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

Convergence of Sequences in Topological Spaces

College Depth 75 in the knowledge graph ☐ I know this ☆ Set as goal
182topics build on this
346prerequisites beneath it
See this on the map →
Limit Points and Accumulation Points→→Cauchy Sequences in Metric SpacesFirst Countable Spaces
sequences convergence

Core Idea

A sequence (xₙ) converges to x in a topological space if every open set containing x eventually contains all terms of the sequence—that is, for every open U containing x, there exists N such that xₙ ∈ U for all n ≥ N. This generalizes the ε-ball definition from metric spaces. Unlike metric spaces, limits in general topological spaces need not be unique; uniqueness requires the Hausdorff separation axiom. Furthermore, sequences alone may not suffice to characterize the topology—in non-first-countable spaces, nets or filters are needed to fully describe convergence behavior.

How It's Best Learned

Compare convergence in a metric space with convergence in the cofinite topology on an infinite set, where sequences can converge to every point simultaneously. This dramatic contrast motivates why separation axioms matter.

Common Misconceptions

Students often assume sequential convergence fully determines the topology. This holds in metric and first-countable spaces but fails in general. Also, a sequence can have multiple limits in non-Hausdorff spaces—this is a feature of the topology, not an error.

Explainer

A sequence (xₙ) in a topological space X converges to a point x if for every open set U containing x, there exists a natural number N such that xₙ ∈ U for all n ≥ N. In words: the sequence eventually enters and stays inside every open neighborhood of x. This generalizes the ε-ball definition from metric spaces — in a metric space, "every open set containing x" can be replaced by "every ball B(x, ε)," recovering the familiar condition d(xₙ, x) < ε for all sufficiently large n. But in a general topological space, there may be no metric, so the open-set formulation is the primitive definition.

A striking difference from metric spaces is that limits need not be unique. In the cofinite topology on an infinite set X, every open neighborhood of any point x has finite complement — so it contains all but finitely many elements of X. This means that any sequence of distinct points is eventually inside every neighborhood of every point, so it converges to every point simultaneously. Uniqueness of limits requires the Hausdorff axiom (T₂): if distinct points x and y have disjoint open neighborhoods U and V, then a sequence cannot eventually be in both, forcing at most one limit. In non-Hausdorff spaces, the failure of limit uniqueness is a feature of the topology, not an error.

Another fundamental limitation is that sequences may not suffice to characterize the topology. In metric spaces and more generally in first-countable spaces (where every point has a countable neighborhood base), sequences detect all topological information: a set is closed if and only if it is sequentially closed, and a function is continuous if and only if it preserves convergent sequences. But in spaces that are not first-countable — such as uncountable products with the product topology — a set can fail to be closed even though no sequence from the set converges outside it. Sequences, indexed by the countable set ℕ, cannot probe all the open neighborhoods of a point when there are uncountably many directions of approach.

To handle convergence in full generality, topology employs nets and filters. A net is a generalization of a sequence where the index set is an arbitrary directed set rather than ℕ. Nets can characterize all topological properties that sequences cannot: a set is closed if and only if it contains the limits of all convergent nets from the set, and a function is continuous if and only if it preserves convergent nets. Filters provide an equivalent framework using collections of subsets instead of indexed families. In first-countable spaces, nets and filters reduce to sequences, so the more general tools are genuinely needed only beyond the first-countable setting. Understanding where sequences suffice and where they fail is a key conceptual milestone in moving from metric topology to general topology.

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 → Closed Sets in Topological Spaces → Limit Points and Accumulation Points → Convergence of Sequences in Topological Spaces

Longest path: 76 steps · 346 total prerequisite topics

Prerequisites (1)

Leads To (2)