Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.3, p. 17 — manufacturer welfare: WMF<WMP<WMNW^F_M < W^P_M < W^N_MWMF​<WMP​<WMN​

Proved
PermBlockchain.Failure.proposition_4_3

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

blockchainmanufacturer-welfarep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the reduced-form blockchain supply chain under its standing assumptions. The manufacturer welfare WMX=∑i∈M(Π(aiX,a−iX)−χiaiX)W_M^X=\sum_{i\in M}(\Pi(a^X_i,a^X_{-i})-\chi_i a^X_i)WMX​=∑i∈M​(Π(aiX​,a−iX​)−χi​aiX​) in the full, partial and non-adoption scenarios satisfies

WMF < WMP < WMN.W^F_M\ <\ W^P_M\ <\ W^N_M .WMF​ < WMP​ < WMN​.

Since price competition leaves every manufacturer with zero gross profit, adoption only adds the adoption costs χi\chi_iχi​; the more manufacturers adopt, the lower their aggregate welfare.

Formalization Note The gross profit Π\PiΠ is the constant 000, the outcome of Proposition A.1 that the paper's proof of this proposition (p. 34) invokes; the paper's display (11) is read, as in that proof, at the scenario's fixed adoption profile.

Preamble
import Mathlib
import Definitions.Def_agt_games
import Definitions.Def_PermBlockchain_Failure_Setting
Formal statement
namespace PermBlockchain.Failure

/-- **Proposition 4.3** (p. 17): manufacturer welfare satisfies `W^F_M < W^P_M < W^N_M`. -/
theorem proposition_4_3 {m : ℕ} (M : Model m) (hM : M.Standing) :
    M.WM .F < M.WM .P ∧ M.WM .P < M.WM .N := by sorry

end PermBlockchain.Failure
Source
Iyengar, Saleh, Sethuraman, Wang, Economics of Permissioned Blockchain Adoption, SSRN 3602376 (version of 2022-08-19), p. 17, Proposition 4.3
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 15, 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