Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (4), p. 1457 — multilinear relaxation of (P)

Proved
CorreaThreshold.Nonadaptive.eq_4

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

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

Let qi∈[0,1]q_i\in[0,1]qi​∈[0,1] be independent Bernoulli success probabilities and let bi∈Rb_i\in\mathbb Rbi​∈R be prizes. Equation (4) rewrites the relaxation of problem (P) as

F(π)=∑ibiπi∑S⊆N∖{i}∏j∈Sπj∏j∈N∖(S∪{i})(1−πj)1+∣S∣.F(\pi)=\sum_i b_i\pi_i\sum_{S\subseteq N\setminus\{i\}}\frac{\prod_{j\in S}\pi_j\prod_{j\in N\setminus(S\cup\{i\})}(1-\pi_j)}{1+|S|}.F(π)=i∑​bi​πi​S⊆N∖{i}∑​1+∣S∣∏j∈S​πj​∏j∈N∖(S∪{i})​(1−πj​)​.

The rewritten expression equals the original multilinear objective for every π\piπ. On the box 0≤πi≤qi0\le\pi_i\le q_i0≤πi​≤qi​, it never exceeds the optimum of (P), and some π\piπ in that box attains that optimum. This equivalence permits the proof to choose a convenient feasible π\piπ.

Formalization Note NNN is a nonempty finite index set, represented by Fin n with n≥1n\ge1n≥1. The optimum over subsets is a finite maximum. Prizes may be negative, as the statement of Lemma 1 permits.

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

/-- Equation (4) and the equivalence of its optimization problem with (P). -/
theorem eq_4 {n : ℕ} [NeZero n] (q b : Fin n → ℝ)
    (hq : ∀ i, 0 ≤ q i ∧ q i ≤ 1) :
    (∀ π : Fin n → ℝ, relaxObj b π = objFour b π) ∧
    (∀ π : Fin n → ℝ, (∀ i, 0 ≤ π i ∧ π i ≤ q i) →
      objFour b π ≤ objP q b) ∧
    (∃ π : Fin n → ℝ, (∀ i, 0 ≤ π i ∧ π i ≤ q i) ∧
      objFour b π = 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. 1457, (P) and (4); 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