Theorem 1 proof: a price from the original vector dominates
ProvedMinBuying.iid_policy_dominationFor a positive finite item count, IID nonnegative probability valuations, and every feasible price vector , there is a coordinate such that uniform pricing at earns at least the revenue of . This is the stronger policy-level assertion explicitly proved in Theorem 1's induction and does not require optimizing-price attainment or regularity.
import Definitions.Def_MinBuying_Symmetry open MeasureTheory
namespace MinBuying
/-- The stronger statement explicitly proved in Theorem 1: a uniform price
chosen from the original vector dominates it. The proof also permits atoms
and zero valuations, and does not require attained optimizing prices. -/
theorem iid_policy_domination (n : ℕ) (hn : 0 < n) (F : Measure ℝ)
(hF : ValidMarginal F) (p : Prices n) (hp : FeasiblePrices p) :
∃ i : Fin n, Revenue (iidLaw n F) p ≤ uniformRevenue (iidLaw n F) (p i) := by
sorry
end MinBuying
Read-back
What the Lean code literally says, in plain math · gpt-6-astra
For every integer , every probability measure on for which holds -almost surely, and every vector of real prices with for all , let . Given any price vector , define its payment at to be the minimum among coordinates with , and to be if no coordinate meets that condition, and let be the integral of this payment with respect to . Then there exists an index such that , where the right-hand side uses the single price equal to the already specified coordinate price at every coordinate. The assertion permits repeated prices, zero prices, atoms in , unbounded support, and infinite first moment; no attainment or positivity assumption on an optimal revenue is present. The empty-coordinate case is excluded by .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.