Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.15 — if the buyer threshold t̄ is below the seller threshold t̲, some price p′ has WorstRationed(p′) ≥ SuperFP(p)/7

Proved
StratifyMarkets.DoubleAuction.lemma_4_15

by Shuze Chen · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

double-auctiongains-from-trademarket-stratificationp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Fix a double auction instance with n,m≥1n,m\ge1n,m≥1, a submarket [a,b][a,b][a,b] (0≤a<b≤10\le a<b\le10≤a<b≤1) and a price p∈[a,b]p\in[a,b]p∈[a,b]. Let tˉ∈[a,b]\bar t\in[a,b]tˉ∈[a,b] be a buyer threshold (∑iPr⁡[tˉ≤vi≤b]=1/4\sum_i\Pr[\bar t\le v_i\le b]=1/4∑i​Pr[tˉ≤vi​≤b]=1/4) and t‾∈[a,b]\underline t\in[a,b]t​∈[a,b] a seller threshold (∑jPr⁡[a≤cj≤t‾]=1/4\sum_j\Pr[a\le c_j\le\underline t]=1/4∑j​Pr[a≤cj​≤t​]=1/4). If tˉ<t‾\bar t<\underline ttˉ<t​, then there is a price p′∈[a,b]p'\in[a,b]p′∈[a,b] with

WorstRationed(a,p′,b)≥17 SuperFP(a,p,b).\mathrm{WorstRationed}(a,p',b)\ge\frac17\,\mathrm{SuperFP}(a,p,b).WorstRationed(a,p′,b)≥71​SuperFP(a,p,b).

Differences from the source:

  • encoding: continuous F_1..F_n, G_1..G_m supported on [0, 1], all values and costs mutually independent → a DAInstance n m: no-atom probability measures with mass 1 on [0, 1]; expectations over the product (Measure.pi μB).prod (Measure.pi μS); reason: same instances; independence is the product measure
  • encoding: a submarket [m̲, m̄] with its price p (footnote 3) → reals a, b with 0 ≤ a < b ≤ 1 and p ∈ [a, b]; counts 'above p' / 'below p' within the submarket are Σ_i Pr[p ≤ v_i ≤ b] / Σ_j Pr[a ≤ c_j ≤ p]; reason: footnote 3's convention; closed intervals as in Remark 2.4
  • encoding: the super buyer v_max = max_i v_i and super seller c_min = min_j c_j → instance arguments [NeZero n] [NeZero m] (n, m ≥ 1); reason: v_max and c_min are undefined without a buyer and a seller; the condition only excludes undefined cases
  • encoding: the buyer threshold t̄ and seller threshold t̲ of the submarket → arbitrary tB, tS ∈ [a, b] with Σ_i Pr[tB ≤ v_i ≤ b] = 1/4 and Σ_j Pr[a ≤ c_j ≤ tS] = 1/4; reason: the thresholds need not be unique; quantifying over all of them is at least as strong as fixing one
  • encoding: 'there exists a price such that …' → ∃ p' ∈ [a, b]; reason: footnote 3: prices lie within the submarket
  • generalization: §4.2.1–4.2.2 (pp. 38, 40): the expected number of buyers and the expected number of sellers in the submarket are both greater than 1/4, which makes t̄ and t̲ well defined → no such hypothesis; the threshold equations (IsBuyerThreshold, IsSellerThreshold) are hypotheses, which imply both counts are at least 1/4, so the boundary instances with a count exactly 1/4 are also covered; reason: on every instance the source allows the statement is the source's; the condition serves only to make the thresholds exist, and the proofs (pp. 40–47) use only E_v[B] = E_c[S] = 1/4 and the order of t̄, t̲
Preamble
import Mathlib
import Definitions.Def_StratifyMarkets_DoubleAuction_Instance
import Definitions.Def_StratifyMarkets_DoubleAuction_WorstRationed
import Definitions.Def_StratifyMarkets_DoubleAuction_Submarket

open MeasureTheory
Formal statement
namespace StratifyMarkets.DoubleAuction

/-- Lemma 4.15 (p. 38): inside a submarket `[a, b]` with price `p ∈ [a, b]`, if the buyer threshold
`t̄` is below the seller threshold `t̲`, some price `p' ∈ [a, b]` has
`WorstRationed(a, p', b) ≥ SuperFP(a, p, b) / 7`. -/
theorem lemma_4_15 {n m : ℕ} [NeZero n] [NeZero m] (I : DAInstance n m) (a b p tB tS : ℝ)
    (ha : 0 ≤ a) (hab : a < b) (hb : b ≤ 1) (hap : a ≤ p) (hpb : p ≤ b)
    (htB : I.IsBuyerThreshold a b tB) (htS : I.IsSellerThreshold a b tS) (hlt : tB < tS) :
    ∃ p' ∈ Set.Icc a b, 1 / 7 * I.superFP a p b ≤ I.worstRationedIn a p' b := by sorry

end StratifyMarkets.DoubleAuction
Source
Deng, Lin, Schoepflin, Wang, Stratifying Markets for Efficient Trade, STOC 2027 submission (manuscript sha256 49372bcf…), p. 38, Lemma 4.15
Human review
  • Endorsed by Community (Bot) · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 11, 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