Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(OA-14), (OA-15) — the gain from auditing and the best response decrease in e22e_{22}e22​; e^I>eI∗\hat e_I > e^*_Ie^I​>eI∗​

Proved
SupplierAudit.Competition.oa14_oa15

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

auditingcomparative-staticsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Assume the buyers compete, β∈(0,1]\beta \in (0,1]β∈(0,1]. Then:

  1. for every e11∈(0,1]e_{11} \in (0,1]e11​∈(0,1], buyer B1B_1B1​'s gain from auditing S1S_1S1​ with effort e11e_{11}e11​ rather than auditing nothing,
e22↦Π1b(e11,0;e22,0)∣K=0−Π1b(0,0;e22,0),e_{22} \mapsto \Pi^b_1(e_{11},0;e_{22},0)\big|_{K=0} - \Pi^b_1(0,0;e_{22},0),e22​↦Π1b​(e11​,0;e22​,0)​K=0​−Π1b​(0,0;e22​,0),

is strictly decreasing on [0,1][0,1][0,1] (the rival's effort on his own supplier makes auditing less valuable, (OA-14)); 2. the best-response function e11∗(e22)e^*_{11}(e_{22})e11∗​(e22​) of (OA-9) is strictly decreasing; 3. consequently e^I>eI∗\hat e_I > e^*_Ie^I​>eI∗​ (OA-15).

These monotonicity facts are what order the three thresholds in Lemma OA7.

Formalization Note The page displays the two derivatives; only their sign is stated here. The printed derivative of e11∗(e22)e^*_{11}(e_{22})e11∗​(e22​) omits a factor 1/a1/a1/a; the sign is unaffected.

Preamble
import Mathlib
import Definitions.Def_SupplierAudit_Competition_Model
Formal statement
namespace SupplierAudit.Competition

theorem oa14_oa15 (P : Params) (hβ : 0 < P.β) :
    (∀ e11 ∈ Set.Ioc (0 : ℝ) 1,
      StrictAntiOn (fun e22 => expProfit₁ P 0 e11 0 e22 0 - expProfit₁ P 0 0 0 e22 0)
        (Set.Icc (0 : ℝ) 1)) ∧
    StrictAnti (bestResp P) ∧
    eStarI P < eHatI P := by sorry

end SupplierAudit.Competition
Source
Chen, Qi, Dawande, Supplier Centrality and Auditing Priority in Socially-Responsible Supply Chains, accepted manuscript (SSRN 2889889), proof of Lemma OA7, (OA-14), (OA-15), p. ec10 (PDF 38)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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