Proof of Proposition 2, Claim (i):
ProvedPlatformToken.SmallCost.claim_i_h_gt_ginequalitiesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1platform-economics
Assume the standing assumptions, or , and . For every and with ,
where is (B.21) and is (B.26). Equivalently, at such points the blockchain effort factor 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 , where ; this is the hypothesis . Both and " or " are needed: on the branch the two functions coincide when , or when and .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.