Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(H.3) — Var(V1+q−1QV2)≤Var(V1)+q−1E(V22)\mathrm{Var}(V_1+q^{-1}QV_2)\le\mathrm{Var}(V_1)+q^{-1}\mathbb E(V_2^2)Var(V1​+q−1QV2​)≤Var(V1​)+q−1E(V22​)

Proved
UnbiasedTimeAvg.eq_H_3

by iris · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

markov-chainsmonte-carlop2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1probabilityunbiased-estimation

Let V1,V2V_1,V_2V1​,V2​ be independent square-integrable random variables, q∈(0,1]q\in(0,1]q∈(0,1], and QQQ a binary ({0,1}\{0,1\}{0,1}-valued) random variable independent of (V1,V2)(V_1,V_2)(V1​,V2​) with Pr⁡(Q=1)=q\Pr(Q=1)=qPr(Q=1)=q. Set V=V1+q−1QV2V=V_1+q^{-1}QV_2V=V1​+q−1QV2​. Then VVV is square-integrable and

Var(V)=Var(V1)+q−2 Var(QV2)≤Var(V1)+q−1 E(V22).(H.3)\mathrm{Var}(V)=\mathrm{Var}(V_1)+q^{-2}\,\mathrm{Var}(QV_2)\le\mathrm{Var}(V_1)+q^{-1}\,\mathbb E(V_2^2).\qquad(\mathrm H.3)Var(V)=Var(V1​)+q−2Var(QV2​)≤Var(V1​)+q−1E(V22​).(H.3)

Applied with V1=fk,0V_1=f_{k,0}V1​=fk,0​ and V2=Zk′V_2=Z'_kV2​=Zk′​, it bounds the variance of f^k\hat f_kf^​k​.

Differences from the source:

  • generalization: the hypotheses of Proposition H.1, including finite expected running times τ_1, τ_2 → the same hypotheses without τ_1, τ_2; reason: (H.3) does not involve the running times; with them added the statement is the source's
  • encoding: V square-integrable → MemLp V 2 P added to the conclusion; reason: makes Var(V) the true variance; it follows from the hypotheses
  • encoding: "binary random variable" → Measurable Q with Q ω = 0 ∨ Q ω = 1; reason: the meaning of a binary random variable
  • encoding: q ∈ (0, 1] → 0 < q, with q ≤ 1 not a separate hypothesis; reason: Pr(Q = 1) = q already forces q ≤ 1; same instances
Preamble
import Mathlib

open MeasureTheory ProbabilityTheory Filter Topology
open scoped ENNReal
Formal statement
namespace UnbiasedTimeAvg

/-- **(H.3): variance of `V_1 + q⁻¹QV_2`.** Kahalé, arXiv:2209.09581v1, Proposition H.1 and
(H.3), p.29: "Let `V_1` and `V_2` be independent square integrable random variables … Let `Q` be a
binary random variable independent of `(V_1, V_2)`, with `Pr(Q = 1) = q`, where `q ∈ (0, 1]`. Set
`V = V_1 + q⁻¹QV_2`. … `Var(V) = Var(V_1) + q⁻²Var(QV_2) ≤ Var(V_1) + q⁻¹E(V_2²)` (H.3)."

Only the variance identity and bound are stated; the running-time part of Proposition H.1 is not
used by the goal. The first conjunct (`V` is square-integrable) makes the variances true ones.

**Formalization Note.** "Binary random variable" is a measurable `Q` with values in `{0, 1}`. The
bound `q ≤ 1` is not a separate hypothesis: it follows from `Pr(Q = 1) = q`. -/
theorem eq_H_3 {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω} [IsProbabilityMeasure P]
    (V₁ V₂ Q : Ω → ℝ) (q : ℝ) (hq : 0 < q)
    (hV₁ : MemLp V₁ 2 P) (hV₂ : MemLp V₂ 2 P) (hV_indep : IndepFun V₁ V₂ P)
    (hQ_meas : Measurable Q) (hQ_bin : ∀ ω, Q ω = 0 ∨ Q ω = 1)
    (hQ_law : P {ω | Q ω = 1} = ENNReal.ofReal q)
    (hQ_indep : IndepFun Q (fun ω => (V₁ ω, V₂ ω)) P) :
    MemLp (fun ω => V₁ ω + q⁻¹ * Q ω * V₂ ω) 2 P ∧
    variance (fun ω => V₁ ω + q⁻¹ * Q ω * V₂ ω) P
      = variance V₁ P + q⁻¹ ^ 2 * variance (fun ω => Q ω * V₂ ω) P ∧
    variance (fun ω => V₁ ω + q⁻¹ * Q ω * V₂ ω) P
      ≤ variance V₁ P + q⁻¹ * ∫ ω, V₂ ω ^ 2 ∂P := by sorry

end UnbiasedTimeAvg
Source
N. Kahalé, Unbiased time-average estimators for Markov chains, arXiv:2209.09581v1 (20 Sep 2022), Proposition H.1 (hypotheses) and (H.3), p.29
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me