Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 4.1 — deterministic optimal-value stability

Proved
InventoryBounds.minimizer_value_error

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

inventoryprobabilitysample-complexity

For true and empirical minimizers over a common nonempty candidate class, a uniform objective error at most b gives an absolute difference at most b between their minimum values. The factor is one for values, compared with two for policy regret.

Preamble
import Definitions.Def_InventoryBounds_Primitives
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring

set_option autoImplicit false
Formal statement
namespace InventoryBounds

theorem minimizer_value_error {α : Type*} (f fhat : α → ℝ)
    (s shat : α) (b : ℝ)
    (hdev : ∀ a, |f a - fhat a| ≤ b)
    (htrue : ∀ a, f s ≤ f a)
    (hemp : ∀ a, fhat shat ≤ fhat a) :
    |fhat shat - f s| ≤ b := by sorry

end InventoryBounds
Source
Hanzhang Qin, David Simchi-Levi, Ruihao Zhu, Information Limits of Multistage Inventory Control: Learning, Valuation, and Censoring, arXiv:2609.37380v1 (29 September 2026), https://arxiv.org/abs/2609.37380v1, Corollary 4.1, proof
Read-back

What the Lean code literally says, in plain math · gpt-6

For every type α\alphaα in any universe, every two functions f,f^:α→Rf,\widehat f:\alpha\to\mathbb Rf,f​:α→R, every two elements s,s^∈αs,\widehat s\in\alphas,s∈α, and every real bbb, suppose ∣f(a)−f^(a)∣≤b|f(a)-\widehat f(a)|\le b∣f(a)−f​(a)∣≤b for all a∈αa\in\alphaa∈α, f(s)≤f(a)f(s)\le f(a)f(s)≤f(a) for all a∈αa\in\alphaa∈α, and f^(s^)≤f^(a)\widehat f(\widehat s)\le\widehat f(a)f​(s)≤f​(a) for all a∈αa\in\alphaa∈α. Then ∣f^(s^)−f(s)∣≤b|\widehat f(\widehat s)-f(s)|\le b∣f​(s)−f(s)∣≤b. Thus the assumptions supply a global minimizer sss of fff and a global minimizer s^\widehat ss of f^\widehat ff​; neither is required to be unique, and they may coincide. No structure or finiteness assumption on α\alphaα or explicit nonnegativity assumption on bbb is present. The supplied elements rule out an empty α\alphaα, and the uniform absolute-error bound therefore forces b≥0b\ge0b≥0, making the hypotheses impossible for b<0b<0b<0.

Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by visuddhi · Oct 15, 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