Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.7, p. 19 — neither full nor partial adoption is an equilibrium

Proved
PermBlockchain.Failure.proposition_4_7

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

adoption-failureblockchainequilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the reduced-form blockchain supply chain under its standing assumptions. In the adoption game (8), where manufacturer iii chooses ai∈{0,1}a_i\in\{0,1\}ai​∈{0,1} and receives

Π(ai,a−i)−χiai,\Pi(a_i,a_{-i})-\chi_i a_i ,Π(ai​,a−i​)−χi​ai​,

neither the full adoption profile (ai=1a_i=1ai​=1 for all iii) nor the partial adoption profile (ai=1a_i=1ai​=1 exactly when ξi=h\xi_i=hξi​=h) is a pure Nash equilibrium.

Because price competition leaves no gross profit to recoup the adoption cost, an adopter always gains by withdrawing. This is the equilibrium half of the adoption failure of Proposition 4.8.

Formalization Note The gross profit Π\PiΠ is the constant 000 in every subgame, the outcome of Proposition A.1 used in the paper's proof (p. 36); the signalling and pricing game behind Proposition A.1 is not formalized. Equilibrium is AGT.IsPureNash over unilateral switches of aia_iai​.

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

/-- **Proposition 4.7** (p. 19): neither full nor partial adoption is an equilibrium of the
adoption game (8). -/
theorem proposition_4_7 {m : ℕ} (M : Model m) (hM : M.Standing) :
    ¬ M.IsEquilibrium Scenario.F.profile ∧ ¬ M.IsEquilibrium Scenario.P.profile := by sorry

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