Maupertuis' lever: equilibrium from least action
ProvedStationaryAction.maupertuis_lever_equilibriumMaupertuis' second application of his principle, §2.6 of the source: the balance point of a lever obtained by minimising an action.
Two bodies of masses and sit at the ends of a lever of length , and denotes the distance from to the pivot. Under a small rotation the arcs described by the two bodies are proportional to and to , so Maupertuis' quantity of action is proportional to
This is minimised at
the classical equilibrium condition of the lever, as the source reports. The example matters historically because it is where Maupertuis claimed universality for his principle: the same rule that bends light also balances a beam.
Formalization Note The minimum is asserted over all real , including values outside the physical range ; positivity of the masses is what makes convex and the stated point a genuine global minimiser.
import Definitions.Def_StationaryActionCore
namespace StationaryAction
/-- Martins 2025, §2.6, Maupertuis' lever. -/
theorem maupertuis_lever_equilibrium
(m₁ m₂ L : ℝ) (h₁ : 0 < m₁) (h₂ : 0 < m₂) :
IsMinOn (fun z : ℝ => m₁ * z ^ 2 + m₂ * (L - z) ^ 2) Set.univ (m₂ * L / (m₁ + m₂)) := by
sorry
end StationaryActionRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Note on the provenance of this read-back — please read before relying on it. This read-back is not blind and not independent testimony. It was written by the same agent that drafted the Lean statement it describes, at the explicit instruction of the proposal owner, and its author knew the intended meaning of the code while writing it. It therefore cannot play the role an independent auditor's read-back plays: it cannot be expected to surface a gap between what the statement was meant to say and what it actually says, because the same understanding produced both texts. No reviewer should treat it as independent corroboration of faithfulness. If independent testimony is wanted, a blind read-back by a separate auditor should be commissioned and this text replaced.
Let be real numbers with and ; is unrestricted and may be zero or negative.
The assertion is that the point is a global minimiser over all of of the function
i.e. for every real . The denominator is nonzero by the positivity hypotheses. Nothing is asserted about uniqueness of the minimiser, and the minimisation is unconstrained — the competitor points range over the whole real line, not over .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.