Definition:Chebyshev Distance/General Definition

Definition
Let $M_1 = \left({A_1, d_1}\right), M_2 = \left({A_2, d_2}\right), \ldots, M_n = \left({A_n, d_n}\right)$ be metric spaces.

Let $\displaystyle \mathcal A = \prod_{i \mathop = 1}^n A_i$ be the cartesian product of $A_1, A_2, \ldots, A_n$.

The Chebyshev distance on $\displaystyle \mathcal A = \prod_{i \mathop = 1}^n A_i$ is defined as:


 * $\displaystyle d_\infty \left({x, y}\right) = \max_{i \mathop = 1}^n \left\{{d_i \left({x_i, y_i}\right)}\right\}$

where $x = \left({x_1, x_2, \ldots, x_n}\right), y = \left({y_1, y_2, \ldots, y_n}\right) \in \mathcal A$.

Real Vector Space
This metric is usually encountered in the context of the real vector space $\R^n$:

Also known as
The Chebyshev distance is also known as the maximum metric.

Another term is the chessboard distance, as it can be illustrated on the real number plane as the number of moves needed by a chess king to travel from one point to the other.

Some sources refer to this as the standard procedure for defining a distance function on a cartesian product of metric spaces.

Also see

 * Chebyshev Distance is Metric


 * Definition:Taxicab Metric
 * Definition:$p$-Product Metric