Theorem 3: logarithmic exchangeable revenue gap
ProvedMinBuying.theorem3_exchangeable_gapFor every integer , there is an exchangeable nonnegative joint valuation law with finite attained positive pricing optima such that . The logarithm is natural. No density or independence condition is imposed on this existential law.
import Definitions.Def_MinBuying_Symmetry
namespace MinBuying
/-- Theorem 3 (p.15), with the natural logarithm and the stated constant 3/32.
The source's construction is discrete, so absolute continuity is not imposed. -/
theorem theorem3_exchangeable_gap (n : ℕ) (hn : 0 < n) :
∃ μ : JointLaw n, ValidLaw μ ∧ Exchangeable μ ∧ WellPosed μ ∧
(3 / 32 : ℝ) * Real.log (n : ℝ) * UPRevenue μ ≤ DPRevenue μ := by
sorry
end MinBuying
Read-back
What the Lean code literally says, in plain math · gpt-6-astra
For a measure on a finite real coordinate space and a price vector , let be the minimum of the numbers over those indices satisfying , with when there is no such index, and put . Write and , where the suprema are taken in and is the constant price vector. Write for the conjunction that both sets defining and are bounded above, there is a vector with every and , there is an with , and . For every integer , there exists a probability measure on for which all coordinates are nonnegative simultaneously almost surely, whose image under every coordinate permutation equals , and for which holds, such that . Here is viewed as a real number inside the natural logarithm. The existence statement includes a nonnegative differentiated maximizer, a nonnegative uniform maximizing price, and a strictly positive uniform supremum through . The inequality is non-strict and is required separately for each positive integer ; at its left-hand side is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.