Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.1 — every strict better response strictly increases Φ′\Phi'Φ′

Proved
CompDesign.thm_4_1_potential_increases

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

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

Throughout, N={1,…,n}N=\{1,\dots,n\}N={1,…,n} is the set of agents, B>0B>0B>0 the budget, ci≥0c_i\ge 0ci​≥0 the private costs, and v:2N→Rv:2^N\to\mathbb Rv:2N→R a value function satisfying Assumption 3.1: v(∅)=0v(\emptyset)=0v(∅)=0, vvv monotone (S⊆S′⇒v(S)≤v(S′)S\subseteq S'\Rightarrow v(S)\le v(S')S⊆S′⇒v(S)≤v(S′)) and submodular (v(S∪{i})−v(S)≥v(S′∪{i})−v(S′)v(S\cup\{i\})-v(S)\ge v(S'\cup\{i\})-v(S')v(S∪{i})−v(S)≥v(S′∪{i})−v(S′) whenever S⊆S′S\subseteq S'S⊆S′ and i∉S′i\notin S'i∈/S′). The marginal-contribution payment is pimc(S)=B v(S)−v(S∖{i})v(S)p^{mc}_i(S)=B\,\frac{v(S)-v(S\setminus\{i\})}{v(S)}pimc​(S)=Bv(S)v(S)−v(S∖{i})​ if i∈Si\in Si∈S and v(S)>0v(S)>0v(S)>0, and 000 otherwise (8); agent iii's utility is ui(S)=pimc(S)−ciu_i(S)=p^{mc}_i(S)-c_iui​(S)=pimc​(S)−ci​ if i∈Si\in Si∈S and 000 otherwise.

Assume moreover cj<Bc_j<Bcj​<B for every agent jjj. Let Φ(S)=v(S)∏i∈S(1−ci/B)\Phi(S)=v(S)\prod_{i\in S}(1-c_i/B)Φ(S)=v(S)∏i∈S​(1−ci​/B) and Φ′(S)=(Φ(S),−∑i∈Sci)\Phi'(S)=(\Phi(S),-\sum_{i\in S}c_i)Φ′(S)=(Φ(S),−∑i∈S​ci​), ordered lexicographically. If S′S'S′ is a strict better response from SSS in Γmc\Gamma^{mc}Γmc (one agent switches its participation and its utility strictly rises), then

Φ′(S)<Φ′(S′).\Phi'(S)<\Phi'(S').Φ′(S)<Φ′(S′).

Opt-ins and opt-outs from positive-value states raise the first coordinate; an opt-out from a zero-value state keeps Φ=0\Phi=0Φ=0 and raises the second coordinate. Since there are finitely many states, this is what makes every better-response sequence terminate.

Differences from the source: none.

Preamble
import Mathlib
import Definitions.Def_CompDesignBFM_IsMonotoneSF
import Definitions.Def_CompDesignBFM_IsSubmodularSF
import Definitions.Def_CompDesign_IsStrictImprovement
import Definitions.Def_CompDesign_PhiLex

open CompDesignBFM
Formal statement
namespace CompDesign

/-- The lexicographic potential increases, proof of Theorem 4.1, §4.1, p.17 (PDF 20) of Anagnostides et al., *Compensation Design*, arXiv:2607.14438 (version of November 3, 2026, sha256 3d305d4d…):
every strict unilateral improvement `S → S'` of `Γ^mc` strictly increases
`Φ′(S) = (Φ(S), −∑_{i∈S} c_i)` in the lexicographic order, where `Φ(S) = v(S) ∏_{i∈S} (1 − c_i/B)`.

**Formalization Note.** Assumption 3.1, `B > 0`, `c ≥ 0` and Theorem 4.1's `max_i c_i < B` are binders.
The order on `ℝ ×ₗ ℝ` is lexicographic. -/
theorem thm_4_1_potential_increases {n : ℕ} (v : Finset (Fin n) → ℝ) (B : ℝ) (c : Fin n → ℝ)
    (hB : 0 < B) (hv0 : v ∅ = 0) (hm : IsMonotoneSF v) (hs : IsSubmodularSF v)
    (hc : ∀ j, 0 ≤ c j) (hcB : ∀ j, c j < B) (S S' : Finset (Fin n))
    (h : IsStrictImprovement v B c S S') :
    PhiLex v B c S < PhiLex v B c S' := 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…), proof of Theorem 4.1, §4.1, p.17 (PDF 20)
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