Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Proposition 4, p. 41 — unique positive root of (41)

Proved
TokenFinance.Statics.root_unique

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

comparative-staticsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1root-uniquenesstoken-financing

Let c>0c>0c>0 be the marginal cost, θ>c\theta>cθ>c the upper demand intercept, and C0>0C_0>0C0​>0 the set-up cost. Suppose C0<(θ−c)3/(12θ)C_0<(\theta-c)^3/(12\theta)C0​<(θ−c)3/(12θ), so the project's net present value is positive. There is exactly one positive pre-sale size ttt satisfying the token break-even equation (16), and it lies below the maximal monopoly quantity:

0<t<θ−c2,cc+t23θ(θ−c2−t)3=(θ−c)312θ−C0.0<t<\frac{\theta-c}{2},\qquad \frac{c}{c+t}\frac{2}{3\theta}\left(\frac{\theta-c}{2}-t\right)^3=\frac{(\theta-c)^3}{12\theta}-C_0.0<t<2θ−c​,c+tc​3θ2​(2θ−c​−t)3=12θ(θ−c)3​−C0​.

This identifies the contract size whose movement is studied in Proposition 4.

Formalization Note The positive-NPV condition is written using the closed form (3). The text following (41) has a sign slip: FFF decreases, rather than increases, in ttt.

Preamble
import Mathlib
import Definitions.Def_TokenFinance_Debt_Setting
Formal statement
namespace TokenFinance.Statics

theorem root_unique (c C0 θ : ℝ) (hc : 0 < c) (hcθ : c < θ)
    (hC0 : 0 < C0) (hNPV : C0 < (θ - c) ^ 3 / (12 * θ)) :
    (∃! t : ℝ, 0 < t ∧ TokenFinance.Debt.tokenBreakEven c C0 θ t) ∧
      (∀ t : ℝ, 0 < t → TokenFinance.Debt.tokenBreakEven c C0 θ t → t < (θ - c) / 2) := by sorry

end TokenFinance.Statics
Source
Malinova & Park, Tokenomics: When Tokens Beat Equity, SSRN 3286825 (version of June 1, 2023), p. 41 (PDF p. 42), Appendix A, proof of Proposition 4, (41), with proof of Proposition 3, pp. 40–41 (PDF pp. 41–42)
Human review
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 16, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me