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

Product Topology on Cartesian Products

Graduate Depth 77 in the knowledge graph ☐ I know this ☆ Set as goal
365prerequisites beneath it
See this on the map →
Open Sets in Topological SpacesProduct Topology→
product-topology products

Core Idea

On ∏ᵢ Xᵢ, the product topology has basis of finite intersections of sets of the form πᵢ⁻¹(Uᵢ) where Uᵢ is open. Products of finitely many spaces are metrizable if factors are (product metric). Infinite products: projections are open, products of Hausdorff/compact/connected spaces are Hausdorff/compact/connected (by Tychonoff). Product topology is the coarsest making projections continuous.

Explainer

You already know how to put a topology on a single set by specifying open sets. Now suppose you have two topological spaces X and Y and want to build a topology on their Cartesian product X × Y. There are many possible topologies — but one stands out as the "right" choice: the product topology, defined as the coarsest topology that makes both projection maps π₁: X×Y → X and π₂: X×Y → Y continuous. Coarsest means "fewest open sets" — you only declare something open if you are forced to by the continuity requirement.

A basis for the product topology consists of sets of the form U × V, where U is open in X and V is open in Y. Every open set in the product topology is a union of such "open rectangles." This matches geometric intuition: in ℝ² = ℝ × ℝ, open rectangles (a,b) × (c,d) do indeed form a basis for the standard topology, which coincides with the product topology. A key characterization: a function f: Z → X × Y is continuous if and only if both component functions π₁ ∘ f: Z → X and π₂ ∘ f: Z → Y are continuous. This makes the product topology the natural setting for analyzing multi-component continuous maps.

For finite products, the product topology coincides with metric topologies in all metrizable cases — on ℝ² it gives the familiar Euclidean topology, and on ℝⁿ it generalizes cleanly. The structural properties propagate beautifully: a product of Hausdorff spaces is Hausdorff, a product of connected spaces is connected, and a finite product of compact spaces is compact. The last result — Tychonoff's theorem — extends to *infinite* products as well, and is one of the deepest theorems in topology (equivalent to the axiom of choice).

The infinite product case reveals why the definition matters. For an infinite product ∏ᵢ Xᵢ, one might guess that open sets should be products Uᵢ with each Uᵢ open — but this gives the box topology, which is strictly finer than the product topology and fails to preserve compactness. The product topology instead requires that Uᵢ = Xᵢ for all but finitely many indices. This constraint is exactly what makes projections continuous with the coarsest possible topology, and it is what allows Tychonoff's theorem to hold. The distinction between product and box topology is a concrete instance of a general principle: coarser topologies have stronger convergence properties.

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 → Product Topology on Cartesian Products

Longest path: 78 steps · 365 total prerequisite topics

Prerequisites (2)

Leads To (0)

No topics depend on this one yet.