Euclidean Distance
Recall from The Euclidean Norm page that if $\mathbf{x} = (x_1, x_2, ..., x_n) \in \mathbb{R}^n$ then the Euclidean norm of $\mathbf{x}$ denoted $\| \mathbf{x} \|$ is defined to be:
(1)With the concept of the Euclidean norm, we can somewhat naturally extend the definition of Euclidean distance (which we familiar with for $n = 1, 2, 3$) into higher dimensions.
Definition: If $\mathbf{x} = (x_1, x_2, ..., x_n), \mathbf{y} = (y_1, y_2, ..., y_n) \in \mathbb{R}^n$ then the Euclidean Distance between $\mathbf{x}$ and $\mathbf{y}$ is defined to be $\| \mathbf{x} - \mathbf{y} \|$. |
Notice that if $n = 1$ then the Euclidean distance between the numbers $x, y \in \mathbb{R}$ on the real number line is what we desire:
(2)Furthermore, if $n = 2$ then the Euclidean distance between the points $\mathbf{x} = (x_1, x_2), \mathbf{y} = (y_1, y_2) \in \mathbb{R}^2$ is:
(3)In general, for any positive integer $n$ we see that the Euclidean distance between $\mathbf{x} = (x_1, x_2, ..., x_n)$ and $\mathbf{y} = (y_1, y_2, ..., y_n)$ is given to be:
(4)Let's now look at an example. Consider the points $\mathbf{x} = (0, 3, 0, 2), \mathbf{y} = (1, 1, 3, 4) \in \mathbb{R}^4$. then we have that:
(5)Let's now look at a very simple theorem which gives us a very intuitively important property in that the distance between a point $\mathbf{x}$ and a point $\mathbf{y}$ should equal the distance between $\mathbf{y}$ and $\mathbf{x}$.
Theorem 1: If $\mathbf{x} = (x_1, x_2, ..., x_n), \mathbf{y} = (y_1, y_2, ..., y_n) \in \mathbb{R}^n$ then $\| \mathbf{x} - \mathbf{y} \| = \| \mathbf{y} - \mathbf{x} \|$. |
- Proof: Let $\mathbf{x}, \mathbf{y} \in \mathbb{R}^n$.
- Note that for all $a, b \in \mathbb{R}$ that:
- Hence we have that: