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

Continuity in Topological Spaces

College Depth 76 in the knowledge graph ☐ I know this ☆ Set as goal
97topics build on this
329prerequisites beneath it
See this on the map →
Open Sets in Topological SpacesNeighborhoods and Neighborhood Bases→→Homeomorphisms and Topological EquivalenceHomotopy of Continuous Maps+1 more
continuity maps

Core Idea

A function f: X → Y is continuous if the preimage of every open set in Y is open in X. Equivalently: the preimage of every closed set is closed; f is continuous at x if for every neighborhood V of f(x), there exists a neighborhood U of x with f(U) ⊆ V. This generalizes ε-δ continuity and is the natural definition in topology.

Explainer

You know what open sets are: subsets whose structure is defined by the topology axioms rather than by a distance formula. Continuity in topology is defined entirely through open sets, stripping away the ε-δ machinery of calculus while capturing the same essential idea — that nearby inputs produce nearby outputs.

The definition: f: X → Y is continuous if for every open set V ⊆ Y, its preimage f⁻¹(V) = {x ∈ X : f(x) ∈ V} is open in X. The preimage pulls a subset of the output space back to a subset of the input space. Continuity says: the topology on X is fine-grained enough to detect all the open structure of Y through f. To see why this matches the intuitive idea, compare with ε-δ: f is continuous at x₀ if for every open ball around f(x₀), there is an open ball around x₀ that maps inside it. The topological version simply replaces "open ball" with "open set" — and since open balls generate the topology on metric spaces, the two definitions agree there.

The power of the topological definition is that it works in any topological space, not just metric spaces or ℝⁿ. You never need a notion of distance — only the topology (the collection of open sets). This lets you talk about continuous functions between function spaces, infinite-dimensional manifolds, or combinatorial structures where no natural metric exists. The preimage direction also has clean logical structure: to check continuity you look at what happens to neighborhoods of the output and ask whether their preimages are open in the input. You are checking a global condition on the function, not a local ε-δ condition at each point separately.

A key application is the characterization of homeomorphisms — topological equivalences. A homeomorphism is a continuous bijection f: X → Y whose inverse f⁻¹ is also continuous. Two spaces are homeomorphic if there is a homeomorphism between them, meaning their open sets correspond exactly under f. They are "the same" topologically: every topological property of one holds for the other. The topological definition of continuity is what makes this equivalence relation precise, and the preimage formulation is what makes it tractable to verify.

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 → Neighborhoods and Neighborhood Bases → Continuity in Topological Spaces

Longest path: 77 steps · 329 total prerequisite topics

Prerequisites (2)

Leads To (3)