Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4, p. 17 (PDF 19), corrected reading — FU beats 0, U and F iff (F) and (U)

Proved
LeaderStyle.WageFloor.lemma_4

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

incentive-contractsleadershipmoral-hazardp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1wage-floor

Under the corrected reading of Lemma 4, style FU is strictly cheaper than each of pure monetary incentives, conditional praise, and conditional scolding exactly when both (F) and (U) hold:

(CFU<C0 ∧ CFU<CU ∧ CFU<CF)  ⟺  (kFh<r ∧ (U)).\bigl(C_{FU}<C_0\ \wedge\ C_{FU}<C_U\ \wedge\ C_{FU}<C_F\bigr)\iff\bigl(k_F^h<r\ \wedge\ (U)\bigr).(CFU​<C0​ ∧ CFU​<CU​ ∧ CFU​<CF​)⟺(kFh​<r ∧ (U)).

These conditions imply noncompetitive wage-setting, u‾<w‾\underline u<\underline wu​<w​. The result combines the two strict improvement tests used in the optimal-style classification.

Formalization Note The printed first sentence alone, CFU<C0C_{FU}<C_0CFU​<C0​ iff (F) and (U), is false: with ρ=1/2\rho=1/2ρ=1/2, c=10c=10c=10, r=5r=5r=5, s=1s=1s=1, all leadership costs 111, u‾=0\underline u=0u​=0, w‾=−10\underline w=-10w​=−10, and u‾l=0\underline u_l=0u​l​=0, one has CFU=9<C0=10C_{FU}=9<C_0=10CFU​=9<C0​=10 while (U) fails. The formal item follows the preceding §4.4 paragraph, which compares FU with all three alternatives. The printed rent and welfare clauses are outside this item.

Preamble
import Mathlib
import Definitions.Def_LeaderStyle_WageFloor_Model
Formal statement
namespace LeaderStyle.WageFloor

theorem lemma_4 (P : Params) (hS : P.Standing) :
    ((Prefers P .FU .none ∧ Prefers P .FU .U ∧ Prefers P .FU .F) ↔
      (condF P ∧ condU P)) ∧
      (condF P ∧ condU P → P.ur < P.wf) := by sorry
end LeaderStyle.WageFloor
Source
Dur, Kvaløy & Schöttner, Leadership Styles and Labor-Market Conditions, CRC TRR 190 Discussion Paper No. 278 (26 Feb 2021), p. 17 (PDF 19), Lemma 4, p. 17 (PDF 19), corrected reading
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