# 1: Euclidean Geometry

- Page ID
- 5099

\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

\( \newcommand{\Span}{\mathrm{span}}\)

\( \newcommand{\id}{\mathrm{id}}\)

\( \newcommand{\Span}{\mathrm{span}}\)

\( \newcommand{\kernel}{\mathrm{null}\,}\)

\( \newcommand{\range}{\mathrm{range}\,}\)

\( \newcommand{\RealPart}{\mathrm{Re}}\)

\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

\( \newcommand{\Argument}{\mathrm{Arg}}\)

\( \newcommand{\norm}[1]{\| #1 \|}\)

\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)

\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)

\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vectorC}[1]{\textbf{#1}} \)

\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

\(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)One of the great privileges of teaching this class is the opportunity I have to blow your minds with a radically different understanding of the nature of space and time. The shift from a Euclidean/Newtonian understanding of space and time, to a Riemannian/Einsteinian one is centrally important to our understanding of cosmology. This chapter is entirely focused on the Euclidean geometry that is familiar to you, but reviewed in a language that may be unfamiliar. The new language will help us journey into the foreign territory of Riemannian geometry where space is curved. Our exploration of that territory will then help you to drop your pre-conceived notions about space and to begin to understand the broader possibilities -- possibilities that are not only mathematically beautiful, but that appear to be realized in the natural world.

According to Euclidean geometry, it is possible to label all space with coordinates *x*, *y*, and *z* such that the square of the distance between a point labeled by \(x_1\), \(y_1\), \(z_1\) and a point labeled by \(x_2\), \(y_2\), \(z_2\) is given by \(\left(x_1 -x_2\right)^2+\left(y_1 -y_2\right)^2+\left(z_1 -z_2\right)^2\). If points 1 and 2 are only infinitesimally separated, and we call the square of the distance between them \(d\ell^2\), then we could write this rule, that gives the square of the distance as

\[d\ell^2 = dx^2 + dy^2 + dz^2 \label{eqn:EuclidCartesian} \]

This rule has physical significance. The physical content is that if you place a ruler between these two points, and it is a good ruler, it will show a length of \(d\ell = +\sqrt{d\ell^2}\). Since it is difficult to find rulers good at measuring infinitesimal lengths, we can turn this into a macroscopic rule. Imagine a string following a path parameterized by \(\lambda\), from \(\lambda = 0\) to \(\lambda = 1\), then the length of the string is \(\int_0^1 d\lambda (d\ell/d\lambda)\). That is, every infinitesimal increment \(d\lambda\) corresponds to some length \(d\ell\). If we add them all up, that's the length of the string.

Box \(\PageIndex{1}\)

**Exercise 1.1.1:** Find the distance along a path from the origin to (x,y,z) = (1,1,1) where the path is given by

\[ x(\lambda) = \lambda, y(\lambda) = \lambda, z(\lambda)= \lambda \]

There are many ways to label the same set of points in space. For example, we could rotate our coordinate system about the *z* axis by angle \(\theta\) (with positive \(\theta\) taken to be in the counterclockwise direction as viewed looking down toward the origin from positive z) to form a primed coordinate system with this transformation rule:

\[z' = z\]

\[y' = -x \sin\theta + y \cos\theta\]

\[x' = x \cos\theta + y \sin\theta\]

Under such a re-labeling, the distance between points 1 and 2 is unchanged. Physically, this has to be the case. All we've done is used a different labeling system. That can't affect what a ruler would tell us about the distance between any pair of points. Further, for this particular transformation, the equation that gives us the distance between infinitesimally separated points has the same form.

Figure 1: A counterclockwise rotation of the coordinate system about the z axis by \( \theta \) creates a new coordinate system which we’ve labeled with primes. The \( z \) axis comes out of the screen and is identical to the \( z’ \) axis. As is true for any point in space, point 1 can be described in either coordinate system, by specifying \( (x_1,y_1,z_1) \) or \( (x’_1,y’_1,z’_1) \) with the relationship between the two given by the equations to the right.

Box \(\PageIndex{2}\)

**Exercise 1.2.1:** Show that the distance rule of Equation \ref{eqn:EuclidCartesian} applied to the prime coordinates,

\[\begin{equation*}

\begin{aligned}

(d\ell')^2 = (dx')^2 + (dy')^2 + (dz')^2

\end{aligned}

\end{equation*}\]

gives the same distance; i.e, show that \(d\ell' = d\ell\). [Warning: \( \theta \) is not a coordinate here. It specifies the relationship between the coordinate systems. So, e.g., \( dx' = dx\cos\theta + dy \sin\theta \).] Because this distance is invariant under rotations of the coordinate system, we call it the invariant distance.

We want to emphasize that the labels themselves, *x, y, z* or *x', y', z' *have no physical meaning. All physical meaning associated with the coordinates comes from an equation that tells us how to calculate distances along paths. To drive this point home, note that we could also label space with a value of *x, y, z* at every point, but do it in such a way that we would have the distance between *x, y, z* and \(x+dx, y+dy, z+dz\) have a square given by

\[d\ell^2 = dx^2 + x^2\left(dy^2 + \sin^2y dz^2\right) \]

For many readers, this result would look more familiar if we renamed the coordinates \(r=x\), \(\theta = y\), and \(\phi = z\) so that we get another expression for the invariant distance,

\[d\ell^2 = dr^2 + r^2\left(d\theta^2 + \sin^2\theta d\phi^2\right)\ \label{eqn:EuclidSphere} \]

This is the usual spherical coordinate labeling of a 3-dimensional Euclidean space by distance from origin, *r*, a latitude-like angle, \(\theta\), and a longitudinal angle, \(\phi\). The transformation between the two coordinate systems is given by

\[z=r\cos\theta\]

\[y=r\sin\theta\sin\phi\]

\[x=r\sin\theta\cos\phi\]

Box \(\PageIndex{3}\)

**Exercise 1.3.1:** Show that the invariant distance given by the equation \(d\ell^2 = dx^2 + dy^2\), the 2-D version of \(\ref{eqn:EuclidCartesian}\), and the invariant distance given by the equation \(d\ell^2 = dr^2 + r^2 d\phi^2\), the 2-D version of \(\ref{eqn:EuclidSphere}\), are consistent if the coordinates are related via:

\[\begin{equation*}

\begin{aligned}

x &= r\cos\phi \\ \\ y &= r\sin\phi

\end{aligned}

\end{equation*}\]

Hint: use the chain rule, so that, e.g., \( dx = dr \cos\phi - r \sin \phi d\phi \). (Note that the coordinate transformation equations here are obtained from the 3-dimensional case by setting \( \theta = \pi/2 \).)

In preparation for thinking about non-Euclidean spaces, we are going to go through how one could construct a labeling of a two-dimensional Euclidean space in polar coordinates, \(r\), \(\phi\). Our construction starts with what will look like an unusual way of defining \(r\). We define \(r\) based on the circumference of the circle rather than the distance from the origin, for reasons that will become clear later.

First we choose a center to our coordinate system. Then we label all points with \(r\) that are equidistant from that center and form a circle with circumference \(C= 2\pi r\). Thus to label space with the appropriate value of \(r\), one takes a string, ties one end down at the center, and marks out all the points that can be just reached by the other end of the string, when it is pulled straight. Then one measures the circumference of the resulting circle and labels the points on this circle with a value of \(r\) given by \(r = C/(2\pi)\). We take strings of varying lengths and repeat again and again to figure out the value of \(r\) for every point in the plane.

Next, to label space with \(\phi\), we take one point on one of the circles and arbitrarily label that one as \(\phi = 0\). We pull a string tight from the origin out to this point and beyond, and label all the points along the string with \(\phi = 0\). We then march outward from the origin and when we get to a point labeled with radial value \(r\), we make a 90\(^\circ\) turn to the left and advance some small distance \(\Delta\). We then label this point with \(\phi = \Delta/r\). Again we pull a string tight from the origin out to this point and beyond, and label all these points along the string with the same value of \(\phi\). We then advance another \(\Delta\) around the circle and repeat, now labeling the \(n\)th iteration with \(\phi = n\Delta/r\). In this manner we label all points in the space with values of \(\phi\). Note that when we have done this \(2\pi r/ \Delta\) times we will have advanced all the way around the circle (because we will have covered a distance of \(2\pi r\) ) and the change in \(\phi\) will be \((2\pi r/\Delta )\times \Delta/r = 2\pi.\)

In a Euclidean space, such a construction leads us to the result (unproven here) that the distance \(d\ell\) between two infinitesimally separated points labeled by \(r,\phi\) and \(r+dr,\phi + d\phi\) has a square given by

\[\label{Eq:PolarEuclid} d\ell^2 = dr^2 + r^2 d\phi^2. \]

Note that in our construction we never made any measurement of the distance from the origin to a circle with origin as center and with circumference \(C=2\pi r\). All we know so far is the circumference of the circle. To calculate the distance from the origin to this circle we can apply the above rule for a path that extends from the origin to the circle. Let's say a circle with circumference \(C_1 = 2\pi r_1\).

Box \(\PageIndex{4}\)

**Exercise 1.4.1**: Calculate the distance from the origin to the circle with circumference \(C_1 = 2 \pi r_1\). Do so along a path of constant \(\phi\) using Eq. \ref{Eq:PolarEuclid}.

You should have got the unsurprising result that the distance from the origin to the circle with circumference \(C_1 = 2\pi r_1\) is \(r_1\). In the next chapter this will get more interesting as we examine a space for which this is *not* the case. We'll see that the distance to a circle with this circumference could be more than \(r_1\) or less than \(r_1\).

We constructed our coordinate system so that as \(\theta\) goes from 0 to \(2\pi\) at constant \(r=r_1\) a distance is traversed of \(2\pi r_1\). Let's now check that our rule for \(d\ell\) above, Eq. \ref{Eq:PolarEuclid} is consistent with this construction.

**Exercise 1.4.2**: Show that the parameterized path \(r=r_1, \theta = \lambda\) as \(\lambda\) goes from 0 to \(2\pi\) covers a distance of \(2\pi r_1\) by integrating \(d\ell\), as given by Eq. \ref{Eq:PolarEuclid}, along this path.

Before going on, we could take a little more care. We have shown that a particular path that takes us from the origin out to \(r=r_1\) at constant \(\phi\) has distance \(r_1\). But how do we know this is the shortest path? Here we will demonstrate that there is not a shorter path; the one prescribed is the shortest path possible. To do so, we use a result from the calculus of variations. That result is as follows:

For \(J = \int_1^2 d\mu f(q_i,\dot q_i , \mu)\) where \(\dot q_i \equiv dq_i/d\mu\), the path from point 1 to 2 that extremizes \(J\) satisfies these equations

\[\dfrac{d}{d\mu}\left(\dfrac{\partial f}{\partial \dot q_i}\right) = \dfrac{\partial f}{\partial q_i}\]

This is a mathematical result with more than one application. In mechanics, the action is given as an integral over the Lagrangian so that

\[S = \int dt L(q_i, \dot q_i, t)\]

with \(\dot q_i \equiv dq_i/dt\), and because a system passes from point 1 to point 2 along the path that minimizes the action, the path taken will satisfy

\[\dfrac{d}{dt}\left(\dfrac{\partial L}{\partial \dot q_i}\right) = \dfrac{\partial L}{\partial q_i}\]

which you know as the *Euler-Lagrange equations*.

In the case at hand we have length = \(\int d\mu \dfrac{d\ell}{d\mu}\) where

\[f = \dfrac{d\ell}{d\mu} = \sqrt{\dot r^2 + r^2\dot \phi^2}\]

(note the overdot is differentiation with respect to the independent variable which here is \(\mu\) again) so the shortest-length path between any two points should satisfy

\[\dfrac{d}{d\mu}\left(\dfrac{\partial f}{\partial \dot r}\right) = \dfrac{\partial f}{\partial r}\]

\[\dfrac{d}{d\mu}\left(\dfrac{\partial f}{\partial \dot \phi}\right) = \dfrac{\partial f}{\partial \phi}\]

These equations are kind of hairy, if you work them out in generality. However, we are testing to see if a particular path satisfies them, the path from the origin to \(r=r_1\), and \(\phi = \phi_1\) that proceeds at fixed \(\phi\). We could parameterize this path with \(\phi = \phi_1, r(\mu) = \mu r_1\) with \(\mu\) running from 0 to 1. Note that \(\dot \phi = 0\) which really simplifies the evaluation of the above equations. We will just do one term out of the first equation as an example, and leave evaluation of the rest of the terms as an exercise. In particular, we evaluate \(\partial f/\partial r = (r/f) \dot \phi^2 = 0\).

Box \(\PageIndex{5}\)

**Exercise 1.5.1:** Evaluate the three other terms ( \( \dfrac{d}{d\mu}\left(\dfrac{\partial f}{\partial \dot r}\right) \), \(\dfrac{d}{d\mu}\left(\dfrac{\partial f}{\partial \dot \phi}\right) \) and \( \dfrac{\partial f}{\partial \phi} \) ) in the two equations above, and verify that the given path does indeed satisfy these equations, thereby demonstrating that it is the shortest possible path.

## Summary

- Space can be labeled with coordinates. The same space can be labeled with a variety of coordinate systems; e.g., Cartesian or Spherical.
- The coordinate labelings themselves have no physical meaning. Physical meaning resides in the distances between points, which one can calculate from a rule that relates infinitesimal changes in coordinates to infinitesimal distances.
- Paths through a space can be parameterized by a single variable; we saw several examples of this.
- The Euler-Lagrange equations can be used to prove that a particular path is (or is not) one with an extreme value of distance between a pair of points on the path. Usually the extreme is a minimum rather than a maximum.

## Homework Problems

Problem \(\PageIndex{1}\)

Starting from \(d\ell^2 = dx^2 + dy^2\) prove the Pythagorean theorem that the squares of the lengths of two sides of a right triangle are equal to the square of the hypotenuse. Start off by proving it for a triangle with the right-angle vertex located at the origin, so all three vertices are at \( (x,y) =(0,0), (x_1,0),\) and \( (0,y_1) \). Be careful to use the distance rule to determine the length of each leg of the triangle, rather than your Euclidean intuition. Let's call the length of the side along the \(x\)-axis \(\ell_x\) and similarly the other lengths \(\ell_y\) and \(\ell_h\). Parameterize each path and perform the appropriate integral over the independent variable you used for the parametrization (like we did with \(\lambda\) in this chapter). Doing so, you should find that \(\ell_h^2 = \ell_x^2 + \ell_y^2\). Having proved the Pythagorean theorem for this specially located and oriented triangle, note that since translations and rotations of the coordinate system leave our invariant distance rule unchanged, you have effectively proved it for all right triangles.

Problem \(\PageIndex{2}\)

Prove that the hypotenuse, the straight line from \( (x_1,0) \) to \( (0,y_1) \) you described in 1.1, is the shortest path between those two points.

Problem \(\PageIndex{3}\)

Show that for a primed system that is rotated relative to the unprimed system so that

\[\begin{equation*}

\begin{aligned}

x' &= x \cos\theta + y \sin\theta \\ \\ y' &= -x \sin\theta + y \cos\theta

\end{aligned}

\end{equation*}\]

the square of the invariant distance is unchanged; i.e., \( dx^2 + dy^2 = (dx')^2 + (dy')^2 \).