Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1, p. 13 — for θ > 1 no campaign in which low-end customers sign up first satisfies the IR/IC constraints

Proved
FlexGroupBuy.REE.proposition_1

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

group-buyingincentive-compatibilitymarket-segmentationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Assume the standing assumptions H>L>0H>L>0H>L>0, 0<γ<10<\gamma<10<γ<1, λ>0\lambda>0λ>0, c>0c>0c>0, θ>1\theta>1θ>1, and let N≥1N\ge 1N≥1. In Case II low-end customers sign up first and both segments sign up from the tipping state xˉG∈[0,N)\bar x^G\in[0,N)xˉG∈[0,N) on; the expected waiting time is wII(n)=(n−1)/λw^{II}(n)=(n-1)/\lambdawII(n)=(n−1)/λ for n≤xˉGn\le \bar x^Gn≤xˉG and xˉG/λ+(n−xˉG−1)/((1−γ)λ)\bar x^G/\lambda+(n-\bar x^G-1)/((1-\gamma)\lambda)xˉG/λ+(n−xˉG−1)/((1−γ)λ) for n>xˉGn>\bar x^Gn>xˉG. Then for no prices pG,rGp^G,r^GpG,rG do the six constraints

IRL: θL−pG−c wII(n)≥0,ICL: θL−pG−c wII(n)≥L−rG,1≤n≤N,IRH1: H−rG≥0,ICH1: H−rG≥θH−pG−c wII(n),xˉG<n≤N,IRH2: θH−pG−c wII(n)≥0,ICH2: θH−pG−c wII(n)≥H−rG,1≤n≤xˉG,\begin{aligned} &IR_L:\ \theta L-p^G-c\,w^{II}(n)\ge 0, && ICL:\ \theta L-p^G-c\,w^{II}(n)\ge L-r^G, && 1\le n\le N,\\ &IR_{H1}:\ H-r^G\ge 0, && IC_{H1}:\ H-r^G\ge \theta H-p^G-c\,w^{II}(n), && \bar x^G<n\le N,\\ &IR_{H2}:\ \theta H-p^G-c\,w^{II}(n)\ge 0, && IC_{H2}:\ \theta H-p^G-c\,w^{II}(n)\ge H-r^G, && 1\le n\le \bar x^G, \end{aligned}​IRL​: θL−pG−cwII(n)≥0,IRH1​: H−rG≥0,IRH2​: θH−pG−cwII(n)≥0,​​ICL: θL−pG−cwII(n)≥L−rG,ICH1​: H−rG≥θH−pG−cwII(n),ICH2​: θH−pG−cwII(n)≥H−rG,​​1≤n≤N,xˉG<n≤N,1≤n≤xˉG,​

all hold, over integer states nnn.

Together with Lemma A.1 this is Proposition 1: with θ>1\theta>1θ>1 the equilibrium segmentation is one of {H}\{H\}{H}, {H;H+L}\{H;H+L\}{H;H+L}, {H+L}\{H+L\}{H+L} (Case I), since the low-end-first scenarios {L}\{L\}{L} (xˉG=0\bar x^G=0xˉG=0) and {L;H+L}\{L;H+L\}{L;H+L} (0<xˉG<N0<\bar x^G<N0<xˉG<N) cannot occur.

Formalization Note. The statement is the infeasibility of Case II that the printed proof establishes (Online Appendix pp. 2–3), not the full classification sentence. The scenario {L+H}\{L+H\}{L+H} coincides with Case I's xˉG=N\bar x^G=NxˉG=N and is excluded from Case II as on the page.

Preamble
import Mathlib
import Definitions.Def_FlexGroupBuy_REE_Model
Formal statement
namespace FlexGroupBuy.REE

/-- Proposition 1 (p. 13), in the form its proof establishes (Online Appendix pp. 2–3): for `θ > 1`
no tipping state `x ∈ [0, N)` and no prices `p`, `r` satisfy the six IR/IC constraints of
Case II (low-end customers sign up first), with the Case II waiting time `wII`. -/
theorem proposition_1 (P : Params) (hP : P.Standing) (N : ℕ) (hN : 1 ≤ N)
    (x : ℝ) (hx0 : 0 ≤ x) (hxN : x < N) (p r : ℝ) :
    ¬ ((∀ n : ℕ, 1 ≤ n → n ≤ N → P.theta * P.L - p - P.c * wII P x n ≥ 0) ∧
       (∀ n : ℕ, 1 ≤ n → n ≤ N → P.theta * P.L - p - P.c * wII P x n ≥ P.L - r) ∧
       (∀ n : ℕ, x < (n : ℝ) → n ≤ N → P.H - r ≥ 0) ∧
       (∀ n : ℕ, x < (n : ℝ) → n ≤ N → P.H - r ≥ P.theta * P.H - p - P.c * wII P x n) ∧
       (∀ n : ℕ, 1 ≤ n → (n : ℝ) ≤ x → P.theta * P.H - p - P.c * wII P x n ≥ 0) ∧
       (∀ n : ℕ, 1 ≤ n → (n : ℝ) ≤ x → P.theta * P.H - p - P.c * wII P x n ≥ P.H - r)) := by sorry

end FlexGroupBuy.REE
Source
Hu, Liu & Zhai, Intertemporal Segmentation via Flexible-Duration Group Buying, SSRN 3242687 (version of 2019-12-06; MSOM forthcoming), p. 13, Proposition 1; proof Online Appendix pp. 2–3
Human review
  • Endorsed by Shuze Chen · Oct 19, 2026

    Confirmed by the moderator at approval.

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