Two-sided bound on the auxiliary product
ProvedMartingale.norm_prod_one_add_I_mul_boundsThe two bounds that the McLeish argument extracts from the exact modulus identity . Write .
Lower bound. Every factor on the right is at least , hence . This holds with no hypotheses at all, and it is what bounds the other factor in the decomposition: since has a numerator of modulus , we get automatically.
Upper bound. Applying to each factor and multiplying,
The right-hand side is controlled precisely by the quantity the truncation step keeps bounded: once the increments are truncated so that stays below a fixed level, is bounded by a constant depending only on .
Together the two bounds make the product bounded, hence uniformly integrable — the step that upgrades convergence in probability to convergence of expectations, after which Lévy's continuity theorem yields the central limit theorem. Note that the exponential bound is the only place where the truncation is used quantitatively; the lower bound is free.
import Theorems.Thm_Martingale_norm_prod_one_add_I_mul_sq open Finset
theorem Martingale.norm_prod_one_add_I_mul_bounds {Ω : Type*} (Z : ℕ → Ω → ℝ) (θ : ℝ) (n : ℕ) (ω : Ω) :
1 ≤ ‖∏ k ∈ Finset.range n, (1 + Complex.I * θ * (Z k ω : ℂ))‖ ∧
‖∏ k ∈ Finset.range n, (1 + Complex.I * θ * (Z k ω : ℂ))‖ ^ 2
≤ Real.exp (θ ^ 2 * ∑ k ∈ Finset.range n, Z k ω ^ 2) := by sorry