Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Z(δ)=δe−λδ/(1−e−λδ)Z(\delta)=\delta e^{-\lambda\delta}/(1-e^{-\lambda\delta})Z(δ)=δe−λδ/(1−e−λδ) is decreasing on (0,∞)(0,\infty)(0,∞)

Proved
AssortSearch.HeurEq.z_antitone

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

assortment-planningp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysis

Let λ>0\lambda>0λ>0 and define, for δ>0\delta>0δ>0,

Z(δ)=δexp⁡(−λδ)1−exp⁡(−λδ).Z(\delta)=\frac{\delta\exp(-\lambda\delta)}{1-\exp(-\lambda\delta)}.Z(δ)=1−exp(−λδ)δexp(−λδ)​.

Then ZZZ is a decreasing (non-increasing) function of δ\deltaδ on (0,∞)(0,\infty)(0,∞).

In the proof of Theorem 7 the no-purchase bias of the estimates reduces to comparing ZZZ at the total preferences ∑j=0x′vj\sum_{j=0}^{x'}v_j∑j=0x′​vj​ and ∑j=0xvj\sum_{j=0}^{x}v_j∑j=0x​vj​ of two assortments; monotonicity of ZZZ settles the comparison.

Formalization Note "Decreasing" is formalized as AntitoneOn on (0,∞)(0,\infty)(0,∞), the property the paper's argument (Z′≤0Z'\le 0Z′≤0) establishes; the denominator vanishes at δ=0\delta=0δ=0, which is excluded.

Preamble
import Mathlib
import Definitions.Def_AssortSearch_HeurEq_Model
Formal statement
namespace AssortSearch.HeurEq

/-- Proof of Theorem 7, p. 23: for `λ > 0`, the function
`Z(δ) = δ exp(−λδ) / (1 − exp(−λδ))` is decreasing in `δ` on `(0, ∞)`. -/
theorem z_antitone (lam : ℝ) (hlam : 0 < lam) :
    AntitoneOn
      (fun δ : ℝ => δ * Real.exp (-(lam * δ)) / (1 - Real.exp (-(lam * δ))))
      (Set.Ioi 0) := by sorry

end AssortSearch.HeurEq
Source
Cachon, Terwiesch & Xu, Retail Assortment Planning in the Presence of Consumer Search, working paper (Dec. 20, 2002), p. 23 (PDF 25), proof of Theorem 7, definition of Z(δ) and its monotonicity
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