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

Subbasis for a Topology

College Depth 74 in the knowledge graph ☐ I know this ☆ Set as goal
127topics build on this
344prerequisites beneath it
See this on the map →
Basis for a Topology→→Product TopologyQuotient Topology+1 more
subbasis construction

Core Idea

A subbasis S is a collection of subsets whose finite intersections form a basis. Subbases are more economical than bases and underlie the definition of product topologies.

Explainer

You already know how a basis generates a topology: take a collection of sets satisfying the basis axioms, and declare the open sets to be all possible unions of basis elements. A subbasis takes one more step back — it is a collection of sets whose finite intersections then form a basis, whose unions in turn generate the topology. Every subset of X qualifies as part of a subbasis (as long as the subbasis covers X), so subbases impose almost no conditions at all. The price for this freedom is the two-step construction: subbasis → (finite intersections) → basis → (unions) → topology.

Why introduce another layer of abstraction? Because many natural topologies are most easily described by specifying a small, convenient collection of sets that you want to be open, without worrying about closure under finite intersections upfront. The product topology is the canonical example. Given spaces X and Y, the product topology on X × Y is generated by the subbasis consisting of sets of the form U × Y (where U is open in X) and X × V (where V is open in Y). These "cylinder sets" are the natural open sets for a product: they specify a condition on one coordinate while leaving the other free. Their finite intersections are sets of the form U × V, which form the standard basis for the product topology. The subbasis makes the definition clean and conceptually transparent — you are simply saying "open sets in the product should reflect the open sets in each factor."

The subbasis perspective also clarifies what it means to specify a topology by declaring certain maps continuous. If you want a topology on a set X such that a family of maps fα: X → Yα is all continuous, the coarsest such topology has subbasis {fα⁻¹(Vα) : Vα open in Yα}. This is the initial topology (also called the weak topology in functional analysis), and it is the right topology for making the fα continuous while keeping as few open sets as possible. The subbasis is the natural language for initial topologies because you simply pull back open sets from each target space, without worrying about intersections or unions until after the subbasis is declared. In this sense, the subbasis is not just a convenient notational shortcut — it is the correct primitive for constructing topologies from families of maps.

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

Longest path: 75 steps · 344 total prerequisite topics

Prerequisites (1)

Leads To (3)