Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1, p. 12 — the enforcer's optimal efforts e₁, e₀ given the conjectured audit quality, with e₁ > e₀ and e₀ < 1

Proved
AuditWhistle.Intensity.enforcer_best_response

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

auditingbest-responsep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1whistleblowing

Fix a model with 0<p<10<p<10<p<1, 12<β<1\tfrac12<\beta<121​<β<1, positive R,γ,D,kR,\gamma,D,kR,γ,D,k and R/γ<1/(1−p)R/\gamma<1/(1-p)R/γ<1/(1−p), an intensity τ∈(0,1)\tau\in(0,1)τ∈(0,1) and a conjectured audit quality a^∈(0,1)\hat a\in(0,1)a^∈(0,1). Let the enforcer's posteriors Pr⁡(B∣g,W1)\Pr(B\mid g,W_1)Pr(B∣g,W1​), Pr⁡(B∣g,W0)\Pr(B\mid g,W_0)Pr(B∣g,W0​) be computed by Bayes' rule, and call e∈[0,1]e\in[0,1]e∈[0,1] a best response at posterior qqq if it maximizes qeR−12γe2qeR-\tfrac12\gamma e^2qeR−21​γe2 over [0,1][0,1][0,1]. Then:

  1. the best response after a tip is unique and equals
e1=min⁡{1, Rγ (1−p)(1−a^)β(1−p)(1−a^)β+p(1−β)};e_1=\min\Big\{1,\ \frac{R}{\gamma}\,\frac{(1-p)(1-\hat a)\beta}{(1-p)(1-\hat a)\beta+p(1-\beta)}\Big\};e1​=min{1, γR​(1−p)(1−a^)β+p(1−β)(1−p)(1−a^)β​};
  1. the best response after silence is unique and equals
e0=Rγ (1−p)(1−a^)(1−βτ)(1−p)(1−a^)(1−βτ)+p [1−(1−β)τ];e_0=\frac{R}{\gamma}\,\frac{(1-p)(1-\hat a)(1-\beta\tau)}{(1-p)(1-\hat a)(1-\beta\tau)+p\,[1-(1-\beta)\tau]};e0​=γR​(1−p)(1−a^)(1−βτ)+p[1−(1−β)τ](1−p)(1−a^)(1−βτ)​;
  1. e1>e0e_1>e_0e1​>e0​;
  2. Pr⁡(B∣g,W0)<1−p\Pr(B\mid g,W_0)<1-pPr(B∣g,W0​)<1−p;
  3. e0<1e_0<1e0​<1.

These are the enforcer's reaction functions used in the equilibrium of Proposition 1.

Formalization Note Effort is restricted to [0,1][0,1][0,1], which is where the min⁡{1,⋅}\min\{1,\cdot\}min{1,⋅} comes from; no min⁡\minmin is needed for e0e_0e0​ because R/γ<1/(1−p)R/\gamma<1/(1-p)R/γ<1/(1−p) and item 4 give e0<1e_0<1e0​<1.

Preamble
import Mathlib
import Definitions.Def_AuditWhistle_Intensity_Setting
Formal statement
namespace AuditWhistle.Intensity

theorem enforcer_best_response (M : Model) (τ â : ℝ) (hτ : τ ∈ Set.Ioo (0:ℝ) 1)
    (hâ : â ∈ Set.Ioo (0:ℝ) 1) :
    (∀ e : ℝ, IsEnforcerBR M (postW1 M τ â) e ↔
      e = min 1 (M.R / M.γ * ((1 - M.p) * (1 - â) * M.β /
        ((1 - M.p) * (1 - â) * M.β + M.p * (1 - M.β))))) ∧
    (∀ e : ℝ, IsEnforcerBR M (postW0 M τ â) e ↔
      e = M.R / M.γ * ((1 - M.p) * (1 - â) * (1 - M.β * τ) /
        ((1 - M.p) * (1 - â) * (1 - M.β * τ) + M.p * (1 - (1 - M.β) * τ)))) ∧
    (∀ e1 e0 : ℝ, IsEnforcerBR M (postW1 M τ â) e1 → IsEnforcerBR M (postW0 M τ â) e0 →
      e0 < e1) ∧
    postW0 M τ â < 1 - M.p ∧
    (∀ e0 : ℝ, IsEnforcerBR M (postW0 M τ â) e0 → e0 < 1) := by sorry

end AuditWhistle.Intensity
Source
Nan, Tang & Ye, Auditing with a Chance of Whistleblowing, author manuscript dated December 30, 2024 (Management Science, DOI 10.1287/mnsc.2024.04808), p. 12, §3.1, display after (3)
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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