Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.4, p. 17 — vendor welfare: WVF,WVP<WVNW^F_V, W^P_V < W^N_VWVF​,WVP​<WVN​

Proved
PermBlockchain.Failure.proposition_4_4

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

blockchainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1vendor-welfare

Consider the reduced-form blockchain supply chain under its standing assumptions, with H=L+ΔH=L+\DeltaH=L+Δ for some Δ>0\Delta>0Δ>0, and suppose Assumption 1 holds at Δ\DeltaΔ. The vendor welfare

WVX=(ΨhshX−γshX)+(ΨlXslX−cl(slX))W_V^X=(\Psi_h s^X_h-\gamma s^X_h)+(\Psi^X_l s^X_l-c_l(s^X_l))WVX​=(Ψh​shX​−γshX​)+(ΨlX​slX​−cl​(slX​))

in the three scenarios satisfies

WVF<WVNandWVP<WVN.W^F_V<W^N_V\qquad\text{and}\qquad W^P_V<W^N_V .WVF​<WVN​andWVP​<WVN​.

Adoption reveals the low type goods, whose manufacturers cut the price they pay the low type vendor; the vendors lose from adoption.

Formalization Note Prices and shares are Proposition A.1's closed forms, with (cl′)−1(x)=sup⁡{s≥0:cl′(s)≤x}(c_l')^{-1}(x)=\sup\{s\ge0:c_l'(s)\le x\}(cl′​)−1(x)=sup{s≥0:cl′​(s)≤x}, which is 000 below cl′(0)c_l'(0)cl′​(0) as on p. 28. No second derivative of clc_lcl​ is assumed (the printed proof uses cl′′c_l''cl′′​; the statement does not need it).

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

/-- **Proposition 4.4** (p. 17): vendor welfare satisfies `W^F_V, W^P_V < W^N_V`. -/
theorem proposition_4_4 {m : ℕ} (M : Model m) (hM : M.Standing) (Δ : ℝ) (hΔ : 0 < Δ)
    (hA : M.Assumption1 Δ) :
    M.WV .F Δ < M.WV .N Δ ∧ M.WV .P Δ < M.WV .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.4
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