My questions seem to be very basic and intuitively correct but I can't formally prove them. Before learning metric spaces, for $\mathbb R^2$, we always define the distance between 2 points as $d_2 = ((x_1-y_1)^2+(x_2-y_2)^2)^{1/2}$ and we admit naturally (and intuitively) that the segment is the shortest path amongst those which connect 2 points. In $\mathbb R^1$, the distance between 2 points is define as $abs(x-y)$, which can be thought as a special case of $d_2$, where 2 points lie on 1 axis.
My questions are:
How to prove this statement (that is for $d_2$ in $\mathbb R^2$)
If we have another metric in another metric space, say for example: $d_n$ in $\mathbb R^n$, what is the shortest path and how to find it?
For $d_2$ in $\mathbb R^2$ we want to minimize the functional $ L[y]=\int_{x_2}^{x_1} \sqrt{1+ ( \frac{dy}{dx})^2} dx$. We can do this by looking for the critical points of $L[y]$. In other metrics we alter the functional that we want to minimize.