Proposition 1 — Lower certificate for the optimal cost
ProvedCappedBaseStock.lower_certificate_boundConsider a periodic-review lost-sales inventory system. Demand is i.i.d., nonnegative and real-valued, with . Lead time is an integer , and holding and lost-sales rates satisfy . Inventory and the pipeline coordinates initially equal zero. The first pipeline component arrives, the order is placed before current demand is observed, demand is served up to available inventory, and the remaining pipeline shifts; today's order arrives periods later. The period cost is .
Costs use the upper limit of finite-horizon expected average costs from this empty initial state. is the infimum over all measurable, possibly time-dependent history policies in the canonical demand-path model, with independent uniform private randomization. Infinite expected costs remain infinite. A capped base-stock rule orders , with finite . Its cost is denoted by , and is the infimum over these parameters. Ordinary base stock at level is the same rule with cap .
For a demand block, let , including the zero empty sum. A pair is feasible when , , and, for both and ,
The lower certificate is the infimum of over this feasible set. Neither attainment of the infimum nor positivity of is assumed. Claim. . The policy optimum is taken over the full zero-start history-policy class; a stationary-optimum reduction is not an added hypothesis.
import Definitions.Def_CappedBaseStock_Model open scoped ENNReal
namespace CappedBaseStock
theorem lower_certificate_bound (P : DemandLaw) (c : Parameters) :
lowerCertificate P c ≤ OPT P c := by sorry
end CappedBaseStockRead-back
What the Lean code literally says, in plain math · GPT-6 (independent Codex sub-agent)
For every probability measure on the nonnegative real numbers with integrable identity function and strictly positive real mean , every integer , and every pair of real numbers and , the certificate infimum defined below is at most the policy cost infimum defined below. For a sequence of nonnegative real numbers, real numbers , and every integer , define , with the empty sum at equal to , and define , where and the value is embedded in . A real pair is feasible when , , and, for both and , its nonnegative Lebesgue integral under the infinite independent product measure satisfies in . The certificate infimum is , with each objective embedded as a finite nonnegative real in . For the policy infimum, let have law and independently let have the restriction of Lebesgue measure to . A policy specifies, for every integer , a measurable map and places the finite nonnegative order ; no boundedness or integrability of these maps is required, and at there are no demand coordinates. Its state starts at and for and evolves by , for , and . Its period cost in is , and its cost is , where ranges over nonnegative integers and the nonnegative integrals and the limit superior may be infinite. Define over all these policies. The asserted inequality is . Both infima and the inequality are in the extended nonnegative reals, the infimum of an empty family is , and no feasible pair or policy attaining either infimum is asserted to exist. Zero demand values, , , , and are included whenever the stated conditions hold; subtraction in the state and loss expressions is truncated at zero, as indicated by the positive part, while the sums defining and the expression inside use ordinary real subtraction.
Confirmed by the mission captain (proposal self-audit).