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.
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.
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.
For coordinate differences , the elementary inequalities
give
The identity map between the two versions of the square is bijective, and both it and its inverse are Lipschitz continuous maps by these inequalities. It is therefore a homeomorphism. In fact the same comparison works on all of ; restriction to the square causes no difficulty.
Take and the constant contraction mapping . For , ,
No Lipschitz constant less than one can work, so need not be a contraction. More generally, differing only in the second input coordinate already prevents a strict contraction whenever has two points.
If has contraction constant , two iterations give
and consequently
Thus is a contraction mapping. The swap lift of a contraction shows why an iterate can contract even when one step does not.

Articles by others on the same topic (0)

There are currently no matching articles.