Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equations (73)–(74): when delegation costs less

Proved
TeamDelegation.Optimal.cost_comparison

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

centralisationdelegationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1wage-cost

When ΔA≤ΔAcrit\Delta_A\le\Delta_A^{\mathrm{crit}}ΔA​≤ΔAcrit​, the first branch of A's delegated bonus applies. Under the standing assumptions and Assumption 1, total delegated success bonuses are strictly smaller than the optimal centralised total exactly when

wAdel+wBdel<2wcent⟺ΔA+ΔB<Δsum∗,Δsum∗=2e(p0−q0)p2−(1−δ)p1−δp0.w_A^{\mathrm{del}}+w_B^{\mathrm{del}}<2w^{\mathrm{cent}} \quad\Longleftrightarrow\quad \Delta_A+\Delta_B<\Delta_{\mathrm{sum}}^*,\qquad \Delta_{\mathrm{sum}}^*=\frac{2e(p_0-q_0)}{p_2-(1-\delta)p_1-\delta p_0}.wAdel​+wBdel​<2wcent⟺ΔA​+ΔB​<Δsum∗​,Δsum∗​=p2​−(1−δ)p1​−δp0​2e(p0​−q0​)​.

Because the desired outcome has success probability p2p_2p2​ under both organisations, this is also the principal's strict wage-cost comparison.

Preamble
import Mathlib
import Definitions.Def_TeamDelegation_Optimal_Model
Formal statement
namespace TeamDelegation.Optimal

/-- Equations (73)–(74), p. 39: in the first branch of A's wage,
delegation's total bonus is smaller exactly below the aggregate threshold. -/
theorem cost_comparison (P : Params) (hS : P.Standing)
    (hA1 : P.Assumption1) (ΔA ΔB : ℝ)
    (hbranch : ΔA ≤ DeltaCritA P) :
    wdelA P ΔA + wdelB P ΔB < 2 * wcent P ↔
      ΔA + ΔB < DeltaStarSum P := by sorry

end TeamDelegation.Optimal
Source
Upton, Implicit Incentives and Delegation in Teams, TRR 266 Working Paper No. 67 (SSRN 3991736, 17 Dec 2021), p. 39 (PDF 40), equations (73)–(74)
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