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

Closure, Interior, and Boundary

Graduate Depth 78 in the knowledge graph ☐ I know this ☆ Set as goal
7topics build on this
366prerequisites beneath it
See this on the map →
Closed Sets in Topological SpacesBoundary of Sets→→Dense Sets and Nowhere Dense SetsInterior and Closure Operators
closure interior boundary derived-sets

Core Idea

For a set A in a topological space, the closure is the smallest closed set containing A, the interior is the largest open set contained in A, and the boundary consists of points in the closure but not the interior. These three operations decompose the space into three disjoint pieces relative to any subset and are fundamental to understanding local structure.

Explainer

Work first with the concrete example of an open disk in the plane: A = {(x, y) : x² + y² < 1}, the open unit disk. You already know what it means for a set to be closed (it contains all its limit points). The interior of A is the largest open set contained within A — here, it's A itself, because A is already open. The closure of A is the smallest closed set containing A — here, it's the closed disk {(x, y) : x² + y² ≤ 1}, which adds the boundary circle. The boundary of A is what's left: the circle {(x, y) : x² + y² = 1}. Every point of the plane belongs to exactly one of these three zones relative to A: the interior (strictly inside), the boundary (on the edge), or the exterior (strictly outside). Together they partition the whole space.

Each operation has a clean characterization in terms of neighborhoods. A point p is in the interior of A if some open neighborhood of p fits entirely inside A — you can step in any direction a little bit and stay in A. A point p is in the closure of A if every open neighborhood of p intersects A — no matter how small a neighborhood you take, it touches A. A boundary point satisfies both: every neighborhood intersects A and intersects the complement of A. Boundary points are precisely the points where A and its complement touch.

These definitions extend uniformly to any topological space, not just ℝ² with its familiar geometry. This is the power of the topological framework you've been building: the same concepts apply to function spaces, discrete topologies, or anything else equipped with a notion of open sets. Notice also that the interior and closure are "dual" operations: the interior of A is the complement of the closure of the complement of A. This algebraic relationship means you rarely need to define both separately — one determines the other.

A crucial subtlety: the closure of an open set is not always obtained by simply "closing it up." Consider A = (0, 1) ∪ (2, 3) in ℝ. Its closure is [0, 1] ∪ [2, 3] — two disjoint closed intervals, not one connected set. The boundary consists of {0, 1, 2, 3}. None of the topology's global structure is assumed; everything follows from which sets are declared open. Mastering these three operators gives you the vocabulary to describe local structure — how a set sits in its ambient space — and is prerequisite to discussing continuity, limit points, and compactness in the full generality of 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 → Closed Sets in Topological Spaces → Closure of Sets → Boundary of Sets → Closure, Interior, and Boundary

Longest path: 79 steps · 366 total prerequisite topics

Prerequisites (2)

Leads To (2)