Math 2.0

Geometry Definition

Euclidean distance

Builds on Euclidean spaceLength of a vector

Definition

Let nn be a positive integer, and let p=(p1,…,pn)p = (p_1, \dots, p_n) and q=(q1,…,qn)q = (q_1, \dots, q_n) be points of ℝn\mathbb{R}^n. The Euclidean distance between pp and qq is the real number d(p,q)=∥p−q∥=(p1−q1)2+(p2−q2)2+⋯+(pn−qn)2,d(p, q) = \|p - q\| = \sqrt{(p_1 - q_1)^2 + (p_2 - q_2)^2 + \dots + (p_n - q_n)^2}, where ∥p−q∥\|p - q\| is the length of the vector p−qp - q.

Remarks

The function dd is a metric on ℝn\mathbb{R}^n. For all points pp, qq and rr: d(p,q)≥0d(p, q) \geq 0, d(p,q)=0d(p, q) = 0 if and only if p=qp = q, d(p,q)=d(q,p)d(p, q) = d(q, p), and d(p,r)≤d(p,q)+d(q,r)d(p, r) \leq d(p, q) + d(q, r). For n=1n = 1 the formula is d(p,q)=∣p−q∣d(p, q) = |p - q|. Some applications use the squared distance d(p,q)2d(p, q)^2, because it has no square root. The squared distance is not a metric, because it does not satisfy the triangle inequality.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Euclidean space object
  2. Length of a vector concept
  3. Euclidean distance definition

Where this leads

4 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Euclidean_distance, Higher dimensions
About this page
Tag0C95TG69SG
URIm2://0C95TG69SG
Kinddefinition
WritingW1 stated
MSC51N20
DefinesEuclidean distance
UsesEuclidean space, Length of a vector

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (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