Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(56), p. 32 (PDF 34) — clamped effort minimizes net effort cost

Proved
HedgeContract.OPE.eq_56

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

convex-optimizationdynamic-contractingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1principal-agentstochastic-control

Let κ>0\kappa>0κ>0 and A‾≤A‾\underline A\le\overline AA​≤A. For every sensitivity Z∈RZ\in\mathbb RZ∈R, the clamped response A∗(Z)A^*(Z)A∗(Z) in equation (56) belongs to [A‾,A‾][\underline A,\overline A][A​,A] and satisfies

h(A∗(Z))−ZA∗(Z)≤h(A)−ZAfor every A∈[A‾,A‾].h(A^*(Z))-ZA^*(Z)\le h(A)-ZA\qquad\text{for every }A\in[\underline A,\overline A].h(A∗(Z))−ZA∗(Z)≤h(A)−ZAfor every A∈[A​,A].

Thus the formula defining A∗A^*A∗ really gives the manager's constrained best response; later results may use the same response without reintroducing the minimization problem.

Formalization Note. The endpoint cases agree because h′(A)=κA+bh'(A)=\kappa A+bh′(A)=κA+b.

Preamble
import Mathlib
import Definitions.Def_HedgeContract_OPE_Model
set_option autoImplicit false
Formal statement
namespace HedgeContract.OPE
open MeasureTheory Filter Topology
open scoped ENNReal NNReal

/-- Equation (56): the clamped effort is a minimizer of the net effort cost. -/
theorem eq_56 (P : Params) (Z : ℝ) (hκ : 0 < P.κ) (hA : P.Alo ≤ P.Ahi) :
    Astar P Z ∈ Set.Icc P.Alo P.Ahi ∧
      ∀ A ∈ Set.Icc P.Alo P.Ahi,
        h P (Astar P Z) - Z * Astar P Z ≤ h P A - Z * A := by sorry

end HedgeContract.OPE
Source
Huang, Ju & Xing, Optimal Contracting with Unobservable Managerial Hedging, working paper (Nov. 14, 2017), p. 32 (PDF 34), §6.6, equation (56)
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

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