Lemma 4.5, p. 540 — ΣΣ_{0<|i−j|≤m} EX_iX_j ≤ Var(W) − λ + (2m + 1)Σp_i² + 4λnφ(m + 1)
ProvedPoissonDepTrials.MixSqrt.lemma_4_5bernoulli-trialsmixingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1poisson-approximation
Let be Bernoulli random variables on a probability space , possibly dependent, with , and put and . As on p. 535, is taken to be identically zero when or . Assume that satisfy Ibragimov's mixing condition (4.1) with a nonincreasing sequence . Fix . Then
This turns the first error term of (2.6) into a quantity expressed by , and the ; with (4.10) it closes the proof of Theorem 4.1.
Formalization Note The trials are a sequence that is measurable, almost surely -valued, and identically at index and above (the paper's padding convention, which changes no -algebra). is defined as , not a free parameter.
Preamble
import Mathlib import Definitions.Def_PoissonDepTrials_MixSqrt_Setting open MeasureTheory ProbabilityTheory
Formal statement
namespace PoissonDepTrials.MixSqrt
/-- Chen (1975), Lemma 4.5, p. 540, (4.9): for Bernoulli trials satisfying (4.1),
`ΣΣ_{0<|i−j|≤m} EX_iX_j ≤ Var(W) − λ + (2m + 1) Σ_i p_i² + 4λnφ(m + 1)`. -/
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.MixSqrt
Source
Chen, Poisson approximation for dependent trials, Ann. Probab. 3 (1975), p. 540, Lemma 4.5, (4.9)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.