Fix a point and a lower point , off to the side. Thread a frictionless wire from to , place a bead on it at , and release it from rest under gravity. The travel time depends on the wire’s shape. The straight line has the shortest length, but length is not what is being minimized; time is, and speed is not free: the bead moves fast only where it has already fallen far.
A steep initial drop buys speed early, and speed acquired early benefits the entire remaining trip. The optimal curve therefore dives more steeply than the straight line at the start and flattens out later. The classical name for the winner is the brachistochrone (Greek for shortest time), and it turns out to be an arc of a cycloid: the curve traced by a point on the rim of a circle rolling along a line.
With the circle of radius rolling under the horizontal line through , and measured downward from , the cycloid is
where is the angle the circle has rolled. Exactly one such arc starts at (which is a cusp of the curve, where the tangent is vertical) and passes through any given ; choosing and the endpoint angle fits the two conditions.
The bead as a light ray
The identification of the cycloid is due to Johann Bernoulli, and his argument is still the shortest path to it. By conservation of energy, a bead that has dropped a depth moves at speed
regardless of the route it took to get there. So the problem reads: find the path of least time through a medium where speed depends on depth. That is a problem optics already solved. Fermat’s principle says light travels between two points along the path of least time, and Snell’s law follows from it at a single interface. Send a ray from a point at height above a flat interface, where the speed is , to a point at depth below it, where the speed is , with horizontal separation between the endpoints; the ray is straight within each medium, so the only unknown is the horizontal position of the crossing. The travel time and its derivative are
where are the angles the two segments make with the normal, since and . Both terms of are strictly convex in , so there is exactly one stationary crossing point and it is the global minimum: the least-time ray refracts so that is the same on both sides of the interface.
Now slice a medium whose speed varies continuously with depth into thin horizontal layers. The least-time path obeys Snell’s law at every interface, so the quantity survives each crossing and is constant along the entire ray, with measured from the vertical.
For the bead this is not an analogy but the same problem. The travel time along any curve is , and energy conservation fixes the bead’s speed at no matter which curve it rides, so the bead and the ray minimize the identical functional: the brachistochrone is the path light takes through a medium whose speed grows as . The optimal path must therefore satisfy for some constant : the deeper the bead, the more horizontal its path, and at the start () it must move straight down.
One gap remains. Slicing treats the continuous medium as a limit of discrete layers, which identifies the invariant but is not by itself a proof of minimality. The next two sections supply the proof: the invariant forces the cycloid, and a convexity argument then shows the cycloid beats every competitor.
The invariant forces a cycloid
Parametrize the unknown curve by depth, , which describes any curve along which the bead keeps descending. The arc-length element is , so the quantity to minimize is
The integrand depends on the slope but not on itself: shifting the whole curve sideways does not change how depth is gained. For such functionals the Euler–Lagrange equation, the first-order optimality condition for integral functionals, collapses to a conservation law, :
using . The conserved quantity is exactly Snell’s invariant: the Euler–Lagrange equation and the layered-medium argument are two derivations of the same statement.
Solving the invariant for the slope gives an ODE,
and the substitution resolves it: and , so , hence
with the integration constant fixed by the start at the origin. This is the parametrization quoted in the opening, now derived rather than assumed. Passing through pins down the two remaining constants: the ratio increases strictly from to as runs over , so every target with is reached by exactly one descending arc, set by the ratio and by the scale. Two byproducts of the computation, and , are used below.
Global minimality by convexity
The Euler–Lagrange equation is a first-order condition; on its own it certifies the cycloid as a stationary point of , not as its minimum. What upgrades it here is a structural feature of the integrand: for each fixed depth , the map is strictly convex, since
A strictly convex function lies above each of its tangent lines, touching only at the point of tangency:
Let be the cycloid and any competing descent through the same endpoints, regular enough for its travel time to be defined. Apply the tangent-line inequality at each depth, with and , and integrate over :
The middle equality is where the conservation law does its work: along the cycloid, is constant, so it pulls out of the integral, and what remains is because the curves share both endpoints. So , and strict convexity turns equality into almost everywhere: the cycloid is the unique minimizer. Read through the optics, the constancy of Snell’s invariant is not merely a property the best curve happens to have; it is the certificate that lets every rival be compared to the cycloid in one line. And since bead and ray minimize the same functional, the theorem settles both at once: no wire is faster than the cycloid, and a light ray in a medium with bends along exactly this curve.
Two limitations of the argument, stated plainly. It compares the cycloid against descents, the curves expressible as ; ruling out paths that dip below and climb back takes the heavier sufficiency machinery of the calculus of variations, and does not change the answer in this regime. And it assumes is within reach of a single descending arc, ; beyond that range the true optimum does dip below its endpoint, a case the remarks after the race below return to. The integrand blows up like at the start, but harmlessly: along the cycloid there, the integral converges, and any competitor whose time integral diverges loses by default.
Time along the cycloid
The cycloid has a property that makes its motion easy to write down exactly. Dividing the arc-length element by the speed,
The sines cancel: the bead advances through equal rolling angles in equal times, . The descent from the cusp to the lowest point () takes
For comparison, take at the bottom of the arc, so . The straight wire from to is a uniformly accelerated slide of length ; solving gives
about 19% slower than the cycloid’s . A third strategy, dropping straight down and then running flat to (with an idealized corner that preserves speed), takes : better than the line, still beaten by the cycloid. All three positions below are computed from these closed forms, no numerical integration:
Two remarks the picture suggests. First, the optimal start is a free fall: the cycloid leaves its cusp vertically, which is what demands at . Second, if is far away and shallow (specifically ), the optimal arc passes below and comes back up: the bead overshoots the destination depth to carry more speed across the long horizontal stretch, then spends some of it climbing.
The same curve is the tautochrone
The cycloid solves a second problem, one Huygens had settled decades before Bernoulli posed his: it is also the tautochrone (equal time). Turn the arc into a bowl (cusps up, vertex down) and release a bead from rest anywhere on it: the time to reach the bottom does not depend on the starting point.
The reason is a hidden harmonic oscillator. Measure arc length from the bottom of the bowl and height above the bottom. For the cycloid, and , so
as a function of arc length, the bowl is an exact parabolic potential well. Conservation of energy, , then describes simple harmonic motion in with angular frequency , so
whose period is independent of the amplitude . Every bead reaches after a quarter period, , the same number as the brachistochrone descent time. The four beads below follow this closed form (and keep oscillating past the bottom, like pendulums):
Huygens found this in the 1650s while hunting for a pendulum whose period does not change with amplitude (a circular pendulum’s period does, slightly, which ruins a clock as the swing decays). His fix used another property of the cycloid: its evolute, the curve traced by the centers of its osculating circles, is a congruent cycloid. Hanging the pendulum from a cusp between two cycloidal cheeks makes the bob wrap along them and swing on a cycloid, giving a truly amplitude-independent period. He published the theory in the Horologium Oscillatorium (1673).
A little history
Galileo had already noticed in the Discorsi (1638) that descent along a circular arc beats the straight chord between the same endpoints. The full problem was posed by Johann Bernoulli in the Acta Eruditorum in June 1696 as a public challenge. Solutions appeared the following year from Johann himself, his brother Jakob, Leibniz, Tschirnhaus, l’Hôpital, and Newton, whose solution was published anonymously; Bernoulli is reported to have recognized the author anyway, “as the lion by its claw.”
The aftermath mattered more than the contest. Jakob Bernoulli’s solution method, clumsier than Johann’s optics trick but more general, treated the whole curve as the unknown and asked how the time integral responds to small deformations. That question, systematized by Euler and Lagrange in the following decades, became the calculus of variations: the framework behind least-action mechanics, geodesics, and optimal control. The cycloid was its first solved problem.
References
- Herman H. Goldstine. A History of the Calculus of Variations from the 17th through the 19th Century. Springer, 1980. Chapter 1 covers the challenge, the 1697 solutions, and the original texts.
- Christiaan Huygens. Horologium Oscillatorium. Paris, 1673. The tautochrone property and the cycloidal pendulum clock.
- Galileo Galilei. Discorsi e dimostrazioni matematiche intorno a due nuove scienze. Leiden, 1638. Descent along arcs and chords, Third Day.
- Héctor J. Sussmann, Jan C. Willems. 300 years of optimal control: from the brachystochrone to the maximum principle. IEEE Control Systems Magazine, 17(3):32-44, 1997. The brachistochrone as the seed of optimal control.
- John L. Troutman. Variational Calculus and Optimal Control: Optimization with Elementary Convexity. 2nd edition, Springer, 1996. The convexity route to global minimality used above, with the brachistochrone as a worked application.
- Gary Lawlor. A new minimization proof for the brachistochrone. The American Mathematical Monthly, 103(3):242-249, 1996. Another complete minimality proof, decomposing the global problem into local single-variable ones.
- Mark Levi. The Mathematical Mechanic. Princeton University Press, 2009. Physical derivations, including the Snell’s-law solution.