Math 2.0

definition

Distance from a point to a set

Definition

Let (X,d)(X, d) be a metric space, let AA be a nonempty subset of XX and let x∈Xx \in X. The distance from xx to AA is the real number d(x,A)=inf⁡{d(x,a):a∈A}.d(x, A) = \inf \{ d(x, a) : a \in A \}.

Remarks

The infimum exists, because the set is nonempty and bounded below by 00. If x∈Ax \in A, then d(x,A)=0d(x, A) = 0. The converse is false: in R\mathbb{R}, d(0,(0,1))=0d(0, (0, 1)) = 0 but 0∉(0,1)0 \notin (0, 1). In general d(x,A)=0d(x, A) = 0 if and only if xx is in the closure of AA. For all x,y∈Xx, y \in X, ∣d(x,A)−d(y,A)∣≤d(x,y)|d(x, A) - d(y, A)| \le d(x, y). Thus x↦d(x,A)x \mapsto d(x, A) is Lipschitz with constant 11.

Explanations

L1 human

The distance from a point to a set is the shortest distance from the point to the set, when a shortest distance exists. For example, the distance from 33 to the interval [0,1][0, 1] is 22.

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

1 node uses this node, directly or through other nodes.

Sources

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