Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A.6, p. 54 — δ^γ̄ δ^(−[γ_i−1]^+) δ^(−[1−γ_i]^+) ≥ 1 and δ^(γ̄+γ_i+1) ≤ δ^(2γ̄+1)

Proved
NestedLogitVariants.PowersDelta.exponent_ge_one

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

approximation-algorithmsassortment-optimizationnested-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let δ>1\delta > 1δ>1, 0<γ≤γˉ0 < \gamma \le \bar\gamma0<γ≤γˉ​ and γˉ>1\bar\gamma > 1γˉ​>1. Then

δγˉ δ−[γ−1]+ δ−[1−γ]+≥1andδγˉ+γ+1≤δ2γˉ+1,\delta^{\bar\gamma}\, \delta^{-[\gamma - 1]^+}\, \delta^{-[1 - \gamma]^+} \ge 1 \qquad \text{and} \qquad \delta^{\bar\gamma + \gamma + 1} \le \delta^{2\bar\gamma + 1},δγˉ​δ−[γ−1]+δ−[1−γ]+≥1andδγˉ​+γ+1≤δ2γˉ​+1,

where [t]+=max⁡{t,0}[t]^+ = \max\{t, 0\}[t]+=max{t,0}.

Applied with γ=γi\gamma = \gamma_iγ=γi​ and γˉ=max⁡iγi\bar\gamma = \max_i \gamma_iγˉ​=maxi​γi​, these two inequalities remove the extra powers of δ\deltaδ in the last step of the nonempty case of the proof of Theorem 12; the first is where the standing assumption γˉ>1\bar\gamma > 1γˉ​>1 of §6 is used.

Formalization Note All powers are real powers.

Preamble
import Mathlib
Formal statement
namespace NestedLogitVariants.PowersDelta

/-- A.6, p. 54: for `δ > 1`, `0 < γ ≤ γ̄` and `γ̄ > 1`,
`δ^{γ̄} δ^{−[γ−1]^+} δ^{−[1−γ]^+} ≥ 1` and `δ^{γ̄+γ+1} ≤ δ^{2γ̄+1}`. -/
theorem exponent_ge_one (δ γ γbar : ℝ) (hδ : 1 < δ) (hγ : 0 < γ) (hγle : γ ≤ γbar)
    (hγbar1 : 1 < γbar) :
    1 ≤ δ ^ γbar * δ ^ (-max (γ - 1) 0) * δ ^ (-max (1 - γ) 0) ∧
      δ ^ (γbar + γ + 1) ≤ δ ^ (2 * γbar + 1) := by sorry

end NestedLogitVariants.PowersDelta
Source
Davis, Gallego, Topaloglu, Assortment optimization under variants of the nested logit model, revised manuscript of June 18, 2013 (published Oper. Res. 62(2), 2014, DOI 10.1287/opre.2014.1256), p. 54, Appendix A.6, the exponent argument
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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