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

Open Sets in Topological Spaces

Graduate Depth 74 in the knowledge graph ☐ I know this ☆ Set as goal
227topics build on this
350prerequisites beneath it
See this on the map →
Topological Spaces: Definition and ExamplesNeighborhoods and Open Sets→→Basis for a TopologyClosed Sets in Topological Spaces+5 more
open-sets topology definitions

Core Idea

Open sets form the fundamental building blocks of a topology. They satisfy axioms that generalize the intuitive properties of open intervals on the real line: any union of open sets is open, and finite intersections of open sets are open. Understanding open sets is essential for defining continuity and other topological properties without relying on distance.

Explainer

Open sets are the primitive objects of a topological space. A topological space (X, τ) is defined by specifying a set X together with a collection τ of subsets — the open sets — satisfying three axioms: (1) ∅ ∈ τ and X ∈ τ, (2) any union of members of τ is in τ, and (3) any finite intersection of members of τ is in τ. From your study of topological spaces, you know that these axioms abstract the behavior of open sets in metric spaces. Open sets in a general topology need not be defined by distances or ε-balls; they are simply the sets that belong to τ.

The distinction between arbitrary unions and finite intersections is essential. Unions of open sets are always open, no matter how many sets are involved — even uncountably many. But only finite intersections of open sets are guaranteed to be open. The intersection of infinitely many open sets can fail to be open: in ℝ with the standard topology, each interval (−1/n, 1/n) is open, but ∩ₙ(−1/n, 1/n) = {0} is not. If the axioms required arbitrary intersections to be open, every point would be open (as the intersection of smaller and smaller intervals), collapsing the topology to the discrete one. The finite-intersection restriction is precisely calibrated to exclude this collapse while preserving a meaningful notion of "openness."

Openness is not an intrinsic property of a set — it depends entirely on the topology. On a set X = {1, 2, 3}, the collection τ₁ = {∅, {1}, {1, 2}, X} and τ₂ = {∅, {2}, {2, 3}, X} are both valid topologies, but the set {1} is open in τ₁ and not open in τ₂. The same underlying set supports many different topologies, each declaring different sets to be open. This flexibility is the point of the axiomatic approach: rather than deriving openness from a distance formula, you declare which sets are open and derive everything else — continuity, convergence, compactness — from that declaration.

Open sets determine all other topological concepts. A function f : X → Y is continuous if and only if the preimage of every open set in Y is open in X. A set is closed if its complement is open. The interior of a set is the largest open set it contains. Compactness, connectedness, and separation axioms are all defined in terms of open sets. Understanding open sets thoroughly is therefore not just the first step in topology — it is the foundation on which the entire theory is built.

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 → De Morgan's Laws → Negation of Quantified Statements → Proof by Contradiction → Topological Spaces: Definition and Examples → Open Sets in Topological Spaces → Neighborhoods and Open Sets → Open Sets in Topological Spaces

Longest path: 75 steps · 350 total prerequisite topics

Prerequisites (2)

Leads To (7)