Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Revenue characterized by the balance equation

Proved
ConstrNestedLogit.Stitch.revenue_characterization

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

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

Fix an assortment S=(Si)i∈MS=(S_i)_{i\in M}S=(Si​)i∈M​ and a real number zzz. With Vi(Si)V_i(S_i)Vi​(Si​), Ri(Si)R_i(S_i)Ri​(Si​), γi\gamma_iγi​, and v0v_0v0​ as in the nested logit model, the balance equation holds exactly when zzz equals the expected revenue Π(S)\Pi(S)Π(S). Its inequality form holds exactly when zzz bounds that revenue from above:

v0z=∑i∈MVi(Si)γi(Ri(Si)−z)⟺z=Π(S),v_0z=\sum_{i\in M}V_i(S_i)^{\gamma_i}(R_i(S_i)-z)\quad\Longleftrightarrow\quad z=\Pi(S),v0​z=i∈M∑​Vi​(Si​)γi​(Ri​(Si​)−z)⟺z=Π(S), v0z≥∑i∈MVi(Si)γi(Ri(Si)−z)⟺Π(S)≤z.v_0z\ge\sum_{i\in M}V_i(S_i)^{\gamma_i}(R_i(S_i)-z)\quad\Longleftrightarrow\quad \Pi(S)\le z.v0​z≥i∈M∑​Vi​(Si​)γi​(Ri​(Si​)−z)⟺Π(S)≤z.

The two relations express the algebraic conversion used in the proof of Lemma 1 to compare candidate combinations with the value solving equation (2).

Formalization Note This is the main model with vi0=0v_{i0}=0vi0​=0, v0>0v_0>0v0​>0, positive product weights, and γi∈(0,1]\gamma_i\in(0,1]γi​∈(0,1]. The formulas include empty assortments, for which Ri(∅)=0R_i(\varnothing)=0Ri​(∅)=0.

Preamble
import Mathlib
import Definitions.Def_NestedLogitVariants_LP_Model
Formal statement
namespace ConstrNestedLogit.Stitch

/-- The algebraic equalities and inequality used in the proof of Lemma 1, pp. 11–12. -/
theorem revenue_characterization {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ}
    (I : NestedLogitVariants.LP.Instance ι n)
    (S : ι → Finset (Fin n)) (z : ℝ)
    (hvnp : ∀ i, I.vnp i = 0)
    (hv0 : 0 < I.v0)
    (hv : ∀ i j, 0 < I.v i j)
    (hγ : ∀ i, 0 < I.γ i ∧ I.γ i ≤ 1) :
    (I.v0 * z = ∑ i, NestedLogitVariants.LP.nestWeight I i (S i) *
      (NestedLogitVariants.LP.R I i (S i) - z) ↔
      z = NestedLogitVariants.LP.revenue I S) ∧
    (I.v0 * z ≥ ∑ i, NestedLogitVariants.LP.nestWeight I i (S i) *
      (NestedLogitVariants.LP.R I i (S i) - z) ↔
      NestedLogitVariants.LP.revenue I S ≤ z) := by sorry

end ConstrNestedLogit.Stitch
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, pp. 11–12, proof of Lemma 1
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