Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.3 — representation (2.4), right-continuity, jumps (2.5), and XXX stays in C1∩C2\mathcal C_1\cap\mathcal C_2C1​∩C2​

Proved
ImpulseGames.Verification.lemma2_3_controlled_process

by mikedeng1 · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

impulse-controlp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-differential-games

Let x∈Sx\in Sx∈S, let φi=(Ci,ξi)\varphi_i=(\mathcal C_i,\xi_i)φi​=(Ci​,ξi​) be strategies for i∈{1,2}i\in\{1,2\}i∈{1,2}, and let {Yτ~k,xk}k\{Y^{\tilde\tau_k,x_k}\}_k{Yτ~k​,xk​}k​ be a realization of the construction of Definition 2.2, with controlled process XXX, exit time τS\tau_SτS​, number of steps kˉ\bar kkˉ, intervention times τi,n\tau_{i,n}τi,n​, impulses δi,n\delta_{i,n}δi,n​ and pre-intervention states X(τi,n)−X_{(\tau_{i,n})^-}X(τi,n​)−​. Then for every ω\omegaω:

  1. Representation (2.4). For every k≤kˉk\le\bar kk≤kˉ and every s≥τ~ks\ge\tilde\tau_ks≥τ~k​ with, when k<kˉk<\bar kk<kˉ, s<τ~k+1s<\tilde\tau_{k+1}s<τ~k+1​:
Xs=Ysτ~k,xk.X_s=Y^{\tilde\tau_k,x_k}_s .Xs​=Ysτ~k​,xk​​.
  1. Continuity. XXX is right-continuous on [0,τS)[0,\tau_S)[0,τS​), and continuous at every s<τSs<\tau_Ss<τS​ that is not an intervention time τi,n<τS\tau_{i,n}<\tau_Sτi,n​<τS​.
  2. Jumps (2.5). For every iii and n≥1n\ge1n≥1 with τi,n<τS\tau_{i,n}<\tau_Sτi,n​<τS​:
δi,n=ξi(X(τi,n)−),X(τi,n)−∉Ci,\delta_{i,n}=\xi_i\big(X_{(\tau_{i,n})^-}\big),\qquad X_{(\tau_{i,n})^-}\notin\mathcal C_i,δi,n​=ξi​(X(τi,n​)−​),X(τi,n​)−​∈/Ci​,

