30.1 Variational Problem 731
the derivatives in (30.9) and solve the resulting differential equation. We
should emphasize that a path could be written as y(x) or any other form,
depending on the variables used in a particular problem.
Example 30.1.2.
Shortest Length Example 30.1.1 looked at very specific
paths connecting two points and found that the straight-line path minimizes the
length. Is this true for all paths?
For any path y(x), the length between (a, y
a
)and(b, y
b
) is given by the (30.3),
where the independent variable is x and dependent variable is y.Thus,L =
1+y
2
and the Euler-Lagrange equation becomes
∂L
∂y
−
d
dx
∂L
∂y
=0 or
d
dx
y
1+y
2
=0. (30.10)
Differentiating the expression inside the parentheses yields
y
(1 + y
2
)
3/2
=0, or y
=0, or y = cx + d,
where c and d are the constants of integration. This is the equation of a straight line.
Thus out of all the possible paths between (a, y
a
)and(b, y
b
), the straight line gives
the smallest length. Actually, we don’t know if the straight line is the shortest or the
longest distance. Euler-Lagrange equation, being the first derivative, is necessary,
but not sufficient. As in calculus, to show minimality one has to look at the second
derivatives. We shall do this later.
30.1.2 Beltrami identity
Most variational problems have an L which is independent of t. Insucha
case, the Euler-Lagrange equation simplifies considerably. Consider the total
derivative of L with respect to t:
dL
dt
=
∂L
∂x
˙x +
∂L
∂ ˙x
d ˙x
dt
.
Substitute for ∂L/∂x from Euler-Lagrange equation to obtain
dL
dt
=˙x
d
dt
∂L
∂ ˙x
+
∂L
∂ ˙x
d ˙x
dt
=
d
dt
˙x
∂L
∂ ˙x
, or
d
dt
L − ˙x
∂L
∂ ˙x
=0.
This gives the Beltrami identity:
L − ˙x
∂L
∂ ˙x
= C. (30.11)
Example 30.1.3.
The Brachistochrone Problem A bead slides on friction-
less bars of various shapes due to gravity. What shape gives the shortest time?
This is the famous brachistochrone problem which started the calculus of variations.
Specifically, consider various paths connecting P
a
=(x
a
,y
a
)andP
b
=(x
b
,y
b
)with
y
b
<y
a
.Amassm starts from rest at P
a
and moves on a frictionless path from P
a
to P
b
. Find the equation of the path that yields the shortest time.