Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1, p. 25 — the low-pricing proportion ψ(te) = (q̂ − q̲)/(1 − q̲) for te > t̂e, else 0; increasing in te, decreasing in q̲

Proved
Shoppertainment.OptimalBandwidth.proposition_1

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

comparative-staticslive-streamingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pricing

Let the manufacturers' qualities be uniform on [q‾,1][\underline q, 1][q​,1] with 0≤q‾<10 \le \underline q < 10≤q​<1, and let ψ(te)\psi(t_e)ψ(te​) be the proportion of them that price low under Lemma 2's rule, i.e. those with 1/(2−q)<te1/(2-q) < t_e1/(2−q)<te​. Write t^e=1/(2−q‾)\hat t_e = 1/(2-\underline q)t^e​=1/(2−q​) and q^=2−1/te\hat q = 2 - 1/t_eq^​=2−1/te​.

  1. For every te∈[0,1]t_e \in [0,1]te​∈[0,1],
ψ(te)={q^−q‾1−q‾=2−1/te−q‾1−q‾if te>t^e,0if te≤t^e.\psi(t_e) = \begin{cases} \dfrac{\hat q - \underline q}{1 - \underline q} = \dfrac{2 - 1/t_e - \underline q}{1 - \underline q} & \text{if } t_e > \hat t_e,\\[2mm] 0 & \text{if } t_e \le \hat t_e.\end{cases}ψ(te​)=⎩⎨⎧​1−q​q^​−q​​=1−q​2−1/te​−q​​0​if te​>t^e​,if te​≤t^e​.​
  1. ψ\psiψ is strictly increasing in tet_ete​ on (t^e,1](\hat t_e, 1](t^e​,1].
  2. For each fixed te∈[0,1]t_e \in [0,1]te​∈[0,1], ψ\psiψ is non-increasing in q‾\underline qq​ over the thresholds q‾∈[0,1)\underline q \in [0,1)q​∈[0,1) with te>t^e(q‾)t_e > \hat t_e(\underline q)te​>t^e​(q​), and strictly decreasing there when te<1t_e < 1te​<1.

The result quantifies how the streamer's bandwidth allocation steers the manufacturers' pricing.

Formalization Note The proportion is the Lebesgue measure of {q∈[q‾,1]:1/(2−q)<te}\{q \in [\underline q, 1] : 1/(2-q) < t_e\}{q∈[q​,1]:1/(2−q)<te​} divided by 1−q‾1 - \underline q1−q​. The decrease in q‾\underline qq​ is strict for te<1t_e < 1te​<1 and only weak at te=1t_e = 1te​=1: there every manufacturer of quality below 111 prices low and ψ≡1\psi \equiv 1ψ≡1, so the decrease cannot be strict. The threshold q‾<1\underline q < 1q​<1 is pinned so that the uniform law on [q‾,1][\underline q,1][q​,1] exists.

Preamble
import Mathlib
import Definitions.Def_Shoppertainment_OptimalBandwidth_Model
Formal statement
namespace Shoppertainment.OptimalBandwidth

theorem proposition_1 (ql : ℝ) (hql : 0 ≤ ql) (hql1 : ql < 1) :
    (∀ te ∈ Set.Icc (0:ℝ) 1,
        psi ql te = if teHat ql < te then (qHat te - ql) / (1 - ql) else 0) ∧
    StrictMonoOn (psi ql) (Set.Ioc (teHat ql) 1) ∧
    (∀ te ∈ Set.Icc (0:ℝ) 1,
        AntitoneOn (fun ql' => psi ql' te) {ql' : ℝ | 0 ≤ ql' ∧ ql' < 1 ∧ teHat ql' < te} ∧
        (te < 1 →
          StrictAntiOn (fun ql' => psi ql' te) {ql' : ℝ | 0 ≤ ql' ∧ ql' < 1 ∧ teHat ql' < te})) := by sorry

end Shoppertainment.OptimalBandwidth
Source
Gu, Zhao & Wu, A Model of Shoppertainment Live Streaming, accepted manuscript (Management Science, forthcoming, Oct. 2024), p. 25, Proposition 1, display (11); proof in Online Supplementary A.2, p. S3 (PDF 52)
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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