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

Interior of Sets

College Depth 75 in the knowledge graph ☐ I know this ☆ Set as goal
10topics build on this
328prerequisites beneath it
See this on the map →
Open Sets in Topological Spaces→→Boundary of Sets
interior operators

Core Idea

The interior of A, denoted int(A) or A°, is the union of all open sets contained in A (the largest open subset of A). A point x ∈ int(A) iff A is a neighborhood of x. Properties: int(∅) = ∅, int(X) = X, int(int(A)) = int(A), int(A ∩ B) = int(A) ∩ int(B).

Explainer

The interior of a set A in a topological space (X, τ), denoted int(A) or A°, is the largest open set contained in A. Equivalently, it is the union of all open sets that are subsets of A. Since any union of open sets is open, this union is itself open and is contained in A, making it the unique largest open subset. A point x belongs to int(A) if and only if A is a neighborhood of x — that is, there exists an open set U with x ∈ U ⊆ A. This gives two equivalent perspectives: globally, int(A) is the largest open set inside A; locally, it is the set of points that have an open "cushion" entirely within A.

In ℝ with the standard topology, the interior of [0, 1] is (0, 1). The endpoints 0 and 1 are not interior points because every open interval around them extends outside [0, 1]. The interior of (0, 1] is also (0, 1) — the endpoint 1 fails the interior test for the same reason. The interior of a single point {x} in ℝ is empty, since no open interval fits inside a singleton. The interior of ℚ (the rationals) in ℝ is also empty: every open interval contains irrationals, so no open set is contained in ℚ. These examples show that the interior operator strips away the "boundary" of a set, leaving only the portion where the set has room to breathe.

The interior operator satisfies four characteristic properties, known as the Kuratowski interior axioms: (1) int(X) = X, (2) int(A) ⊆ A for every A, (3) int(int(A)) = int(A) (idempotence), and (4) int(A ∩ B) = int(A) ∩ int(B). Property (3) follows from the fact that int(A) is already open, and the interior of an open set is itself. Property (4) states that the interior distributes over finite intersections. However, the analogous identity for unions fails: int(A ∪ B) is not necessarily equal to int(A) ∪ int(B). For example, in ℝ, int([0, 1] ∪ [1, 2]) = int([0, 2]) = (0, 2), but int([0, 1]) ∪ int([1, 2]) = (0, 1) ∪ (1, 2), which misses the point 1.

The interior operator is dual to the closure operator: int(A) = X \ cl(X \ A), and cl(A) = X \ int(X \ A). Taking the interior of A is the same as taking the complement, then the closure, then the complement again. This duality means that every theorem about interiors has a dual theorem about closures, and vice versa. A set is open if and only if it equals its own interior (A = int(A)), just as a set is closed if and only if it equals its own closure. The interior and closure operators, together with the boundary operator ∂A = cl(A) \ int(A), provide a complete toolkit for analyzing the fine structure of sets in a topological space.

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

Longest path: 76 steps · 328 total prerequisite topics

Prerequisites (1)

Leads To (1)