Math 2.0

example

Euclidean metric

Example

Let n≥1n \ge 1 be an integer. For points 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 d2(x,y)=∑i=1n(xi−yi)2.d_2(x, y) = \sqrt{\sum_{i=1}^{n} (x_i - y_i)^2}. Then d2d_2 is a metric on Rn\mathbb{R}^n, the Euclidean metric.

Remarks

For n=1n = 1, d2(x,y)=∣x−y∣d_2(x, y) = |x - y|, the usual metric on the real line. For n=2n = 2, the formula is the theorem of Pythagoras for the segment from xx to yy. The triangle inequality for d2d_2 follows from the Cauchy–Schwarz inequality.

Explanations

L1 human

The Euclidean metric is the length of the straight segment between two points. In the plane, the distance from (0,0)(0, 0) to (3,4)(3, 4) is 9+16=5\sqrt{9 + 16} = 5.

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

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

Sources

  1. Web https://en.wikipedia.org/wiki/Euclidean_distance, Higher dimensions