Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 2, Claim (i): h(e,Q)>g(e,Q)h(e,Q)>g(e,Q)h(e,Q)>g(e,Q)

Proved
PlatformToken.SmallCost.claim_i_h_gt_g

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

inequalitiesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1platform-economics

Assume the standing assumptions, c>0c>0c>0 or m>0m>0m>0, and K>0K>0K>0. For every Q>0Q>0Q>0 and e>0e>0e>0 with d(e,Q)>s(Q)d(e,Q)>s(Q)d(e,Q)>s(Q),

g(e,Q)<h(e,Q),g(e,Q)<h(e,Q),g(e,Q)<h(e,Q),

where hhh is (B.21) and ggg is (B.26). Equivalently, at such points the blockchain effort factor βB\beta^BβB exceeds the traditional factor $\beta^$$.

This is the step of the proof of Proposition 2 that makes the traditional problem's feasible set a subset of the blockchain one.

Formalization Note The paper works on (e†(Q),∞)(e^\dagger(Q),\infty)(e†(Q),∞), where d(e,Q)>s(Q)d(e,Q)>s(Q)d(e,Q)>s(Q); this is the hypothesis s(Q)<d(e,Q)s(Q)<d(e,Q)s(Q)<d(e,Q). Both K>0K>0K>0 and "c>0c>0c>0 or m>0m>0m>0" are needed: on the branch c≤d−sc\le d-sc≤d−s the two functions coincide when K=0K=0K=0, or when c=0c=0c=0 and s(Q)=0s(Q)=0s(Q)=0.

Preamble
import Mathlib
import Definitions.Def_PlatformToken_SmallCost_Setting
import Definitions.Def_PlatformToken_SmallCost_Corollary1

set_option autoImplicit false
Formal statement
namespace PlatformToken.SmallCost

/-- **Proof of Proposition 2, Claim (i)** (Chod, Trichakis, Yang, Platform Tokenization: Financing, Governance, and Moral Hazard,
Management Science (Articles in Advance, 2022), doi:10.1287/mnsc.2021.4225, p. 20, proof of Proposition 2, "Claim (i) is
true because h(e,Q) > g(e,Q)"; `h` is (B.21), `g` is (B.26), p. 19).

For `K > 0`, `Q > 0`, `e > 0` with `d(e,Q) > s(Q)` (the proof works on `(e†(Q), ∞)`),
`h(e,Q) > g(e,Q)`.

**Formalization Note.** Both `0 < K` and `0 < c ∨ 0 < m` are needed: on the branch `c ≤ d - s`,
`h = g` when `K = 0`, or when `c = 0` and `s(Q) = 0`.
-/
theorem claim_i_h_gt_g (p : Params) (hp : p.Standing) (hcm : 0 < p.c ∨ 0 < p.m)
    (hK : 0 < p.K) (Q e : ℝ) (hQ : 0 < Q) (he : 0 < e) (hsd : s p Q < d p e Q) :
    g p e Q < h p e Q := by sorry

end PlatformToken.SmallCost
Source
Chod, Trichakis, Yang, Platform Tokenization: Financing, Governance, and Moral Hazard, Management Science (Articles in Advance, 2022), doi:10.1287/mnsc.2021.4225, p. 20, proof of Proposition 2, Claim (i); h is (B.21), g is (B.26), p. 19
Human review
  • Endorsed by Shuze Chen · Oct 18, 2026

    Confirmed by the moderator at approval.

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