Prove2Me
Navigate
MissionsFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Pontryagin minimum principle

Open
VectorSpaceOpt.pontryagin_minimum_principle

by wenxinzhang · Aug 25, 2026 · Mathlib c5ea003 (Lean v4.30.0)

almost-everywherecostateminimum-principlepontryaginsource-erratum

Fix a positive-length interval, continuously state-differentiable dynamics FFF and running cost ℓ\ellℓ, continuous state derivatives, interval integrability of those derivative coefficients along the optimal path, an a.e. norm bound for the optimal control, and a uniform Lipschitz bound for the dynamics. If (x0,u0)(x₀,u₀)(x0​,u0​) is an optimal admissible state-control pair, then there exists an absolutely continuous costate λ\lambdaλ with λ(t1)=0\lambda (t₁) = 0λ(t1​)=0. Its adjoint equation holds almost everywhere in weak inner-product form, and almost everywhere

H(x0(t),u0(t),λ(t))≤H(x0(t),v,λ(t))∀v∈Ω.H(x₀(t),u₀(t),λ(t)) ≤ H(x₀(t),v,λ(t)) \quad ∀v∈Ω.H(x0​(t),u0​(t),λ(t))≤H(x0​(t),v,λ(t))∀v∈Ω.

The a.e. qualifier is a deliberate correction to the book's false all-times wording for piecewise-continuous controls. The statement includes measurable controls, absolutely continuous states and costate, and joint continuity and interval integrability of the state derivatives needed along the optimal path. The explicit a.e. control bound restores the compact-interval boundedness inherited from the source piecewise-continuous model and supplies local domination for state perturbations.

Preamble
import Definitions.Def_VectorSpaceOpt_optimal_control

open Set MeasureTheory
open scoped RealInnerProductSpace
Formal statement
namespace VectorSpaceOpt

/-- Luenberger, Chapter 9, §9.6, Theorem 1, repaired from `∀ t` to an a.e. conclusion. -/
theorem pontryagin_minimum_principle
    {n m : ℕ} (t₀ t₁ : ℝ) (ht : t₀ < t₁)
    (F : OCState n → OCControl m → OCState n)
    (ell : OCState n → OCControl m → ℝ)
    (Fx : OCState n → OCControl m → (OCState n →L[ℝ] OCState n))
    (ellx : OCState n → OCControl m → (OCState n →L[ℝ] ℝ))
    (Omega : Set (OCControl m)) (xInit : OCState n)
    (u₀ : ℝ → OCControl m) (x₀ : ℝ → OCState n)
    (hFx : ∀ x u, HasFDerivAt (fun y => F y u) (Fx x u) x)
    (hellx : ∀ x u, HasFDerivAt (fun y => ell y u) (ellx x u) x)
    (hFCont : Continuous (Function.uncurry F))
    (hellCont : Continuous (Function.uncurry ell))
    (hFxCont : Continuous (Function.uncurry Fx))
    (hellxCont : Continuous (Function.uncurry ellx))
    (hFxPathInt : IntervalIntegrable (fun t => Fx (x₀ t) (u₀ t)) volume t₀ t₁)
    (hellxPathInt : IntervalIntegrable (fun t => ellx (x₀ t) (u₀ t)) volume t₀ t₁)
    (hu₀Bound : ∃ C : ℝ, ∀ᵐ t ∂volume.restrict (Icc t₀ t₁), ‖u₀ t‖ ≤ C)
    (hLip : ∃ M : ℝ, 0 ≤ M ∧ ∀ x y u v,
      ‖F x u - F y v‖ ≤ M * (‖x - y‖ + ‖u - v‖))
    (hopt : IsOptimalControlPair t₀ t₁ F Omega xInit ell u₀ x₀) :
    ∃ lambda : ℝ → OCState n,
      lambda t₁ = 0 ∧
      AbsolutelyContinuousOnInterval lambda t₀ t₁ ∧
      (∀ᵐ t ∂volume.restrict (Ioo t₀ t₁),
        ∃ dlambda : OCState n, HasDerivAt lambda dlambda t ∧
          ∀ h : OCState n,
            ⟪-dlambda, h⟫ =
              ⟪lambda t, Fx (x₀ t) (u₀ t) h⟫ + ellx (x₀ t) (u₀ t) h) ∧
      (∀ᵐ t ∂volume.restrict (Icc t₀ t₁),
        ∀ v : OCControl m, v ∈ Omega →
          controlHamiltonian F ell (x₀ t) (u₀ t) (lambda t) ≤
            controlHamiltonian F ell (x₀ t) v (lambda t)) := by
  sorry

