Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma OA5 — both buyers audit their independent suppliers iff K<KuMK < K^M_uK<KuM​

Proved
SupplierAudit.Competition.lemma_OA5

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

auditingequilibriump2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Assume the buyers compete, β∈(0,1]\beta \in (0,1]β∈(0,1], and the interior-effort assumption e^I<1\hat e_I < 1e^I​<1. Let KuMK^M_uKuM​ be the threshold (OA-10). Then:

  1. for every fixed cost 0≤K<KuM0 \le K < K^M_u0≤K<KuM​, the profile in which each buyer audits his independent supplier with effort eI∗e^*_IeI∗​ (eq. (1)), ((eI∗,0),(eI∗,0))\big((e^*_I,0),(e^*_I,0)\big)((eI∗​,0),(eI∗​,0)), is an equilibrium;
  2. for every K≥KuMK \ge K^M_uK≥KuM​, no profile ((x,0),(y,0))\big((x,0),(y,0)\big)((x,0),(y,0)) with x,y>0x, y > 0x,y>0, in which each buyer audits his independent supplier, is an equilibrium.

This is the first of the three ingredients of Proposition 2: the "both audit independent suppliers" equilibrium exists exactly below KuMK^M_uKuM​.

Formalization Note The paper says "there exists a threshold KuMK^M_uKuM​"; the statement uses the threshold the proof defines in (OA-10), which is stronger. Equilibria follow the paper's tie-breaking rule. The interior-effort assumption of p. 10 is encoded as e^I<1\hat e_I < 1e^I​<1.

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

theorem lemma_OA5 (P : Params) (hβ : 0 < P.β) (hint : eHatI P < 1) :
    (∀ K : ℝ, 0 ≤ K → K < KMu P → IsEquilibrium P K (eStarI P, 0) (eStarI P, 0)) ∧
    (∀ K : ℝ, KMu P ≤ K → ∀ x y : ℝ, 0 < x → 0 < y → ¬ IsEquilibrium P K (x, 0) (y, 0)) := by sorry

end SupplierAudit.Competition
Source
Chen, Qi, Dawande, Supplier Centrality and Auditing Priority in Socially-Responsible Supply Chains, accepted manuscript (SSRN 2889889), Lemma OA5 and (OA-10), p. ec8 (PDF 36)
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