Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A.6, p. 54 — if δ^(l−1) ≤ a ≤ δ^l then (δ^l)^(γ−1) ≥ δ^(−[1−γ]^+) a^(γ−1)

Proved
NestedLogitVariants.PowersDelta.rpow_lower_bound_level

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\gamma > 0γ>0, l∈Zl \in \mathbb Zl∈Z and aaa a real number with δl−1≤a≤δl\delta^{l-1} \le a \le \delta^lδl−1≤a≤δl. Then

(δl)γ−1≥δ−[1−γ]+ aγ−1,(\delta^l)^{\gamma - 1} \ge \delta^{-[1 - \gamma]^+}\, a^{\gamma - 1},(δl)γ−1≥δ−[1−γ]+aγ−1,

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

In the proof of Theorem 12 this is applied with a=Vi(Si)a = V_i(S_i)a=Vi​(Si​) for the arbitrary assortment SiS_iSi​, to pass from display (36) back to Vi(Si)V_i(S_i)Vi​(Si​).

Formalization Note δl\delta^lδl and δl−1\delta^{l-1}δl−1 are integer powers; the outer powers are real powers. γ>0\gamma > 0γ>0 is the pinned standing assumption γi>0\gamma_i > 0γi​>0.

Preamble
import Mathlib
Formal statement
namespace NestedLogitVariants.PowersDelta

/-- A.6, p. 54: if `δ^{l−1} ≤ a ≤ δ^l` (with `a = V_i(S_i)`), then
`(δ^l)^{γ−1} ≥ δ^{−[1−γ]^+} a^{γ−1}`, where `[t]^+ = max{t, 0}`. -/
theorem rpow_lower_bound_level (δ γ a : ℝ) (l : ℤ) (hδ : 1 < δ) (hγ : 0 < γ)
    (ha1 : δ ^ (l - 1) ≤ a) (ha2 : a ≤ δ ^ l) :
    δ ^ (-max (1 - γ) 0) * a ^ (γ - 1) ≤ (δ ^ l) ^ (γ - 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 bound on (δ^l)^{γ_i−1}
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