Theorem 4 — w.p. ,
ProvedDynAssortPers.TypeDist.theorem_4Let be a distribution of customer types on , and let () be the types of customers, drawn i.i.d. from . Let
be the empirical type frequencies. Let and be given. Then, with probability at least ,
where is the norm on , for , and is the natural logarithm.
The first term shows that is estimated consistently in every norm, , as soon as grows faster than ; in particular is -consistent in . The second term is the sharper bound when is large compared with .
Formalization Note is assumed: is undefined for an empty sample. is implied by . The probability is the finite sum, over the samples in the event, of . The paper's observation model also records an item and an assortment with every type; since the types are i.i.d. whatever the items and assortments are, the type marginal is the whole law of , and restricting to it is exact. The norm is Mathlib's PiLp norm; is raised to an exponent defined as at and otherwise. Types are 0-based.
import Mathlib import Definitions.Def_DynAssortPers_TypeDist_IIDSampling import Definitions.Def_DynAssortPers_TypeDist_Estimator
namespace DynAssortPers.TypeDist
open Finset
open scoped ENNReal
theorem theorem_4 {m N : ℕ} (μ : Fin m → ℝ) (hμ : μ ∈ stdSimplex ℝ (Fin m))
(hN : 0 < N) (τ : ℝ) (hτ : 0 ≤ τ) (q : ℝ≥0∞) (hq : 1 ≤ q) :
1 - Real.exp (-τ) ≤
iidProb μ (fun x : Fin N → Fin m =>
lqNorm q (fun i => muHat x i - μ i)
≤ min (8 * Real.sqrt ((τ + m) / N))
((m : ℝ) ^ invQ q / Real.sqrt 2 * Real.sqrt ((τ + Real.log (2 * m)) / N))) := by sorry
end DynAssortPers.TypeDist
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.