Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1, p. 17 — with traditional sales the optimum serves the whole market at p = ((Θ−1)/Θ)x, with payoff ((Θ−1)/Θ)x

Proved
UtilityTokens.ICOChoice.proposition_1

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

monopoly-pricingnetwork-effectsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-discriminationutility-tokens

Let Θ∈(1,3]\Theta\in(1,3]Θ∈(1,3] and x>0x>0x>0. Under traditional sales the entrepreneur chooses a threshold θˉ∈[1,Θ]\bar\theta\in[1,\Theta]θˉ∈[1,Θ] and earns XT(θˉ)=p1TQ(p1T)X_T(\bar\theta)=p^T_1Q(p^T_1)XT​(θˉ)=p1T​Q(p1T​). Then:

  1. the maximal profit is attained and equals Θ−1Θx\frac{\Theta-1}{\Theta}xΘΘ−1​x;
  2. it is attained only at θˉ=1\bar\theta=1θˉ=1 (the whole market is served);
  3. the equilibrium price is p1T=v=Θ−1Θxp^T_1=v=\frac{\Theta-1}{\Theta}xp1T​=v=ΘΘ−1​x;
  4. the optimal payoff is
XT∗=Θ−1Θ x.X^*_T=\frac{\Theta-1}{\Theta}\,x .XT∗​=ΘΘ−1​x.

Network effects remove the monopolist's incentive to price-discriminate when the spread of types is limited; this is the benchmark against which the ICO is compared.

Formalization Note XT∗X^*_TXT∗​ is the supremum of the profit over θˉ∈[1,Θ]\bar\theta\in[1,\Theta]θˉ∈[1,Θ]; the first item pins it as an attained maximum.

Preamble
import Mathlib
import Definitions.Def_UtilityTokens_ICOChoice_Setting
Formal statement
namespace UtilityTokens.ICOChoice

theorem proposition_1 (Θ x : ℝ) (hΘ1 : 1 < Θ) (hΘ3 : Θ ≤ 3) (hx : 0 < x) :
    IsGreatest (profitT Θ x '' Set.Icc 1 Θ) ((Θ - 1) / Θ * x) ∧
    (∀ θbar ∈ Set.Icc 1 Θ, profitT Θ x θbar = (Θ - 1) / Θ * x → θbar = 1) ∧
    thresholdPrice Θ x 1 = (Θ - 1) / Θ * x ∧
    optPayoffT Θ x = (Θ - 1) / Θ * x := by sorry

end UtilityTokens.ICOChoice
Source
Shakhnov & Zaccaria, Utility Tokens, Network Effects, and Pricing Power, SSRN working paper 3613261 (PDF of 2023-04-23), p. 17, Proposition 1, displays (4)–(6)
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

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