Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2, p. 572 — additive invariance of the choice distribution

Proved
BoundedNV.Pooling.lemma2_additive_invariance

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

bounded-rationalitylogit-choicep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Y⊆RY\subseteq\mathbb RY⊆R be a measurable decision domain, and suppose the logit normalizer of a utility uuu at parameter β>0\beta>0β>0 is finite and positive. Adding a constant aaa to every utility value does not change the choice distribution:

Ψu+a(y)=Ψu(y)for every y∈R.\Psi_{u+a}(y)=\Psi_u(y)\qquad\text{for every }y\in\mathbb R.Ψu+a​(y)=Ψu​(y)for every y∈R.

This result permits the cost-based logit law used here to represent the paper's profit-based behavioral choice.

Formalization Note The normalizer assumptions make the density a probability density rather than an artifact of Lean's default value for a nonintegrable integral.

Preamble
import Mathlib
import Definitions.Def_BoundedNV_Pooling_Logit

open MeasureTheory
Formal statement
namespace BoundedNV.Pooling

/-- Lemma 2, p. 572: a common additive shift of utility preserves the choice CDF. -/
theorem lemma2_additive_invariance (Y : Set ℝ) (u : ℝ → ℝ) (β a : ℝ)
    (hY : MeasurableSet Y)
    (hu : IntegrableOn (fun v => Real.exp (u v / β)) Y)
    (hZ : 0 < ∫ v in Y, Real.exp (u v / β))
    (hβ : 0 < β) (y : ℝ) :
    logitCDF Y (fun v => u v + a) β y = logitCDF Y u β y := by sorry

end BoundedNV.Pooling
Source
Su, Bounded Rationality in Newsvendor Models, Manufacturing & Service Operations Management 10(4), 2008, p. 572 (PDF 7), Lemma 2; proof p. 586 (PDF 21), eq. (35)
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