Math 2.0

Geometry 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 ℝn\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 ℝn\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.

Where this leads

7 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Euclidean_distance, Higher dimensions
About this page
Tag0E1MMCAY5B
URIm2://0E1MMCAY5B
Aliaseseuclidean-distance
Kindexample
WritingW0 stub
MSC51M05
Instance ofMetric space

Markdown · JSON · Edit on GitHub

What this page 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 page is. They do not measure its truth.

What links here

Used by