§3.1.3, upper-bound claim — the approximation of (8) is an upper bound for expected sales
ProvedFastFashion.Approx.gTilde_upper_boundLet be an independent Poisson family with rates on a probability space, let , let be a nonempty set of major sizes with , and for every size let be a nonempty finite set of tangent indices. Then for every inventory vector ,
where is the sales of (1) and is the approximation (8) built from the tangents with indices in .
This is the guarantee behind the paper's shipment optimization: the deterministic, piecewise-linear objective that replaces the expected sales in the MIP of §3.2 never underestimates them.
Formalization Note is defined from by (1), not by formula (2). The tangent coefficients are the index-corrected ones of FastFashion.Approx.Tangents. The paper's rule (7) for choosing ("") is approximate; the statement is made for every nonempty finite choice, which includes the paper's. Nonemptiness of is an added hypothesis: without a major size the first term of (8), times a minimum over , has no value.
import Mathlib import Definitions.Def_FastFashion_Structure_Model import Definitions.Def_FastFashion_Approx_Tangents
namespace FastFashion.Approx
open MeasureTheory ProbabilityTheory
/-- §3.1.3, upper-bound claim (Caro–Gallien, p. 13): for every choice of nonempty finite tangent
index sets `𝒩(λ_s) ⊆ ℕ ∪ {∞}` and every inventory vector `q ∈ ℕ^S`, the approximation `g̃_λ(q)`
of (8) is an upper bound for the expected sales `g_λ(q) = 𝔼[G(q)]`. -/
theorem gTilde_upper_bound {S Ω : Type*} [Fintype S] [DecidableEq S] [MeasurableSpace Ω]
(P : Measure Ω) [IsProbabilityMeasure P] (lam : S → ℝ) (N : S → ℝ → Ω → ℕ)
(hN : FastFashion.Structure.IsPoissonFamily lam N P) (hlam : ∀ s, 0 < lam s) (T : ℝ) (hT : 0 < T)
(Sp : Finset S) (hSp : Sp.Nonempty)
(Nset : S → Finset (WithTop ℕ)) (hNset : ∀ s, (Nset s).Nonempty) (q : S → ℕ) :
FastFashion.Structure.expectedSales N P Sp T q ≤ gTilde lam T Sp hSp Nset hNset q := by sorry
end FastFashion.Approx
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.