Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma OA10 — auditing ScS_cSc​ and one independent supplier beats auditing both independent suppliers

Proved
SupplierAudit.Joint.lemma_OA10

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. For every fixed cost K≥0K\ge0K≥0 and all efforts y,z∈[0,1]y,z\in[0,1]y,z∈[0,1], there are efforts y′,z′∈[0,1]y',z'\in[0,1]y′,z′∈[0,1] with

Πb(y,0,z)≤Πb(y′,z′,0).\Pi^b(y,0,z)\le\Pi^b(y',z',0).Πb(y,0,z)≤Πb(y′,z′,0).

That is, whatever the coalition earns by auditing both independent suppliers, it earns at least as much by auditing the common supplier together with one independent supplier. With Lemma OA9, this reduces the coalition's choice to three candidate plans: audit S1S_1S1​ and ScS_cSc​, audit ScS_cSc​ only, or audit nothing.

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

/-- Lemma OA10, p. ec11: jointly auditing the common supplier and an independent supplier is at
least as good as jointly auditing both independent suppliers. -/
theorem lemma_OA10 (P : SupplierAudit.Competition.Params) (hβ : 0 < P.β) (hscen : Scenario P) (K : ℝ) (hK : 0 ≤ K) :
    ∀ y ∈ Set.Icc (0 : ℝ) 1, ∀ z ∈ Set.Icc (0 : ℝ) 1,
      ∃ y' ∈ Set.Icc (0 : ℝ) 1, ∃ z' ∈ Set.Icc (0 : ℝ) 1,
        aggProfit P K (y, 0, z) ≤ 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 OA10, p. ec11 (PDF 39), 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