Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7, p.51 — Ej[Profit(p,q)]=(q−p)pSj(q)\mathbb E^j[\mathrm{Profit}(p,q)]=(q-p)pS_j(q)Ej[Profit(p,q)]=(q−p)pSj​(q), maximized at p=q/2p=q/2p=q/2 with value hj(q)=q24Sj(q)h^j(q)=\tfrac{q^2}{4}S_j(q)hj(q)=4q2​Sj​(q)

Proved
BilateralProfitLB.expected_profit_formula

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

bilateral-tradelower-boundsonline-learningp2o-gran-per-chapterp2o-plan-paperp2o-v1posted-pricesregret-bounds

Let K≥1K\ge1K≥1, j∈{0,…,K}j\in\{0,\dots,K\}j∈{0,…,K}, and let Ej\mathbb E^jEj denote expectation when the valuation pair (s,b)(s,b)(s,b) has law Dj\mathcal D_jDj​ (uniform seller, buyer with survival function SjS_jSj​, independent). For all prices p,q∈[0,1]p,q\in[0,1]p,q∈[0,1]:

  1. Ej[Profit(p,q)]=(q−p) p Sj(q)\mathbb E^j[\mathrm{Profit}(p,q)]=(q-p)\,p\,S_j(q)Ej[Profit(p,q)]=(q−p)pSj​(q);
  2. the same holds for the expected-profit function μ(p,q)=(q−p) P(s≤p, b≥q)\mu(p,q)=(q-p)\,\mathbb P(s\le p,\ b\ge q)μ(p,q)=(q−p)P(s≤p, b≥q) of §2;
  3. hj(q)=Ej[Profit(q/2,q)]=q24Sj(q)h^j(q)=\mathbb E^j[\mathrm{Profit}(q/2,q)]=\dfrac{q^2}{4}S_j(q)hj(q)=Ej[Profit(q/2,q)]=4q2​Sj​(q);
  4. Ej[Profit(p,q)]≤hj(q)\mathbb E^j[\mathrm{Profit}(p,q)]\le h^j(q)Ej[Profit(p,q)]≤hj(q): for every buyer price the best seller price is q/2q/2q/2.

This reduces the choice of posted prices on these instances to the choice of the buyer price qqq for hjh^jhj.

Differences from the source:

  • reading: the profit formula for "D0\mathcal D_0D0​ and the family Dj\mathcal D_jDj​" → j∈{0,…,K}j\in\{0,\dots,K\}j∈{0,…,K}; reason: the sentence follows the introduction of both, and h0h^0h0 is used in Claim 3.4
  • encoding: "the best seller price comes from setting p=q/2p=q/2p=q/2, for an expected profit of hj(q)=q2/4⋅Sj(q)h^j(q)=q^2/4\cdot S_j(q)hj(q)=q2/4⋅Sj​(q)" → items 3 and 4, with hj(q)h^j(q)hj(q) defined as Ej[Profit(q/2,q)]\mathbb E^j[\mathrm{Profit}(q/2,q)]Ej[Profit(q/2,q)]; reason: the definition of hjh^jhj on p.15
Preamble
import Mathlib
import Definitions.Def_BilateralProfitLB_Construction
Formal statement
namespace BilateralProfitLB

open MeasureTheory BilateralProfit

/-- **§7, p.51 (PDF 53), display before Claim 3.4**, Brüstle, di Gregorio, Fusco, Leonardi
(manuscript, sha256 e91e8127…): under `𝒟_j`, `E^j[Profit(p, q)] = (q − p) p S_j(q)`; "for any
buyer price `q`, the best seller price comes from setting `p = q/2`, for an expected profit of
`h^j(q) = q²/4 · S_j(q)`".

Stated for every `K ≥ 1`, `j ≤ K` (`j = 0`: the baseline `𝒟_0`) and prices `p, q ∈ [0, 1]`:
1. `E^j[Profit(p, q)] = (q − p) p S_j(q)`, the expectation of the realized profit;
2. the same for the expected-profit function `µ(p, q) = (q − p) P(p, q)` of §2;
3. `h^j(q) = q²/4 · S_j(q)`;
4. `E^j[Profit(p, q)] ≤ h^j(q)`.

**Formalization Note.** `h^j(q)` is defined as `µ(q/2, q)` under `𝒟_j` (§3.5, p.15), so item 3
is a statement, not a definition. -/
theorem expected_profit_formula (K : ℕ) (hK : 1 ≤ K) (j : ℕ) (hj : j ≤ K) (p q : ℝ)
    (hp : p ∈ Set.Icc (0 : ℝ) 1) (hq : q ∈ Set.Icc (0 : ℝ) 1) :
    (∫ v, profit v (p, q) ∂(law K j)) = (q - p) * p * S K j q ∧
      muP (law K j) (p, q) = (q - p) * p * S K j q ∧
      h K j q = q ^ 2 / 4 * S K j q ∧
      (∫ v, profit v (p, q) ∂(law K j)) ≤ h K j q := by sorry

end BilateralProfitLB
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), §7, p.51 (PDF 53), display and sentence before Claim 3.4; h^j: §3.5, p.15 (PDF 17)
Human review
  • Endorsed by Shuze Chen · Nov 15, 2026

    Confirmed by the moderator at approval.

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