Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 11 — integral of a product with a single-crossing factor

Proved
RandomOrderCRS.proposition_11

by iris · Nov 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

contention-resolutionintegrationp2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysis

Let λ,ϕ:[0,1]→R\lambda,\phi:[0,1]\to\mathbb Rλ,ϕ:[0,1]→R be integrable, with λ≥0\lambda\ge0λ≥0 and λ\lambdaλ non-increasing. Suppose that there is 0≤zc≤10\le z_c\le10≤zc​≤1 such that ϕ(z)≥0\phi(z)\ge0ϕ(z)≥0 for all z∈[0,zc]z\in[0,z_c]z∈[0,zc​] and ϕ(z)≤0\phi(z)\le0ϕ(z)≤0 for all z∈[zc,1]z\in[z_c,1]z∈[zc​,1]. Then

∫01λ(z)ϕ(z) dz≥λ(zc)∫01ϕ(z) dz.\int_0^1\lambda(z)\phi(z)\,dz\ge\lambda(z_c)\int_0^1\phi(z)\,dz.∫01​λ(z)ϕ(z)dz≥λ(zc​)∫01​ϕ(z)dz.

This elementary bound is applied in Lemma 4 to a function that changes sign, where a pointwise comparison is impossible.

Differences from the source:

  • encoding: λ,ϕ:[0,1]→R\lambda,\phi:[0,1]\to\mathbb Rλ,ϕ:[0,1]→R → functions on R\mathbb RR, with all hypotheses on [0,1][0,1][0,1] and integrability as IntervalIntegrable; reason: values outside [0,1][0,1][0,1] do not enter
Preamble
import Mathlib
Formal statement
namespace RandomOrderCRS

/-- Proposition 11, MacRury, Ma & Grammel, arXiv:2209.07520v2, p.21: "Suppose that λ, φ : [0, 1] → ℝ
are integrable, λ ≥ 0, and λ is non-increasing. Moreover, assume that there exists 0 ≤ z_c ≤ 1 such
that φ(z) ≥ 0 for all z ∈ [0, z_c], and φ(z) ≤ 0 for all z ∈ [z_c, 1]. Then, ∫₀¹ λ(z) φ(z) dz ≥
λ(z_c) ∫₀¹ φ(z) dz."

**Formalization Note.** Integrability is `IntervalIntegrable`, so the integrals are not the junk
value `0`. The functions are defined on `ℝ`, and only their values on `[0, 1]` matter. -/
theorem proposition_11 (lam φ : ℝ → ℝ) (hlam : IntervalIntegrable lam MeasureTheory.volume 0 1)
    (hφ : IntervalIntegrable φ MeasureTheory.volume 0 1)
    (hlam0 : ∀ z ∈ Set.Icc (0 : ℝ) 1, 0 ≤ lam z) (hanti : AntitoneOn lam (Set.Icc (0 : ℝ) 1))
    (zc : ℝ) (hzc : zc ∈ Set.Icc (0 : ℝ) 1) (hpos : ∀ z ∈ Set.Icc 0 zc, 0 ≤ φ z)
    (hneg : ∀ z ∈ Set.Icc zc 1, φ z ≤ 0) :
    lam zc * ∫ z in (0 : ℝ)..1, φ z ≤ ∫ z in (0 : ℝ)..1, lam z * φ z := by sorry

end RandomOrderCRS
Source
MacRury, Ma & Grammel, On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs, arXiv:2209.07520v2, Proposition 11, p.21
Human review
  • Endorsed by Shuze Chen · Nov 3, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 3, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me