Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3 and equations (11)–(12): optimal revenue share

Proved
TokenFinance.OptToken.lemma_3

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

monopolyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-sharingtoken-financing

Let c>0c>0c>0 be marginal cost and t>0t>0t>0 the number of units pre-sold to investors. Give those investors the fraction αt=t/(c+t)\alpha_t=t/(c+t)αt​=t/(c+t) of the tokens issued after production. Then 0<αt<10<\alpha_t<10<αt​<1. For every demand intercept xxx such that the monopoly quantity qm(x)=(x−c)/2q^m(x)=(x-c)/2qm(x)=(x−c)/2 exceeds ttt, the entrepreneur's time-one payoff from any output q>tq>tq>t is at most her payoff at qm(x)q^m(x)qm(x):

(1−αt)(q−t)(x−q)−cq≤(1−αt)(qm(x)−t)(x−qm(x))−cqm(x).(1-\alpha_t)(q-t)(x-q)-cq\le(1-\alpha_t)(q^m(x)-t)(x-q^m(x))-cq^m(x).(1−αt​)(q−t)(x−q)−cq≤(1−αt​)(qm(x)−t)(x−qm(x))−cqm(x).

This is the incentive calculation behind the contract's revenue share. Formalization Note This statement concerns the high-demand case treated before the paper introduces the low-demand refund terms; both quantities range over q>tq>tq>t.

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

theorem lemma_3 (c t : ℝ) (hc : 0 < c) (ht : 0 < t) :
    0 < TokenFinance.Debt.alphaT c t ∧ TokenFinance.Debt.alphaT c t < 1 ∧
      ∀ x q : ℝ, t < (x - c) / 2 → t < q →
        (1 - TokenFinance.Debt.alphaT c t) * (q - t) * (x - q) - c * q ≤
          (1 - TokenFinance.Debt.alphaT c t) * ((x - c) / 2 - t) * (x - (x - c) / 2) -
            c * ((x - c) / 2) := by sorry

end TokenFinance.OptToken
Source
Malinova & Park, Tokenomics: When Tokens Beat Equity, SSRN 3286825 (version of June 1, 2023), pp. 21–22 (PDF pp. 22–23), Lemma 3 and (11)–(12)
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me