Lemma 2.3 — representation (2.4), right-continuity, jumps (2.5), and stays in
ProvedImpulseGames.Verification.lemma2_3_controlled_processLet , let be strategies for , and let be a realization of the construction of Definition 2.2, with controlled process , exit time , number of steps , intervention times , impulses and pre-intervention states . Then for every :
- Representation (2.4). For every and every with, when , :
- Continuity. is right-continuous on , and continuous at every that is not an intervention time .
- Jumps (2.5). For every and with :
and, if no other intervention follows at the same instant, . 4. No exit. for every 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 ; when player 2 acts immediately after player 1 has moved the state deep outside , or at time 0 when , that state is outside ; what holds and what the proof of Theorem 3.3 uses is . (b) holds only when no further simultaneous intervention follows, since otherwise at that instant is the state after the last one; the condition is . (c) "Never exits" holds at times that are not intervention times and : at with , or right after a jump onto , is possible. (d) "Discontinuous at " means "may jump" ( is allowed) and is not stated; the jump relation is (2.5). (e) Continuity statements are restricted to ; on , after is the paper's convention 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).
import Mathlib import Definitions.Def_ImpulseGames_Verification_Game open MeasureTheory ProbabilityTheory Filter Topology open scoped ENNReal NNReal
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.