Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Existence and first-order expansion of the needle-perturbed trajectory

Proved
BertsekasDP.needle_perturbed_trajectory_exists

by davidnet · Sep 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

optimal-controlpontryaginvariational-calculus

Consider the fixed-horizon control system x˙=f(x,u)\dot x = f(x,u)x˙=f(x,u) of BertsekasCTModel with continuously differentiable dynamics fff, and let (u,x)(u,x)(u,x) be an admissible pair on [0,T][0,T][0,T] starting from x(0)=x0x(0)=x_0x(0)=x0​: the control takes values in UUU, has bounded image and is continuous off a finite set, and the state is continuous and solves the state equation off a finite set.

Fix an interior time τ∈(0,T)\tau\in(0,T)τ∈(0,T) at which uuu is continuous, and a value v∈Uv\in Uv∈U. For ε>0\varepsilon>0ε>0 let

uε(s)={v,s∈(τ−ε,τ],u(s),otherwise,u_\varepsilon(s)=\begin{cases} v, & s\in(\tau-\varepsilon,\tau],\\ u(s), & \text{otherwise,}\end{cases}uε​(s)={v,u(s),​s∈(τ−ε,τ],otherwise,​

be the needle (spike) variation of uuu of width ε\varepsilonε ending at τ\tauτ.

The assertion is that the perturbed control admits an admissible trajectory for all sufficiently small ε>0\varepsilon>0ε>0, together with the two quantitative properties that the needle construction is meant to supply. There exist a family ε↦xε\varepsilon\mapsto x_\varepsilonε↦xε​ of state trajectories and a constant KKK such that, for all small ε>0\varepsilon>0ε>0:

  1. the pair (uε,xε)(u_\varepsilon,x_\varepsilon)(uε​,xε​) is admissible on [0,T][0,T][0,T] with xε(0)=x0x_\varepsilon(0)=x_0xε​(0)=x0​;
  2. the perturbation is causal: xε(s)=x(s)x_\varepsilon(s)=x(s)xε​(s)=x(s) for every s∈[0,τ−ε]s\in[0,\tau-\varepsilon]s∈[0,τ−ε];
  3. the trajectory stays within O(ε)O(\varepsilon)O(ε) of the base state on the needle window: ∥xε(s)−x(τ)∥≤Kε\lVert x_\varepsilon(s)-x(\tau)\rVert\le K\varepsilon∥xε​(s)−x(τ)∥≤Kε for every s∈[τ−ε,τ]s\in[\tau-\varepsilon,\tau]s∈[τ−ε,τ];

and moreover the state deviation created by the needle has the first-order expansion

lim⁡ε↓0xε(τ)−x(τ)ε=f(x(τ),v)−f(x(τ),u(τ)).\lim_{\varepsilon\downarrow 0}\frac{x_\varepsilon(\tau)-x(\tau)}{\varepsilon}=f(x(\tau),v)-f(x(\tau),u(\tau)).ε↓0lim​εxε​(τ)−x(τ)​=f(x(τ),v)−f(x(τ),u(τ)).

No global Lipschitz hypothesis is imposed: fff is only assumed C1C^1C1, so solutions must be produced on a compact tube around the base trajectory. Continuity of uuu at τ\tauτ is what makes the limit equal to the value f(x(τ),u(τ))f(x(\tau),u(\tau))f(x(τ),u(τ)) at the single time τ\tauτ.

Preamble
import Definitions.Def_BertsekasCTModel

open Filter
open scoped Topology
Formal statement
theorem BertsekasDP.needle_perturbed_trajectory_exists
    {n m : ℕ} (M : BertsekasCTModel n m)
    (hf : ContDiff ℝ 1 (Function.uncurry M.f))
    (u : ℝ → EuclideanSpace ℝ (Fin m))
    (x : ℝ → EuclideanSpace ℝ (Fin n))
    (hadm : BertsekasCTAdmissibleFrom M 0 M.x0 u x)
    (τ : ℝ) (hτ : τ ∈ Set.Ioo 0 M.T) (huτ : ContinuousAt u τ)
    (v : EuclideanSpace ℝ (Fin m)) (hv : v ∈ M.U) :
    ∃ (xε : ℝ → ℝ → EuclideanSpace ℝ (Fin n)) (K : ℝ),
      (∀ᶠ ε in 𝓝[>] (0 : ℝ),
        BertsekasCTAdmissibleFrom M 0 M.x0
            (fun s => if s ∈ Set.Ioc (τ - ε) τ then v else u s) (xε ε) ∧
          (∀ s ∈ Set.Icc 0 (τ - ε), xε ε s = x s) ∧
          (∀ s ∈ Set.Icc (τ - ε) τ, ‖xε ε s - x τ‖ ≤ K * ε)) ∧
      Tendsto (fun ε => ε⁻¹ • (xε ε τ - x τ)) (𝓝[>] (0 : ℝ))
        (𝓝 (M.f (x τ) v - M.f (x τ) (u τ))) := by
  sorry
Source
D. Liberzon, Calculus of Variations and Optimal Control Theory, Sections 4.2.3-4.2.4, equations (4.14)-(4.23), https://liberzon.csl.illinois.edu/teaching/cvoc/node68.html and https://liberzon.csl.illinois.edu/teaching/cvoc/node69.html; adjoint pairing identity (4.32), Section 4.2.8; terminal costs, Section 4.3.1.3, https://liberzon.csl.illinois.edu/teaching/cvoc/node82.html. Fixed-horizon Bolza specialization adapted to the finite-exception admissibility class of BertsekasCTModel (D. Bertsekas, Dynamic Programming and Optimal Control, Vol. I, 3rd ed., Sections 3.2-3.3.1).

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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me