Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 16 / Appendix p. 2 — g2(n, v) is strictly increasing in n, so g2(N^j, v^j) ≥ g2(1, v^j)

Proved
PlatformLeakage.Perfect.g2_strictMono

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

monotonicityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1platform-leakage

Under the standing assumptions, for every valuation v>0v>0v>0 the function

n⟼g2(n,v)=cμϕn(1+nv/(cϕ)−1)2n\longmapsto g_2(n,v)=\frac{c\mu\phi}{n}\Big(\sqrt{1+nv/(c\phi)}-1\Big)^2n⟼g2​(n,v)=ncμϕ​(1+nv/(cϕ)​−1)2

is strictly increasing on n>0n>0n>0. In particular g2(Nj,vj)≥g2(1,vj)g_2(N^j,v^j)\ge g_2(1,v^j)g2​(Nj,vj)≥g2​(1,vj) for every Nj≥1N^j\ge1Nj≥1.

By Lemma 2 this says that the on-platform utility rate Upj(ω,n)=ωg2(n,vj)−KjU^j_p(\omega,n)=\omega g_2(n,v^j)-K^jUpj​(ω,n)=ωg2​(n,vj)−Kj grows with the number of providers on the platform (the participation externality), which is why the equilibrium ranges of Proposition 1 can overlap.

Formalization Note The head count nnn is a real variable here, as in the proof's derivative ∂Upj/∂npj>0\partial U^j_p/\partial n^j_p>0∂Upj​/∂npj​>0.

Preamble
import Mathlib
import Definitions.Def_PlatformLeakage_Perfect_Model
Formal statement
namespace PlatformLeakage.Perfect

/-- p. 16 and the proof of Proposition 1 (Appendix p. 2): for a positive valuation `v`, `g2(n, v)` is
strictly increasing in the head count `n > 0`; in particular `g2(N, v) ≥ g2(1, v)` for `N ≥ 1`. -/
theorem g2_strictMono (P : Params) (hP : P.Std) (v : ℝ) (hv : 0 < v) :
    StrictMonoOn (fun n : ℝ => g2 P n v) (Set.Ioi 0) := by sorry

end PlatformLeakage.Perfect
Source
He, Savin, Goh & Teo, Off-Platform Threats in On-Demand Services, SSRN working paper 3550646 (PDF of 2021-03-25), p. 16 (PDF 16), remark after Proposition 1; proof of Proposition 1, Appendix p. 2 (PDF 37)
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

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