Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 4 — w.p. ≥1−e−τ\ge1-e^{-\tau}≥1−e−τ, ∥μ^−μ⋆∥q≤min⁡{8(τ+m)/N, m1/q2(τ+log⁡(2m))/N}\|\hat\mu-\mu^\star\|_q\le\min\{8\sqrt{(\tau+m)/N},\ \frac{m^{1/q}}{\sqrt2}\sqrt{(\tau+\log(2m))/N}\}∥μ^​−μ⋆∥q​≤min{8(τ+m)/N​, 2​m1/q​(τ+log(2m))/N​}

Proved
DynAssortPers.TypeDist.theorem_4

by mikedeng1 · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

concentrationempirical-distributionlp-normp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let μ⋆∈Δm\mu^\star\in\Delta^mμ⋆∈Δm be a distribution of customer types on {1,…,m}\{1,\dots,m\}{1,…,m}, and let i1,…,iNi_1,\dots,i_Ni1​,…,iN​ (N≥1N\ge1N≥1) be the types of NNN customers, drawn i.i.d. from μ⋆\mu^\starμ⋆. Let

μ^i=1N∑t=1NI[it=i]\hat\mu_i=\frac1N\sum_{t=1}^N\mathbb I[i_t=i]μ^​i​=N1​t=1∑N​I[it​=i]

be the empirical type frequencies. Let τ≥0\tau\ge0τ≥0 and q∈[1,∞]q\in[1,\infty]q∈[1,∞] be given. Then, with probability at least 1−e−τ1-e^{-\tau}1−e−τ,

∥μ^−μ⋆∥q ≤ min⁡{8τ+mN, m1/q2τ+log⁡(2m)N},\|\hat\mu-\mu^\star\|_q\ \le\ \min\left\{8\sqrt{\frac{\tau+m}{N}},\ \frac{m^{1/q}}{\sqrt2}\sqrt{\frac{\tau+\log(2m)}{N}}\right\},∥μ^​−μ⋆∥q​ ≤ min{8Nτ+m​​, 2​m1/q​Nτ+log(2m)​​},

where ∥⋅∥q\|\cdot\|_q∥⋅∥q​ is the ℓq\ell_qℓq​ norm on Rm\mathbb R^mRm, m1/q=1m^{1/q}=1m1/q=1 for q=∞q=\inftyq=∞, and log⁡\loglog is the natural logarithm.

The first term shows that μ⋆\mu^\starμ⋆ is estimated consistently in every ℓq\ell_qℓq​ norm, q≥1q\ge1q≥1, as soon as NNN grows faster than mmm; in particular μ^\hat\muμ^​ is m/N\sqrt{m/N}m/N​-consistent in ℓ1\ell_1ℓ1​. The second term is the sharper bound when NNN is large compared with m2/qm^{2/q}m2/q.

Formalization Note N≥1N\ge1N≥1 is assumed: μ^\hat\muμ^​ is undefined for an empty sample. m≥1m\ge1m≥1 is implied by μ⋆∈Δm\mu^\star\in\Delta^mμ⋆∈Δm. The probability is the finite sum, over the samples x∈{1,…,m}Nx\in\{1,\dots,m\}^Nx∈{1,…,m}N in the event, of ∏tμxt⋆\prod_t\mu^\star_{x_t}∏t​μxt​⋆​. The paper's observation model also records an item jtj_tjt​ and an assortment StS_tSt​ with every type; since the types iti_tit​ are i.i.d. μ⋆\mu^\starμ⋆ whatever the items and assortments are, the type marginal is the whole law of μ^\hat\muμ^​, and restricting to it is exact. The ℓq\ell_qℓq​ norm is Mathlib's PiLp norm; m1/qm^{1/q}m1/q is mmm raised to an exponent defined as 000 at q=∞q=\inftyq=∞ and 1/q1/q1/q otherwise. Types are 0-based.

Preamble
import Mathlib
import Definitions.Def_DynAssortPers_TypeDist_IIDSampling
import Definitions.Def_DynAssortPers_TypeDist_Estimator
Formal statement
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
Source
Kallus, Udell, Dynamic Assortment Personalization in High Dimensions, arXiv:1610.05604 (PDF sha256 2b010481…216a), Theorem 4, Sec. 3.2.4, p. 18
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me