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

Interior and Closure Operators

Graduate Depth 79 in the knowledge graph ☐ I know this ☆ Set as goal
369prerequisites beneath it
See this on the map →
Closure, Interior, and BoundaryClosure, Interior, and Boundary of Sets→
operators interior closure kuratowski-axioms

Core Idea

Interior and closure are operators satisfying Kuratowski's axioms: they are idempotent, expansive (or contractive), preserve unions (or intersections), and are compatible with the empty set and whole space. These axioms characterize how topologies are defined, and an alternative approach to topology is to axiomatically define a closure operator and derive the open sets from it.

Explainer

You already know the concrete definitions: the interior of a set A is the largest open set contained in A; the closure of A is the smallest closed set containing A. The goal of this topic is to step back from those definitions and ask: what abstract rules govern these operations? The answer is Kuratowski's axioms, which state that the closure operator cl satisfies four properties: (1) cl(∅) = ∅, (2) A ⊆ cl(A) (extensivity), (3) cl(cl(A)) = cl(A) (idempotency), and (4) cl(A ∪ B) = cl(A) ∪ cl(B) (preservation of unions). Dual axioms characterize the interior operator int with containment and unions reversed.

Idempotency captures the key intuition: closing an already-closed set does nothing. Taking the interior of an open set does nothing. The operations are *stable* — applying them twice is the same as applying them once. This contrasts with how iterating many other operations changes the result; here, one application fully saturates the operation. The fixed points of cl are precisely the closed sets; the fixed points of int are precisely the open sets.

The deeper insight is that these axioms are not just properties of the closure operator — they *characterize* topologies. Given *any* function cl : 𝒫(X) → 𝒫(X) satisfying Kuratowski's four axioms, you can define the closed sets to be exactly the fixed points of cl, and the resulting collection determines a unique topology on X. This means you can define a topology without ever mentioning open sets explicitly — the closure operator encodes the entire topological structure.

This operator perspective makes the duality between interior and closure completely explicit. The two operators are related by complementation: int(A) = (cl(Aᶜ))ᶜ. Every axiom for closure has a dual axiom for interior with the direction of containment reversed and unions replaced by intersections. When you encounter a proof about one operator, its dual proof about the other follows by mechanically applying this duality. This algebraic perspective becomes especially powerful when you study more abstract spaces where the concrete definitions are harder to visualize.

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 of Sets → Interior and Closure Operators

Longest path: 80 steps · 369 total prerequisite topics

Prerequisites (2)

Leads To (0)

No topics depend on this one yet.