Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1, p. 14 — ∫₀¹ λφ ≥ λ(z*)∫₀¹ φ for λ ≥ 0 non-increasing and φ changing sign once at z*

Proved
OfflineStochMatch.Attenuation.proposition_1

by mikedeng1 · Oct 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

integral-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysis

Let λ,φ:[0,1]→R\lambda, \varphi : [0,1] \to \mathbb Rλ,φ:[0,1]→R be integrable, with λ≥0\lambda \ge 0λ≥0 and λ\lambdaλ non-increasing. Suppose there is z∗∈[0,1]z^* \in [0,1]z∗∈[0,1] such that φ(z)≥0\varphi(z) \ge 0φ(z)≥0 for all z∈[0,z∗]z \in [0, z^*]z∈[0,z∗] and φ(z)≤0\varphi(z) \le 0φ(z)≤0 for all z∈[z∗,1]z \in [z^*, 1]z∈[z∗,1]. Then

∫01λ(z)φ(z) dz  ≥  λ(z∗)∫01φ(z) dz.\int_0^1 \lambda(z)\varphi(z)\,dz \;\ge\; \lambda(z^*) \int_0^1 \varphi(z)\,dz.∫01​λ(z)φ(z)dz≥λ(z∗)∫01​φ(z)dz.

In the paper this elementary bound drives the exchange argument (Lemma 6) for the case of patience 222.

Formalization Note Integrability is interval integrability on [0,1][0,1][0,1] with respect to Lebesgue measure; the monotonicity, sign and nonnegativity conditions are imposed on [0,1][0,1][0,1] only. Under these hypotheses λφ\lambda\varphiλφ is integrable on [0,1][0,1][0,1] (λ\lambdaλ is bounded by λ(0)\lambda(0)λ(0) there and monotone), so neither integral takes a default value.

Preamble
import Mathlib
import Definitions.Def_OfflineStochMatch_Attenuation_Setting
Formal statement
namespace OfflineStochMatch.Attenuation

theorem proposition_1 (lam φ : ℝ → ℝ)
    (hlam : IntervalIntegrable lam MeasureTheory.volume 0 1)
    (hφ : IntervalIntegrable φ MeasureTheory.volume 0 1)
    (hlam_nonneg : ∀ z ∈ Set.Icc (0 : ℝ) 1, 0 ≤ lam z)
    (hlam_anti : AntitoneOn lam (Set.Icc (0 : ℝ) 1))
    (zs : ℝ) (hzs : zs ∈ Set.Icc (0 : ℝ) 1)
    (hφ_pos : ∀ z ∈ Set.Icc (0 : ℝ) zs, 0 ≤ φ z)
    (hφ_neg : ∀ z ∈ Set.Icc zs 1, φ z ≤ 0) :
    lam zs * ∫ z in (0 : ℝ)..1, φ z ≤ ∫ z in (0 : ℝ)..1, lam z * φ z := by sorry

end OfflineStochMatch.Attenuation
Source
Brubach, Grammel, Ma, MacRury, Srinivasan, Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes, arXiv:2106.06892v3, p. 14, Proposition 1 (Proposition 11 of reference [33])
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 14, 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