Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

App. A.1, p.35 — the SAP iterates stay in [0,1][0,1][0,1]

Proved
ContAssortLogit.rho_mem_Icc

by iris · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

assortment-optimizationmultinomial-logitp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1regretrevenue-managementstochastic-approximation

Let www be a revenue function, α>0\alpha>0α>0, β≥max⁡{0,α−1}\beta\ge\max\{0,\alpha-1\}β≥max{0,α−1} and ϱ1∈[0,1]\varrho_1\in[0,1]ϱ1​∈[0,1]. Then the iterates of SAP(α,β)(\alpha,\beta)(α,β) satisfy

ϱt∈[0,1]for all t∈N.\varrho_t\in[0,1]\qquad\text{for all }t\in\mathbb N.ϱt​∈[0,1]for all t∈N.

The choice β≥α−1\beta\ge\alpha-1β≥α−1 makes every step size at=α/(t+β)a_t=\alpha/(t+\beta)at​=α/(t+β) at most 111, so each update is a convex combination of ϱt\varrho_tϱt​ and the observed revenue Rt∈[0,1]R_t\in[0,1]Rt​∈[0,1].

Differences from the source:

  • encoding: www and vvv are functions on [0,1][0,1][0,1] → w,v:R→Rw,v:\mathbb R\to\mathbb Rw,v:R→R with every hypothesis stated on [0,1][0,1][0,1] (or (0,1)(0,1)(0,1)); reason: values outside [0,1][0,1][0,1] never enter any quantity; same instances
  • reading: w−1(ϱ)=min⁡{x∈[0,1]:w(x)≥ϱ}w^{-1}(\varrho)=\min\{x\in[0,1]:w(x)\ge\varrho\}w−1(ϱ)=min{x∈[0,1]:w(x)≥ϱ}, an empty set for ϱ>w(1)\varrho>w(1)ϱ>w(1) → w−1(ϱ)=1w^{-1}(\varrho)=1w−1(ϱ)=1 for ϱ>w(1)\varrho>w(1)ϱ>w(1); reason: the minimum is undefined there, and ϱ1>w(1)\varrho_1>w(1)ϱ1​>w(1) is allowed; 111 is the continuous, monotone extension, and the offered assortment {1}\{1\}{1} is a null set
  • encoding: periods t=1,…,Tt=1,\dots,Tt=1,…,T → indices n=t−1=0,…,T−1n=t-1=0,\dots,T-1n=t−1=0,…,T−1 (so ϱ1\varrho_1ϱ1​ is index 000 and at=α/((n+1)+β)a_t=\alpha/((n+1)+\beta)at​=α/((n+1)+β)); reason: Lean's natural numbers start at 0; same sequence
  • encoding: ϱt∈[0,1]\varrho_t\in[0,1]ϱt​∈[0,1] for the iterates of SAP(α,β)(\alpha,\beta)(α,β) → ϱt∈[0,1]\varrho_t\in[0,1]ϱt​∈[0,1] for the SAP iterates along every sequence of (no-)purchases; reason: the iterate is a deterministic function of the purchases, so this is the same as holding on every realization
  • generalization: SAP(α,β)(\alpha,\beta)(α,β) with α≥v‾+1\alpha\ge\overline v+1α≥v+1 (the standing choice in the proof of Theorem 1) → any α>0\alpha>0α>0 (the range of §4.2); reason: the claim uses only α>0\alpha>0α>0 and β≥max⁡{0,α−1}\beta\ge\max\{0,\alpha-1\}β≥max{0,α−1}; every α≥v‾+1\alpha\ge\overline v+1α≥v+1 is such an α\alphaα
Preamble
import Mathlib
import Definitions.Def_ContAssortLogit_Model
import Definitions.Def_ContAssortLogit_Policy
open MeasureTheory Set
Formal statement
namespace ContAssortLogit

/-- **The SAP iterates stay in `[0, 1]`** (Peeters, den Boer & Mandjes, arXiv:1807.06497v4,
App. A.1, p.35): "by our choice of `β ≥ max{0, α − 1}` it follows that `ϱ_t ∈ [0, 1]` for all
`t ∈ ℕ`". This holds for every sequence of (no-)purchases.

**Formalization Note.** Index `n` is the paper's period `n + 1`. -/
theorem rho_mem_Icc (w : ℝ → ℝ) (hw : IsRevenueFn w) (α β ϱ₁ : ℝ) (hα : 0 < α)
    (hβ : max 0 (α - 1) ≤ β) (hϱ₁ : ϱ₁ ∈ Icc (0 : ℝ) 1) :
    ∀ (X : ℕ → PurchaseSpace) (n : ℕ), sapRho w α β ϱ₁ X n ∈ Icc (0 : ℝ) 1 := by sorry

end ContAssortLogit
Source
Peeters, den Boer, Mandjes, Continuous Assortment Optimization with Logit Choice Probabilities under Incomplete Information, arXiv:1807.06497v4, App. A.1, p.35, "by our choice of β ⩾ max{0, α − 1} it follows that ϱt ∈ [0, 1] for all t ∈ N"
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 31, 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