Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary C.1, p. 48 — at most N log NT epochs offer a product with Tᵢ(ℓ) < log NT

Proved
MNLBandit.WellSeparated.corollary_C_1

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

assortment-optimizationmnl-banditp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the MNL-Bandit problem under Assumption 4.1 with revenues ri∈[0,1]r_i\in[0,1]ri​∈[0,1], and run Algorithm 1 with any tie-breaking rule along any history of TTT customers. Let S1,…,SLS_1,\dots,S_LS1​,…,SL​ be the assortments of the epochs started within the horizon. Let Ti(ℓ)=∣{τ≤ℓ:i∈Sτ}∣T_i(\ell)=|\{\tau\le\ell : i\in S_\tau\}|Ti​(ℓ)=∣{τ≤ℓ:i∈Sτ​}∣ be the number of epochs up to and including ℓ\ellℓ that offered product iii (3.2). Then

∣{ℓ∈{1,…,L}:Ti(ℓ)<log⁡NT for some i∈Sℓ}∣≤Nlog⁡NT.\Big|\big\{\ell\in\{1,\dots,L\} : T_i(\ell)<\log NT\ \text{for some } i\in S_\ell\big\}\Big|\le N\log NT.​{ℓ∈{1,…,L}:Ti​(ℓ)<logNT for some i∈Sℓ​}​≤NlogNT.

In the proof of Theorem 3 this bounds the regret of the epochs in which some offered product has been sampled fewer than log⁡NT\log NTlogNT times by N(N+1)log⁡NTN(N+1)\log NTN(N+1)logNT.

Formalization Note The count uses the paper's own indexing: Ti(ℓ)T_i(\ell)Ti​(ℓ) includes epoch ℓ\ellℓ, and SℓS_\ellSℓ​ is the set offered in epoch ℓ\ellℓ. The last epoch is counted even if it is still in progress at time TTT. The statement is pathwise.

Preamble
import Mathlib
import Definitions.Def_ChoiceCDLP_MNL_mnlObjective
import Definitions.Def_MNLBandit_WellSeparated_Setting
Formal statement
namespace MNLBandit.WellSeparated

open ChoiceCDLP.MNL

/-- Corollary C.1, p. 48, for Algorithm 1 under Assumption 4.1 and `r_i ∈ [0, 1]`, along any
history `h` of `T` customers: the number of epochs `ℓ = 1, …, L` started within the horizon whose
assortment `S_ℓ` contains a product `i` with `T_i(ℓ) < log NT` (`T_i(ℓ)` counting the epochs
`τ ≤ ℓ`, epoch `ℓ` included, that offered `i`) is at most `N log NT`. -/
theorem corollary_C_1 (N : ℕ) (v r : Fin N → ℝ) (𝒮 : Finset (Finset (Fin N)))
    (sel : (Finset (Fin N) → ℝ) → Finset (Fin N))
    (hTU : MNLBandit.UCB.IsTU 𝒮) (hdown : MNLBandit.UCB.DownClosed 𝒮) (hv : ∀ i, 0 ≤ v i ∧ v i ≤ 1)
    (hr : ∀ i, r i ∈ Set.Icc (0 : ℝ) 1) (hsel : MNLBandit.UCB.IsArgmaxSel 𝒮 sel)
    (T : ℕ) (h : Fin T → Option (Fin N)) :
    (((Finset.Icc 1 (epochsStarted r sel h)).filter (fun ℓ =>
        ∃ i ∈ epochSet r sel h ℓ, (Tcount r sel h i ℓ : ℝ) < Real.log (N * T))).card : ℝ)
      ≤ N * Real.log (N * T) := by sorry

end MNLBandit.WellSeparated
Source
Agrawal, Avadhanula, Goyal, Zeevi, MNL-Bandit: A Dynamic Learning Approach to Assortment Selection, arXiv:1706.03880v2, p. 48, Corollary C.1
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me