and, if no other intervention follows at the same instant, Xτi,n=Γi(X(τi,n)−,δi,n)X_{\tau_{i,n}}=\Gamma^i\big(X_{(\tau_{i,n})^-},\delta_{i,n}\big)Xτi,n​​=Γi(X(τi,n​)−​,δi,n​). 4. No exit. Xs∈C1∩C2X_s\in\mathcal C_1\cap\mathcal C_2Xs​∈C1​∩C2​ for every s∈ ]0,τS[s\in\,]0,\tau_S[s∈]0,τS​[ that is not an intervention time.

This lemma makes precise the informal rules (2.2): each player intervenes exactly when the state leaves her continuation set. It gives the properties (3.8) used in the proof of the verification theorem.

Formalization Note. Several clauses of the printed lemma fail at simultaneous or boundary interventions, which the paper allows (Remark 2.8), and are stated here in corrected form. (a) The page has X(τi,k)−∈∂CiX_{(\tau_{i,k})^-}\in\partial\mathcal C_iX(τi,k​)−​∈∂Ci​; when player 2 acts immediately after player 1 has moved the state deep outside C2\mathcal C_2C2​, or at time 0 when x∉Cˉix\notin\bar{\mathcal C}_ix∈/Cˉi​, that state is outside Cˉi\bar{\mathcal C}_iCˉi​; what holds and what the proof of Theorem 3.3 uses is ∉Ci\notin\mathcal C_i∈/Ci​. (b) Xτi,k=Γi(⋅)X_{\tau_{i,k}}=\Gamma^i(\cdot)Xτi,k​​=Γi(⋅) holds only when no further simultaneous intervention follows, since otherwise XXX at that instant is the state after the last one; the condition is τ~η(i,n)<τ~η(i,n)+1\tilde\tau_{\eta(i,n)}<\tilde\tau_{\eta(i,n)+1}τ~η(i,n)​<τ~η(i,n)+1​. (c) "Never exits" holds at times that are not intervention times and s>0s>0s>0: at s=0s=0s=0 with x∈∂Cix\in\partial\mathcal C_ix∈∂Ci​, or right after a jump onto ∂Ci\partial\mathcal C_i∂Ci​, Xs∉CiX_s\notin\mathcal C_iXs​∈/Ci​ is possible. (d) "Discontinuous at τi,k\tau_{i,k}τi,k​" means "may jump" (Γi(y,δ)=y\Gamma^i(y,\delta)=yΓi(y,δ)=y is allowed) and is not stated; the jump relation is (2.5). (e) Continuity statements are restricted to [0,τS)[0,\tau_S)[0,τS​); on {kˉ=∞}\{\bar k=\infty\}{kˉ=∞}, XXX after τS\tau_SτS​ is the paper's convention lim⁡kX~k\lim_k\tilde X^klimk​X~k and is not used. "Satisfies Equation (2.1) between jumps" is the representation (2.4) combined with the fact that each piece solves (2.1).

Preamble
import Mathlib
import Definitions.Def_ImpulseGames_Verification_Game

open MeasureTheory ProbabilityTheory Filter Topology
open scoped ENNReal NNReal
Formal statement
namespace ImpulseGames.Verification

/-- Lemma 2.3 (properties of the controlled process), pathwise for every realization:
(2.4) the representation through the diffusion pieces; right-continuity before `τ_S` and
continuity off the intervention times; (2.5) at the `n`-th intervention of player `i` the
impulse is `ξ_i` of the pre-intervention state, that state lies outside `C_i`, and, when no
further intervention happens at the same instant, `X_{τ_{i,n}} = Γ_i(X_{(τ_{i,n})^-}, δ_{i,n})`;
and `X` stays in `C_1 ∩ C_2` at all times of `]0, τ_S[` that are not intervention times. -/
theorem lemma2_3_controlled_process {d k : ℕ} {Ω : Type*} [m : MeasurableSpace Ω]
    (P : Measure Ω) (𝔽 : Filtration ℝ≥0 m) (W : ℝ≥0 → Ω → (Fin k → ℝ))
    (hW : IsBrownianBasis P 𝔽 W) (G : Game d k) (hG : G.Standing)
    (x : State d) (hx : x ∈ G.S) (π : Profile G) (hπ : ∀ i, IsStrategy G i (π.C i) (π.ξ i))
    (Y : ℕ → ℝ≥0 → Ω → State d) (hY : IsRealization P 𝔽 W G x π Y) (ω : Ω) :
    -- (2.4)
    (∀ (n : ℕ) (s : ℝ≥0), (n : ℕ∞) ≤ kbar G x π (pathOf Y ω) →
      (stage G x π (pathOf Y ω) n).time ≤ (s : ℝ≥0∞) →
      ((n : ℕ∞) < kbar G x π (pathOf Y ω) →
        (s : ℝ≥0∞) < (stage G x π (pathOf Y ω) (n + 1)).time) →
      ctrl G x π (pathOf Y ω) s = Y n s ω) ∧
    -- right-continuity, and continuity off the intervention times
    (∀ s : ℝ≥0, (s : ℝ≥0∞) < exitTime G x π (pathOf Y ω) →
      ContinuousWithinAt (ctrl G x π (pathOf Y ω)) (Set.Ici s) s) ∧
    (∀ s : ℝ≥0, (s : ℝ≥0∞) < exitTime G x π (pathOf Y ω) →
      (s : ℝ≥0∞) ∉ interventionTimes G x π (pathOf Y ω) →
      ContinuousAt (ctrl G x π (pathOf Y ω)) s) ∧
    -- (2.5)
    (∀ (i : Player) (n : ℕ), 1 ≤ n →
      interTime G x π (pathOf Y ω) i n < exitTime G x π (pathOf Y ω) →
      impulse G x π (pathOf Y ω) i n = π.ξ i (preState G x π (pathOf Y ω) i n) ∧
      preState G x π (pathOf Y ω) i n ∉ π.C i ∧
      ((stage G x π (pathOf Y ω) (eta G x π (pathOf Y ω) i n)).time <
          (stage G x π (pathOf Y ω) (eta G x π (pathOf Y ω) i n + 1)).time →
        ctrl G x π (pathOf Y ω) (interTime G x π (pathOf Y ω) i n).toNNReal =
          G.Γ i (preState G x π (pathOf Y ω) i n) (impulse G x π (pathOf Y ω) i n))) ∧
    -- X never exits C₁ ∩ C₂
    (∀ s : ℝ≥0, 0 < s → (s : ℝ≥0∞) < exitTime G x π (pathOf Y ω) →
      (s : ℝ≥0∞) ∉ interventionTimes G x π (pathOf Y ω) →
      ctrl G x π (pathOf Y ω) s ∈ π.C .one ∩ π.C .two) := by sorry

end ImpulseGames.Verification
Source
Aïd et al. (2020), Math. Oper. Res. 45(1), accepted manuscript, Lemma 2.3 (p. 5)
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 4, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me