Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Coordinate-threshold comparison for affiliated laws

Proved
MinBuying.affiliated_coordinate_threshold

by mikeh · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

min-buyingmtp2operations-researchpricingprobability

Let V∈R+nV\in\mathbb R_+^nV∈R+n​ have an affiliated probability law represented either by a measurable nonnegative MTP2 Lebesgue density or by an MTP2 probability mass function. For any coordinates i,ji,ji,j and real thresholds a,s,ta,s,ta,s,t with s≤ts\le ts≤t,

Pr⁡(Vi<a,Vj≥t)Pr⁡(Vj≥s)≤Pr⁡(Vi<a,Vj≥s)Pr⁡(Vj≥t).\Pr(V_i<a,V_j\ge t)\Pr(V_j\ge s)\le\Pr(V_i<a,V_j\ge s)\Pr(V_j\ge t).Pr(Vi​<a,Vj​≥t)Pr(Vj​≥s)≤Pr(Vi​<a,Vj​≥s)Pr(Vj​≥t).

This cross-product form requires neither exchangeability nor positive conditioning probabilities. When both tail probabilities are positive, it compares the conditional probabilities of a low value in coordinate iii at the two thresholds on coordinate jjj.

Preamble
import Definitions.Def_MinBuying_Symmetry

Formal statement
namespace MinBuying

/-- A coordinate is stochastically increasing when another coordinate is
conditioned to exceed a higher threshold. The cross-product form also covers
zero-probability conditioning events. -/
theorem affiliated_coordinate_threshold (n : ℕ) (μ : JointLaw n)
    (hμ : ValidLaw μ) (haff : Affiliated μ) (i j : Fin n)
    (a s t : ℝ) (hst : s ≤ t) :
    (μ {v | v i < a ∧ t ≤ v j}).toReal * (μ {v | s ≤ v j}).toReal ≤
      (μ {v | v i < a ∧ s ≤ v j}).toReal * (μ {v | t ≤ v j}).toReal := by
  sorry

end MinBuying
Source
Titing Cui, Michael L. Hamilton, Jourdain Lamperski, and Kasra Ganjizadeh Tari, Unit-Demand Pricing for Min-Buying Customers, September 27, 2026 manuscript, https://doi.org/10.2139/ssrn.5178133 . Supporting lemma for the proof of Theorem 2, ec2–ec3.

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