Section 2.2 — recovering capped demand from a qualified log
ProvedInventoryBounds.recensor_qualified_loginventoryprobabilitysample-complexity
If the logged boundary b reaches cap a, then recensoring min(d,b) at a gives exactly min(d,a). This is a pathwise identity, without statistical assumptions.
Preamble
import Definitions.Def_InventoryBounds_Primitives import Mathlib.Tactic.Linarith import Mathlib.Tactic.Ring set_option autoImplicit false
Formal statement
namespace InventoryBounds
theorem recensor_qualified_log (d a b : ℝ) (hab : a ≤ b) :
min (min d b) a = min d a := by sorry
end InventoryBoundsSource
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, Section 2.2
Read-back
What the Lean code literally says, in plain math · gpt-6
For every real satisfying , the identity holds. There are no nonnegativity assumptions on and no ordering assumption on relative to either or . The case is included.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.