Eq. (51): a.s. for a weak asymptotic pseudotrajectory
ProvedStochApproxDyn.WeakAPT.conditional_drift_eq51dynamical-systemsmartingalesp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-approximation
Let be a probability space with a filtration , let be a separable metric space with its Borel -algebra, let be a semiflow on , and let be a weak asymptotic pseudotrajectory of . Let be uniformly continuous, let , and let for and or . Then, almost surely,
Since , this says that, conditionally on the past, the process over the next window is on average indistinguishable from the image under of the process over the current window. This is the step of the proof of Theorem 10.1 where the weak asymptotic pseudotrajectory property enters.
Formalization Note Conditional expectations are Mathlib's condExp. The value at is irrelevant for the limit.
Preamble
import Mathlib import Definitions.Def_StochApproxDyn_WeakAPT_WeakAsymptoticPseudotrajectory import Definitions.Def_StochApproxDyn_WeakAPT_BlockIntegral
Formal statement
namespace StochApproxDyn.WeakAPT
open MeasureTheory Filter Topology
open scoped NNReal
/-- Benaïm (1999), §10, proof of Theorem 10.1, Eq. (51), p. 62: if `X` is a weak asymptotic
pseudotrajectory of `Φ`, `f : M → [0, 1]` is uniformly continuous and `T > 0`, then almost surely
`E(U_{i+1}(f,T) - U_i(f ∘ Φ_T, T) | 𝓕_{(i-1)T}) → 0` as `i → ∞`. -/
theorem conditional_drift_eq51
{Ω M : Type*} {m0 : MeasurableSpace Ω} [MetricSpace M] [TopologicalSpace.SeparableSpace M]
[MeasurableSpace M] [BorelSpace M]
(P : Measure Ω) [IsProbabilityMeasure P] (ℱ : Filtration ℝ≥0 m0)
(Φ : Flow ℝ≥0 M) (X : ℝ≥0 → Ω → M)
(hX : IsWeakAsymptoticPseudotrajectory P ℱ Φ X)
(f : M → ℝ) (hf : UniformContinuous f) (hf01 : ∀ y, f y ∈ Set.Icc (0 : ℝ) 1)
(T : ℝ≥0) (hT : 0 < T) :
∀ᵐ ω ∂P, Tendsto
(fun i : ℕ => (P[blockIntegral X f T (i + 1) - blockIntegral X (f ∘ Φ T) T i |
ℱ (((i - 1 : ℕ) : ℝ≥0) * T)]) ω)
atTop (𝓝 0) := by sorry
end StochApproxDyn.WeakAPT
Source
Benaïm, Dynamics of Stochastic Approximation Algorithms, Séminaire de Probabilités XXXIII, LNM 1709 (1999), DOI 10.1007/BFb0096509, Section 10, proof of Theorem 10.1, p. 62 (PDF p. 63), Eq. (51)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.