Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.2, pp. 21–22 — the ICO problem reduces to an attained maximum over θ̄ ∈ [1, Θ]

Proved
UtilityTokens.ICOChoice.reduced_ico_problem

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\Theta>1Θ>1, x>0x>0x>0 and f∈Rf\in\mathbb Rf∈R. For every threshold θˉ∈[1,Θ]\bar\theta\in[1,\Theta]θˉ∈[1,Θ], the ICO profit at the late price p1I=vp^I_1=vp1I​=v equals

XI(θˉ,v)=[Θ−θˉΘ x][Θ−θˉΘ(θˉ−1)+1]−f.X_I(\bar\theta,v)=\Bigl[\frac{\Theta-\bar\theta}{\Theta}\,x\Bigr]\Bigl[\frac{\Theta-\bar\theta}{\Theta}(\bar\theta-1)+1\Bigr]-f .XI​(θˉ,v)=[ΘΘ−θˉ​x][ΘΘ−θˉ​(θˉ−1)+1]−f.

For θˉ>1\bar\theta>1θˉ>1 this is display (13); at θˉ=1\bar\theta=1θˉ=1 it is display (14). That one formula covers both cases is the paper's "no discontinuity in entrepreneurial profits around p0I=vp^I_0=vp0I​=v". The maximum of this expression on [1,Θ][1,\Theta][1,Θ] is attained and equals the optimal ICO payoff XI∗X_I^*XI∗​ from the original two-price problem (10).

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

theorem reduced_ico_problem (Θ x f : ℝ) (hΘ1 : 1 < Θ) (hx : 0 < x) :
    let g : ℝ → ℝ := fun θbar =>
      (Θ - θbar) / Θ * x * ((Θ - θbar) / Θ * (θbar - 1) + 1) - f
    (∀ θbar ∈ Set.Icc 1 Θ,
      profitI Θ x f θbar (basicUtility Θ x θbar) = g θbar) ∧
    IsGreatest (g '' Set.Icc 1 Θ) (optPayoffI Θ x f) := by sorry

end UtilityTokens.ICOChoice
Source
Shakhnov & Zaccaria, Utility Tokens, Network Effects, and Pricing Power, SSRN working paper 3613261 (PDF of 2023-04-23), pp. 21–22, §5.2, displays (13), (14) and the reduced problem
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