Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (29), p. 18 — F(i) ≥ 1 − e^{−F*(i)} ≥ (1 − 1/e)F*(i) when z_j ∈ [0,1] and Σ_{j≤k} z_j ≤ 1

Proved
OfflineStochMatch.UnitPatience.eq_29

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

am-gmexponential-boundinequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let z1,…,zk∈[0,1]z_1,\dots,z_k\in[0,1]z1​,…,zk​∈[0,1] with ∑j=1kzj≤1\sum_{j=1}^{k}z_j\le 1∑j=1k​zj​≤1, and for 0≤i≤k0\le i\le k0≤i≤k put F(i)=1−∏j=1i(1−zj)F(i)=1-\prod_{j=1}^{i}(1-z_j)F(i)=1−∏j=1i​(1−zj​) and F∗(i)=∑j=1izjF^*(i)=\sum_{j=1}^{i}z_jF∗(i)=∑j=1i​zj​. Then

F(i) ≥ 1−e−F∗(i) ≥ (1−1e)F∗(i).(29)F(i)\ \ge\ 1-e^{-F^*(i)}\ \ge\ \Big(1-\frac1e\Big)F^*(i).\tag{29}F(i) ≥ 1−e−F∗(i) ≥ (1−e1​)F∗(i).(29)

The first inequality is the bound ∏j=1i(1−zj)≤e−F∗(i)\prod_{j=1}^{i}(1-z_j)\le e^{-F^*(i)}∏j=1i​(1−zj​)≤e−F∗(i), which the page derives from the inequality of arithmetic and geometric means; the second uses 0≤F∗(i)≤∑j=1kzj≤10\le F^*(i)\le\sum_{j=1}^{k}z_j\le 10≤F∗(i)≤∑j=1k​zj​≤1. Together with (27) and (28) it gives Lemma 8.

Formalization Note The two inequalities are stated as a conjunction; 1−1/e1-1/e1−1/e is written 1−e−11-e^{-1}1−e−1. The sequence is indexed by N\mathbb NN and only the indices 1,…,k1,\dots,k1,…,k are constrained.

Preamble
import Mathlib
import Definitions.Def_OfflineStochMatch_UnitPatience_Setting
Formal statement
namespace OfflineStochMatch.UnitPatience

open Finset

theorem eq_29 (k : ℕ) (z : ℕ → ℝ) (hz : ∀ j ∈ Icc 1 k, 0 ≤ z j ∧ z j ≤ 1)
    (hsum : ∑ j ∈ Icc 1 k, z j ≤ 1) (i : ℕ) (hi : i ≤ k) :
    1 - Real.exp (-Fstar z i) ≤ Fcum z i ∧
    (1 - Real.exp (-1)) * Fstar z i ≤ 1 - Real.exp (-Fstar z i) := by sorry

end OfflineStochMatch.UnitPatience
Source
Brubach, Grammel, Ma, MacRury, Srinivasan, Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes, arXiv:2106.06892v3, p. 18, Eq. (29) (proof of Lemma 8; F(i) defined on p. 17, F*(i) on p. 18)
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