Theorem 2 — if then
ProvedGallegoOzerADI.PositiveSetup.myopic_order_up_to_optimalConsider a stationary instance of the finite-horizon inventory model with advance demand information and set-up costs (Definition Model): the single-period cost , the set-up cost , the discount factor and the demand law do not depend on , and . Let be the least minimizer of , and (Definition MyopicLevels). Fix a period and a vector of observed demands with nonnegative components. If
then the optimal order-up-to level equals the myopic one:
Once the demand already observed for period , the first period beyond the protection period, is large enough, the advance demand information for later periods can be ignored when choosing the order-up-to level. The threshold depends only on the single-period cost, the set-up cost and the discount factor.
Formalization Note The conclusion is IsLeast {y | ∀ x, V_t(y, o_t) ≤ V_t(x, o_t)} S^m: is a global minimizer of and no smaller level is. Only the first component is compared with the threshold. The other components are required to be nonnegative, as all reachable observed-demand vectors are (Eq. (1) with nonnegative demands). The paper's proof uses the lower bound of Lemma 3, which needs this, and a negative component of would become a negative first component at a later period. The terminal case is included: there and the statement says that is the least minimizer of .
import Mathlib import Definitions.Def_GallegoOzerADI_PositiveSetup_Model import Definitions.Def_GallegoOzerADI_PositiveSetup_MyopicLevels open MeasureTheory
namespace GallegoOzerADI.PositiveSetup
theorem myopic_order_up_to_optimal {L M : ℕ} [NeZero M] (P : Model L M) (G : ℝ → ℝ)
(K α : ℝ) (ν : Measure (Fin (L + M + 2) → ℝ)) (hG : ∀ t, P.G t = G)
(hK : ∀ t, P.K t = K) (hα : ∀ t, P.α t = α) (hμ : ∀ t, P.μ t = ν) (t : ℕ) (ht₁ : 1 ≤ t)
(htT : t ≤ P.T) (o : Fin M → ℝ) (ho : ∀ j, 0 ≤ o j)
(hobs : myopicUpperLevel G K α - myopicReorderPoint G K ≤ o 0) :
IsLeast {y | ∀ x, P.V t y o ≤ P.V t x o} (myopicOrderUpTo G) := by sorry
end GallegoOzerADI.PositiveSetup
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Here and are natural numbers with , and is a structure of type Model with parameters . The code shown does not include the definition of Model or of its fields, so the fields named below are described only by how they are used.
The other inputs are:
- a function ;
- real numbers and ;
- a measure on the space of real vectors indexed by . The statement assumes nothing about : it need not be a probability measure, finite or σ-finite, unless
Modelitself requires this.
The following hypotheses are imposed:
- Stationarity. For every natural number , including and , the model's period- fields satisfy
So each of these four fields is constant in , with values , , and .
- Period range. is a natural number with , where is the model's horizon field.
- State vector. with for every . The component exists because .
- Condition on the first component. Let be
myopicUpperLevel G K αand bemyopicReorderPoint G K. Their definitions are imported and not shown here. The condition is
This is ordinary real subtraction. It constrains only ; the other components need only be nonnegative.
denotes the model's value function P.V, evaluated at period , a point and the vector . Its definition is not shown. Consider the set
which is the set of global minimizers of over the whole domain of 's second argument. The statement says nothing more about that type than that it carries an order. Let be myopicOrderUpTo G, whose definition is not shown.
The conclusion is that is the least element of . This has two parts:
- is itself a global minimizer:
- Every global minimizer satisfies .
In particular, the theorem asserts that the minimum of is attained. Note which quantities appear where:
- The point depends only on , not on , , , or .
- and enter only through the stationarity hypotheses and the condition on .
- enters only through .
Degenerate cases.
- If , no satisfies , so the statement is vacuous.
- is allowed, and then lives on .
- is allowed. Then is a single nonnegative number and the condition applies to it directly.
- If , the condition on follows from .
- If , only states with at least that large are covered.
- Whether , or can take default values (for example, an infimum or supremum of an empty or unbounded set, or a division by zero) depends on their definitions, which are not shown. If they can, the conclusion is still asserted about whatever value takes.
- The requirement that the model's fields be constant for every natural could be impossible to satisfy if
Modelimposes conditions that conflict with it. In that case the statement would be vacuous. That cannot be decided from the code shown.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.