(4.19), proof of Theorem 4.2, p. 542 — p_iE{X_j[1 + 2 min(λ^{−1/2},1)|Y_{i,j−1} + 1 − λ|]} ≤ p_ip_j[8m + 5 + 4(nφ(m+1))^{1/2}] + 8 min(λ^{−1/2},1)(np_i + λ)φ(m+1)
ProvedPoissonDepTrials.MixInv.bound_4_19Let 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 with (including ),
It bounds each summand of the second double sum of (4.14).
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)). The scan's sign in is smudged; it is , as in (4.18).
import Mathlib import Definitions.Def_PoissonDepTrials_MixInv_Setting open MeasureTheory ProbabilityTheory
namespace PoissonDepTrials.MixInv
theorem bound_4_19 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
(n : ℕ) (X : ℕ → Ω → ℕ) (hX : IsBernoulliTrials P n X) (φ : ℕ → ℝ) (hφ : IbragimovMixing P X φ) (m : ℕ) (i j : ℕ)
(hi : i ∈ Finset.Icc 1 n) (hj : j ∈ Finset.Icc 1 n) (hij : |(i : ℤ) - ((j : ℕ) : ℤ)| ≤ m) :
prob P X i * ∫ ω, (X j ω : ℝ) *
(1 + 2 * min (1 / Real.sqrt (lam P n X)) 1 * |(Y n m X i ((j : ℤ) - 1) ω : ℝ) + 1 - lam P n X|) ∂P
≤ prob P X i * prob P X j * (8 * m + 5 + 4 * Real.sqrt ((n : ℝ) * φ (m + 1)))
+ 8 * min (1 / Real.sqrt (lam P n X)) 1 * (n * prob P X i + lam P n X) * φ (m + 1) := by sorry
end PoissonDepTrials.MixInv
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.