Proposition 4.2: martingale noise with bounded -th moments and satisfies A1 almost surely
ProvedStochApproxDyn.MartingaleNoise.robbinsMonro_A1_aeLet be a probability space with a nondecreasing sequence of sub--algebras, continuous, and a deterministic step sequence (, , ). Let , given by
be a Robbins–Monro algorithm: is -measurable and . Suppose that for some
Then assumption A1 holds with probability : for -almost every , for every ,
where .
Combined with Proposition 4.1, this shows that the interpolated process of a Robbins–Monro algorithm with bounded iterates is almost surely an asymptotic pseudotrajectory of the flow of .
Formalization Note The exceptional null set is chosen once for all (the almost-sure quantifier is outside "for all "). Both forms of A1 that the paper calls equivalent are concluded. The moment hypothesis is a uniform bound on integrals in ; it implies integrability of every , which the Robbins–Monro definition also requires. is a real number, powers are real powers of nonnegative numbers, and , are unused.
import Mathlib import Definitions.Def_StochApproxDyn_MartingaleNoise_Interpolation import Definitions.Def_StochApproxDyn_MartingaleNoise_AssumptionA1 import Definitions.Def_StochApproxDyn_MartingaleNoise_RobbinsMonro open MeasureTheory ProbabilityTheory Filter Topology open scoped ENNReal
namespace StochApproxDyn.MartingaleNoise
/-- Benaïm 1999, Proposition 4.2, p. 15: let `{x_n}` given by (7) be a Robbins–Monro algorithm.
Suppose that for some `q ≥ 2`, `sup_n E(‖U_{n+1}‖^q) < ∞` and `∑_n γ_n^{1+q/2} < ∞`. Then
assumption A1 holds with probability 1: for `P`-almost every `ω`, the realised noise
sequence satisfies A1 for every `T > 0` (in both of its stated forms). -/
theorem robbinsMonro_A1_ae {d : ℕ} {Ω : Type*} {m0 : MeasurableSpace Ω}
(P : Measure Ω) [IsProbabilityMeasure P] (ℱ : Filtration ℕ m0)
(F : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (γ : ℕ → ℝ)
(x U : ℕ → Ω → EuclideanSpace ℝ (Fin d)) (hRM : IsRobbinsMonro P ℱ F γ x U)
(q : ℝ) (hq : 2 ≤ q)
(hmom : ∃ M : ℝ≥0∞, M < ⊤ ∧ ∀ n : ℕ, ∫⁻ ω, ‖U (n + 1) ω‖ₑ ^ q ∂P ≤ M)
(hsum : Summable (fun n : ℕ => γ (n + 1) ^ (1 + q / 2))) :
∀ᵐ ω ∂P, IsA1 γ (fun n => U n ω) ∧ IsA1Delta γ (fun n => U n ω) := by sorry
end StochApproxDyn.MartingaleNoise
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.