Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(13), p. 14 — v₁f(1,q)Σ1/vᵢ ≤ Σf(i,q) ≤ vₙf(n,q)Σ1/vᵢ under strong network effects

Proved
NetworkQuality.PotentialMax.eq_13

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

inequalitynetwork-effectsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

In the network market under the standing assumptions, fix a quality q≥0q\ge 0q≥0 with strong network effects. Then

v1f(1,q)∑i=1n1vi  ≤  ∑i=1nf(i,q)  ≤  vnf(n,q)∑i=1n1vi.v_1f(1,q)\sum_{i=1}^n\frac1{v_i}\;\le\;\sum_{i=1}^n f(i,q)\;\le\;v_nf(n,q)\sum_{i=1}^n\frac1{v_i}.v1​f(1,q)i=1∑n​vi​1​≤i=1∑n​f(i,q)≤vn​f(n,q)i=1∑n​vi​1​.

Dividing by ∑i1/vi\sum_i 1/v_i∑i​1/vi​, the threshold price p(q)=(1n∑i1vi)−11n∑if(i,q)p(q)=\big(\frac1n\sum_i\frac1{v_i}\big)^{-1}\frac1n\sum_i f(i,q)p(q)=(n1​∑i​vi​1​)−1n1​∑i​f(i,q) of (12) satisfies v1f(1,q)≤p(q)≤vnf(n,q)v_1f(1,q)\le p(q)\le v_nf(n,q)v1​f(1,q)≤p(q)≤vn​f(n,q): it lies in the price range in which both "all buy" and "none buy" are equilibria (Proposition 1(iii)).

Preamble
import Mathlib
import Definitions.Def_NetworkQuality_PotentialMax_Setting
Formal statement
namespace NetworkQuality.PotentialMax

open Market

theorem eq_13 {n : ℕ} (M : Market n) (hM : M.Standing) (q : ℝ) (hq : 0 ≤ q)
    (hs : M.StrongNE q) :
    M.v ⟨0, hM.1⟩ * M.f 1 q * ∑ i : Fin n, 1 / M.v i ≤ ∑ i : Fin n, M.f (i.val + 1) q ∧
    ∑ i : Fin n, M.f (i.val + 1) q ≤
      M.v ⟨n - 1, Nat.sub_lt hM.1 Nat.one_pos⟩ * M.f n q * ∑ i : Fin n, 1 / M.v i := by sorry

end NetworkQuality.PotentialMax
Source
Chan, Quality Strategies in Network Markets, SSRN 4203818 (version of April 2023), p. 14, (13)
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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