Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (5), p. 1458 — feasible substitution in the relaxation

Proved
CorreaThreshold.Nonadaptive.eq_5

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

bernoulli-selectionmultilinear-relaxationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let 0≤zi≤qi≤10\le z_i\le q_i\le10≤zi​≤qi​≤1 and put πi=2zi/[2+(e−2)zi]\pi_i=2z_i/[2+(e-2)z_i]πi​=2zi​/[2+(e−2)zi​]. Substituting these probabilities into (4) gives

F(π)=∑ibizi22+(e−2)zifN∖{i}(z).F(\pi)=\sum_i b_i z_i\frac{2}{2+(e-2)z_i}f_{N\setminus\{i\}}(z).F(π)=i∑​bi​zi​2+(e−2)zi​2​fN∖{i}​(z).

This value is at most the optimum of (P). The formula identifies the auxiliary factor that the analytic lemmas bound.

Formalization Note As on the page, zzz is an optimum of the feasible linear problem in (3), with 0≤zi≤qi0\le z_i\le q_i0≤zi​≤qi​ and ∑izi≤1\sum_i z_i\le1∑i​zi​≤1. All denominators are positive on that box.

Preamble
import Mathlib
import Definitions.Def_CorreaThreshold_Nonadaptive_Bernoulli
Formal statement
namespace CorreaThreshold.Nonadaptive

/-- Substitution in (4) yields (5) and a feasible lower bound on (P). -/
theorem eq_5 {n : ℕ} [NeZero n] (q b z : Fin n → ℝ)
    (hq : ∀ i, 0 ≤ q i ∧ q i ≤ 1)
    (hz : ∀ i, 0 ≤ z i ∧ z i ≤ q i)
    (hzsum : (∑ i, z i) ≤ 1)
    (hopt : ∀ w : Fin n → ℝ, (∀ i, 0 ≤ w i ∧ w i ≤ q i) →
      (∑ i, w i) ≤ 1 → (∑ i, b i * w i) ≤ (∑ i, b i * z i)) :
    objFour b (fun i => 2 * z i / (2 + (Real.exp 1 - 2) * z i)) =
      ∑ i : Fin n, b i * z i * (2 / (2 + (Real.exp 1 - 2) * z i)) *
        fM (Finset.univ.erase i) z ∧
    (∑ i : Fin n, b i * z i * (2 / (2 + (Real.exp 1 - 2) * z i)) *
        fM (Finset.univ.erase i) z) ≤ objP q b := by sorry

end CorreaThreshold.Nonadaptive
Source
Correa, Foncea, Hoeksma, Oosterwijk, Vredeveld, Posted price mechanisms and optimal threshold strategies for random arrivals, Math. Oper. Res. 46 (2021), p. 1458, (5); https://doi.org/10.1287/moor.2020.1105
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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