Cycloid 2026-10-14
A cycloid is the plane curve traced by a point on a circle rolling without slipping along a straight line. A parametrization with rolling radius is , ; reversing the sign of reflects the curve. Its cusps occur at integer multiples of . A descending cycloidal arc solves the classical brachistochrone problem.
Maximum-depth bound for a brachistochrone 2026-10-20
Consider a frictionless track from rest between equal-height endpoints separated horizontally by . Let depth be positive downward and let the maximum depth be . Conservation of energy gives speed . The Cauchy-Schwarz inequality, applied to the tangent displacement, givesThe squared norm of the coefficient vector is . The track goes from depth zero to and returns to zero, so the second term integrates to at least . Integrating the first term gives , even if the track backtracks horizontally. Division by proves the first bound. The arithmetic-geometric mean inequality proves the second.
Equality requires and tangent slope , on the descending and ascending halves respectively. Substitution integrates to the cycloid , . It attains the bound, proving global minimality of the single-arch brachistochrone problem between these endpoints. Endpoint singularities are handled as limits of the integrals; the cycloid has finite travel time.
Past exam of the mathematics course of the University of Cambridge 2006 ib Paper 4 16B Solution Created 2026-09-24 Updated 2026-10-14
For a variation with but arbitrary , differentiation and integration by parts giveFirst choose variations supported inside the interval. The fundamental lemma of the calculus of variations gives the Euler-Lagrange equation. Then allow arbitrary endpoint variation to obtain the natural boundary conditions for a free endpoint:Because has no explicit dependence on ,Thus the Beltrami identity is , constant along an extremal.
For the brachistochrone problem, put , so conservation of energy gives the bead speed . Its travel time isThe Beltrami identity now gives for a positive constant . A descending cycloid parametrizes this relation:The free endpoint has , hence . On the first descending arc this occurs at . ThereforeAlong this arc and , soThe initial vertical tangent causes no divergent travel time: the quotient has the finite constant limit .
To verify global minimality, take any admissible wire graph of finite travel time below the release level, and let be its maximum depth. For , the Cauchy-Schwarz inequality givesIndeed the two coefficients on the right, after multiplication by , form a unit vector. Since the path starts at depth zero and reaches depth , the weighted total variation is at least the integral over all depths from to . ConsequentlyThe last inequality is minimized at . Our cycloid attains equality throughout: its depth increases to and . Thus it achieves the genuine minimum over the wire graphs, not merely a stationary time. Reflection handles a negative horizontal endpoint coordinate by replacing with .
For fixed endpoint values, stationarity requires the Euler-Lagrange equation . Differentiate along an extremal: its derivative is . Thus when the Beltrami identity makes that quantity constant.
Take as depth measured downward. Conservation of energy from rest gives , hence speed . With arc length , the travel time is . For , the Beltrami quantity is . Thus .
Put and take along the first arch. Since , one obtains . Integrating from the initial cusp gives the cycloid solving the brachistochrone problem:For the equal-height target, the first complete arch has , so . Also and for . ThereforeThe endpoint zeros of speed cancel the zeros of , leaving finite travel time. Global minimality follows from the maximum-depth bound for a brachistochrone: any competing track with maximum depth satisfies . The displayed cycloid attains both inequalities with .
