(4.16), proof of Theorem 4.2, p. 541 — E|V^{(i,j)} − EV^{(i,j)}| ≤ [Var V^{(i,j)}]^{1/2} ≤ λ^{1/2}[m + 1 + 2(nφ(m + 1))^{1/2}]
ProvedPoissonDepTrials.MixInv.bound_4_16Let be Bernoulli random variables on a probability space , with , padded by for and . Write and . Assume Ibragimov's mixing condition (4.1): there is a non-increasing sequence such that for all and every event , almost surely, where . For and indices let . Then
The first inequality is Jensen's; the second is Lemma 4.4 for the subsequence obtained by omitting the trials near and , which again satisfies (4.1), with .
Formalization Note The trials are with IsBernoulliTrials (measurable, zero outside , at most almost surely); is the definition prob, so it cannot disagree with . Constant padding variables generate the trivial -algebra, so (4.1) for the padded sequence is (4.1) for . Double sums over are computed in . is min (1 / Real.sqrt λ) 1 and is Real.sqrt (n * φ (m + 1)).
import Mathlib import Definitions.Def_PoissonDepTrials_MixInv_Setting open MeasureTheory ProbabilityTheory
namespace PoissonDepTrials.MixInv
theorem bound_4_16 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
(n : ℕ) (X : ℕ → Ω → ℕ) (hX : IsBernoulliTrials P n X) (φ : ℕ → ℝ) (hφ : IbragimovMixing P X φ) (m : ℕ) (i j : ℕ) :
∫ ω, |(Vij n m X i j ω : ℝ) - ∫ ω', (Vij n m X i j ω' : ℝ) ∂P| ∂P
≤ Real.sqrt (Var[fun ω => (Vij n m X i j ω : ℝ); P]) ∧
Real.sqrt (Var[fun ω => (Vij n m X i j ω : ℝ); P])
≤ Real.sqrt (lam P n X) * (m + 1 + 2 * Real.sqrt ((n : ℝ) * φ (m + 1))) := by sorry
end PoissonDepTrials.MixInv
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.