Ibragimov's covariance inequality:
ProvedMarkovChainCLT.abs_covariance_le_two_mul_sqrt_phiMixingCoefLet be a sequence of random variables on a probability space , let , and let
be the corresponding past and future -algebras. Let denote the uniform (φ-) mixing coefficient of the sequence at lag ,
Then for all square-integrable measurable with respect to and measurable with respect to ,
This is Ibragimov's covariance inequality in the case : it is the pairwise form of the Cogburn–Ibragimov comparison between the maximal-correlation and uniform-mixing coefficients, and taking the supremum over all admissible pairs turns this inequality into that comparison.
The classical argument interpolates between two endpoint estimates for the centered conditional-expectation operator acting on -measurable variables, namely and ; the geometric mean of the two bounds gives , and Cauchy–Schwarz then yields the displayed covariance bound. An interpolation-free route to the same bound uses that is positive and self-adjoint, so that by iterated Cauchy–Schwarz, while controls the right-hand side by the endpoint norms; letting gives .
import Definitions.Def_MixingCoefficients open MeasureTheory ProbabilityTheory MarkovChainCLT open scoped ProbabilityTheory
theorem MarkovChainCLT.abs_covariance_le_two_mul_sqrt_phiMixingCoef
{Ω E : Type*} [MeasurableSpace Ω] [MeasurableSpace E]
(P : Measure Ω) [IsProbabilityMeasure P] (Y : ℕ → Ω → E) (n k : ℕ) (U V : Ω → ℝ)
(hU : Measurable[processSigma Y (Set.Iic k)] U)
(hV : Measurable[processSigma Y (Set.Ici (k + n))] V)
(hU2 : MemLp U 2 P) (hV2 : MemLp V 2 P) :
|cov[U, V; P]| ≤ 2 * Real.sqrt (phiMixingCoef P Y n) *
(Real.sqrt (Var[U; P]) * Real.sqrt (Var[V; P])) := by sorry