1 Curves
Curves are, intuitively speaking, 1D objects in the 2D or 3D space. For example in two dimensions one could think of a straight line, a hyperbole or a circle. These can be all described by an equation in the \(x\) and \(y\) coordinates: respectively \[ y = 2x + 1\,, \quad y = e^x \,, \quad x^2 + y^2 = 1 \,. \]
Goal
Question
It is clear that we need a way to mathematically describe the curves. One way of doing it is by means of Cartesian equations. This means that the curve is described as the set of points \((x,y) \in \mathbb{R}^2\) where the equation \[ f(x,y) = c \,, \] is satisfied, where \[ f : \mathbb{R}^2 \to \mathbb{R} \,. \] is some given function, and \[ c \in \mathbb{R} \] some given value. In other words, the curve is identified with the subset of \(\mathbb{R}^2\) given by \[ C = \{ (x,y) \in \mathbb{R}^2 \, \colon \, f(x,y)=c \} \,. \] For example, in the case of the straight line, we would have \[ f(x,y) = y - 2x \,, \quad c = 1 \,. \] while for the circle \[ f(x,y) = x^2 + y^2 \,\,, c = 1 \,. \] But what about for example a helix in 3 dimensions? It would be more difficult to find an equation of the form \[ f(x,y,z) = 0 \] to describe such object.
Problem
1.1 Parametrized curves
Rather than Cartesian equations, a more useful way of thinking about curves is viewing them as the path traced out by a moving point. If \(\pmb{\gamma}(t)\) represents the position a point in \(\mathbb{R}^n\) at time \(t\), the whole curve can be identified by the function \[ \pmb{\gamma} \ \colon \mathbb{R} \to \mathbb{R}^n \,, \,\,\, \pmb{\gamma} = \pmb{\gamma}(t) \,. \]
This motivates the following definition of parametrized curve, which will be our main definition of curve.
Definition 1: Parametrized curve
where
\[ - \infty \leq a < b \leq \infty \,. \]
A few remarks:
- The symbol \((a,b)\) denotes an open interval \[ (a,b) = \{ t \in \mathbb{R} \ \colon \ a < t < b \}\,. \]
- The requirement that \[ -\infty \leq a < b \leq \infty \] means that the interval \((a,b)\) is possibly unbounded.
- For each \(t \in (a,b)\) the quantity \(\pmb{\gamma}(t)\) is a vector in \(\mathbb{R}^n\).
- The components of \(\pmb{\gamma}(t)\) are denoted by \[ \pmb{\gamma}(t) = ( \gamma_1(t), \ldots, \gamma_n(t) ) \,, \] where the components are functions \[ \gamma_i \ \colon (a,b) \to \mathbb{R} \,, \] for all \(i = 1, \ldots, n\).
1.2 Parametrizing Cartesian curves
At the start we said that examples of curves in \(\mathbb{R}^2\) were the straight line, the hyperbole and the circle, with equations \[ y = 2x + 1\,, \quad y = e^x \,, \quad x^2 + y^2 = 1 \,. \] We saw that these can be represented by Cartesian equations \[ f(x,y) = c \] for some function \(f \ \colon \mathbb{R}^2 \to \mathbb{R}\) and value \(c \in \mathbb{R}\). Curves that can be represented in this way are called level curves. Let us give a precise definition.
Definition 2: Level curve
We now want to represent level curves by means of parametrizations.
Definition 3
Question
The answer is YES, as shown in the following examples.
Example 4: Parametrizing the straight line
is a level curve with \[ C = \{ (x,y) \in \mathbb{R}^2 \ \colon \ f(x,y) = c \} \,, \] where \[ f(x,y) := y -2x \,, \quad c :=1 \,. \]
How do we represent \(C\) as a parametrized curve \(\pmb{\gamma}\)? We know that the curve is 2D, therefore we need to find a function \[ \pmb{\gamma} \ \colon (a,b) \to \mathbb{R}^2 \] with componenets \[ \pmb{\gamma}(t) = (\gamma_1(t),\gamma_2(t)) \, . \] The curve \({\pmb{\gamma}}\) needs to be chosen so that it parametrizes the set \(C\), in the sense that \[ C = \{ (\gamma_1(t), \gamma_2(t)) \ \colon \ t \in (a,b) \} \,. \tag{1.1}\] Thus we need to have \[ (x,y) = (\gamma_1,\gamma_2) \,. \tag{1.2}\] How do we define such \(\pmb{\gamma}\)? Note that the points \((x,y)\) in \(C\) satisfy \[ (x,y) \in C \iff y = 2x +1 \,. \] Therefore, using (1.2), we have that \[ \gamma_1 = x \,, \quad \gamma_2 = y = 2x + 1 \] from which we deduce that \(\pmb{\gamma}\) must satisfy \[ \gamma_2(t) = 2 \gamma_1(t) + 1 \tag{1.3}\] for all \(t \in (a,b)\). We can then choose \[ \gamma_1(t) := t \,, \] and from (1.3) we deduce that \[ \gamma_2 (t) = 2 t + 1 \,. \] This choice of \(\pmb{\gamma}\) works: \[\begin{align} C & = \{ (x,2x+1) \ \colon \ x \in \mathbb{R} \} \\ & = \{ (t,2t+1) \ \colon \ - \infty < t < \infty \} \\ & = \{ (\gamma_1(t),\gamma_2(t)) \ \colon \ - \infty < t < \infty \} \,, \end{align}\] where in the second line we just swapped the symbol \(x\) with the symbol \(t\). In this case we have to choose the time interval as \[ (a,b) = (-\infty,\infty) \,. \] In this way \(\pmb{\gamma}\) satisfies (1.1) and we have successfully parametrized the straight line \(C\).
Remark 5: Parametrization is not unique
Example 6: Parametrizing the circle
The circle \(C\) is described by all the points \((x,y) \in \mathbb{R}^2\) such that \[
x^2 + y^2 = 1\,.
\] Therefore if we want to find a curve \[
\pmb{\gamma} = (\gamma_1,\gamma_2)
\] which parametrizes \(C\), this has to satisfy \[
\gamma_1 (t)^2 + \gamma_2(t)^2 = 1
\tag{1.4}\] for all \(t \in (a,b)\).
How to find such curve? We could proceed as in the previous example, and set \[
\gamma_1(t):=t \,.
\] Then (1.4) implies \[
\gamma_2 (t) = \sqrt{1-t^2}\,,
\] from which we also deduce that \[
- 1 \leq t \leq 1
\] are the only admissible values of \(t\). However this curve does not represent the full circle \(C\), but only the upper half, as seen in the plot below.
Simlarly, another solution to (1.4) would be \(\pmb{\gamma}\) with \[ \gamma_1(t)=t \,, \quad \gamma_2 (t) = - \sqrt{1-t^2}\,, \] for \(t \in [-1,1]\). However this choice does not parametrize the full circle \(C\) either, but only the bottom half, as seen in the plot below.
How to represent the whole circle? Recall the trigonometric identity \[ \cos(t)^2 + \sin(t)^2 = 1 \] for all \(t \in \mathbb{R}\). This suggests to choose \(\pmb{\gamma}\) as \[ \gamma_1(t):=\cos(t)\,, \quad \gamma_2(t):=\sin(t) \] for \(t \in [0,2\pi)\). This way \(\pmb{\gamma}\) satisfies (1.4), and actually parametrizes \(C\), as shown below.
Note the following:
- If we had chosen \(t \in [0,4\pi]\) then \(\pmb{\gamma}\) would have covered \(C\) twice.
- If we had chosen \(t \in [0,\pi]\), then \(\pmb{\gamma}\) would have covered the upper semi-circle
- If we had chosen \(t \in [\pi,2\pi]\), then \(\pmb{\gamma}\) would have covered the lower semi-circle
- Similarly, we can choose \(t \in [\pi/6, \pi /2]\) to cover just a portion of \(C\), as shown below.
Finally we are also able to give a mathematical description of the 3D Helix.
Example 7: Parametrizing the helix
1.3 Smooth curves
Let us recall the definition of parametrized curve.
Definition 8: Parametrized curve
\[ (a,b) = \{ t \in \mathbb{R}\ \colon \ a < t < b \} \,, \] with \[ - \infty \leq a < b \leq \infty \,. \] The components of \({\pmb{\gamma}}(t) \in \mathbb{R}^n\) are denoted by \[ {\pmb{\gamma}}(t) = ( \gamma_1(t), \ldots, \gamma_n(t) ) \,, \] where the components are functions \[ \gamma_i \ \colon (a,b) \to \mathbb{R}\,, \] for all \(i = 1, \ldots, n\).
As we already mentioned, the aim of the course is to study curves by differentiating them. Let us see what that means for curves.
Definition 9: Smooth functions
We will denote the first and second derivatives of \(f\) as follows: \[ \dot f := \frac{d f}{dt} \,, \quad \ddot f := \frac{d^2 f}{dt^2} \,. \]
Example 10
Definition 11
In Figure 1.1 we skectch a smooth and a non-smooth curve. Notice that the curve on the right is smooth, except for the point \(x\).
We will work under the following assumption.
Assumption
Example 12
1.4 Tangent vectors
Looking at Figure 1.2, it seems like the vector \[ \dot{{\pmb{\gamma}}}(\pi/2) = (-1,0) \] is tangent to the circle at the point \[ {\pmb{\gamma}}(\pi/2) = (0,1) \,. \] Is this a coincidence? Not that all. Let us look at the definition of derivative at a point: \[ \dot{{\pmb{\gamma}}}(t) := \lim_{\delta \to 0} \frac{{\pmb{\gamma}}(t + \delta) - {\pmb{\gamma}}(t)}{\delta} \,. \] If we just look at the quantity \[ \frac{{\pmb{\gamma}}(t + \delta) - {\pmb{\gamma}}(t)}{\delta} \] for non-negative \(\delta\), we see that this vector is parallel to the chord joining \({\pmb{\gamma}}(t)\) to \({\pmb{\gamma}}(t + \delta)\), as shown in Figure 1.3 below. As \(\delta \to 0\), the length of the chord tends to zero. However the direction of the chord becomes parallel to that of the tangent vector of the curve \({\pmb{\gamma}}\) at \({\pmb{\gamma}}(t)\). Since \[ \frac{{\pmb{\gamma}}(t + \delta) - {\pmb{\gamma}}(t)}{\delta} \to \dot{{\pmb{\gamma}}}(t) \] as \(\delta \to 0\), we see that \(\dot{{\pmb{\gamma}}}(t)\) is parallel to the tangent of \({\pmb{\gamma}}\) at \({\pmb{\gamma}}(t)\), as showin in Figure 1.3.
The above remark motivates the following definition.
Definition 13: Tangent vector
Example 14: Tangent vector to helix
Remark 15: Avoiding potential ambiguities
Example 16: The Lemniscate, a self intersecting curve
1.5 Length of curves
For a vector \(v \in \mathbb{R}^n\) with components \[ v=(v_1,\ldots,v_n), \] its length is defined by \[ \left\| v \right\|:= \sqrt{\sum_{i=1}^n v_i^2 } \,. \] The above is just an extension of the Pythagoras theorem to \(\mathbb{R}^n\), and the length of \(v\) is computed from the origin.
If we have a second vector \(u \in \mathbb{R}^n\), then the quantity \[ \left\| u-v \right\|:= \sqrt{\sum_{i=1}^n (u_i-v_i)^2 } \] measures the length of the difference between \(u\) and \(v\).
We would like to define the concept of length of a curve. Intuitively, one could proceed by approximation as in the figure below.
In formulae, this means choosing some time instants \[ t_0, \ldots, t_m \in (a,b) \,. \] The length of the segment connecting \({\pmb{\gamma}}(t_{i-1})\) to \({\pmb{\gamma}}(t_i)\) is given by \[ \left\| {\pmb{\gamma}}(t_i) - {\pmb{\gamma}}(t_{i-1}) \right\| \,. \] Thus \[ L({\pmb{\gamma}}) \approx \sum_{i=1}^m \left\| {\pmb{\gamma}}(t_i) - {\pmb{\gamma}}(t_{i-1}) \right\| \,. \tag{1.5}\] Intuitively, if we increase the number of points \(t_i\), the quantity on the RHS of (1.5) should approximate \(L({\pmb{\gamma}})\) better and better. Let us make this precise.
Definition 17: Partition
Note that \(\left\| \mathcal{P} \right\|\) measures how fine the partition \(\mathcal{P}\) is.
Definition 18: Length of approximating polygonal curve
If \(\left\| \mathcal{P} \right\|\) becomes smaller and smaller, that is, the partition \(\mathcal{P}\) is finer and finer, it is reasonable to say that \[ L({\pmb{\gamma}}, \mathcal{P}) \] is approximating the length of \({\pmb{\gamma}}\). We take this as definition of length.
Definition 19: Rectifiable curve and length
This definition definitely corresponds to our geometrical intuition of length of a curve.
Question 20
Thankfully, when \({\pmb{\gamma}}\) is smooth, the length \(L({\pmb{\gamma}})\) can be characterized in terms of \(\dot{{\pmb{\gamma}}}\). Indeed, when \(\delta\) is small, then the quantity \[ \left\| {\pmb{\gamma}}(t + \delta) - {\pmb{\gamma}}(t) \right\| \] is approximating the length of \({\pmb{\gamma}}\) between \({\pmb{\gamma}}(t)\) and \({\pmb{\gamma}}(t + \delta)\). Multiplying and dividing by \(\delta\) we obtain \[ \frac{\left\| {\pmb{\gamma}}(t + \delta) - {\pmb{\gamma}}(t) \right\|}{\delta} \, \delta \] which for small \(\delta\) is close to \[ \left\| \dot{{\pmb{\gamma}}}(t) \right\| \,\delta \,. \] We can now divide the time interval \((a,b)\) in steps \(t_0, \ldots, t_m\) with \(|t_{i}-t_{i-1}| < \delta\) and obtain \[\begin{align*} \left\| {\pmb{\gamma}}(t_{i}) - {\pmb{\gamma}}(t_{i-1}) \right\| & = \frac{\left\| {\pmb{\gamma}}(t_{i}) - {\pmb{\gamma}}(t_{i-1}) \right\|}{ |t_{i}-t_{i-1}| } |t_{i}-t_{i-1}| \\ & \approx \left\| \dot{{\pmb{\gamma}}}(t_i) \right\| \delta \end{align*}\] since \(\delta\) is small. Therefore \[ L({\pmb{\gamma}}) \approx \sum_{i=1}^m \left\| {\pmb{\gamma}}(t_{i}) - {\pmb{\gamma}}(t_{i-1}) \right\| \approx \sum_{i=1}^m \left\| \dot{{\pmb{\gamma}}}(t_i) \right\| \,\delta \,. \] The RHS is a Riemann sum, therefore \[ L({\pmb{\gamma}}) \approx \int_a^b \left\| \dot{{\pmb{\gamma}}}(t) \right\| \, dt \,. \]
The above argument can be made rigorous, as we see in the next theorem.
Theorem 21: Characterizing the length of \({\pmb{\gamma}}\)
Proof
Since \({\pmb{\gamma}}\) is smooth, in particular \(\dot{{\pmb{\gamma}}}\) is continuous. Since \([a,b]\) is bounded, then \(\dot{{\pmb{\gamma}}}\) is bounded, that is \[ \sup_{t \in [a,b]} \left\| \dot{{\pmb{\gamma}}}(t) \right\| \leq C \] for some constant \(C \geq 0\). Therefore \[ \int_a^b \left\| \dot{{\pmb{\gamma}}}(t) \right\| \, dt \leq C (b-a) < \infty \,. \]
Step 2. Writing (1.6) as limit.
Recalling that \[
L({\pmb{\gamma}}) = \lim_{\left\| \mathcal{P} \right\| \to 0} \ L({\pmb{\gamma}},\mathcal{P}) \,,
\] whenever the limit is finite, in order to show (1.6) we then need to prove \[
L({\pmb{\gamma}},\mathcal{P}) \to \int_a^b \left\| \dot{{\pmb{\gamma}}}(t) \right\| \, dt
\] as \(\left\| \mathcal{P} \right\| \to 0\). Showing the above means proving that: for every \(\varepsilon> 0\) there exists a \(\delta > 0\) such that, if \(\mathcal{P}\) is a partition of \([a,b]\) such that \(\left\| \mathcal{P} \right\|<\delta\), then \[
\left| \int_a^b \left\| \dot{{\pmb{\gamma}}}(t) \right\| \, dt - L({\pmb{\gamma}}, \mathcal{P} ) \right| < \varepsilon\,.
\tag{1.7}\]
Step 3. First estimate in (1.7).
This first estimate is easy, and only relies on the Fundamental Theorem of Calculus. To be more precise, we will show that each polygonal has shorter length than \(\int_{a}^b \left\| \dot{{\pmb{\gamma}}}(t) \right\| \, dt\). To this end, take an arbitrary partition \(\mathcal{P} = (t_0, \ldots, t_m)\) of \([a,b]\). Then for each \(i = 1,\ldots,m\) we have \[
\left\| {\pmb{\gamma}}(t_i) - {\pmb{\gamma}}(t_{i-1}) \right\| = \left\| \int_{t_{i-1}}^{t_i} \dot{{\pmb{\gamma}}}(t)\, dt \right\| \leq \int_{t_{i-1}}^{t_i}\left\| \dot{{\pmb{\gamma}}}(t) \right\| \, dt
\] where we used the Fundamental Theorem of calculus, and usual integral properties. Therefore by definition \[\begin{align*}
L({\pmb{\gamma}},\mathcal{P} ) & = \sum_{i=1}^m \left\| {\pmb{\gamma}}(t_i) - {\pmb{\gamma}}(t_{i-1}) \right\| \\
& \leq \sum_{i=1}^m \int_{t_{i-1}}^{t_i} \left\| \dot{{\pmb{\gamma}}}(t) \right\| \, dt \\
& = \int_{a}^b \left\| \dot{{\pmb{\gamma}}}(t) \right\| \, dt \,.
\end{align*}\] We have then shown \[
L({\pmb{\gamma}}, \mathcal{P}) \leq \int_{a}^b \left\| \dot{{\pmb{\gamma}}}(t) \right\| \, dt
\tag{1.8}\] for all partitions \(\mathcal{P}\).
Step 4. Second estimate in (1.7).
The second estimate is more delicate. We need to carefully construct a polygonal so that its length is close to \(\int_a^b \left\| \dot{{\pmb{\gamma}}} \right\| \,dt\). This will be possible by uniform continuity of \(\dot{{\pmb{\gamma}}}\). Indeed, note that \(\dot{{\pmb{\gamma}}}\) is continuous on the compact set \([a,b]\). Therefore it is uniformly continuous by the Heine-Borel Theorem. Fix \(\varepsilon>0\). By uniform continuity of \(\dot{{\pmb{\gamma}}}\) there exists \(\delta >0\) such that \[
|t-s| < \delta \implies \left\| \dot{{\pmb{\gamma}}}(t)-\dot{{\pmb{\gamma}}}(s) \right\| < \frac{ \varepsilon}{b-a} \,.
\tag{1.9}\] for all \(t,s \in [a,b]\). Let \(\mathcal{P} = (t_0, \ldots, t_m)\) be a partition of \([a,b]\) with \(\left\| \mathcal{P} \right\| < \delta\). Recall that \[
\left\| \mathcal{P} \right\| = \max_{i=1,\ldots ,m} |t_i - t_{i-1}| \,.
\] Therefore the condition \(\left\| \mathcal{P} \right\| < \delta\) implies \[
|t_i - t_{i-1}| < \delta
\tag{1.10}\] for each \(i = 1, \ldots, m\). For all \(i = 1, \ldots, m\) and \(s \in [t_{i-1},t_i]\) we have \[\begin{align*}
{\pmb{\gamma}}(t_i) - {\pmb{\gamma}}(t_{i-1}) & = \int_{t_{i-1}}^{ t_i } \dot{{\pmb{\gamma}}}(t)\, dt \\
& = \int_{t_{i-1}}^{ t_i } \dot{{\pmb{\gamma}}}(s) + (\dot{{\pmb{\gamma}}}(t) - \dot{{\pmb{\gamma}}}(s)) \, dt \\
& = ( t_i - t_{i-1} ) \dot{{\pmb{\gamma}}}(s) + \int_{t_{i-1}}^{ t_i } (\dot{{\pmb{\gamma}}}(t) - \dot{{\pmb{\gamma}}}(s)) \, dt
\end{align*}\] Therefore \[
\left\| {\pmb{\gamma}}(t_i) - {\pmb{\gamma}}(t_{i-1}) \right\| = \left\| ( t_i - t_{i-1} ) \dot{{\pmb{\gamma}}}(s) +
\int_{t_{i-1}}^{ t_i } (\dot{{\pmb{\gamma}}}(t) - \dot{{\pmb{\gamma}}}(s)) \, dt \right\|
\tag{1.11}\] We can now use the reverse triangle inequality \[
| \| x\| - \left\| y \right\|| \leq \left\| x-y \right\|\,,
\] for all \(x,y \in \mathbb{R}^n\), which implies \[
\left\| x+y \right\| = \left\| x - (-y) \right\| \geq \| x \| - \left\| y \right\|
\] for all \(x,y \in \mathbb{R}^n\). Applying the above to (1.11) we get \[
\left\| {\pmb{\gamma}}(t_i) - {\pmb{\gamma}}(t_{i-1}) \right\| \geq
( t_i - t_{i-1} ) \left\| \dot{{\pmb{\gamma}}}(s) \right\| -
\left\| \int_{t_{i-1}}^{ t_i } (\dot{{\pmb{\gamma}}}(t) - \dot{{\pmb{\gamma}}}(s)) \, dt \right\|
\tag{1.12}\] By standard properties of integral we also have \[
\left\| \int_{t_{i-1}}^{ t_i } (\dot{{\pmb{\gamma}}}(t) - \dot{{\pmb{\gamma}}}(s)) \, dt \right\|
\leq
\int_{t_{i-1}}^{ t_i } \left\| \dot{{\pmb{\gamma}}}(t) - \dot{{\pmb{\gamma}}}(s) \right\| \, dt\,,
\] so that (1.12) implies \[
\left\| {\pmb{\gamma}}(t_i) - {\pmb{\gamma}}(t_{i-1}) \right\| \geq ( t_i - t_{i-1} ) \left\| \dot{{\pmb{\gamma}}}(s) \right\| - \int_{t_{i-1}}^{ t_i } \left\| \dot{{\pmb{\gamma}}}(t) - \dot{{\pmb{\gamma}}}(s) \right\| \, dt\,.
\tag{1.13}\] Since \(t,s \in [t_{i-1},t_i]\), then \[
|t-s| \leq | t_{i} - t_{i-1} | < \delta
\] where the last inequality follows by (1.10). Thus by uniform continuity (1.9) we get \[
\left\| \dot{{\pmb{\gamma}}}(t) - \dot{{\pmb{\gamma}}}(s) \right\| < \frac{\varepsilon}{b-a} \,.
\] We can therefore further estimate (1.13) and obtain \[\begin{align*}
\left\| {\pmb{\gamma}}(t_i) - {\pmb{\gamma}}(t_{i-1}) \right\| & \geq ( t_i - t_{i-1} ) \left\| \dot{{\pmb{\gamma}}}(s) \right\| - \int_{t_{i-1}}^{ t_i } \left\| \dot{{\pmb{\gamma}}}(t) - \dot{{\pmb{\gamma}}}(s) \right\| \, dt \\
& \geq ( t_i - t_{i-1} ) \left\| \dot{{\pmb{\gamma}}}(s) \right\| - ( t_i - t_{i-1} ) \frac{\varepsilon}{b-a} \, dt \,.
\end{align*}\] Dividing the above by \(t_i - t_{i-1}\) we get \[
\frac{ \left\| {\pmb{\gamma}}(t_i) - {\pmb{\gamma}}(t_{i-1}) \right\| }{ t_i - t_{i-1} } \geq
\left\| \dot{{\pmb{\gamma}}}(s) \right\| - \frac{\varepsilon}{b-a} \,.
\] Integrating the above over \(s\) in the interval \([t_{i-1}, t_i ]\) we get \[
\left\| {\pmb{\gamma}}(t_i) - {\pmb{\gamma}}(t_{i-1}) \right\| \geq \int_{t_{i-1}}^{ t_i } \left\| \dot{{\pmb{\gamma}}}(s) \right\| \, ds - \frac{\varepsilon}{b-a} (t_i - t_{i-1}) \,.
\] Summing over \(i=1,\ldots,m\) we get \[
L(\mathcal{P},{\pmb{\gamma}}) \geq \int_{a}^b \left\| \dot{{\pmb{\gamma}}}(s) \right\| \, ds - \varepsilon
\tag{1.14}\] since \[
\sum_{i=1}^m (t_i - t_{i-1}) = t_m - t_0 = b - a \,.
\]
Conclusion.
Putting together (1.8) and (1.14) we get \[
\int_{a}^b \left\| \dot{{\pmb{\gamma}}}(s) \right\| \, ds - \varepsilon\leq L(\mathcal{P},{\pmb{\gamma}})
\leq \int_{a}^b \left\| \dot{{\pmb{\gamma}}}(s) \right\| \, ds
\] which implies (1.7), concluding the proof.
Thanks to the above theorem we have now a way to compute \(L({\pmb{\gamma}})\). Let us check that we have given a meaningful definition of length by computing \(L({\pmb{\gamma}})\) on known examples.
Example 22: Length of Circle
Example 23: Length of helix
1.6 Arc-length
We have just shown in Theorem 21 that the length of a regular curve \({\pmb{\gamma}}\ \colon [a,b] \to \mathbb{R}^n\) with \([a,b]\) bounded is given by \[ L({\pmb{\gamma}}) = \int_a^b \left\| \dot{{\pmb{\gamma}}}(t) \right\| \,dt \,. \] Using this formula, we introduce the notion of length of a portion of \({\pmb{\gamma}}\).
Definition 24: Arc-length
Remark 25
A few remarks:
Arc-length is well-defined
Indeed, \({\pmb{\gamma}}\) is smooth, and so \(\dot{{\pmb{\gamma}}}\) is continuous. WLOG assume \(t \geq t_0\). Then \[ s(t) = \int_{t_0}^t \left\| \dot{{\pmb{\gamma}}}(\tau) \right\|\, d\tau \leq (t-t_0) \max_{ \tau \in [t_0,t] } \left\| \dot{{\pmb{\gamma}}}(\tau) \right\| < \infty \,. \]
We always have \[ s(t_0)=0\,. \]
We have \[ t > t_0 \implies s(t) \geq 0 \] and \[ t < t_0 \implies s(t) \leq 0 \,. \]
Choosing a different starting point changes the arc-length by a constant:
For example define \(\tilde{s}\) as the arc-length starting from \(\tilde{t}_0\) \[ \tilde{s}(t) := \int_{\tilde{t}_0}^t \left\| \dot{{\pmb{\gamma}}}(\tau) \right\| \, d\tau \,. \] Then by the properties of integral \[\begin{align*} s(t) & = \int_{t_0}^t \left\| \dot{{\pmb{\gamma}}}(\tau) \right\| \, d\tau \\ & = \int_{t_0}^{\tilde{t}_0} \left\| \dot{{\pmb{\gamma}}}(\tau) \right\| \, d\tau + \int_{\tilde{t}_0}^{t} \left\| \dot{{\pmb{\gamma}}}(\tau) \right\| \, d\tau \\ & = \int_{t_0}^{\tilde{t}_0} \left\| \dot{{\pmb{\gamma}}}(\tau) \right\| \, d\tau + \tilde{s}(t) \,. \end{align*}\] Hence \[ s = c + \tilde{s} \] with \[ c := \int_{t_0}^{\tilde{t}_0} \left\| \dot{{\pmb{\gamma}}}(\tau) \right\| \, d\tau \,. \] Note that \(c\) is the arc-length of \({\pmb{\gamma}}\) between the starting points \({\pmb{\gamma}}(t_0)\) and \({\pmb{\gamma}}(\tilde{t}_0)\).
The arc-length is a differentiable function, with \[ \dot s(t) = \frac{d}{dt} \int_{t_0}^t \left\| \dot{{\pmb{\gamma}}}(\tau) \right\| \, d\tau = \left\| \dot{{\pmb{\gamma}}}(t) \right\| \,. \]
Since \(\dot{{\pmb{\gamma}}}\) is continuous, the above follows by the Fundamental Theorem of Calculus.
Example 26: Circle
Example 27: Logarithmic spiral
1.7 Scalar product in \(\mathbb{R}^n\)
Let us start by defining the scalar product in \(\mathbb{R}^2\).
Definition 28: Scalar product in \(\mathbb{R}^2\)
Remark 29
Definition 30: Orthogonal vectors
Proposition 31: Bilinearity and symmetry of scalar product
Let \(u, v, w \in \mathbb{R}^2\) and \(\lambda \in \mathbb{R}\). Then
- Symmetry: \(u \cdot v = v \cdot u\)
- Bilinearity: It holds \[ \lambda (u \cdot v) = (\lambda u) \cdot v = u \cdot (\lambda v) \,, \] \[ u \cdot (v + w) = u \cdot v + u \cdot w \,. \]
We leave the proof to the reader. The above proposition is saying that the scalar product is bilinear and symmetric.
Proposition 32: Scalar products written wrt euclidean coordinates
Proof
The above proposition provides a way to generalize of the scalar product to \(\mathbb{R}^n\)..
Definition 33: Scalar product in \(\mathbb{R}^n\)
With the above definition we still have that the scalar product is bilinear and symmetric, as detailed in the following proposition:
Proposition 34: Bilinearity and symmetry of scalar product in \(\mathbb{R}^n\)
Let \(u, v, w \in \mathbb{R}^n\) and \(\lambda \in \mathbb{R}\). Then
- Symmetry: \(u \cdot v = v \cdot u\)
- Bilinearity: It holds \[ \lambda (u \cdot v) = (\lambda u) \cdot v = u \cdot (\lambda v) \,, \] \[ u \cdot (v + w) = u \cdot v + u \cdot w \,. \]
The proof of the above proposition is an easy check, and is left to the reader for exercise.
Definition 35
Proposition 36: Differentiating scalar product
Proof
Concerning the formula, by definition of scalar product and linearity of the derivative we have \[\begin{align*} \frac{d}{dt} ({\pmb{\gamma}}\cdot {\pmb{\eta}}) & = \frac{d}{dt} \left( \sum_{i=1}^n {\pmb{\gamma}}_i \eta_i \right) \\ & = \sum_{i=1}^n \frac{d}{dt} ( {\pmb{\gamma}}_i \eta_i ) \\ & = \sum_{i=1}^n {\dot\gamma}_i \eta_i + \dot{\gamma}_i {\dot \eta}_i \\ & = \dot{{\pmb{\gamma}}}\cdot {\pmb{\eta}}+ {\pmb{\gamma}}\cdot \dot{{\pmb{\eta}}} \,, \end{align*}\] where in the second to last equality we used the product rule of differentiation.
1.8 Speed of a curve
Given a curve \({\pmb{\gamma}}\) we defined the tangent vector at \({\pmb{\gamma}}(t)\) to be \[ \dot{{\pmb{\gamma}}}(t) \,. \] The tangent vector measures the change of direction of the curve. Therefore the magnitude of \(\dot{{\pmb{\gamma}}}\) can be interpreted as the speed of the curve.
Definition 37
Remark 38
The reason why we introduce unit speed curves is because they make calculations easy. This is essentially because of the next proposition.
Proposition 39
Proof
Remark 40
1.9 Reparametrization
As we have observed in the Examples of Chapter 1, there is in general no unique way to parametrize a curve. However we would like to understand when two parametrizations are related. In other words, we want to clarify the concept of equivalence of two parametrizations.
Definition 41: Diffeomorphism
Let \(\phi\ \colon (a,b) \to (\tilde{a},\tilde{b})\). We say that \(\phi\) is a diffeomorphism if the following conditions are satisfied:
- \(\phi\) is invertible, with inverse \(\phi^{-1} \ \colon (\tilde{a},\tilde{b}) \to (a,b)\). Thus \[ \phi^{-1} \circ \phi= \phi\circ \phi^{-1} = \mathop{\mathrm{Id}}\,, \] where \(\mathop{\mathrm{Id}}\colon \mathbb{R}\to \mathbb{R}\) is the identity map on \(\mathbb{R}\), that is, \[ \mathop{\mathrm{Id}}(t) = t \,, \quad \forall \, t \in \mathbb{R}\,. \]
- \(\phi\) is smooth,
- \(\phi^{-1}\) is smooth.
Definition 42: Reparametrization
Remark 43
Example 44: Change of orientation
Example 45: Reversing orientation of circle
Example 46: Change of speed
Let \(k > 0\). The map \(\phi\colon (\tilde{a},\tilde{b}) \to (a,b)\) defined by \[ \phi(t) := kt \] is a diffeomoprhism. The inverse of \(\phi\) is given by \({\phi}^{-1} \colon (a,b) \to (\tilde{a},\tilde{b})\) defined by \[ {\phi}^{-1} (t) = \frac{t}{k} \,. \] Note that \(\phi\) can be used to change the speed of a curve:
- If \(k > 1\) the speed increases ,
- If \(0 < k < 1\) the speed decreases.
Example 47: Doubling the speed of Lemniscate
Recall the Lemniscate \[ {\pmb{\gamma}}(t): = (\sin(t), \sin(t)\cos(t) ) \,, \quad t \in [0,2\pi] \,. \] We can double the speed of the Lemniscate by using the Using the diffeomorphism \[ \phi(t):=2t \,. \] This way we obtain \(\tilde{{\pmb{\gamma}}}:= {\pmb{\gamma}}\circ \phi\ \colon [0,\pi] \to [0, 2\pi]\) with \[ \widetilde{{\pmb{\gamma}}}(t) = {\pmb{\gamma}}(\phi(t)) = (\sin(2t), \sin(2t)\cos(2t)) \,. \] In this case we have that \[ \dot{\widetilde{{\pmb{\gamma}}}}(t) = 2 \dot{{\pmb{\gamma}}}(\phi(t)) \,. \]
The above follows by chain rule. Indeed, \(\dot{\phi} = 2\), so that \[ \dot{\widetilde{{\pmb{\gamma}}}}= \frac{d}{dt} \left( {\pmb{\gamma}}(\phi(t)) \right) = \dot{\phi}(t) \dot{{\pmb{\gamma}}}(\phi(t)) = 2 \dot{{\pmb{\gamma}}}(\phi(t))\,. \]
Important
Definition 48: Regular points
Let \({\pmb{\gamma}}\ \colon (a,b) \to \mathbb{R}^n\) be a parametrized curve. We say that:
- \({\pmb{\gamma}}(t_0)\) is a regular point if \[ \dot{{\pmb{\gamma}}}(t_0) \neq 0 \,. \]
- A point \({\pmb{\gamma}}(t_0)\) is singular if it is not regular.
- The curve \({\pmb{\gamma}}\) is regular if every point of \({\pmb{\gamma}}\) is regular, that is, \[ \dot{{\pmb{\gamma}}}(t) \neq 0 \,, \quad \forall \, t \in (a,b) \,. \]
Note that when \(\dot{{\pmb{\gamma}}}(t_0) = 0\), this means the curve is stopping at time \(t_0\). Before making an example, let us prove a useful lemma about diffeomorphisms.
Lemma 49
Proof
Example 50: A curve with one singular point
Consider the parabola \[ \Gamma := \{ (x,y) \in \mathbb{R}^2 \, \colon \, y=x^2 , \, -1 \leq x \leq 1\} \,. \] This can be parametrized in two ways by \({\pmb{\gamma}}, {\pmb{\eta}}\ \colon [-1,1] \to \mathbb{R}^2\) defined as \[ {\pmb{\gamma}}(t) = (t,t^2) \,, \quad {\pmb{\eta}}(t) = (t^3, t^6) \,. \] We will see that the above parametrizations are not equivalent. This is intuitively clear, since the change of variables map should be \[ \phi(t) = t^3 \,. \] This is smooth and invertible, with inverse \[ \phi^{-1}(t) = \sqrt[3]{x} \,. \] However \(\phi^{-1}\) is not smooth at \(t=0\), and thus \(\phi\) is not a diffeomorphism. Alternatively we could have just noticed that \[ \dot \phi(t) = 3t^2 \quad \implies \quad \dot\phi(0) = 0 \,, \] and therefore \(\phi\) cannot be a diffeomorphism due to Lemma 49.
Let us look at the derivatives: \[ \dot{{\pmb{\gamma}}}(t) = (1,2t) \,, \quad \dot{{\pmb{\eta}}} (t)= (3t^2,6t^5) \,. \] We notice a difference:
- \({\pmb{\gamma}}\) is a regular parametrization,
- \({\pmb{\eta}}(t)\) is regular only for \(t \neq 0\).
Indeed if we animate the plots of the above parametrizations, we see that:
- The point \({\pmb{\gamma}}(t)\) moves with constant horizontal speed
- The point \({\pmb{\eta}}(t)\) is decelerating for \(t < 0\), it stops at \(t = 0\), and then accelerates again for \(t>0\).
Proposition 51: Regularity is invariant for reparametrization
Proof
Example 52
- \({\pmb{\gamma}}\) is a regular parametrization,
- \({\pmb{\eta}}(t)\) is regular only for \(t \neq 0\).
Proposition 51 implies that \({\pmb{\eta}}\) is NOT a reparametrization of \({\pmb{\gamma}}\).
Definition 53: Unit speed reparametrization
The next theorem states that a curve is regular if and only if it has a unit speed reparametrization. For the proof, it is crucial to recall the definition of arc-length of a curve \({\pmb{\gamma}}\colon (a,b) \to \mathbb{R}^n\), which is given by \[ s(t):=\int_{t_0}^t \left\| \dot{{\pmb{\gamma}}}(\tau) \right\| \, d\tau \,, \] for some arbitrary \(t_0 \in (a,b)\) fixed. Indeed, we will see that for \(\phi\) regular the unit speed parametrization map can be taken as \[ \phi= s^{-1} \,. \]
Theorem 54: Existence of unit speed reparametrization
Let \({\pmb{\gamma}}\) be a parametrized curve. They are equivalent:
- \({\pmb{\gamma}}\) is regular,
- \({\pmb{\gamma}}\) has a unit speed reparametrization.
Proof
Assume \({\pmb{\gamma}}\ \colon (a,b) \to \mathbb{R}^n\) is regular, that is, \[ \dot{{\pmb{\gamma}}}(t) \neq 0 \,, \quad \forall \, t \in (a,b)\,. \] Let \(s \ \colon (a,b) \to \mathbb{R}\) be the arc-length of \({\pmb{\gamma}}\) starting at any point \(t_0 \in (a,b)\). By the Fundamental Theorem of Calculus we have \[ \dot s (t) = \left\| \dot{{\pmb{\gamma}}}(t) \right\| \tag{1.22}\] so that \[ \dot s (t) > 0 \,, \quad \forall \, t \in (a,b)\,. \] Since \(s\) is a scalar function, the above condition and the Inverse Function Theorem guarantee the existsence of a smooth inverse \[ s^{-1} \ \colon (\tilde{a},\tilde{b}) \to (a,b) \] for some \(\tilde{\alpha}< \tilde{\beta}\). Define the reparametrization map \(\phi\) as \[ \phi:= s^{-1} \] and the corresponding reparametrization of \({\pmb{\gamma}}\) given by the curve \[ \widetilde{{\pmb{\gamma}}}\ \colon (\tilde{a},\tilde{b}) \to \mathbb{R}^n \,, \quad \widetilde{{\pmb{\gamma}}}:= {\pmb{\gamma}}\circ \phi\,. \] We claim that \(\widetilde{{\pmb{\gamma}}}\) is unit speed. Indeed, by definition \[ \widetilde{{\pmb{\gamma}}}:= {\pmb{\gamma}}\circ \phi\quad \implies \quad {\pmb{\gamma}}= \widetilde{{\pmb{\gamma}}}\circ \phi^{-1} = \widetilde{{\pmb{\gamma}}}\circ s \,, \] or in other words \[ {\pmb{\gamma}}(t) = \widetilde{{\pmb{\gamma}}}(s(t)) \,, \quad \forall t \in (a,b) \,. \] Differentiating the above expression and using the chain rule we get \[ \dot{{\pmb{\gamma}}}(t) = \dot{\widetilde{{\pmb{\gamma}}}}(s(t)) \, \dot s(t) = \dot{\widetilde{{\pmb{\gamma}}}}(s(t)) \, \left\| \dot{{\pmb{\gamma}}}(t) \right\| \] where in the last equality we used (1.22). Taking the absolute value of the above yileds \[ \left\| \dot{{\pmb{\gamma}}}(t) \right\| = \left\| \dot{\widetilde{{\pmb{\gamma}}}}(s(t)) \right\| \, \left\| \dot{{\pmb{\gamma}}}(t) \right\| \,. \tag{1.23}\] Since \({\pmb{\gamma}}\) is regular, we have \[ \left\| \dot{{\pmb{\gamma}}}(t) \right\| \neq 0 \,, \quad \forall \, t \in (a,b)\,. \] Therefore we can divide (1.23) by \(\left\| \dot{{\pmb{\gamma}}}(t) \right\|\) and obtain \[ \left\| \dot{\widetilde{{\pmb{\gamma}}}}(s(t)) \right\| = 1 \,, \quad \forall \, t \in (a,b) \,. \] By invertibility of \(s\), the above holds if and only if \[ \left\| \dot{\widetilde{{\pmb{\gamma}}}}(t) \right\| = 1 \,, \quad \forall \, t \in (\tilde{a},\tilde{b}) \,, \] showing that \(\widetilde{{\pmb{\gamma}}}\) is a unit speed reparametrization of \({\pmb{\gamma}}\).
Step 2. Reverse implication.
Suppose there exists a unit speed reparametrization of \({\pmb{\gamma}}\) denoted by \[
\widetilde{{\pmb{\gamma}}}\ \colon (\tilde{a},\tilde{b}) \to \mathbb{R}^n \,, \quad \widetilde{{\pmb{\gamma}}}= {\pmb{\gamma}}\circ \phi
\] for some reparametrization map \(\phi\ \colon (\tilde{a},\tilde{b}) \to (a,b)\). Differentiating \(\widetilde{{\pmb{\gamma}}}= {\pmb{\gamma}}\circ \phi\) and using the chain rule we get \[
\dot{\widetilde{{\pmb{\gamma}}}}(t) = \dot{{\pmb{\gamma}}}(\phi(t)) \, \dot{\phi} (t) \,.
\] Taking the norm \[
\left\| \dot{\widetilde{{\pmb{\gamma}}}}(t) \right\| = \left\| \dot{{\pmb{\gamma}}}(\phi(t)) \right\| \, |\dot{\phi} (t)| \,.
\] Since \(\widetilde{{\pmb{\gamma}}}\) is unit speed we obtain \[
\left\| \dot{{\pmb{\gamma}}}(\phi(t)) \right\| \, |\dot \phi(t)| = 1 \,, \quad \forall \, t \in (\tilde{a},\tilde{b}) \,.
\tag{1.24}\] Since \(\phi\) is a diffeomorphism from \((\tilde{a},\tilde{b})\) into \((a,b)\), Lemma 49 guarantees that \[
\dot{\phi} (t) \neq 0 \,, \quad \forall \, t \in (a,b) \,.
\] In particular (1.24) implies \[
\dot{{\pmb{\gamma}}}(\phi(t)) \neq 0 \,, \quad \forall \, t \in (\tilde{a},\tilde{b}) \,.
\] As \(\phi\) is invertible, we also have \[
\dot{{\pmb{\gamma}}}(t) \neq 0 \,, \quad \forall \, t \in (a,b) \,,
\] proving that \({\pmb{\gamma}}\) is regular.
The proof of Theorem 54 told us that, if \({\pmb{\gamma}}\) is regular, then \[ \widetilde{{\pmb{\gamma}}}= {\pmb{\gamma}}\circ s^{-1} \] is a unit speed reparametrization of \({\pmb{\gamma}}\). In the next proposition we show that the arc-length \(s\) is essentially the only unit-speed reparametrization of a regular curve.
Proposition 55: Arc-length and unit speed reparametrization
Let \({\pmb{\gamma}}\ \colon (a,b) \to \mathbb{R}^n\) be a regular curve. Let \(\widetilde{{\pmb{\gamma}}}\ \colon (\tilde{a},\tilde{b}) \to \mathbb{R}^n\) be reparametrization of \({\pmb{\gamma}}\), so that \[ {\pmb{\gamma}}(t) = \widetilde{{\pmb{\gamma}}}( \phi(t) ) , \quad \forall \, t \in (a,b)\,. \] for some diffeomorphism \(\phi\ \colon (a,b) \to (\tilde{a},\tilde{b})\). Denote by \[ s(t):= \int_{t_0}^t \left\| \dot{{\pmb{\gamma}}}(\tau) \right\| \, d \tau \,, \quad t \in (a,b) \] the arc-length of \({\pmb{\gamma}}\) starting at any point \(t_0 \in (a,b)\). We have:
If \(\widetilde{{\pmb{\gamma}}}\) is unit speed, then there exists \(c \in \mathbb{R}\) such that \[ \phi(t) = \pm s(t) + c \,, \quad \forall \, t \in (a,b) \,. \tag{1.25}\]
If \(\phi\) is given by (1.25) for some \(c \in \mathbb{R}\), then \(\widetilde{{\pmb{\gamma}}}\) is unit speed.
Proof
First note that a unit speed reparametrization \(\widetilde{{\pmb{\gamma}}}\) of \({\pmb{\gamma}}\) exists by Theorem 54, since \({\pmb{\gamma}}\) is assumed to be regular. Thus assume \(\widetilde{{\pmb{\gamma}}}\) is unit speed reparametrization of \({\pmb{\gamma}}\). By differentiating both sides of \[ {\pmb{\gamma}}(t) = \widetilde{{\pmb{\gamma}}}( \phi(t) ) , \quad \forall \, t \in (a,b)\,, \] we obtain \[ \dot{{\pmb{\gamma}}}(t) = \frac{d}{dt} \widetilde{{\pmb{\gamma}}}( \phi(t) ) = \dot{\widetilde{{\pmb{\gamma}}}}(\phi(t)) \, \dot\phi(t) \,. \] Taking the norms we then have \[\begin{align*} \left\| \dot{{\pmb{\gamma}}}(t) \right\| & = \left\| \dot{\widetilde{{\pmb{\gamma}}}}(\phi(t)) \, \dot\phi(t) \right\| \\ & = \left\| \dot{\widetilde{{\pmb{\gamma}}}}(\phi(t)) \right\| \, | \dot\phi(t) | \\ & = | \dot\phi(t) | \,, \end{align*}\] where in the last equality we used that \(\widetilde{{\pmb{\gamma}}}\) is unit speed, and so \[ \left\| \dot{\widetilde{{\pmb{\gamma}}}} \right\| \equiv 1 \,. \] To summarize, so far we have proven that \[ \left\| \dot{{\pmb{\gamma}}}(t) \right\| = | \dot\phi(t) | \,, \quad \forall \, t \in (a,b) \,. \] Therefore \[ s(t) = \int_{t_0}^t \left\| \dot{{\pmb{\gamma}}}(\tau) \right\| \, d\tau = \int_{t_0}^t | \dot \phi(\tau) | \, d\tau \,. \] By the Fundamental Theorem of Calculus we get \[ \dot s(t) = |\dot \phi(t) | \] and therefore \[ \phi= \pm s + c \] for some \(c \in \mathbb{R}\), concluding the proof.
Step 2. Second Point.
Suppose that \[
\phi:= \pm s + c
\] for some \(c \in \mathbb{R}\), so that \(\phi \ \colon (a,b) \to (\tilde{a},\tilde{b})\). We have \[
\dot\phi(t) = \pm \dot s (t) = \pm \left\| \dot{{\pmb{\gamma}}}(t) \right\| \neq 0
\tag{1.26}\] where the last term is non-zero since \({\pmb{\gamma}}\) is regular. Therefore, due to the Inverse Function Theorem, \(\phi\) is invertible with smooth inverse. This proves that \(\widetilde{{\pmb{\gamma}}}\) defined by \[
\widetilde{{\pmb{\gamma}}}:= {\pmb{\gamma}}\circ \psi \,, \quad \psi := \phi^{-1} \,,
\] is a reparametrization of \({\pmb{\gamma}}\). In particular \[
{\pmb{\gamma}}= \widetilde{{\pmb{\gamma}}}\circ \phi\,.
\] Differentiating the above, and recalling (1.26), we get \[
\dot{{\pmb{\gamma}}}(t) = \dot{\widetilde{{\pmb{\gamma}}}}( \phi(t) ) \, \dot\phi(t) = \dot{\widetilde{{\pmb{\gamma}}}}( \phi(t) ) \,\left( \pm \left\| \dot{{\pmb{\gamma}}}(t) \right\| \right) \,.
\] Taking the absolute value of the above yields \[
\left\| \dot{{\pmb{\gamma}}}(t) \right\| = \left\| \dot{\widetilde{{\pmb{\gamma}}}}( \phi(t) ) \right\| \, \left\| \dot{{\pmb{\gamma}}}(t) \right\| \,.
\] Since \({\pmb{\gamma}}\) is regular we can divide by \(\left\| \dot{{\pmb{\gamma}}}(t) \right\|\) to get \[
\left\| \dot{\widetilde{{\pmb{\gamma}}}}( \phi(t) ) \right\| = 1 \, \quad \forall \, t \in (a,b) \, .
\] Since \(\phi\) is invertible, the above is equivalent to \[
\left\| \dot{\widetilde{{\pmb{\gamma}}}}( t ) \right\| = 1 \, \quad \forall \, t \in (\tilde{a},\tilde{b}) \, ,
\] proving that \(\widetilde{{\pmb{\gamma}}}\) is a unit speed reparametrization.
Remark 56
Computing a unit speed reparametrization of \({\pmb{\gamma}}\),
Computing \(s\) the arc-length of \({\pmb{\gamma}}\).
In some cases however, unit speed reparametrization and arc-length are impossible to characterize in terms of elementary functions, even for very simple curves.
Example 57: Twisted cubic
1.10 Closed curves
So far we have seen examples of:
- Curves which are infinite, or unbounded. This is for example the parabola \[ {\pmb{\gamma}}(t) := (t,t^2) \,, \quad \forall \, t \in \mathbb{R}\,, \]
- Curves which are finite and have end-points, such as the semi-circle \[ {\pmb{\gamma}}(t) := (\cos(t),\sin(t)) \,, \quad \forall \, t \in [0,\pi] \,, \]
- Curves which form loops, such as the circle \[ {\pmb{\gamma}}(t) := (\cos(t),\sin(t)) \,, \quad \forall \, t \in [0,2\pi] \,. \]
However there are examples of curves which are in between the above types.
Example 58
For example consider the curve \({\pmb{\gamma}}\ \colon \mathbb{R}\to \mathbb{R}^2\) \[ {\pmb{\gamma}}(t) := (t^2-1, t^3 -t) \,\quad \forall \, t \in \mathbb{R}\,. \] This curve has two main properties:
- \({\pmb{\gamma}}\) is unbounded: If define \(\widetilde{{\pmb{\gamma}}}\) as the restriction of \({\pmb{\gamma}}\) to the time interval \([1,\infty)\), then \(\widetilde{{\pmb{\gamma}}}\) is unbounded. A point which starts at \({\pmb{\gamma}}(1) = (0,0)\) goes towards infinity.
- \({\pmb{\gamma}}\) contains a loop: If we define \(\widetilde{{\pmb{\gamma}}}\) as the restriction of \({\pmb{\gamma}}\) to the time interval \([-1,1]\), then \(\widetilde{{\pmb{\gamma}}}\) is a closed loop starting at \({\pmb{\gamma}}(-1) = (0,0)\) and returnning at \({\pmb{\gamma}}(1) = (0,0)\).
The aim of this section is to make precise the concept of looping curve. To do that, we need to define periodic curves.
Definition 59: Periodic curve
Note that every curve is \(0\)-periodic. Therefore to define a closed curve we need to rule out this case.
Definition 60: Closed curve
Let \({\pmb{\gamma}}\ \colon \mathbb{R}\to \mathbb{R}^n\) be a parametrized curve. We say that \({\pmb{\gamma}}\) is closed if:
- \({\pmb{\gamma}}\) is not constant,
- \({\pmb{\gamma}}\) is T-periodic for some \(T \neq 0\).
Remark 61
We have the following basic facts:
If \({\pmb{\gamma}}\) is \(T\)-periodic, then a point moving around \({\pmb{\gamma}}\) returns to its starting point after time \(T\).
This is exactly the definition of \(T\)-periodicity. Indeed let \(p = {\pmb{\gamma}}(a)\) be the point in question, then \[ {\pmb{\gamma}}(a + T) = {\pmb{\gamma}}(a) = p \] by periodicity. Thus \({\pmb{\gamma}}\) returns to \(p\) after time \(T\).
If \({\pmb{\gamma}}\) is \(T\)-periodic, then \({\pmb{\gamma}}\) is determined by its restriction to any interval of length \(|T|\).
Conversely, suppose that \({\pmb{\gamma}}\ \colon [a,b] \to \mathbb{R}^n\) satisfies \[ {\pmb{\gamma}}(a) = {\pmb{\gamma}}(b) \,, \quad \frac{d^k {\pmb{\gamma}}}{dt^k} (a) =\frac{d^k {\pmb{\gamma}}}{dt^k} (b) \] for all \(k \in \mathbb{N}\). Set \[ T:=b-a \,. \] Then \({\pmb{\gamma}}\) can be extended to a \(T\)-periodic curve \(\widetilde{{\pmb{\gamma}}}\ \colon \mathbb{R}\to \mathbb{R}^n\) defined by \[ \widetilde{{\pmb{\gamma}}}(t) := {\pmb{\gamma}}(\tilde{t}) \,, \quad \tilde{t}:= t - \biggl\lfloor \frac{t-a}{b-a} \biggr\rfloor (b-a) \,, \quad \forall \, t \in \mathbb{R}\,. \] The above means that \(\widetilde{{\pmb{\gamma}}}(t)\) is defined by \({\pmb{\gamma}}(\tilde{t})\) where \(\tilde{t}\) is the unique point in \([a,b]\) such that \[ t = \tilde{t} + k(b-a) \] with \(k \in \mathbb{Z}\) defined by \[ k := \biggl\lfloor \frac{t-a}{b-a} \biggr\rfloor \,, \] see figure below. In this way \(\widetilde{{\pmb{\gamma}}}\) is \(T\)-periodic.
If \({\pmb{\gamma}}\) is \(T\)-periodic, then it is also \((-T)\)-periodic.
Because if \({\pmb{\gamma}}\) is \(T\)-periodic then \[ {\pmb{\gamma}}(t) = {\pmb{\gamma}}((t - T) + T ) = {\pmb{\gamma}}(t - T) \] where in the first equality we used the trivial identity \(t = (t-T) + T\), while in the second equality we used \(T\)-periodicity of \({\pmb{\gamma}}\).
If \({\pmb{\gamma}}\) is \(T\)-periodic for some \(T \neq 0\), then it is \(T\)-periodic for some \(T>0\).
This is an immediate consequence of Point 4.
If \({\pmb{\gamma}}\) is \(T\)-periodic the \({\pmb{\gamma}}\) is \((kT)\)-periodic, for all \(k \in \mathbb{Z}\).
By point 4 we can assume WLOG that \(k \geq 0\). We proceed by induction:
- The statement is true for \(k=1\), since \({\pmb{\gamma}}\) is \(T\)-periodic.
- Assume now that \({\pmb{\gamma}}\) is \(kT\)-periodic. Then \[\begin{align*} {\pmb{\gamma}}(t + (k+1) T) & = {\pmb{\gamma}}( (t+T) + kT ) & \\ & = {\pmb{\gamma}}(t + T) & \mbox{(by $kT$-periodicity)} \\ & = {\pmb{\gamma}}(t) & \mbox{(by $T$-periodicity)} \end{align*}\] showing that \({\pmb{\gamma}}\) is \((k+1)T\)-periodic.
By induction we conclude that \({\pmb{\gamma}}\) is \((kT)\)-periodic for all \(k \in \mathbb{N}\).
If \({\pmb{\gamma}}\) is \(T_1\)-periodic and \(T_2\)-periodic then \({\pmb{\gamma}}\) is \((k_1T_1 + k_2 T_2)\)-periodic, for all \(k_1, k_2 \in \mathbb{Z}\).
By Point 6 we know that \({\pmb{\gamma}}\) is \(k_1T_1\)-periodic and \(k_2T_2\)-periodic. Set \(T:=k_1T_1 + k_2T_2\). We have \[\begin{align*} {\pmb{\gamma}}(t + T) & = {\pmb{\gamma}}( (t+ k_1T_1) + k_2T_2 ) & \\ & = {\pmb{\gamma}}(t + k_1T_1) & \mbox{(by $k_2T_2$-periodicity)} \\ & = {\pmb{\gamma}}(t) & \mbox{(by $k_1T_1$-periodicity)} \end{align*}\] showing that \({\pmb{\gamma}}\) is \((k_1T_1 + k_2 T_2)\)-periodic.
Definition 62
We need to show that the above definition is well-posed, i.e., that there exists such smallest \(T>0\).
Proposition 63
Proof
- Since \({\pmb{\gamma}}\) is closed, we have that \({\pmb{\gamma}}\) is \(T\)-periodic for some \(T \neq 0\). By Remark 61 Point 5, we know that \(T\) can be chosen such that \(T>0\). Therefore \[ S \neq \emptyset \,. \]
- \(S\) is bounded below by \(0\). This is by definition of \(S\).
Thus, by the Axiom of Completeness of the Real Numbers, the set \(S\) admits an infimum \[ P = \inf S \,. \] The proof is concluded if we show that:
Claim. We have \[ P = \min S \,. \] This is equivalent to saying that \[ P \in S \,. \]
Proof of claim.
To see that \(P \in S\) we need to show that
- \({\pmb{\gamma}}\) is \(P\)-periodic,
- \(P>0\).
Since \(P\) is the infimum of \(S\), there exists an infimizing sequence \(\{T_n\}_{n \in \mathbb{N}} \subset S\) such that \[ T_n \to P \,. \] WLOG we can choose \(T_n\) decreasing, that is, such that \[ T_1 > T_2 > \ldots > T_n > \ldots > 0 \,. \]
Proof of Point 1. As \(T_n \in S\), we have that \({\pmb{\gamma}}\) is \(T_n\)-periodic. Then \[ {\pmb{\gamma}}(t + T_n) = {\pmb{\gamma}}(t) \,, \quad \forall \, t \in \mathbb{R}\,, \,\, n \in \mathbb{N}\,. \] Since \(T_n \to P\), we can take the limit as \(n \to \infty\) and use the continuity of \({\pmb{\gamma}}\) to obtain \[ {\pmb{\gamma}}(t) = \lim_{n \to \infty} \ {\pmb{\gamma}}(t + T_n) = {\pmb{\gamma}}(t + P) \,, \quad \forall \, t \in \mathbb{R}\,, \] showing that \({\pmb{\gamma}}\) is \(P\)-periodic.
Proof of Point 2. Suppose by contradiction that \[ P = 0 \,. \] Fix \(t \in \mathbb{R}\). Since \(T_n > 0\), we can find unique \[ t_n \in [0,T_n] \,, \quad k_n \in \mathbb{Z}\,, \] such that \[ t = t_n + k_n T_n \,, \] as shown in the figure below. Indeed, it is sufficient to define \[ k_n := \biggl\lfloor \frac{t}{T_n} \biggr\rfloor \in \mathbb{Z}\,, \quad t_n := t - k_n T_n \,. \] Since \(T_n \in S\), we know that \({\pmb{\gamma}}\) is \(T_n\)-periodic. Remark 61 Point 6 implies that \({\pmb{\gamma}}\) is also \(k_nT_n\)-periodic, since \(k_n \in \mathbb{Z}\). Thus \[\begin{align*} {\pmb{\gamma}}(t) & = {\pmb{\gamma}}( t_n + k_nT_n ) & \mbox{(definition of $t_n$)} \\ & = {\pmb{\gamma}}(t_n) & \mbox{(by $k_nT_n$-periodicity)} \,. \end{align*}\] Therefore \[ {\pmb{\gamma}}(t) = {\pmb{\gamma}}(t_n) \,, \quad \forall \, n \in \mathbb{N}\,. \tag{1.27}\] Also notice that \[ 0 \leq t_n \leq T_n \,, \quad \forall \, n \in \mathbb{N}\,. \] by construction. Since \(T_n \to 0\), by the Squeeze Theorem we conclude that \[ t_n \to 0 \quad \mbox{as } \, n \to \infty \,. \] Using the continuity of \({\pmb{\gamma}}\), we can pass to the limit in (1.27) and obtain \[ {\pmb{\gamma}}(t) = \lim_{n \to \infty} {\pmb{\gamma}}(t_n) = {\pmb{\gamma}}(0) \,. \] Since \(t \in \mathbb{R}\) was arbitrary, we have shown that \[ {\pmb{\gamma}}(t) = {\pmb{\gamma}}(0) \,, \quad \forall \, t \in \mathbb{R}\,. \] Therefore \({\pmb{\gamma}}\) is constant. This is a contradiction, as we were assuming that \({\pmb{\gamma}}\) is closed, and, in particular, not constant.
Example 64
Some examples of closed curves:
The circumference \[ {\pmb{\gamma}}(t) = (\cos(t), \sin(t)) \,, \quad t \in \mathbb{R} \] is not costant and is \(2\pi\)-periodic. Thus \({\pmb{\gamma}}\) is closed. The period of \({\pmb{\gamma}}\) is \(2 \pi\).
The Lemniscate \[ {\pmb{\gamma}}(t) = (\sin(t), \sin(t) \cos(t)) \,, \quad t \in \mathbb{R} \] is not costant and is \(2\pi\)-periodic. Thus \({\pmb{\gamma}}\) is closed. The period of \({\pmb{\gamma}}\) is \(2 \pi\).
Consider again the curve from Example 58 \[ {\pmb{\gamma}}(t) := (t^2-1, t^3 -t) \,, \quad \, t \in \mathbb{R}\,. \] According to our definition, \({\pmb{\gamma}}\) is not periodic. Therefore \({\pmb{\gamma}}\) is not closed. However there is a point of self-intersection on \({\pmb{\gamma}}\), namely \[ p := (0,0) \,, \] for which we have \[ p = {\pmb{\gamma}}(-1) = {\pmb{\gamma}}(1) \,. \]
The last curve in the above example motivates the definition of self-intersecting curve.
Definition 65: Self-intersecting curve
Let \({\pmb{\gamma}}\ \colon \mathbb{R}\to \mathbb{R}^n\) be a parametrized curve. We say that \({\pmb{\gamma}}\) is self-intersecting at a point \(p\) on the curve if
- There exist two times \(a \neq b\) such that \[ p = {\pmb{\gamma}}(a)={\pmb{\gamma}}(b) \,, \]
- If \({\pmb{\gamma}}\) is closed with period \(T\), then \(b-a\) is not an integer multiple of \(T\).