Euler–Lagrange equation from a computed first variation
ProvedVectorSpaceOpt.euler_lagrange_equationcalculus-of-variationseuler-lagrangeinterval-integraloptimization
Let , let be a real Lagrangian, and let be a path. Let and be continuous along the path and equal the indicated partial derivatives of . Assume the already computed first variation vanishes for every fixed-endpoint variation:
Then, for every interior time,
The Lean conclusion uses HasDerivAt, so it establishes differentiability as well as equality. This is the mission capstone and deliberately starts at the first-variation identity displayed by Luenberger. It is ready for concrete Lagrangians without changing the shared variation infrastructure.
Preamble
import Definitions.Def_VectorSpaceOpt_isC1OnSegment open Set intervalIntegral
Formal statement
namespace VectorSpaceOpt
/-- Luenberger, Chapter 7, §7.5, equation (2) and its conclusion. -/
theorem euler_lagrange_equation
(a b : ℝ) (hab : a < b)
(L : ℝ → ℝ → ℝ → ℝ) (x dx Lx Lv : ℝ → ℝ)
(hx : IsC1OnSegment a b x dx)
(hLx_cont : ContinuousOn Lx (Icc a b))
(hLv_cont : ContinuousOn Lv (Icc a b))
(hLx : ∀ t ∈ Icc a b,
HasDerivAt (fun y : ℝ ↦ L y (dx t) t) (Lx t) (x t))
(hLv : ∀ t ∈ Icc a b,
HasDerivAt (fun v : ℝ ↦ L (x t) v t) (Lv t) (dx t))
(hstationary : ∀ (h dh : ℝ → ℝ),
IsC1OnSegment a b h dh → h a = 0 → h b = 0 →
(∫ t in a..b, (Lx t * h t + Lv t * dh t)) = 0) :
∀ t ∈ Ioo a b, HasDerivAt Lv (Lx t) t := by sorry
end VectorSpaceOptSource
David G. Luenberger, Optimization by Vector Space Methods, Wiley, 1969, public scan https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf, Chapter 7, §7.5, first-variation equation (1), printed p. 179, and Euler–Lagrange equation (2) with conclusion, printed pp. 180–181; physical PDF pp. 199–201.