Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (13): J_θk(θx) ≤ θ v_k(x)

Proved
BidPriceControl.Asymptotic.scaled_optimum_le

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

dynamic-programmingp2o-batch-rm-cafterp2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management

Under the standing assumptions of §1, let μ∗\mu^*μ∗ be an optimal solution of (9) for (x,k)(x, k)(x,k), so that vk(x)=Jˉk(x,μ∗)v_k(x) = \bar J_k(x, \mu^*)vk​(x)=Jˉk​(x,μ∗). Then for every integer θ≥1\theta \ge 1θ≥1 the optimal expected revenue of the θ\thetaθ-scaled problem satisfies

Jθk(θx)≤θ vk(x).J_{\theta k}(\theta x) \le \theta\, v_k(x).Jθk​(θx)≤θvk​(x).

Formalization Note. Jθk(θx)J_{\theta k}(\theta x)Jθk​(θx) is optValue for the scaled laws scaledLaw F θ, horizon θk\theta kθk and capacity θx\theta xθx; vk(x)v_k(x)vk​(x) is relaxedValue A F k x μstar.

Preamble
import Mathlib
import Definitions.Def_BidPriceControl_Asymptotic_Model
Formal statement
namespace BidPriceControl.Asymptotic

open MeasureTheory ProbabilityTheory

/-- Display (13) of the proof of Theorem 1 (p. 1585): by Lemma 1 and the scaling identity, the optimal
expected revenue of the `θ`-scaled problem satisfies `J_{θk}(θx) ≤ θ v_k(x)`, where
`v_k(x) = J̄_k(x, μ*)` is the optimal value of (9). -/
theorem scaled_optimum_le {m n : ℕ} (A : Fin m → Fin n → ℕ) (F : ℕ → Measure (Fin n → ℝ))
    (k : ℕ) (x : Fin m → ℕ) (hF : ∀ t ∈ Finset.Icc 1 k, IsRequestLaw (F t))
    (μstar : Fin m → ℝ) (hmin : IsRelaxedMinimizer A F k x μstar) (θ : ℕ) (hθ : 1 ≤ θ) :
    optValue A (scaledLaw F θ) (θ * k) (θ • x) ≤ (θ : ℝ) * relaxedValue A F k x μstar := by sorry

end BidPriceControl.Asymptotic
Source
Talluri, van Ryzin, An Analysis of Bid-Price Controls for Network Revenue Management, Management Sci. 44(11), 1998, p. 1585, eq. (13)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Data. The theorem takes A=(aij)∈Nm×nA=(a_{ij})\in\mathbb N^{m\times n}A=(aij​)∈Nm×n, measures (Ft)t(F_t)_t(Ft​)t​ on Rn\mathbb R^nRn, k∈Nk\in\mathbb Nk∈N, x∈Nmx\in\mathbb N^mx∈Nm, μ∗∈Rm\mu^*\in\mathbb R^mμ∗∈Rm and θ∈N\theta\in\mathbb Nθ∈N with θ≥1\theta\ge1θ≥1.

Hypotheses.

  • For each t∈{1,…,k}t\in\{1,\dots,k\}t∈{1,…,k}, FtF_tFt​ is a request law: a probability measure, a.s. nonnegative with at most one positive coordinate, no positive-value atoms of the coordinates, and integrable coordinates.
  • μ∗\mu^*μ∗ minimizes the relaxed value: μ∗≥0\mu^*\ge0μ∗≥0 and Jˉk(x,μ∗)≤Jˉk(x,μ)\bar J_k(x,\mu^*)\le\bar J_k(x,\mu)Jˉk​(x,μ∗)≤Jˉk​(x,μ) for all μ≥0\mu\ge0μ≥0, where Jˉk(x,μ)=∑t=1k∑j∫(rj−μAj)+dFt+∑iμixi\bar J_k(x,\mu)=\sum_{t=1}^k\sum_j\int(r_j-\mu A^j)^+dF_t+\sum_i\mu_ix_iJˉk​(x,μ)=∑t=1k​∑j​∫(rj​−μAj)+dFt​+∑i​μi​xi​ and μAj=∑iμiaij\mu A^j=\sum_i\mu_ia_{ij}μAj=∑i​μi​aij​.

Conclusion.

Jθk(θ)(θx)  ≤  θ Jˉk(x,μ∗).J^{(\theta)}_{\theta k}(\theta x)\;\le\;\theta\,\bar J_k(x,\mu^*).Jθk(θ)​(θx)≤θJˉk​(x,μ∗).

Here J(θ)J^{(\theta)}J(θ) is the recursion

  • J0(θ)≡0J^{(\theta)}_0\equiv0J0(θ)​≡0,
  • Jt(θ)(y)=∫max⁡(Jt−1(θ)(y),max⁡j:Aj≤y(rj+Jt−1(θ)(y−Aj))) dF⌈t/θ⌉(r)J^{(\theta)}_t(y)=\int\max\big(J^{(\theta)}_{t-1}(y),\max_{j:A^j\le y}(r_j+J^{(\theta)}_{t-1}(y-A^j))\big)\,dF_{\lceil t/\theta\rceil}(r)Jt(θ)​(y)=∫max(Jt−1(θ)​(y),maxj:Aj≤y​(rj​+Jt−1(θ)​(y−Aj)))dF⌈t/θ⌉​(r).

So period ttt (counted as periods to go) has law F⌈t/θ⌉F_{\lceil t/\theta\rceil}F⌈t/θ⌉​. The starting capacity is θx=(θxi)i\theta x=(\theta x_i)_iθx=(θxi​)i​. Non-integrable integrands count as 000.

Degenerate cases.

  • No minimizer: if none exists, the statement is vacuous.
  • Indices used: only F1,…,FkF_1,\dots,F_kF1​,…,Fk​ occur.
  • k=0k=0k=0: it asserts 0≤θ∑iμi∗xi0\le\theta\sum_i\mu^*_ix_i0≤θ∑i​μi∗​xi​.
  • θ=1\theta=1θ=1: it asserts Jk(x)≤Jˉk(x,μ∗)J_k(x)\le\bar J_k(x,\mu^*)Jk​(x)≤Jˉk​(x,μ∗).
  • n=0n=0n=0: the left side is 000.
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 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