The product topology on consists of arbitrary unions of rectangles with , open. Such rectangles form a basis of a topology: every point lies in one, and intersections of two rectangles are rectangles with open factors.
If induce the factor topologies, set
Definiteness and symmetry are immediate. Each factor triangle inequality bounds its distance by the sum of the two relevant product distances; taking the maximum proves the product triangle inequality. A ball of radius is exactly , so every metric-open set is product-open. Conversely an open rectangle containing contains a product ball with radius the minimum of two suitable factor radii. Hence the maximum product metric induces precisely the product topology.
A compact space is one for which every open cover has a finite subcover. Let cover , with both factors compact; if either is empty the result is immediate. For each fixed and each , choose a rectangle containing and lying in a member of . The sets cover , so finitely many, indexed by , suffice. Their -neighbourhoods have open intersection
containing . The finitely many selected members of cover all of . Now the sets cover , so select finitely many of these by compactness of . Taking the union of their finite selections from gives a finite cover of the whole product. The product of two compact spaces is compact, without requiring the factors to be Hausdorff.
Nonnegativity and symmetry of the maximum product metric follow from those of the two factor metrics. Its value is zero precisely when both coordinates agree. For three points , , , the two triangle inequalities give
All metric axioms therefore hold.
When the two factors are the same metric space, consider an off-diagonal point and set . A product-metric ball of radius cannot contain any : such membership would imply and then , a contradiction. The complement of the diagonal is thus open, so
This proves the closed diagonal of a metric space. Equality of the factors here means equality as metric spaces, as intended; merely sharing an underlying set while allowing unrelated metrics would be a different assertion.
Let be a Cauchy sequence in the product. Since each coordinate distance is bounded by , both and are Cauchy in their respective factors. By completeness they have limits , . Part (ii) then gives convergence of the pairs to .
Thus the product of two complete metric spaces is complete under the maximum product metric. This checks every Cauchy sequence, rather than assuming beforehand that it has a coordinate limit.
Each coordinate distance is at most the maximum, so convergence of the pairs implies convergence of both coordinates. Conversely, for any , coordinate convergence gives indices after which the respective distances are below . Beyond their maximum, both are below , and so is the maximum product metric.
The same distance comparison will also handle Cauchy sequences.
Nonnegativity and symmetry follow from the corresponding metric axioms in the two factors. The maximum is zero exactly when both coordinate distances are zero, hence exactly when the ordered pairs are equal.
For the triangle inequality, put , and . Then
Therefore the maximum formula defines a metric, the maximum product metric.
Product metric Created 2026-10-25 Updated 2026-10-31
For metric spaces and , the sum metric on is the displayed formula. Nonnegativity, symmetry and the triangle inequality follow by adding the respective inequalities in the two factors, and zero distance forces equality in both coordinates. It induces the finite product topology, as does the maximum product metric, since their distances satisfy . A sequence converges for this metric exactly when both coordinate sequences converge. Two successive extractions of a convergent subsequence therefore show that the product of two sequentially compact spaces is sequentially compact.
On the maximum product metric, the displayed map is nonexpansive when is a contraction mapping. If the space has two distinct points, changing only the second input coordinate shows that one step preserves some nonzero distance exactly, so it is not itself a strict contraction. Two iterations apply to both coordinates and therefore contract with the same constant as . This provides a direct example of a map whose iterate is contractive although the map is not.