LEMMA — a sequence satisfying (5), (6), (7) tends to 0 at a rate depending only on a, b, c
ProvedVectorPayoffs.Convex.blackwell_lemmaLet and . There is an integer , depending only on , such that for every probability space and every sequence of measurable real random variables satisfying conditions (5), (6) and (7),
Here (5) is whenever (), (6) is (), and (7) is ().
This is the probabilistic core of THEOREM 1: once the squared distance of the average payoff from is shown to satisfy (5)–(7) with constants independent of the opponent's strategy, the uniform rate yields approachability.
Formalization Note The order of quantifiers is the paper's "an depending only on such that for any ": is chosen before the probability space (any space in Type) and the sequence. Conditions (6) and (7) are assumed only almost surely, which makes the statement stronger than a pointwise reading.
import Mathlib import Definitions.Def_VectorPayoffs_Convex_Recursion open MeasureTheory
namespace VectorPayoffs.Convex
/-- Blackwell (1956), §2, p. 4, LEMMA: a sequence satisfying (5), (6), (7) tends to `0` with
probability `1` at a rate depending only on `a, b, c`: `N₀` is chosen before the probability
space and the sequence. -/
theorem blackwell_lemma (a b c ε : ℝ) (hε : 0 < ε) :
∃ N₀ : ℕ, ∀ (Ω : Type) [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ]
(δ : ℕ → Ω → ℝ), (∀ n, 1 ≤ n → Measurable (δ n)) → SatisfiesRecursion a b c μ δ →
(μ {ω | ∃ n, N₀ ≤ n ∧ 1 ≤ n ∧ ε ≤ δ n ω}).toReal < ε := by sorry
end VectorPayoffs.Convex
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.