Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Ratio inequality for full and fractional products

Proved
ConstrNestedLogit.Space.ratio_inequality

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

assortment-optimizationknapsacknested-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Suppose an optimal LP solution xxx of (10) has exactly one fractional product jgj_gjg​, and write Sg={j:xj=1}S^g=\{j:x_j=1\}Sg={j:xj​=1}. Its full products have utility-to-space ratios at least that of jgj_gjg​, hence

∑j∈Sgvij(rij−u)≥vijg(rijg−u)wijg∑j∈Sgwij.\sum_{j\in S^g}v_{ij}(r_{ij}-u)\ge\frac{v_{ij_g}(r_{ij_g}-u)}{w_{ij_g}}\sum_{j\in S^g}w_{ij}.j∈Sg∑​vij​(rij​−u)≥wijg​​vijg​​(rijg​​−u)​j∈Sg∑​wij​.

This comparison supports the refined space approximation when individual products are small relative to capacity.

Formalization Note Positive space weights make the displayed quotient meaningful.

Preamble
import Mathlib
import Definitions.Def_ConstrNestedLogit_Space_Model
Formal statement
namespace ConstrNestedLogit.Space

/-- Full products have utility-to-space ratios at least that of the fractional product. -/
theorem ratio_inequality {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ}
    (I : NestedLogitVariants.LP.Instance ι n)
    (w : ι → Fin n → ℝ) (c : ι → ℝ) (i : ι)
    (hvnp : ∀ i, I.vnp i = 0) (hv : ∀ k, 0 < I.v i k)
    (hw : ∀ k, 0 < w i k) (hwc : ∀ k, w i k ≤ c i)
    (u : ℝ) (hu : 0 ≤ u) (x : Fin n → ℝ)
    (hx : spaceLPOptimal I w c i u x) (j : Fin n)
    (hj : oneFractional x j) :
    utilityRatio I w i u j * (∑ k ∈ rounded x, w i k) ≤
      assortmentUtility I i u (rounded x) := by sorry

end ConstrNestedLogit.Space
Source
Gallego & Topaloglu, Constrained Assortment Optimization for the Nested Logit Model, Management Science (2014), DOI 10.1287/mnsc.2014.1931; authors' manuscript of Sept. 11, 2013, p. 21, §5.2 displayed ratio inequality
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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