Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (9): conditional maximum-threshold comparison

Proved
MinBuying.affiliated_threshold_comparison

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

min-buyingoperations-researchpricingprobability

For an exchangeable affiliated nonnegative joint probability law, a coordinate iii, and thresholds a≤ba\le ba≤b with positive probability that the maximum is at least bbb, the conditional probability of Vi<aV_i<aVi​<a given that the maximum is at least aaa is at least its conditional probability given that the maximum is at least bbb. Affiliation is the actual density-or-PMF condition.

Preamble
import Definitions.Def_MinBuying_Symmetry

Formal statement
namespace MinBuying

/-- Equation (9), obtained in the source through affiliation of order
statistics. Conditioning events have positive probability; this is a theorem
obligation rather than an additional definition of affiliation. -/
theorem affiliated_threshold_comparison (n : ℕ) (hn : 0 < n) (μ : JointLaw n)
    (hμ : ValidLaw μ) (hex : Exchangeable μ) (haff : Affiliated μ)
    (i : Fin n) (a b : ℝ) (hab : a ≤ b)
    (hb : 0 < μ (upperMaximumEvent b)) :
    (μ (coordinateBelowAndUpperMaximumEvent i a b)).toReal /
        (μ (upperMaximumEvent b)).toReal ≤
      (μ (coordinateBelowAndUpperMaximumEvent i a a)).toReal /
        (μ (upperMaximumEvent a)).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, 47 PDF pages (main pp.1–27; companion ec1–ec20). https://doi.org/10.2139/ssrn.5178133 . p.14 Eq.(9); PDF pp.30–32/ec3–ec5, proof of Theorem 2.
Read-back

What the Lean code literally says, in plain math · gpt-6-astra

For every integer n>0n>0n>0, let μ\muμ be a probability measure on Rn\mathbb R^nRn such that all coordinates are nonnegative simultaneously μ\muμ-almost surely. Assume μ\muμ is invariant under every map (xi)i↦(xσ(i))i(x_i)_i\mapsto(x_{\sigma(i)})_i(xi​)i​↦(xσ(i)​)i​ for a permutation σ\sigmaσ of the coordinates, and assume one of the following alternatives holds: either μ\muμ has an everywhere nonnegative, Borel-measurable real density fff with respect to Lebesgue measure on Rn\mathbb R^nRn, satisfying f(x)f(y)≤f(x∨y)f(x∧y)f(x)f(y)\le f(x\vee y)f(x\wedge y)f(x)f(y)≤f(x∨y)f(x∧y) for every x,y∈Rnx,y\in\mathbb R^nx,y∈Rn, or μ\muμ is the measure of a probability mass function www on Rn\mathbb R^nRn whose real point masses satisfy w(x)w(y)≤w(x∨y)w(x∧y)w(x)w(y)\le w(x\vee y)w(x\wedge y)w(x)w(y)≤w(x∨y)w(x∧y) for every x,y∈Rnx,y\in\mathbb R^nx,y∈Rn. Here ∨\vee∨ and ∧\wedge∧ mean coordinatewise maximum and minimum, and the mass-function alternative does not require finite support. For every index i<ni<ni<n and every pair of real numbers a,ba,ba,b with a≤ba\le ba≤b, put At={x:∃j<n, t≤xj}A_t=\{x:\exists j<n,\ t\le x_j\}At​={x:∃j<n, t≤xj​} and Bi,a,t={x:xi<a and ∃j<n, t≤xj}B_{i,a,t}=\{x:x_i<a\text{ and }\exists j<n,\ t\le x_j\}Bi,a,t​={x:xi​<a and ∃j<n, t≤xj​}. If μ(Ab)>0\mu(A_b)>0μ(Ab​)>0, then μ(Bi,a,b)/μ(Ab)≤μ(Bi,a,a)/μ(Aa)\mu(B_{i,a,b})/\mu(A_b)\le\mu(B_{i,a,a})/\mu(A_a)μ(Bi,a,b​)/μ(Ab​)≤μ(Bi,a,a​)/μ(Aa​), with all event masses read as finite real numbers. The coordinate-below test is strict and the maximum-threshold test is weak. The thresholds need not be nonnegative, and equality a=ba=ba=b is allowed. Since Ab⊆AaA_b\subseteq A_aAb​⊆Aa​ and μ\muμ is a probability measure, the given positive-mass hypothesis makes both displayed denominators finite and strictly positive.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikeh · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

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