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

Basis for a Topology

College Depth 73 in the knowledge graph ☐ I know this ☆ Set as goal
128topics build on this
343prerequisites beneath it
See this on the map →
Open Sets in Topological Spaces→→Product TopologySubbasis for a Topology
basis generating-topologies

Core Idea

A basis B for a topology is a collection of open sets such that every open set is a union of basis sets. Bases provide economical specifications of topologies without listing all open sets.

Explainer

You've already learned that a topology on a set X is a collection of open sets satisfying certain axioms — closed under arbitrary unions and finite intersections. But specifying a topology directly by listing all its open sets is impractical. A space like ℝ has uncountably many open sets, yet you can describe the standard topology on ℝ perfectly well using just the open intervals (a, b). That's the idea behind a basis: a smaller, manageable collection from which the entire topology can be reconstructed.

Formally, a collection B of subsets of X is a basis for a topology if two conditions hold: (1) every point of X belongs to at least one basis element, and (2) if a point x belongs to the intersection of two basis elements B₁ and B₂, there is a third basis element B₃ containing x and contained in B₁ ∩ B₂. These conditions ensure that when you take all possible unions of basis elements, the result actually satisfies the topology axioms. The topology generated by B is then τ = {all unions of elements of B}, plus the empty set.

The analogy to linear algebra is instructive. A spanning set for a vector space generates all vectors via linear combinations; a basis does the same but with minimal redundancy. Topological bases generate all open sets via unions, with the conditions above playing the role of spanning without collapse. Just as you can describe all of ℝ² by linear combinations of two vectors, you can describe all standard open sets in ℝ by unions of open intervals — and the intervals are far easier to reason about than arbitrary open sets.

Why does this matter in practice? Different bases for the same topology offer different computational advantages. The standard topology on ℝ can be generated by all open intervals, or equivalently by all open intervals with rational endpoints — a countable basis. The existence of a countable basis is the property called second countability, which you'll encounter when studying manifolds. Two different-looking bases might generate the same topology (the "same" space with different descriptions), so a key skill is comparing bases: B and B' generate the same topology if and only if each basis element of B is a union of elements of B', and vice versa. Checking this criterion is far more tractable than comparing topologies directly.

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 → Basis for a Topology

Longest path: 74 steps · 343 total prerequisite topics

Prerequisites (1)

Leads To (2)