Lemma 4.5, p. 540 — ΣΣ_{0<|i−j|≤m} EX_iX_j ≤ Var W − λ + (2m + 1)Σp_i² + 4λnφ(m + 1)
ProvedPoissonDepTrials.MixInv.lemma_4_5Let 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 every ,
It expresses the local dependence of the trials through the variance of , which turns the bounds of (4.18)–(4.19) into the variance form of Theorem 4.2.
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 .
import Mathlib import Definitions.Def_PoissonDepTrials_MixInv_Setting open MeasureTheory ProbabilityTheory
namespace PoissonDepTrials.MixInv
theorem lemma_4_5 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
(n : ℕ) (X : ℕ → Ω → ℕ) (hX : IsBernoulliTrials P n X) (φ : ℕ → ℝ) (hφ : IbragimovMixing P X φ) (m : ℕ) :
∑ i ∈ Finset.Icc 1 n, ∑ j ∈ Finset.Icc 1 n with 0 < |(i : ℤ) - ((j : ℕ) : ℤ)| ∧ |(i : ℤ) - ((j : ℕ) : ℤ)| ≤ m,
∫ ω, (X i ω : ℝ) * X j ω ∂P
≤ Var[fun ω => (W n X ω : ℝ); P] - lam P n X
+ (2 * m + 1) * ∑ i ∈ Finset.Icc 1 n, prob P X i ^ 2
+ 4 * lam P n X * n * φ (m + 1) := by sorry
end PoissonDepTrials.MixInv
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.