Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.1, pp. 15–16 — consumer welfare: WCF≥WCP>WCNW^F_C \ge W^P_C > W^N_CWCF​≥WCP​>WCN​

Proved
PermBlockchain.Failure.proposition_4_1

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

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

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 consumer welfare WCX=E[max⁡{uX,φ}]W_C^X=\mathbb E[\max\{u^X,\varphi\}]WCX​=E[max{uX,φ}] in the full, partial and non-adoption scenarios satisfies

WCF ≥ WCP > WCN.W^F_C\ \ge\ W^P_C\ >\ W^N_C .WCF​ ≥ WCP​ > WCN​.

Both forms of blockchain adoption therefore raise consumer welfare relative to non-adoption, and full adoption raises it at least as much as partial adoption. This is the consumer side of the welfare comparison behind Proposition 4.6.

Formalization Note WCXW_C^XWCX​ is the Bochner integral of φ↦max⁡{uX,φ}\varphi\mapsto\max\{u^X,\varphi\}φ↦max{uX,φ} against the law μ\muμ of the outside option, with Proposition A.1's utilities uF=uP=H+h−γu^F=u^P=H+h-\gammauF=uP=H+h−γ and uN=H+L+h+l2−γu^N=\frac{H+L+h+l}2-\gammauN=2H+L+h+l​−γ; the finite mean of φ\varphiφ (a standing assumption) makes it a genuine expectation.

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

open MeasureTheory

/-- **Proposition 4.1** (p. 15–16): consumer welfare satisfies `W^F_C ≥ W^P_C > W^N_C`. -/
theorem proposition_4_1 {m : ℕ} (M : Model m) (hM : M.Standing) (Δ : ℝ) (hΔ : 0 < Δ)
    (hA : M.Assumption1 Δ) :
    M.WC .P Δ ≤ M.WC .F Δ ∧ M.WC .N Δ < M.WC .P Δ := by sorry

end PermBlockchain.Failure
Source
Iyengar, Saleh, Sethuraman, Wang, Economics of Permissioned Blockchain Adoption, SSRN 3602376 (version of 2022-08-19), pp. 15–16, Proposition 4.1
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