(4.17), proof of Theorem 4.2, p. 541 — Cov(|V^{(i,j)} − EV^{(i,j)}|, X_iX_j) ≤ 4np_iφ(m + 1) + 4λφ(m + 1)
ProvedPoissonDepTrials.MixInv.bound_4_17Let 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 ,
This is the first and last member of the paper's chain (4.17), obtained from Lemma 4.3; the intermediate member uses an independent copy of the trials, which stays inside the proof.
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 bound_4_17 {Ω : 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 : 0 < |(i : ℤ) - ((j : ℕ) : ℤ)| ∧ |(i : ℤ) - ((j : ℕ) : ℤ)| ≤ m) :
cov[fun ω => |(Vij n m X i j ω : ℝ) - ∫ ω', (Vij n m X i j ω' : ℝ) ∂P|,
fun ω => (X i ω : ℝ) * X j ω; P]
≤ 4 * n * prob P X i * φ (m + 1) + 4 * 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.