Theorem 2: strict gap for the whole classical class, remainder varying by outcome
ProvedTwoStageRnQ.impossibility_strict_inf_randTheorem 2 with a strict gap for the whole classical class, the upstream remainder varying by outcome. Let . For every there is an instance with and such that
The first two infima run over all demand environments and all classical controls of the counter construction. The last two run over every demand environment , every shipment policy and all fixed controls such that follows the classical rule from a compatible initialization whose upstream remainder is any time-0 random variable (RuleRand.FollowsRnQRand). The benchmark is in all four comparisons, and the class contains a policy whose costs are finite in both accountings, so the strict inequalities are not satisfied by an empty infimum.
Formalization Note This extends TwoStageRnQ.impossibility_strict_inf, whose policy infima cover compatible initializations with a fixed remainder (part of the controls). Together with TwoStageRnQ.paper_rule_follows_rand it covers every compatible initialization of the paper, with fixed or outcome-dependent remainder.
import Definitions.Def_TwoStageRnQ_RuleRand
namespace TwoStageRnQ
theorem impossibility_strict_inf_rand (r : ℝ) (hr : r < (1 + Real.sqrt 3) / 2) :
∃ P : Params, 0 < P.lam ∧ 0 < P.L1 ∧ 0 < P.L2 ∧ 0 < P.h1 ∧ 0 < P.h2 ∧ 0 < P.p ∧
0 < P.K1 ∧ 0 < P.K2 ∧ 0 < OPTsh P ∧ OPTsh P < ⊤ ∧
ENNReal.ofReal r * OPTsh P
< ⨅ (S : DemandSpace P) (c : ClassicalControls), classicalShipCost P S c ∧
ENNReal.ofReal r * OPTsh P
< ⨅ (S : DemandSpace P) (c : ClassicalControls), classicalLotCost P S c ∧
ENNReal.ofReal r * OPTsh P
< ⨅ (S : DemandSpace P) (π : ShipmentPolicy P S) (R1 : ℤ) (R2 : ℤ) (Q : ℕ+)
(n : ℕ+) (_ : RuleRand.FollowsRnQRand S π R1 R2 Q n), π.shipCost ∧
ENNReal.ofReal r * OPTsh P
< ⨅ (S : DemandSpace P) (π : ShipmentPolicy P S) (R1 : ℤ) (R2 : ℤ) (Q : ℕ+)
(n : ℕ+) (_ : RuleRand.FollowsRnQRand S π R1 R2 Q n), π.lotCost (Q, n * Q) ∧
∃ (S : DemandSpace P) (π : ShipmentPolicy P S) (R1 R2 : ℤ) (Q n : ℕ+),
RuleRand.FollowsRnQRand S π R1 R2 Q n ∧ π.shipCost < ⊤ ∧ π.lotCost (Q, n * Q) < ⊤ := by sorry
end TwoStageRnQ
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.