end VectorSpaceOpt
Source
David G. Luenberger, Optimization by Vector Space Methods (Wiley, 1969), Chapter 9, §9.6, Theorem 1, printed pp. 263–264 (physical PDF pp. 281–282), with the Hamiltonian quantifier repaired from every time to almost every time. Scan: https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf
Read-back

What the Lean code literally says, in plain math · gpt-5

For every pair of natural numbers n,mn,mn,m (including 000), let the state and control spaces be the real Euclidean spaces Rnℝ^nRn and Rmℝ^mRm. Fix real numbers t0<t1t₀<t₁t0​<t1​; maps F:Rn→Rm→RnF:ℝ^n→ℝ^m→ℝ^nF:Rn→Rm→Rn and ℓ:Rn→Rm→Rℓ:ℝ^n→ℝ^m→ℝℓ:Rn→Rm→R; proposed state derivatives Fx(x,u):Rn→LRnFₓ(x,u):ℝ^n→Lℝ^nFx​(x,u):Rn→LRn and ℓx(x,u):Rn→LRℓₓ(x,u):ℝ^n→Lℝℓx​(x,u):Rn→LR; an arbitrary set Ω⊆RmΩ⊆ℝ^mΩ⊆Rm; an initial state xInit∈Rnx_{\mathrm{Init}}∈ℝ^nxInit​∈Rn; and total paths u0:R→Rmu₀:ℝ→ℝ^mu0​:R→Rm and x0:R→Rnx₀:ℝ→ℝ^nx0​:R→Rn. Assume, for every state xxx and control uuu, that Fx(x,u)Fₓ(x,u)Fx​(x,u) is the Fréchet derivative at xxx of y↦F(y,u)y↦F(y,u)y↦F(y,u) and ℓx(x,u)ℓₓ(x,u)ℓx​(x,u) is the Fréchet derivative at xxx of y↦ℓ(y,u)y↦ℓ(y,u)y↦ℓ(y,u); assume that the four jointly curried maps (x,u)↦F(x,u)(x,u)↦F(x,u)(x,u)↦F(x,u), (x,u)↦ℓ(x,u)(x,u)↦ℓ(x,u)(x,u)↦ℓ(x,u), (x,u)↦Fx(x,u)(x,u)↦Fₓ(x,u)(x,u)↦Fx​(x,u), and (x,u)↦ℓx(x,u)(x,u)↦ℓₓ(x,u)(x,u)↦ℓx​(x,u) are continuous; and assume that t↦Fx(x0(t),u0(t))t↦Fₓ(x₀(t),u₀(t))t↦Fx​(x0​(t),u0​(t)) and t↦ℓx(x0(t),u0(t))t↦ℓₓ(x₀(t),u₀(t))t↦ℓx​(x0​(t),u0​(t)) are interval-integrable with respect to Lebesgue volume from t0t₀t0​ to t1t₁t1​. Assume also that there is a real constant CCC, with no separately stated condition C≥0C≥0C≥0, such that ‖u0(t)‖≤C‖u₀(t)‖≤C‖u0​(t)‖≤C for Lebesgue-almost every ttt in the closed interval [t0,t1][t₀,t₁][t0​,t1​], and that there is a real M≥0M≥0M≥0 such that, for all states x,yx,yx,y and controls u,vu,vu,v, ‖F(x,u)−F(y,v)‖≤M(‖x−y‖+‖u−v‖)‖F(x,u)-F(y,v)‖≤M(‖x-y‖+‖u-v‖)‖F(x,u)−F(y,v)‖≤M(‖x−y‖+‖u−v‖). Finally assume that (u0,x0)(u₀,x₀)(u0​,x0​) is globally optimal in the following fully specified sense: x0(t0)=xInitx₀(t₀)=x_{\mathrm{Init}}x0​(t0​)=xInit​; x0x₀x0​ is absolutely continuous on [t0,t1][t₀,t₁][t0​,t1​]; u0u₀u0​ is strongly measurable modulo a null set for Lebesgue measure restricted to [t0,t1][t₀,t₁][t0​,t1​]; u0(t)∈Ωu₀(t)∈Ωu0​(t)∈Ω for almost every such ttt; x0x₀x0​ is differentiable with x0′(t)=F(x0(t),u0(t))x₀'(t)=F(x₀(t),u₀(t))x0′​(t)=F(x0​(t),u0​(t)) for almost every t∈(t0,t1)t∈(t₀,t₁)t∈(t0​,t1​); t↦ℓ(x0(t),u0(t))t↦ℓ(x₀(t),u₀(t))t↦ℓ(x0​(t),u0​(t)) is interval-integrable; and, for every pair of total paths u:R→Rmu:ℝ→ℝ^mu:R→Rm and x:R→Rnx:ℝ→ℝ^nx:R→Rn satisfying those same admissibility conditions—namely x(t0)=xInitx(t₀)=x_{\mathrm{Init}}x(t0​)=xInit​, absolute continuity of xxx on [t0,t1][t₀,t₁][t0​,t1​], almost-everywhere strong measurability of uuu there, u(t)∈Ωu(t)∈Ωu(t)∈Ω almost everywhere there, x′(t)=F(x(t),u(t))x'(t)=F(x(t),u(t))x′(t)=F(x(t),u(t)) almost everywhere on (t0,t1)(t₀,t₁)(t0​,t1​), and interval-integrability of t↦ℓ(x(t),u(t))t↦ℓ(x(t),u(t))t↦ℓ(x(t),u(t))—one has ∫t0t1ℓ(x0(t),u0(t)) dt≤∫t0t1ℓ(x(t),u(t)) dt∫_{t₀}^{t₁}ℓ(x₀(t),u₀(t))\,dt≤∫_{t₀}^{t₁}ℓ(x(t),u(t))\,dt∫t0​t1​​ℓ(x0​(t),u0​(t))dt≤∫t0​t1​​ℓ(x(t),u(t))dt. Then there exists a total path λ:R→Rnλ:ℝ→ℝ^nλ:R→Rn such that λ(t1)=0λ(t₁)=0λ(t1​)=0, λλλ is absolutely continuous on [t0,t1][t₀,t₁][t0​,t1​], and, for Lebesgue-almost every t∈(t0,t1)t∈(t₀,t₁)t∈(t0​,t1​), there exists a vector dλ∈Rndλ∈ℝ^ndλ∈Rn for which λλλ is differentiable at ttt with derivative dλdλdλ and, for every h∈Rnh∈ℝ^nh∈Rn, ⟨−dλ,h⟩=⟨λ(t),Fx(x0(t),u0(t))(h)⟩+ℓx(x0(t),u0(t))(h)⟨-dλ,h⟩=⟨λ(t),Fₓ(x₀(t),u₀(t))(h)⟩+ℓₓ(x₀(t),u₀(t))(h)⟨−dλ,h⟩=⟨λ(t),Fx​(x0​(t),u0​(t))(h)⟩+ℓx​(x0​(t),u0​(t))(h). Moreover, for Lebesgue-almost every t∈[t0,t1]t∈[t₀,t₁]t∈[t0​,t1​] and every v∈Ωv∈Ωv∈Ω, H(x0(t),u0(t),λ(t))≤H(x0(t),v,λ(t))H(x₀(t),u₀(t),λ(t))≤H(x₀(t),v,λ(t))H(x0​(t),u0​(t),λ(t))≤H(x0​(t),v,λ(t)), where H(x,u,λ)=⟨λ,F(x,u)⟩+ℓ(x,u)H(x,u,λ)=⟨λ,F(x,u)⟩+ℓ(x,u)H(x,u,λ)=⟨λ,F(x,u)⟩+ℓ(x,u). Each separately stated almost-everywhere condition may have its own exceptional null set. In particular, neither the state equation nor the adjoint identity is asserted at an endpoint, and the control bound, membership in ΩΩΩ, and Hamiltonian comparison are phrased over the closed interval only almost everywhere, so they need not hold at either singleton endpoint; the exact endpoint assertions are x0(t0)=xInitx₀(t₀)=x_{\mathrm{Init}}x0​(t0​)=xInit​ and λ(t1)=0λ(t₁)=0λ(t1​)=0. No uniqueness or nonzero condition is imposed on λλλ, and the theorem imposes no conditions on the paths outside the interval beyond their being total functions. Although ΩΩΩ is formally arbitrary, if Ω=∅Ω=∅Ω=∅ then the optimal-pair hypothesis is unsatisfiable on the positive-length interval, so that instance is vacuous. The zero-dimensional state and control cases remain included.

Human review
  • Endorsed by Shuze Chen · Aug 26, 2026

  • Endorsed by wenxinzhang · Aug 26, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me