Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 5: J(vj)>0J(v_j)>0J(vj​)>0 and N(vj)<0N(v_j)<0N(vj​)<0 for vj>0v_j>0vj​>0

Proved
AssortSearch.SearchQC.J_pos_N_neg

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

assortment-planningconsumer-searchp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let λ>0\lambda>0λ>0 and VS>0V_S>0VS​>0, and let Hˉ(vj)=1−e−λ(vj+VS)\bar H(v_j)=1-e^{-\lambda(v_j+V_S)}Hˉ(vj​)=1−e−λ(vj​+VS​) with derivative Hˉ′(vj)=λe−λ(vj+VS)\bar H'(v_j)=\lambda e^{-\lambda(v_j+V_S)}Hˉ′(vj​)=λe−λ(vj​+VS​). For every vj>0v_j>0vj​>0,

J(vj)=Hˉ(vj)VS+Hˉ′(vj)vj(vj+VS)(vj+VS)2>0,N(vj)=Hˉ′(vj)(vj+VS)−Hˉ(vj)(vj+VS)2<0.J(v_j)=\frac{\bar H(v_j)V_S+\bar H'(v_j)v_j(v_j+V_S)}{(v_j+V_S)^2}>0,\qquad N(v_j)=\frac{\bar H'(v_j)(v_j+V_S)-\bar H(v_j)}{(v_j+V_S)^2}<0.J(vj​)=(vj​+VS​)2Hˉ(vj​)VS​+Hˉ′(vj​)vj​(vj​+VS​)​>0,N(vj​)=(vj​+VS​)2Hˉ′(vj​)(vj​+VS​)−Hˉ(vj​)​<0.

The paper observes that J>0J>0J>0 "because each term is positive" and asserts N<0N<0N<0 ("It can be shown that N(vj)<0N(v_j)<0N(vj​)<0"). Together with (7), these signs show that at a critical point of hsih^{si}hsi the terms fff and ggg have the same sign.

Preamble
import Mathlib
import Definitions.Def_AssortSearch_SearchQC_ProofTerms
Formal statement
namespace AssortSearch.SearchQC

/-- p. 15: for `λ > 0`, `V_S > 0` and `v_j = x > 0`, `J(x) > 0` and `N(x) < 0`. -/
theorem J_pos_N_neg (lam VS x : ℝ) (hlam : 0 < lam) (hVS : 0 < VS) (hx : 0 < x) :
    0 < Jfn lam VS x ∧ Nfn lam VS x < 0 := by sorry

end AssortSearch.SearchQC
Source
Cachon, Terwiesch & Xu, Retail Assortment Planning in the Presence of Consumer Search, working paper (Dec. 20, 2002), p. 15 (PDF 17), proof of Theorem 5
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