Theorem 2 proof: uniform-price domination under affiliation
ProvedMinBuying.affiliated_policy_dominationFor every feasible price vector under an exchangeable affiliated nonnegative joint probability law with a positive finite number of coordinates, one of the coordinate prices earns weakly greater revenue when charged uniformly. This policy assertion uses no optimum-attainment assumption and covers the density-or-PMF affiliation scope of Definition 1.
import Definitions.Def_MinBuying_Symmetry
namespace MinBuying
/-- The stronger own-vector domination statement from the proof of Theorem 2
(ec3--ec5), formulated without assuming an optimizing vector is attained. -/
theorem affiliated_policy_domination (n : ℕ) (hn : 0 < n) (μ : JointLaw n)
(hμ : ValidLaw μ) (hex : Exchangeable μ) (haff : Affiliated μ)
(p : Prices n) (hp : FeasiblePrices p) :
∃ i : Fin n, Revenue μ p ≤ uniformRevenue μ (p i) := by
sorry
end MinBuying
Read-back
What the Lean code literally says, in plain math · gpt-6-astra
For every integer , let be a probability measure on such that every coordinate is nonnegative simultaneously -almost surely. Assume is invariant under every map for a permutation of the coordinates, and assume one of the following alternatives holds: either has an everywhere nonnegative, Borel-measurable real density with respect to Lebesgue measure on , satisfying for every , or is the measure of a probability mass function on whose real point masses satisfy for every . Here and mean coordinatewise maximum and minimum, and the mass-function alternative does not require finite support. For every price vector with all , define as the integral of the minimum price among indices with , using payment at a valuation vector when no such index exists. Then there is an index for which , where the right-hand side sets every coordinate's price equal to the original price . This is a statement about each given feasible vector and a price drawn from its entries. It includes zero and repeated prices and makes no assumption that any revenue optimum is attained or is strictly positive; is excluded.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.