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

College Depth 72 in the knowledge graph ☐ I know this ☆ Set as goal
1,080topics build on this
342prerequisites beneath it
See this on the map →
Topological Spaces: Definition and Examples→→Basis for a TopologyClosed Sets in Topological Spaces+9 more
open-sets fundamental

Core Idea

A set U in a topological space (X, τ) is open if U ∈ τ. Open sets are the building blocks of a topology and generalize open intervals from ℝ. They are defined by closure under arbitrary unions and finite intersections rather than by distance.

Explainer

When you study real analysis, an open set in ℝ is typically defined as a set where every point has some open interval around it that stays inside the set — the set (0, 1) is open because for any x ∈ (0, 1), you can find ε > 0 so that (x−ε, x+ε) ⊆ (0, 1). This definition relies entirely on distance. Topology asks: what if we strip away distance but keep the essential structure that makes "open" useful? The answer is to simply declare which sets count as open.

A topology on a set X is a collection τ of subsets of X satisfying three axioms: (1) ∅ and X are in τ; (2) any union of sets in τ is in τ; (3) any finite intersection of sets in τ is in τ. A set is open if and only if it belongs to τ — that is the entire definition. Notice there is no mention of distance, neighborhoods, or real numbers. The axioms capture the algebraic behavior of open sets in ℝ while leaving the concept free to apply to any set at all.

The two extreme topologies illustrate the range of possibilities. The indiscrete topology τ = {∅, X} is the coarsest: only the empty set and the whole space are open. The discrete topology τ = P(X) is the finest: every subset is open. Most useful topologies live between these extremes. The standard topology on ℝ — where open sets are arbitrary unions of open intervals — is one such topology, and it can be recovered from the axiomatic definition by verifying the three properties hold.

Why only *finite* intersections? If you allow infinite intersections, open sets are no longer stable under intersection: in ℝ, the sets (-1/n, 1/n) are all open, but their intersection is {0}, which is not open. The axiom is designed to exclude this case. Arbitrary unions are allowed because union only makes sets bigger, which does not cause similar problems. These asymmetries — arbitrary unions, finite intersections — reappear constantly in topology and are worth memorizing.

Open sets are the raw material from which all other topological concepts are built. Closed sets are defined as complements of open sets. Continuity of a function f: X → Y means the preimage of every open set in Y is open in X. Compactness, connectedness, and convergence are all ultimately defined in terms of open sets. This is why getting comfortable with what "open" means at the axiomatic level — membership in τ, not proximity — is so foundational.

Practice Questions 3 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

Longest path: 73 steps · 342 total prerequisite topics

Prerequisites (1)

Leads To (11)