Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Profit and trade probabilities for independent positive densities

Proved
BilateralProfitMHR.positive_density_profit_facts

by sim2000dg · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

bilateral-tradeonline-learningprobability

For independent seller and buyer valuations with strictly positive densities on [0,1][0,1][0,1], the prior is a probability measure and the trade probability is measurable. On the unit square it factors as FS(p)(1−FB(q))F_S(p)(1-F_B(q))FS​(p)(1−FB​(q)). Expected profit is continuous, bounded in absolute value by one, and positive exactly in the open ordered triangle. Its positive global maximum is attained in that triangle. The result also gives the boundary identities, the product identity used to reconstruct trade probabilities from a split point, and the comparison of profit differences with differences in negative log profit.

Preamble
import Mathlib
import Definitions.Def_BilateralProfitMHR_Model
open BilateralProfitMHR MeasureTheory BilateralProfit MechanismDesign.BilateralTrade
Formal statement
theorem BilateralProfitMHR.positive_density_profit_facts (E : Environment) (hE : UnitSupport E) :
    IsProbabilityMeasure E.prior ∧
    Measurable (Ptrade E.prior) ∧
    (∀ a, 0 ≤ Ptrade E.prior a ∧ Ptrade E.prior a ≤ 1) ∧
    (∀ a ∈ unitSq, Ptrade E.prior a = E.cdfS a.1 * (1 - E.cdfB a.2)) ∧
    MonotoneOn E.cdfS (Set.Icc 0 1) ∧
    MonotoneOn E.cdfB (Set.Icc 0 1) ∧
    ContinuousOn (muP E.prior) unitSq ∧
    ContinuousOn (lossL E.prior) intT ∧
    (∀ a ∈ unitSq, 0 < muP E.prior a ↔ a ∈ intT) ∧
    (0 < muStar E.prior ∧ muStar E.prior ≤ 1) ∧
    (∀ a ∈ unitSq, muP E.prior a ≤ muStar E.prior) ∧
    (∃ a ∈ intT, muP E.prior a = muStar E.prior) ∧
    (∀ a ∈ unitSq, |muP E.prior a| ≤ 1 ∧ muP E.prior a ≤ Ptrade E.prior a) ∧
    (∀ x ∈ Set.Icc (0:ℝ) 1, muP E.prior (0,x) = 0 ∧ muP E.prior (x,1) = 0 ∧
      muP E.prior (x,x) = 0) ∧
    (∀ x ∈ Set.Icc (0:ℝ) 1, ∀ z ∈ Set.Icc (0:ℝ) 1, ∀ y ∈ Set.Icc (0:ℝ) 1,
      x ≤ z → z ≤ y →
      Ptrade E.prior (x,z) * Ptrade E.prior (z,y) = Ptrade E.prior (x,y) * Ptrade E.prior (z,z) ∧
      Ptrade E.prior (x,z) ≤ Ptrade E.prior (z,z) ∧
      Ptrade E.prior (z,y) ≤ Ptrade E.prior (z,z) ∧
      Ptrade E.prior (x,y) ≤ Ptrade E.prior (z,z)) ∧
    (∀ a ∈ intT, ∀ b ∈ intT, muP E.prior a ≤ muP E.prior b →
      muP E.prior b - muP E.prior a ≤
        muStar E.prior * (lossL E.prior a - lossL E.prior b)) := by sorry
Source
Brüstle, di Gregorio, Fusco and Leonardi, Regret Bounds for Profit Maximization in Bilateral Trade: Learning the Best Posted-Price Mechanism, §2, Proposition 3.2 and the proof of Proposition 5.4.

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