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

Product Topology

Graduate Depth 76 in the knowledge graph ☐ I know this ☆ Set as goal
23topics build on this
354prerequisites beneath it
See this on the map →
Basis for a TopologyBasis for a Topology+1 more→→Homotopy of PathsProduct Topology on Cartesian Products+3 more
product-topology cartesian-products finite-products

Core Idea

The product topology on a Cartesian product of topological spaces is generated by the basis of boxes (products of open sets from each factor). This topology makes coordinate projections continuous and is the coarsest topology with this property. It allows us to study properties of finite (and infinite) products of spaces.

Explainer

Given two topological spaces (X, τ_X) and (Y, τ_Y), you want to put a topology on their Cartesian product X × Y. The natural candidate for open sets is to take products of open sets: U × V where U is open in X and V is open in Y. But you cannot take these as the open sets directly, because the collection of all such products is generally not closed under finite intersections in the required way (intersections of two such products are still products, so that is fine, but finite unions of products are not always products). Instead, these products form a basis: the open sets of the product topology are arbitrary unions of such basis elements. From your study of bases for topologies, you know this is the standard construction.

The key property that determines which topology to use is the universal property: the product topology is the coarsest (fewest open sets) topology on X × Y that makes the two coordinate projection maps π₁: X × Y → X (sending (x, y) ↦ x) and π₂: X × Y → Y (sending (x, y) ↦ y) continuous. "Coarsest" means we add open sets only as needed to achieve continuity of projections — no extra structure. This universal property characterizes the product topology uniquely and generalizes cleanly to any number of factors.

The simplest case illuminates the geometry. With ℝ × ℝ = ℝ² and the standard topology on each copy of ℝ (open intervals as a basis), the basis for the product topology consists of all open rectangles (a, b) × (c, d). The resulting topology on ℝ² is exactly the standard Euclidean topology — the one generated by open disks. Open rectangles and open disks generate the same topology because each contains the other: every open disk contains an open rectangle around each of its points, and every open rectangle contains an open disk around each of its points.

For infinite products ∏_{α ∈ A} X_α, two choices appear: the box topology (arbitrary products of open sets) and the product topology (products of open sets with only finitely many factors restricted). The product topology is the coarser one — it is the one that makes all projections continuous — and it has dramatically better properties. The Tychonoff theorem (an arbitrary product of compact spaces is compact) holds for the product topology but fails for the box topology. The box topology is too fine: it has so many open sets that compactness breaks down. This is why the product topology, not the box topology, is the standard definition, even though the box topology might seem more natural at first.

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

Longest path: 77 steps · 354 total prerequisite topics

Prerequisites (3)

Leads To (5)