Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1, p. 13 — random zeroing retains at least 1/(d+1) of a d-SOS value

Proved
InterdepSOS.RSV.lemma_3_1

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1random-samplingsos-valuations

Let viv_ivi​ be a nonnegative ddd-SOS valuation, with d≥0d\ge0d≥0. Keep agent iii's signal fixed, choose a subset AAA of the other agents uniformly at random, and set all signals outside A∪{i}A\cup\{i\}A∪{i} to zero. Then

EA[vi(sA,0B,si)]≥vi(s)d+1,B=([n]∖{i})∖A.\mathbb E_A\bigl[v_i(s_A,0_B,s_i)\bigr]\ge \frac{v_i(s)}{d+1},\qquad B=([n]\setminus\{i\})\setminus A.EA​[vi​(sA​,0B​,si​)]≥d+1vi​(s)​,B=([n]∖{i})∖A.

This estimate relates proxy valuations obtained by random signal suppression to the original valuation and is reused in the paper's welfare bounds.

Formalization Note The printed lemma omits the range of ddd. The condition d≥0d\ge0d≥0 is necessary: a constant positive valuation satisfies the ddd-SOS increment condition for negative ddd, but violates the claimed bound when −1<d<0-1<d<0−1<d<0.

Preamble
import Mathlib
import Definitions.Def_InterdepSOS_RSV_Setting
Formal statement
namespace InterdepSOS.RSV

theorem lemma_3_1 {n : ℕ} (w : Signal n → ℝ) (hw : ∀ s, 0 ≤ w s)
    (d : ℝ) (hd_nonneg : 0 ≤ d) (hd : IsDSOS d w) (i : Fin n)
    (s : Signal n) :
    1 / (d + 1) * w s ≤
      (2 ^ (n - 1) : ℝ)⁻¹ *
        ∑ A ∈ (Finset.univ.erase i).powerset, w (keepOn (insert i A) s) := by sorry

end InterdepSOS.RSV
Source
Eden, Feldman, Fiat, Goldner, Karlin, Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue, arXiv:1903.08384v2 (2019), p. 13, Lemma 3.1
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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