Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, p. 10 — binding participation gives reduced payoff (6)

Proved
OpRiskInspection.RandomVsPeriodic.reduction_6

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

inspectionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1payoffprincipal-agent

Fix the paper's standing parameters, an inspection cost K>0K>0K>0, a frequency v>0v>0v>0, an inspection-interval law FFF, a penalty PPP, a wage www, and an optimal effort path aaa. If the agent's participation constraint binds, πF(a;P,w)=πˉ\pi_F(a;P,w)=\bar\piπF​(a;P,w)=πˉ, then the principal's payoff (3) equals the reduced payoff (6):

ΠF(v,P,w;a)=VF(v,P;a).\Pi_F(v,P,w;a)=V_F(v,P;a).ΠF​(v,P,w;a)=VF​(v,P;a).

This equality removes the wage from the principal's objective at a binding feasible strategy and is the algebraic reduction used in the policy comparisons.

Formalization Note The statement gives the equality under binding participation. The preceding prose's claim that every optimum binds is a separate optimization claim, not assumed here.

Preamble
import Mathlib
import Definitions.Def_OpRiskInspection_RandomVsPeriodic_Setting
Formal statement
namespace OpRiskInspection.RandomVsPeriodic

/-- Equation (6), p. 10, under the binding participation constraint (5). -/
theorem reduction_6 (p : Params) (hp : Standing p) (K v P w : ℝ)
    (F : MeasureTheory.Measure ℝ) (a : Effort)
    (hv : 0 < v) (hK : 0 < K) (ha : AgentOptimal p F P a)
    (hbind : agentPayoff p F a P w = p.pibar) :
    principalPayoff p K v F a P w = reducedPayoff p K v F a := by sorry

end OpRiskInspection.RandomVsPeriodic
Source
Kim & Xu, Operational Risk Management: Optimal Inspection Policy, SSRN 3491006 (version of July 2023), p. 10, §3.2 and (6)
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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