Lemma 5.5 — Prior-density bounds
ProvedSecondBestTrade.HalfEfficiency.prior_densityalgorithmic-game-theorymechanism-designp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1
At every useful dual and every , the terminal distribution of each agent started from its prior obeys the componentwise bound
Averaging over the independent rate-one exponential clock also gives
Both assertions apply to every buyer and every seller and every support coordinate. The factor is uniform over times, types and the number of agents.
Differences from the source:
- encoding: finite agent, trade and support sets with product-prior expectations → Fin labels, an injective nonnegative-vector support embedding, and finite product-weighted sums; reason: bijections cover every finite source market, and summing an overwritten own coordinate multiplies by its total probability one
Preamble
import Mathlib import Definitions.Def_SecondBestTrade_HalfEfficiency_Dual open scoped BigOperators NNReal open MeasureTheory set_option autoImplicit false noncomputable section
Formal statement
namespace SecondBestTrade.HalfEfficiency
/-- Lemma 5.5, printed p. 11 (PDF p. 12), including the integrated inequalities. -/
theorem prior_density (N : Market) (z : Dual N) (hz : useful N z) :
(∀ theta : ℝ, 0 ≤ theta → ∀ a t,
terminalMass N z a theta t ≤ Real.exp (kappa (z.tau : ℝ) * theta) * N.mass a t) ∧
(∀ a t, (∑ s, N.mass a s * resolvent N z a s t) ≤
(1 + (z.tau : ℝ)) * N.mass a t) := by sorry
end SecondBestTrade.HalfEfficiency
Source
Dirk Bergemann, Yang Cai, Kangning Wang, Jinzhao Wu, Renzhe Xu, STOC 2027 submission #529 (October 2026), Lemma 5.5 — Prior-density bounds, printed p. 11 (PDF p. 12)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.