Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma OA11 — for K<K~K<\tilde KK<K~, auditing S1S_1S1​ and ScS_cSc​ beats auditing ScS_cSc​ alone

Proved
SupplierAudit.Joint.lemma_OA11

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

auditingjoint-auditingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1supply-chain

Consider the joint-auditing coalition with competing buyers (0<β≤10<\beta\le10<β≤1), in the Sec. 4.3 scenario πb(0,0)≥πb(dM,0)≥πb(dM,dM)≥πb(2dM,dM)≥πb(2dM,2dM)\pi^b(0,0)\ge\pi^b(d_M,0)\ge\pi^b(d_M,d_M)\ge\pi^b(2d_M,d_M)\ge\pi^b(2d_M,2d_M)πb(0,0)≥πb(dM​,0)≥πb(dM​,dM​)≥πb(2dM​,dM​)≥πb(2dM​,2dM​). Let Πb(ec1,ecc,ec2)\Pi^b(e_{c1},e_{cc},e_{c2})Πb(ec1​,ecc​,ec2​) be its aggregate expected profit, and let

K~=max⁡(y,z)∈[0,1]2Πb(y,z,0)∣K=0−max⁡y∈[0,1]Πb(0,y,0)∣K=0.\tilde K=\max_{(y,z)\in[0,1]^2}\Pi^b(y,z,0)\big|_{K=0}-\max_{y\in[0,1]}\Pi^b(0,y,0)\big|_{K=0}.K~=(y,z)∈[0,1]2max​Πb(y,z,0)​K=0​−y∈[0,1]max​Πb(0,y,0)​K=0​.

Then K~≥0\tilde K\ge0K~≥0. Moreover, if 0≤K<K~0\le K<\tilde K0≤K<K~, there are efforts y,z∈(0,1]y,z\in(0,1]y,z∈(0,1] such that

Πb(0,y′,0)<Πb(y,z,0)for every y′∈(0,1].\Pi^b(0,y',0)<\Pi^b(y,z,0)\qquad\text{for every }y'\in(0,1].Πb(0,y′,0)<Πb(y,z,0)for every y′∈(0,1].

In words: when the fixed cost is below K~\tilde KK~, some plan that audits both S1S_1S1​ and the common supplier is strictly better than every plan that audits the common supplier alone.

Formalization Note "Jointly audit" means a positive effort on each audited supplier, so both sides of the comparison range over positive efforts ((0,1](0,1](0,1]), and each pays the fixed cost once per audited supplier. The threshold is the one defined in the paper's proof.

Preamble
import Mathlib
import Definitions.Def_SupplierAudit_Joint_Model
Formal statement
namespace SupplierAudit.Joint

/-- Lemma OA11, p. ec12: with `K̃` as defined in its proof, `K̃ ≥ 0`, and for `0 ≤ K < K̃` some joint
audit of `S₁` and `S_c` (both efforts positive) is strictly better than every joint audit of `S_c`
alone (positive effort). -/
theorem lemma_OA11 (P : SupplierAudit.Competition.Params) (hβ : 0 < P.β) (hscen : Scenario P) :
    0 ≤ Ktilde P ∧
    ∀ K : ℝ, 0 ≤ K → K < Ktilde P →
      ∃ y ∈ Set.Ioc (0 : ℝ) 1, ∃ z ∈ Set.Ioc (0 : ℝ) 1, ∀ y' ∈ Set.Ioc (0 : ℝ) 1,
        aggProfit P K (0, y', 0) < aggProfit P K (y, z, 0) := by sorry

end SupplierAudit.Joint
Source
Chen, Qi, Dawande, Supplier Centrality and Auditing Priority in Socially-Responsible Supply Chains, accepted manuscript (SSRN 2889889), Lemma OA11 and its proof, p. ec12 (PDF 40); scenario of Sec. 4.3, p. 13
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