Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(OA-11) — auditing ScS_cSc​ is beaten by auditing S1S_1S1​ with the same effort

Proved
SupplierAudit.Competition.oa11_common_dominated

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

auditinggame-theoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Assume the buyers compete, β∈(0,1]\beta \in (0,1]β∈(0,1]. For every fixed cost KKK, every effort e1∈(0,1]e_1 \in (0,1]e1​∈(0,1] and every effort e2∈[0,1]e_2 \in [0,1]e2​∈[0,1] of buyer B2B_2B2​ on his independent supplier,

Π1b(e1,0;e2,0)−Π1b(0,e1;e2,0)>0.\Pi^b_1(e_1,0;e_2,0) - \Pi^b_1(0,e_1;e_2,0) > 0 .Π1b​(e1​,0;e2​,0)−Π1b​(0,e1​;e2​,0)>0.

When the rival audits his independent supplier (or nobody), a buyer who audits the common supplier would do strictly better auditing his own independent supplier with the same effort: an audit of ScS_cSc​ also protects the competitor. This is how the common supplier is excluded from the equilibria of Proposition 2.

Formalization Note Only the conclusion of (OA-11) is stated. The page's closed-form evaluation of the difference has a misprint: the prefactor of its second term should be β(w^−w)\beta(\hat w - w)β(w^−w), not β(dM+w^−w)\beta(d_M + \hat w - w)β(dM​+w^−w); the sign of the difference is unaffected. Both sides pay the same audit cost, so the difference does not depend on KKK.

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

theorem oa11_common_dominated (P : Params) (hβ : 0 < P.β) (K e₁ e₂ : ℝ)
    (h₁ : e₁ ∈ Set.Ioc (0 : ℝ) 1) (h₂ : e₂ ∈ Set.Icc (0 : ℝ) 1) :
    0 < expProfit₁ P K e₁ 0 e₂ 0 - expProfit₁ P K 0 e₁ e₂ 0 := 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 OA5 (b), (OA-11), p. ec8 (PDF 36) and p. ec9 (PDF 37)
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