Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix A.4, pp. 25–26 — pointwise doubled-linear-payoff bound

Proved
PESContracts.Linear.pointwise_dominance

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

approximationcontract-designlinear-contractsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

For a0,h,k>0a_0,h,k>0a0​,h,k>0, any type θ∈[0,1]\theta\in[0,1]θ∈[0,1], and any conservation action a∈[0,a0]a\in[0,a_0]a∈[0,a0​], the rent-free surplus is at most twice the principal's payoff from the linear price k/2k/2k/2 at that type:

ka−ch(a−θa0)≤2(k−k/2)min⁡{θa0+k/(2h),a0}.k a-c_h(a-\theta a_0) \leq 2\bigl(k-k/2\bigr) \min\{\theta a_0+k/(2h),a_0\}.ka−ch​(a−θa0​)≤2(k−k/2)min{θa0​+k/(2h),a0​}.

This typewise comparison supplies the distribution-free inequality needed for Theorem 1.

Formalization Note Appendix A.4 compares the paper's optimal allocation with the linear action. The stated bound holds for every feasible action and therefore includes that allocation. Weak inequality includes boundary types and prices where equality occurs.

Preamble
import Mathlib
import Definitions.Def_PESContracts_Linear_Model
Formal statement
namespace PESContracts.Linear

/-- Appendix A.4, pp. 25–26: doubled linear payoff bounds rent-free surplus. -/
theorem pointwise_dominance (M : Params) (hM : M.Standing) (k : ℝ) (hk : 0 < k)
    (θ : ℝ) (hθ : θ ∈ Set.Icc 0 1) (a : ℝ) (ha : a ∈ Set.Icc 0 M.a0) :
    k * a - cost M.h (a - θ * M.a0) ≤
      2 * ((k - k / 2) * linAction M (k / 2) θ) := by sorry

end PESContracts.Linear
Source
Li, Ashlagi & Lo, Simple and Approximately Optimal Contracts for Payment for Ecosystem Services, SSRN preprint 3754041 (version of 2021-05-19), pp. 25–26, Appendix A.4, cases (i)–(vi) and closing paragraph; https://ssrn.com/abstract=3754041
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

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