Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1 (p. 200) — Hιv1=O(∣x∣3)H_\iota v1 = O(|x|^3)Hι​v1=O(∣x∣3) and HιG=O(∣x∣ρ+3)H_\iota G = O(|x|^{\rho+3})Hι​G=O(∣x∣ρ+3), both finite

Proved
FedergruenZipkin.AvgCost.corollary1_hitting_sums

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

hitting-timeinventorymarkov-chainp2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1

In the capacitated inventory model with storage capacity UUU, let ι=[l,u]\iota = [l, u]ι=[l,u] with 0≤u≤U0 \le u \le U0≤u≤U and l≤u−bl \le u - bl≤u−b, and let HιH_\iotaHι​ be the hitting-sum operator of Lemma 3. Let v1v1v1 be the constant function 111 and GGG the one-period cost, which satisfies G(y)≤A+B∣y∣ρG(y) \le A + B|y|^\rhoG(y)≤A+B∣y∣ρ (Assumption 3). Then there are constants such that for all x≤Ux \le Ux≤U

Hιv1(x)≤A1+B1∣x∣3,HιG(x)≤A2+B2∣x∣ρ+3.H_\iota v1(x) \le A_1 + B_1 |x|^3,\qquad H_\iota G(x) \le A_2 + B_2 |x|^{\rho+3}.Hι​v1(x)≤A1​+B1​∣x∣3,Hι​G(x)≤A2​+B2​∣x∣ρ+3.

In particular both functions are finite-valued on x≤Ux \le Ux≤U.

Hιv1(x)H_\iota v1(x)Hι​v1(x) is the largest expected time, over policies in Δι\Delta_\iotaΔι​, for the inventory starting at xxx to enter ι\iotaι, and HιG(x)H_\iota G(x)Hι​G(x) is the largest expected cost incurred meanwhile. Their finiteness is condition FST2(a) in the paper's proof of Theorem 1.

Formalization Note HιH_\iotaHι​ is [0,∞][0,\infty][0,∞]-valued, so the growth bounds already imply finiteness; the finiteness clause is kept because the corollary states it.

Preamble
import Mathlib
import Definitions.Def_FedergruenZipkin_AvgCost_Model
Formal statement
namespace FedergruenZipkin.AvgCost
open scoped ENNReal
theorem corollary1_hitting_sums (M : Model) (U l u : ℤ) (hu0 : 0 ≤ u) (huU : u ≤ U)
    (hlu : l ≤ u - M.b) :
    (∃ A B : ℝ, ∀ x ≤ U,
      H M U l u (fun _ => (1 : ℝ≥0∞)) x ≤ ENNReal.ofReal (A + B * |(x : ℝ)| ^ 3)) ∧
    (∃ A B : ℝ, ∀ x ≤ U,
      H M U l u (fun y => ENNReal.ofReal (M.G y)) x ≤
        ENNReal.ofReal (A + B * |(x : ℝ)| ^ (M.ρ + 3))) ∧
    ∀ x ≤ U, H M U l u (fun _ => (1 : ℝ≥0∞)) x ≠ ⊤ ∧
      H M U l u (fun y => ENNReal.ofReal (M.G y)) x ≠ ⊤ := by sorry
end FedergruenZipkin.AvgCost
Source
Federgruen and Zipkin, An Inventory Model with Limited Production Capacity and Uncertain Demands I, Math. Oper. Res. 11(2), 1986, p. 200, Corollary 1
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

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