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

Graduate Depth 77 in the knowledge graph I know this Set as goal
22topics build on this
356prerequisites beneath it
See this on the map →
Open Sets in Topological SpacesConvergence in Topological Spaces+1 moreHomeomorphisms and Topological EquivalenceHomotopy of Paths+1 more
continuity continuous-functions preimages

Core Idea

A function f: X → Y between topological spaces is continuous if the preimage of every open set is open (equivalently, preimages of closed sets are closed, or preimages of neighborhoods are neighborhoods). This topological definition removes reliance on distance and applies to any pair of topological spaces, unifying continuity across algebra, analysis, and geometry.

Explainer

You learned continuity in calculus through the epsilon-delta definition: f is continuous at x₀ if for every ε > 0 there exists δ > 0 such that |x − x₀| < δ implies |f(x) − f(x₀)| < ε. This definition is intuitive and practical, but it is built around the idea of distance — the absolute values measure how far two points are from each other. Topology's goal is to study properties that don't depend on distance at all, only on which sets are "open." To work in that more general setting, you need a definition of continuity that uses only open sets.

The key insight is that the epsilon-delta condition can be rephrased entirely in terms of open sets: f is continuous at x₀ if and only if for every open set V containing f(x₀), the preimage f⁻¹(V) = {x ∈ X : f(x) ∈ V} is an open set containing x₀. Asking for "every such open V" to have an open preimage is exactly what the global definition says: f is continuous if and only if f⁻¹(V) is open in X whenever V is open in Y. Notice that the arrow is backward — you pull sets back through f, not forward. The image f(U) of an open set need not be open (think of f(x) = constant, where every open set maps to a single point), but the preimage of an open set must be open.

Why does this matter? Because the preimage definition works in any topological space, even ones where there is no meaningful notion of distance. A function between two abstract topological spaces — say, two different spaces of functions, or a space built from combinatorial data — can be declared continuous using only the topology (the collection of open sets) on each space. This unifies the continuity you know from real analysis, the continuity of paths in topology, the continuity of group homomorphisms in algebra, and the continuity of probability measures — all instances of the same definition.

The preimage characterization also has a useful equivalent in terms of neighborhoods: f is continuous at x if and only if for every neighborhood N of f(x), f⁻¹(N) is a neighborhood of x. This version is closer in spirit to the epsilon-delta definition and is often easier to work with in concrete cases. You can also rephrase everything in terms of closed sets: f is continuous if and only if the preimage of every closed set is closed, since preimages commute with complements and complements of open sets are closed. All three characterizations — open sets, closed sets, neighborhoods — say the same thing in different languages, and knowing all three makes it easier to choose the right one for any particular proof.

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesDe Morgan's LawsNegation of Quantified StatementsProof by ContradictionTopological Spaces: Definition and ExamplesOpen Sets in Topological SpacesNeighborhoods and Open SetsOpen Sets in Topological SpacesBasis for a TopologyNeighborhoods and Local PropertiesContinuity in Topological Spaces

Longest path: 78 steps · 356 total prerequisite topics

Prerequisites (3)

Leads To (3)