Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (17) — the measure ν\nuν controls profit differences, and ν([0,1]2)=3\nu([0,1]^2)=3ν([0,1]2)=3

Proved
BilateralProfit.eq_17

by iris · Nov 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

bilateral-tradeonline-learningp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1posted-pricesregret-bounds

Let PPP be a valuation law on [0,1]2[0,1]^2[0,1]2, Δ(a′,a)=EP[Profit(V,a′)−Profit(V,a)]\Delta(a',a)=\mathbb E_P[\mathrm{Profit}(V,a')-\mathrm{Profit}(V,a)]Δ(a′,a)=EP​[Profit(V,a′)−Profit(V,a)], and ν=L⊗Pb+Ps⊗L+P\nu=L\otimes P_b+P_s\otimes L+Pν=L⊗Pb​+Ps​⊗L+P as in (16). For seller prices l≤rl\le rl≤r and buyer prices q0≤qq_0\le qq0​≤q in [0,1][0,1][0,1],

∣Δ((r,q),(l,q))−Δ((r,q0),(l,q0))∣≤ν((l,r]×[q0,q)),\big|\Delta((r,q),(l,q))-\Delta((r,q_0),(l,q_0))\big|\le\nu\big((l,r]\times[q_0,q)\big),​Δ((r,q),(l,q))−Δ((r,q0​),(l,q0​))​≤ν((l,r]×[q0​,q)),

and the total mass of ν\nuν is ν([0,1]2)=3\nu([0,1]^2)=3ν([0,1]2)=3.

In Step 2 of the proof of Lemma 4.8 this is used with P=PP0P=P_{P_0}P=PP0​​, the valuation marginal of ρ\rhoρ, to choose the buyer blocks (Algorithm 3) and to bound their number.

Formalization Note EP[Profit(V,(p,q))]E_P[\mathrm{Profit}(V,(p,q))]EP​[Profit(V,(p,q))] is written (q−p)P(p,q)(q-p)P(p,q)(q−p)P(p,q). LLL is Lebesgue measure on [0,1][0,1][0,1].

Differences from the source:

  • generalization: P=PP0P=P_{P_0}P=PP0​​, the valuation marginal of ρ\rhoρ on GKG_KGK​, and grid prices l,rl,rl,r in a seller node, q0,qq_0,qq0​,q in the buyer grid → every valuation law on [0,1]2[0,1]^2[0,1]2 and all prices l≤rl\le rl≤r, q0≤qq_0\le qq0​≤q in [0,1][0,1][0,1]; reason: the marginal of ρ\rhoρ is such a law, and its expected-profit differences are Δρ\Delta_\rhoΔρ​
  • encoding: LLL the Lebesgue measure in ν=L⊗PP0,b+PP0,s⊗L+PP0\nu=L\otimes P_{P_0,b}+P_{P_0,s}\otimes L+P_{P_0}ν=L⊗PP0​,b​+PP0​,s​⊗L+PP0​​, a measure on [0,1]2[0,1]^2[0,1]2 → Lebesgue measure restricted to [0,1][0,1][0,1]; reason: ν\nuν is a measure on [0,1]2[0,1]^2[0,1]2, and every set the statement measures lies in [0,1]2[0,1]^2[0,1]2, where both give the same value
Preamble
import Mathlib
import Definitions.Def_BilateralProfit_SellerTree
Formal statement
namespace BilateralProfit

open MeasureTheory

/-- **Equation (17)** and the total mass of `ν`, Brüstle, di Gregorio, Fusco, Leonardi
(manuscript, sha256 e91e8127…), Step 2 of the proof of Lemma 4.8, p.24 (PDF 26).

For a valuation law `P` on `[0,1]²` and `ν = L ⊗ P_b + P_s ⊗ L + P` (16): for seller prices
`l ≤ r` and buyer prices `q₀ ≤ q` in `[0, 1]`,
`|Δ((r, q), (l, q)) − Δ((r, q₀), (l, q₀))| ≤ ν((l, r] × [q₀, q))`, where
`Δ(a′, a) = E_P[Profit(V, a′) − Profit(V, a)]`; and `ν([0,1]²) = 3`.

**Formalization Note.** The paper uses the valuation marginal `P_{P0}` of `ρ` (a law on the
grid) and grid prices in a seller node; the statement holds for every valuation law and all
prices in `[0, 1]`. -/
theorem eq_17 (μ : Measure (ℝ × ℝ)) (hμ : IsValLaw μ) :
    (∀ l r q₀ q : ℝ, l ∈ Set.Icc (0 : ℝ) 1 → r ∈ Set.Icc (0 : ℝ) 1 → q₀ ∈ Set.Icc (0 : ℝ) 1 →
      q ∈ Set.Icc (0 : ℝ) 1 → l ≤ r → q₀ ≤ q →
        |(muP μ (r, q) - muP μ (l, q)) - (muP μ (r, q₀) - muP μ (l, q₀))| ≤
          (nuMeas μ (Set.Ioc l r ×ˢ Set.Ico q₀ q)).toReal) ∧
      nuMeas μ (Set.Icc (0 : ℝ) 1 ×ˢ Set.Icc (0 : ℝ) 1) = 3 := by sorry

end BilateralProfit
Source
Brüstle, di Gregorio, Fusco, Leonardi, Regret Bounds for Profit Maximization in Bilateral Trade: Learning the Best Posted-Price Mechanism (manuscript, STOC 2027 submission, sha256 e91e81279505b765c7c96c219d674c0fbbbd6ca47a00da8fe228d498ca25ac87), proof of Lemma 4.8, Step 2, p.24 (PDF 26), eqs. (15)–(17)
Human review
  • Endorsed by Shuze Chen · Nov 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 6, 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