Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 5.3, p. 560 — property (a) for the supporting profile's prices

Proved
BalancedPrices.ClosureMax.closure_max_a

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

balanced-pricesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1prophet-inequalityvaluation-maxima

Fix agents with outcome spaces XiX_iXi​ (null outcome ∅\varnothing∅), a downward-closed feasible set F\mathcal FF, an exchange-compatible family (Fx)x∈X(\mathcal F_x)_{x\in X}(Fx​)x∈X​, base valuation spaces ViV_iVi​ whose functions take values in [0,1][0,1][0,1], and constants α>0\alpha>0α>0, β≥0\beta\ge0β≥0. Let ALG be a consistent allocation rule feasible for every profile in Vmax⁡V^{\max}Vmax, and suppose that for every w∈Vw\in Vw∈V the pricing rule pwp^wpw is (α,β)(\alpha,\beta)(α,β)-balanced with respect to www, ALG and (Fx)(\mathcal F_x)(Fx​). Let v∈Vmax⁡v\in V^{\max}v∈Vmax and let v~∈V\tilde v\in Vv~∈V be a supporting valuation profile for ALG⁡(v)\operatorname{ALG}(v)ALG(v). Then for every x∈Fx\in\mathcal Fx∈F,

∑ipiv~(xi∣x[i−1])≥1α(v(ALG⁡(v))−v(OPT⁡(v,Fx))).\sum_{i}p_i^{\tilde v}(x_i\mid x_{[i-1]})\ge\frac1\alpha\bigl(v(\operatorname{ALG}(v))-v(\operatorname{OPT}(v,\mathcal F_x))\bigr).i∑​piv~​(xi​∣x[i−1]​)≥α1​(v(ALG(v))−v(OPT(v,Fx​))).

This is property (a) of Definition 3.1 for the pricing rule pv~p^{\tilde v}pv~ with respect to vvv, the first half of Theorem 5.3.

Formalization Note Agents are indexed from zero. The optimum is a real supremum, bounded by the standing [0,1][0,1][0,1] bound. Prices are ℝ≥0∞; the right-hand side enters through ENNReal.ofReal, which turns a negative bound into 000, an equivalent constraint on nonnegative prices.

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

/-- Property (a) in the proof of Theorem 5.3. -/
theorem closure_max_a {n : ℕ} {X : Fin n → Type*}
    (nul : BalancedPrices.Extension.Outcome X) (F : Set (BalancedPrices.Extension.Outcome X))
    (hdown : BalancedPrices.Extension.DownClosed nul F)
    (Fam : BalancedPrices.Extension.Outcome X → Set (BalancedPrices.Extension.Outcome X))
    (Vsp : ∀ i, Set (X i → ℝ))
    (hV : ∀ i (f : X i → ℝ), f ∈ Vsp i → ∀ xi, 0 ≤ f xi ∧ f xi ≤ 1)
    (α β : ℝ) (hα : 0 < α) (hβ : 0 ≤ β)
    (hFam : BalancedPrices.Extension.ExchFamily F Fam)
    (ALG : BalancedPrices.Extension.Valuation X → BalancedPrices.Extension.Outcome X)
    (hALG : ∀ w, (∀ i, w i ∈ VmaxSet Vsp i) → ALG w ∈ F)
    (hcons : Consistent Vsp ALG)
    (pr : BalancedPrices.Extension.Valuation X → BalancedPrices.Extension.PriceRule X)
    (hprice : ∀ w, (∀ i, w i ∈ Vsp i) → BalancedPrices.Extension.IsPricingRule F (pr w))
    (hbal : ∀ w : BalancedPrices.Extension.Valuation X, (∀ i, w i ∈ Vsp i) →
      BalancedPrices.Extension.Balanced nul α β F Fam w (ALG w) (pr w))
    (vf vt : BalancedPrices.Extension.Valuation X) (hvf : ∀ i, vf i ∈ VmaxSet Vsp i)
    (hsup : IsSupporting Vsp vt (ALG vf) vf)
    (x : BalancedPrices.Extension.Outcome X) (hx : x ∈ F) :
    ENNReal.ofReal ((1 / α) * (BalancedPrices.Extension.welfare vf (ALG vf) - BalancedPrices.Extension.optVal vf (Fam x))) ≤
      ∑ i, pr vt i (x i) (BalancedPrices.Extension.pre nul x i) := 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 (a)
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