Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2.4 — 𝔼[1 ∧ e^A] = Φ(μ/σ) + exp(μ + σ²/2)Φ(−σ − μ/σ) for A ~ N(μ, σ²)

Proved
Roberts1997.RWM.expect_min_one_exp_gaussian

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

gaussianmetropolisp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let μ∈R\mu\in\mathbb Rμ∈R, σ>0\sigma>0σ>0 and A∼N(μ,σ2)A\sim N(\mu,\sigma^2)A∼N(μ,σ2). With Φ\PhiΦ the standard normal distribution function,

E[1∧eA]=Φ(μσ)+exp⁡(μ+σ22) Φ(−σ−μσ).\mathbb E\big[1\wedge e^A\big]=\Phi\Big(\frac\mu\sigma\Big)+\exp\Big(\mu+\frac{\sigma^2}2\Big)\,\Phi\Big(-\sigma-\frac\mu\sigma\Big).E[1∧eA]=Φ(σμ​)+exp(μ+2σ2​)Φ(−σ−σμ​).

This computes the expected acceptance probability when the log acceptance ratio is Gaussian; it yields the speed h(l)h(l)h(l) and the acceptance rate a(l)a(l)a(l).

Formalization Note The paper writes A∼N(μ,σ2)A\sim N(\mu,\sigma^2)A∼N(μ,σ2) and divides by σ\sigmaσ; the formula is read with σ>0\sigma>0σ>0 (for σ<0\sigma<0σ<0 the law is the same but the right side changes). The variance is (σ ^ 2).toNNReal. The integrand lies in (0,1](0,1](0,1], so the integral is a genuine expectation.

Preamble
import Definitions.Def_Roberts1997_RWM_Speed

open MeasureTheory ProbabilityTheory
Formal statement
namespace Roberts1997.RWM

/-- Proposition 2.4 (p. 115). If `A ~ N(μ, σ²)` with `σ > 0`, then
`𝔼[1 ∧ e^A] = Φ(μ/σ) + exp(μ + σ²/2) Φ(-σ - μ/σ)`. -/
theorem expect_min_one_exp_gaussian (μ σ : ℝ) (hσ : 0 < σ) :
    ∫ a, min 1 (Real.exp a) ∂(gaussianReal μ (σ ^ 2).toNNReal) =
      Phi (μ / σ) + Real.exp (μ + σ ^ 2 / 2) * Phi (-σ - μ / σ) := by sorry

end Roberts1997.RWM
Source
Roberts, Gelman, Gilks, Weak convergence and optimal scaling of random walk Metropolis algorithms, Ann. Appl. Probab. 7(1), 1997, p. 115, Proposition 2.4
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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