Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 3.3 — Uniform Lipschitz bounds for the Hamiltonian and optimizer

Proved
FiniteStateContract.Equivalence.lemma_3_3

by Shuze Chen · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

contract-theoryfinite-statemean-field-gamesp2o-gran-per-chapterp2o-plan-paperp2o-v1

Under the §2 setting and Assumptions 2.1 and 3.1, there is one constant C>0C>0C>0 such that for every path ω\omegaω, time t∈(0,T]t\in(0,T]t∈(0,T], reward argument R∈RR\in\mathbb RR∈R, distribution p∈Sp\in\mathcal Sp∈S, and vectors z,z′∈Rmz,z'\in\mathbb R^mz,z′∈Rm,

∣H^(t,Xt−,z,p,R)−H^(t,Xt−,z′,p,R)∣≤C∥z−z′∥Xt−,|\hat H(t,X_{t-},z,p,R)-\hat H(t,X_{t-},z',p,R)|\le C\|z-z'\|_{X_{t-}},∣H^(t,Xt−​,z,p,R)−H^(t,Xt−​,z′,p,R)∣≤C∥z−z′∥Xt−​​, ∥a^(t,Xt−,z,p)−a^(t,Xt−,z′,p)∥≤C∥z−z′∥Xt−.\|\hat a(t,X_{t-},z,p)-\hat a(t,X_{t-},z',p)\|\le C\|z-z'\|_{X_{t-}}.∥a^(t,Xt−​,z,p)−a^(t,Xt−​,z′,p)∥≤C∥z−z′∥Xt−​​.

The same positive constant works in both estimates, uniformly over all the displayed variables. It may depend on the model data. The action norm is the Euclidean norm for arbitrary dimension lll.

Differences from the source:

  • encoding: basis-vector states and paths on [0,T] → Fin m labels and nonnegative real time, with canonical paths frozen after T; reason: the published path space is in bijection with the source space; the initial simplex vector excludes m=0 and retains m=1
  • reading: the right side of (15) is written with a hat → evaluate the unminimized Hamiltonian H at its unique minimizer; reason: the printed argument count and preceding sentence uniquely identify H; recorded in insight I4
Preamble
import Definitions.Def_FiniteStateContract_Equivalence_Model

open MeasureTheory
open scoped NNReal
Formal statement
namespace FiniteStateContract.Equivalence

open ExtFSMFG.Existence (Omega Xm seminormE)

theorem lemma_3_3 {m l : ℕ} {T : ℝ≥0} (D : Data m l T) (a : Feedback m l)
    (hS : Setting D) (h21 : Assumption21 D) (h31 : Assumption31 D a) :
    ∃ C : ℝ, 0 < C ∧ ∀ (ω : Omega m T) (t : ℝ≥0), 0 < t → t ≤ T →
      ∀ (R : ℝ) (p : stdSimplex ℝ (Fin m)) (z z' : Vec m),
        |Hhat D a t (Xm t ω) z p R - Hhat D a t (Xm t ω) z' p R| ≤
          C * seminormE (Xm t ω) (z - z') ∧
        ‖a t (Xm t ω) z p - a t (Xm t ω) z' p‖ ≤
          C * seminormE (Xm t ω) (z - z') := by sorry

end FiniteStateContract.Equivalence
Source
Carmona and Wang, Finite-State Contract Theory with a Principal and a Field of Agents, held PDF arXiv:1808.07942v1 (23 Aug 2018), Lemma 3.3, PDF p. 6 = printed p. 6; catalog DOI 10.1287/mnsc.2020.3760 (metadata basis published).
Human review
  • Endorsed by Community (Bot) · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 30, 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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me