Chapter 11: Problem 6
The purpose of this problem is to derive the shortest path \(y(x)\) between the points \(\left(x_{0}, y_{0}\right)\) and \(\left(x_{1}, y_{1}\right) .\) Consider an arbitrary path between these points as shown in the figure. We can break the path into differential elements \(d \vec{l}=d x \hat{a}_{x}+d y \hat{a}_{y} .\) The magnitude of each differential element is $$|d \vec{l}|=\sqrt{(d x)^{2}+(d y)^{2}}=d x \sqrt{1+\left(\frac{d y}{d x}\right)^{2}}$$ The distance between the points can be described by the action $$\mathbb{S}=\int_{x_{0}}^{x_{1}} \sqrt{1+\left(\frac{d y}{d x}\right)^{2}} d x .$$ To find the path \(y(x)\) that minimizes the action, we can solve the Euler- Lagrange equation, with \(\mathcal{L}=\sqrt{1+\left(\frac{d y}{d x}\right)^{2}}\) as the Lagrangian, for this shortest path \(y(x)\). This approach can be used because we want to minimize the integral of some functional \(\mathcal{L}\) even though this functional does not represent an energy difference \([163,\) p. 33\(]\). Set up the Euler-Lagrange equation, and solve it for the shortest path, \(y(x)\).
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.