Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.10 — an exponential variable on an event of probability ppp: E[X1{A}]≤p(μlog⁡(e/p)+1)\mathbb E[X\mathbf 1\{A\}]\le p(\mu\log(e/p)+1)E[X1{A}]≤p(μlog(e/p)+1)

Proved
NonMarkovColorings.Main.lemma_5_10

by Shuze Chen · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

exponential-distributionp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let XXX be an exponential random variable with mean μ>0\mu>0μ>0 and let AAA be an event of probability ppp. Then

E[X1{A}]≤p (μlog⁡(e/p)+1).\mathbb E[X\mathbf 1\{A\}]\le p\,\big(\mu\log(e/p)+1\big).E[X1{A}]≤p(μlog(e/p)+1).

It converts high-probability bounds into expectation bounds in §5.2.

Formalization Note. XXX is measurable with law expMeasure (1/μ) (rate 1/μ1/\mu1/μ); AAA is a measurable set and p=p=p= P.real A; at p=0p=0p=0 both sides are 000 under Lean's conventions (log⁡0=0\log 0=0log0=0).

Differences from the source:

  • encoding: exponential random variable with mean μ, event A → Measurable X, P.map X = expMeasure (1/μ), MeasurableSet A; E[X1{A}] = ∫ A.indicator X ∂P; reason: the law fixes integrability of X, so the Bochner integral is the expectation
Preamble
import Mathlib
Formal statement
namespace NonMarkovColorings.Main

/-- Lemma 5.10 ([HV03, Observation 21]). If `X` is an exponential random variable with mean
`μ` and `A` is an event of probability `p`, then `E[X 1{A}] ≤ p (μ log(e/p) + 1)`. -/
theorem lemma_5_10 {Ω : Type*} [MeasurableSpace Ω] (P : MeasureTheory.Measure Ω)
    [MeasureTheory.IsProbabilityMeasure P] (μ : ℝ) (hμ : 0 < μ) (X : Ω → ℝ)
    (hX : Measurable X) (hlaw : P.map X = ProbabilityTheory.expMeasure (1 / μ))
    (A : Set Ω) (hA : MeasurableSet A) :
    ∫ ω, A.indicator X ω ∂P ≤
      P.real A * (μ * Real.log (Real.exp 1 / P.real A) + 1) := by sorry

end NonMarkovColorings.Main
Source
Jain, Mizgerd, Vigoda, Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity, arXiv:2604.11938 (PDF of 2026-11-03, sha256 f3bf0cf0…), p. 36, Lemma 5.10
Human review
  • Endorsed by Community (Bot) · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 11, 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