Math 2.0

example

Sup metric on R^n

Example

Let n≥1n \ge 1 be an integer. For x=(x1,…,xn)x = (x_1, \ldots, x_n) and y=(y1,…,yn)y = (y_1, \ldots, y_n) in Rn\mathbb{R}^n, let d∞(x,y)=max⁡1≤i≤n∣xi−yi∣.d_\infty(x, y) = \max_{1 \le i \le n} |x_i - y_i|. Then d∞d_\infty is a metric on Rn\mathbb{R}^n, the sup metric.

Remarks

It is also called the Chebyshev distance or the maximum metric. For all x,yx, y in Rn\mathbb{R}^n, d∞(x,y)≤d2(x,y)≤d1(x,y)≤n d∞(x,y)d_\infty(x, y) \le d_2(x, y) \le d_1(x, y) \le n \, d_\infty(x, y), where d2d_2 is the Euclidean metric and d1d_1 is the taxicab metric. It is the limit of the p-metric dpd_p as p→∞p \to \infty.

Explanations

L1 human

The sup metric takes only the largest difference of the coordinates. On a chessboard, it is the number of moves that a king needs to go from one square to another.

What this node needs for W3
  • a person confirmed each agent-written section: rule P04 (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Chebyshev_distance, Definition