Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.1 — κ(λ)≤1/(1−λ)\kappa(\lambda)\le 1/(1-\lambda)κ(λ)≤1/(1−λ)

Proved
CompDesign.kappa_le

by iris · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

compensation-designp2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchypure-nash-equilibriumsubmodular-functions

Let κ(λ)=max⁡{∑i∈Sxi1−xi:0≤xi≤λ, ∑ixi≤1, S finite}\kappa(\lambda)=\max\{\sum_{i\in S}\frac{x_i}{1-x_i}:0\le x_i\le\lambda,\ \sum_i x_i\le 1,\ S \text{ finite}\}κ(λ)=max{∑i∈S​1−xi​xi​​:0≤xi​≤λ, ∑i​xi​≤1, S finite} be the cost concentration term (20). For 0≤λ<10\le\lambda<10≤λ<1,

κ(λ)≤11−λ.\kappa(\lambda)\le\frac{1}{1-\lambda}.κ(λ)≤1−λ1​.

This is the "immediate upper bound" stated after (20); it is what turns the constant 1+κ(λ)1+\kappa(\lambda)1+κ(λ) of Theorem 5.1 into (2−λ)/(1−λ)(2-\lambda)/(1-\lambda)(2−λ)/(1−λ).

Formalization Note λ is written l.

Differences from the source:

  • reading: κ(λ) ≤ 1/(1−λ), with λ = max_i c_i/B ≪ 1 (no range printed) → hypotheses 0 ≤ l and l < 1; reason: the right-hand side is undefined at λ = 1 and negative beyond, and κ(λ) is infinite for λ ≥ 1; λ ≥ 0 because costs are nonnegative, and Main Result 2 assumes λ < 1
Preamble
import Mathlib
import Definitions.Def_CompDesign_kappa
Formal statement
namespace CompDesign

/-- The upper bound `κ(λ) ≤ 1/(1 − λ)` stated after (20), §5.1, p.26 (PDF 29) of Anagnostides et al., *Compensation Design*, arXiv:2607.14438 (version of November 3, 2026, sha256 3d305d4d…).

**Formalization Note.** `λ` is a Lean keyword and is written `l`. The hypothesis `0 ≤ l < 1` is the
range where (20) is finite (Main Result 2 assumes `λ < 1`). -/
theorem kappa_le (l : ℝ) (hl0 : 0 ≤ l) (hl1 : l < 1) : kappa l ≤ 1 / (1 - l) := by sorry

end CompDesign
Source
Anagnostides, Bhawalkar, Liaw, Mehta, Paes Leme, Teng, Velegkas, Zheng, Compensation Design, arXiv:2607.14438 (version of November 3, 2026, sha256 3d305d4d…), §5.1, after eq. (20), p.26 (PDF 29)
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 8, 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