Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 5.3, p. 560 — optimal welfare is monotone under valuation dominance

Proved
BalancedPrices.ClosureMax.optVal_mono

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

balanced-pricesoptimal-welfarep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1prophet-inequality

Let every valuation in the base spaces ViV_iVi​ take values in [0,1][0,1][0,1]. Let v~∈V\tilde v\in Vv~∈V and v∈Vmax⁡v\in V^{\max}v∈Vmax with v~i(xi)≤vi(xi)\tilde v_i(x_i)\le v_i(x_i)v~i​(xi​)≤vi​(xi​) for every agent iii and outcome xix_ixi​. Then for every set SSS of outcome profiles

v~(OPT⁡(v~,S))≤v(OPT⁡(v,S)).\tilde v(\operatorname{OPT}(\tilde v,S))\le v(\operatorname{OPT}(v,S)).v~(OPT(v~,S))≤v(OPT(v,S)).

In the proof of Theorem 5.3 this is the comparison v~(OPT⁡(v~,Fx))≤v(OPT⁡(v~,Fx))≤v(OPT⁡(v,Fx))\tilde v(\operatorname{OPT}(\tilde v,\mathcal F_x))\le v(\operatorname{OPT}(\tilde v,\mathcal F_x))\le v(\operatorname{OPT}(v,\mathcal F_x))v~(OPT(v~,Fx​))≤v(OPT(v~,Fx​))≤v(OPT(v,Fx​)), used in both chains.

Formalization Note The optimal value is the real supremum of welfare over SSS, so the paper's two steps (evaluate vvv at v~\tilde vv~'s maximiser, then compare with vvv's optimum) merge into one supremum comparison and no attainment is assumed. The [0,1][0,1][0,1] bound of §2 keeps both suprema bounded; both sides are 000 when SSS is empty. Agents are indexed from zero.

Preamble
import Mathlib
import Definitions.Def_BalancedPrices_ClosureMax_Composition
Formal statement
namespace BalancedPrices.ClosureMax

/-- The supremum comparison used in the proof of Theorem 5.3, including the empty set. -/
theorem optVal_mono {n : ℕ} {X : Fin n → Type*}
    (Vsp : ∀ i, Set (X i → ℝ))
    (hV : ∀ i (f : X i → ℝ), f ∈ Vsp i → ∀ xi, 0 ≤ f xi ∧ f xi ≤ 1)
    (vt vf : BalancedPrices.Extension.Valuation X) (hvt : ∀ i, vt i ∈ Vsp i)
    (hvf : ∀ i, vf i ∈ VmaxSet Vsp i)
    (hle : ∀ i xi, vt i xi ≤ vf i xi)
    (S : Set (BalancedPrices.Extension.Outcome X)) : BalancedPrices.Extension.optVal vt S ≤ BalancedPrices.Extension.optVal vf S := by sorry

end BalancedPrices.ClosureMax
Source
Dütting, Feldman, Kesselheim, Lucier, Prophet inequalities made easy: Stochastic optimization by pricing nonstochastic inputs, SIAM J. Comput. 49 (2020), p. 560, proof of Theorem 5.3, property (b), last two inequalities
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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