Math 2.0

definition

Equivalent metrics

Definition

Let XX be a set and let d1d_1 and d2d_2 be metrics on XX. The metrics d1d_1 and d2d_2 are equivalent when they have the same open sets, that is, when they give the same metric topology on XX. The metrics are strongly equivalent when there are real numbers a>0a > 0 and b>0b > 0 with a d1(x,y)≤d2(x,y)≤b d1(x,y)for all x,y∈X.a \, d_1(x, y) \le d_2(x, y) \le b \, d_1(x, y) \quad \text{for all } x, y \in X.

Remarks

Strongly equivalent metrics are equivalent: each ball for one metric contains a ball with the same centre for the other metric. On Rn\mathbb{R}^n, the taxicab metric, the Euclidean metric and the sup metric are strongly equivalent. On R\mathbb{R}, the metrics ∣x−y∣|x - y| and min⁡(∣x−y∣,1)\min(|x - y|, 1) are equivalent but not strongly equivalent, because only the second one is bounded. Equivalent metrics have the same convergent sequences and the same continuous maps. Completeness can change: see the Remarks of complete metric space.

Explanations

L1 human

Equivalent metrics can give different numbers for distances, but they agree on which points are near each other. For example, on the plane, the taxicab distance is never more than 2\sqrt{2} times the straight distance, and never less than it.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

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

What depends on this

14 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Equivalence_of_metrics, Topological equivalence
  2. Web https://en.wikipedia.org/wiki/Equivalence_of_metrics, Strong equivalence