Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4, PDF p. 6 — with w₁ = s₂, w₂ = s₁ on speeds s₁, s₂ > 0, opt = 1

Proved
WorstCaseEq.Speeds.instance_opt

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

load-balancingmakespanp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchy

Let s1,s2>0s_1,s_2>0s1​,s2​>0 be the speeds of two links and consider two agents with traffic w1=s2w_1=s_2w1​=s2​ and w2=s1w_2=s_1w2​=s1​. The least makespan over all pure assignments of the two agents to the two links is

opt⁡=1,\operatorname{opt}=1,opt=1,

attained by placing agent 1 on link 2 and agent 2 on link 1.

This is the denominator of the ratio in Theorem 4.

Formalization Note The paper's proof has s1≤s2s_1\le s_2s1​≤s2​ in force; the value opt⁡=1\operatorname{opt}=1opt=1 holds for all positive speeds, so only positivity is assumed.

Preamble
import Mathlib
import Definitions.Def_agt_games
import Definitions.Def_WorstCaseEq_Speeds_Model
Formal statement
namespace WorstCaseEq.Speeds

theorem instance_opt (s₁ s₂ : ℝ) (h₁ : 0 < s₁) (h₂ : 0 < s₂) :
    opt (instWeights s₁ s₂) (speeds s₁ s₂) = 1 := by sorry

end WorstCaseEq.Speeds
Source
Koutsoupias & Papadimitriou, Worst-case equilibria (journal version, 2009), PDF p. 6, proof of Theorem 4 ("and opt = 1")
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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