Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Prop. 3, part (2) — the coalition's optimal audit set for K<KcLK<K^L_cK<KcL​, KcL≤K<KcHK^L_c\le K<K^H_cKcL​≤K<KcH​, K≥KcHK\ge K^H_cK≥KcH​

Proved
SupplierAudit.Joint.prop3_thresholds

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

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

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 K^\hat KK^ and K~\tilde KK~ be the thresholds of Lemmas OA9 and OA11, and set

KcL=min⁡{K^+K~2,K~},KcH=max⁡{K^+K~2,K^}.K^L_c=\min\Big\{\frac{\hat K+\tilde K}{2},\tilde K\Big\},\qquad K^H_c=\max\Big\{\frac{\hat K+\tilde K}{2},\hat K\Big\}.KcL​=min{2K^+K~​,K~},KcH​=max{2K^+K~​,K^}.

Feasible joint plans (ec1,ecc,ec2)∈[0,1]3(e_{c1},e_{cc},e_{c2})\in[0,1]^3(ec1​,ecc​,ec2​)∈[0,1]3 audit at most two suppliers. For every fixed cost K≥0K\ge0K≥0:

  1. if K<KcLK<K^L_cK<KcL​, some maximizer of the coalition's aggregate profit over the feasible plans has ec1>0e_{c1}>0ec1​>0, ecc>0e_{cc}>0ecc​>0, ec2=0e_{c2}=0ec2​=0, and at it ΔΠ>0\Delta\Pi>0ΔΠ>0;
  2. if KcL≤K<KcHK^L_c\le K<K^H_cKcL​≤K<KcH​, some maximizer has ec1=0e_{c1}=0ec1​=0, ecc>0e_{cc}>0ecc​>0, ec2=0e_{c2}=0ec2​=0, and at it ΔΠ=0\Delta\Pi=0ΔΠ=0;
  3. if K≥KcHK\ge K^H_cK≥KcH​, the plan that audits no supplier is a maximizer.

This is the structural half of Proposition 3, with the thresholds given explicitly.

Formalization Note "Yields the highest aggregate profit" is read as "some maximizer has this pattern". The proof compares candidate plans by weak inequalities, so uniqueness of the maximizer is not claimed. The paper's convention that S1S_1S1​ (not S2S_2S2​) is the audited independent supplier is the choice of the maximizer in case 1: its mirror image, which audits S2S_2S2​ and ScS_cSc​, has ΔΠ<0\Delta\Pi<0ΔΠ<0.

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

/-- Proof of Proposition 3, part (2), p. ec13: with `K^L_c = min{(K̂+K̃)/2, K̃}` and
`K^H_c = max{(K̂+K̃)/2, K̂}`, the coalition's optimal plan audits `S₁` and `S_c` (with `∆Π > 0`) for
`K < K^L_c`, only `S_c` (with `∆Π = 0`) for `K^L_c ≤ K < K^H_c`, and no supplier for `K ≥ K^H_c`. -/
theorem prop3_thresholds (P : SupplierAudit.Competition.Params) (hβ : 0 < P.β) (hscen : Scenario P) (K : ℝ) (hK : 0 ≤ K) :
    (K < KcL P → ∃ x ∈ Feasible, IsMaxOn (aggProfit P K) Feasible x ∧
        0 < x.1 ∧ 0 < x.2.1 ∧ x.2.2 = 0 ∧ 0 < deltaPi P x) ∧
    (KcL P ≤ K → K < KcH P → ∃ x ∈ Feasible, IsMaxOn (aggProfit P K) Feasible x ∧
        x.1 = 0 ∧ 0 < x.2.1 ∧ x.2.2 = 0 ∧ deltaPi P x = 0) ∧
    (KcH P ≤ K → IsMaxOn (aggProfit P K) Feasible (0, 0, 0)) := by sorry

end SupplierAudit.Joint
Source
Chen, Qi, Dawande, Supplier Centrality and Auditing Priority in Socially-Responsible Supply Chains, accepted manuscript (SSRN 2889889), proof of Proposition 3, part (2), pp. ec13–ec14 (PDF 41–42); Proposition 3, pp. 13–14
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