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

The Topology Induced by a Metric

Graduate Depth 75 in the knowledge graph ☐ I know this ☆ Set as goal
83topics build on this
334prerequisites beneath it
See this on the map →
Metric Spaces: Definition and ExamplesOpen Sets in Topological Spaces→→Cauchy Sequences in Metric SpacesCompleteness in Metric Spaces
metric-topology induced-topology

Core Idea

Given a metric d on X, the metric topology consists of all unions of open balls B(x,ε) = {y : d(x,y) < ε}. Open balls form a basis for this topology. Not every topology comes from a metric (metrization theorems characterize which do). Metrics provide explicit, computable topologies on ℝⁿ and function spaces.

Explainer

A metric gives you a way to measure distance: d(x, y) satisfies non-negativity, symmetry, and the triangle inequality. From your prerequisites you know what a metric space is and what open sets look like. The goal here is to see precisely how a metric *generates* a topology — how the distance function produces a family of open sets that satisfies all the topological axioms.

The construction begins with open balls: B(x, ε) = {y ∈ X : d(x, y) < ε}. Think of this as all points strictly within distance ε of x — the interior of a ball of radius ε centered at x. On the real line, B(x, ε) = (x−ε, x+ε), an open interval. In ℝ², it is an open disk. In a discrete metric space (where d(x,y) = 1 for all x ≠ y), B(x, 1/2) = {x}, a single point. The metric topology is then defined as the collection of all sets that can be written as unions of open balls. A set U is open in the metric topology if for every point x ∈ U, some open ball B(x, ε) is contained in U — equivalently, every point of U has a little breathing room inside U. Verifying that this collection satisfies the topological axioms (closed under arbitrary unions, finite intersections, contains ∅ and X) is a standard exercise using the triangle inequality.

The open balls form a basis for this topology, meaning every open set is a union of open balls — but the open balls themselves need not form a topology, because finite intersections of open balls are not generally open balls. The concept of a basis is important: you rarely specify a topology by listing all open sets (there can be uncountably many). Instead, you specify a basis and declare a set open if it's a union of basis elements. The metric provides such a basis for free.

A central point is that different metrics can generate the same topology. On ℝⁿ, the Euclidean metric, the taxicab metric (sum of coordinate differences), and the maximum metric all generate the same topology — the standard one — even though the shapes of their open "balls" differ. Two metrics that generate the same topology are called topologically equivalent. This shows that topology abstracts away the specific geometry (exact distances) and retains only the qualitative structure (which sets are open). The converse question — which topologies arise from some metric — is answered by metrization theorems: not every topology is metrizable, and conditions like second-countability and regularity characterize which ones are. The metric topology sits at a middle level of generality: richer than abstract topology (because you have explicit distances), but not as rigid as Euclidean geometry (because distances can be exotic). Most spaces you encounter in analysis — function spaces like C([0,1]) with the sup-norm, sequence spaces like ℓ², manifolds — are metric spaces, making this the dominant setting for applied 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 → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Topological Spaces: Definition and Examples → Open Sets in Topological Spaces → The Topology Induced by a Metric

Longest path: 76 steps · 334 total prerequisite topics

Prerequisites (2)

Leads To (2)