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 ExamplesBasis 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesDe Morgan's LawsNegation of Quantified StatementsProof by ContradictionTopological Spaces: Definition and ExamplesOpen Sets in Topological Spaces

Longest path: 73 steps · 342 total prerequisite topics

Prerequisites (1)

Leads To (11)