Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.3, p. 12 — simultaneous signal increments preserve the d-SOS bound

Proved
InterdepSOS.RSV.lemma_2_3

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

interdependent-valuesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sos-valuations

Let vvv be a nonnegative ddd-SOS function on nonnegative signal profiles. Partition the coordinates into AAA and its complement BBB. Hold the coordinates in AAA at sAs_AsA​, then increase them by the nonnegative vector yAy_AyA​. If sB≤sB′s_B\le s'_BsB​≤sB′​ coordinatewise, the gain at the higher complementary profile is bounded by ddd times the gain at the lower one:

v(sA+yA,sB′)−v(sA,sB′)≤d(v(sA+yA,sB)−v(sA,sB)).v(s_A+y_A,s'_B)-v(s_A,s'_B)\le d\bigl(v(s_A+y_A,s_B)-v(s_A,s_B)\bigr).v(sA​+yA​,sB′​)−v(sA​,sB′​)≤d(v(sA​+yA​,sB​)−v(sA​,sB​)).

The lemma extends the one-coordinate ddd-SOS condition to simultaneous changes in any chosen set of coordinates.

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

theorem lemma_2_3 {n : ℕ} (w : Signal n → ℝ) (hw : ∀ s, 0 ≤ w s)
    (d : ℝ) (hd : IsDSOS d w) (A : Finset (Fin n))
    (s y s' : Signal n) (hss' : ∀ j, j ∉ A → s j ≤ s' j) :
    w (fun j => if j ∈ A then s j + y j else s' j) -
      w (fun j => if j ∈ A then s j else s' j) ≤
      d * (w (fun j => if j ∈ A then s j + y j else s j) - w 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. 12, Lemma 2.3
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