Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.1, p. 23 — nonnegativity of μ

Proved
RobustPoA.Tight.lemma_5_1

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

congestion-gamesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchysmooth-games

Let C\mathcal CC be a nonempty set of nonnegative, nondecreasing, strictly positive cost functions. For every (λ,μ)∈A(C)(\lambda,\mu)\in\mathcal A(\mathcal C)(λ,μ)∈A(C),

μ≥0.\mu\ge0.μ≥0.

The lemma fixes the sign of the second smoothness parameter under strict positivity, as used when resourcewise bounds are summed across a game.

Formalization Note Admissibility includes nondecreasing costs at positive loads; the all-zero function is excluded by the standing convention of §5.1.

Preamble
import Definitions.Def_RobustPoA_Tight_Classes
Formal statement
namespace RobustPoA.Tight

/-- Lemma 5.1, p. 23: an admissible smoothness pair for nonempty, strictly positive
cost functions has nonnegative second coordinate. -/
theorem lemma_5_1 (C : Set (ℕ → ℝ)) (hne : C.Nonempty)
    (hC : ∀ c ∈ C, IsCostFn c ∧ IsStrictlyPos c)
    (p : ℝ × ℝ) (hp : p ∈ smoothParams C) : 0 ≤ p.2 := by sorry

end RobustPoA.Tight
Source
Roughgarden, Intrinsic Robustness of the Price of Anarchy, J. ACM 62(5) (2015), Lemma 5.1, p. 23
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