Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1.1, p. 5555 — for t ≥ 5, each experimental price is charged at least ¼√t times in periods 1, …, t

Proved
BanKeskin.UnknownSparsity.experiment_count

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

dynamic-pricingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-experimentation

Let M1={L2:L=1,2,… }M_1 = \{L^2 : L = 1,2,\dots\}M1​={L2:L=1,2,…} and M2={L2+1:L=1,2,… }M_2 = \{L^2+1 : L = 1,2,\dots\}M2​={L2+1:L=1,2,…} be the experimentation periods of the schedule (7) of Ban and Keskin (2021), in which the experimental prices m1m_1m1​ and m2m_2m2​ are charged. Then for every t≥5t \ge 5t≥5,

∣M1∩{1,…,t}∣ ≥ 14tand∣M2∩{1,…,t}∣ ≥ 14t.|M_1\cap\{1,\dots,t\}| \ \ge\ \tfrac14\sqrt t \qquad\text{and}\qquad |M_2\cap\{1,\dots,t\}| \ \ge\ \tfrac14\sqrt t .∣M1​∩{1,…,t}∣ ≥ 41​t​and∣M2​∩{1,…,t}∣ ≥ 41​t​.

This guarantees that the information about the price sensitivity grows at rate t\sqrt tt​, which underlies the estimation-error bound of Lemma 3 and hence Theorem 3. ILQX uses the same schedule as ILSX (§4.1.1).

Formalization Note. Periods are 1-based. "Each experimental price is charged" counts the experimentation periods of that price, ∣Mi∩{1,…,t}∣|M_i\cap\{1,\dots,t\}|∣Mi​∩{1,…,t}∣.

Preamble
import Mathlib
import Definitions.Def_BanKeskin_UnknownSparsity_Model
Formal statement
namespace BanKeskin.UnknownSparsity

open Classical in
theorem experiment_count (t : ℕ) (ht : 5 ≤ t) :
    (1 / 4 : ℝ) * Real.sqrt t ≤ (((Finset.Icc 1 t).filter fun k => BanKeskin.KnownSparsity.inM1 k).card : ℝ) ∧
      (1 / 4 : ℝ) * Real.sqrt t ≤ (((Finset.Icc 1 t).filter fun k => BanKeskin.KnownSparsity.inM2 k).card : ℝ) := by sorry

end BanKeskin.UnknownSparsity
Source
Ban and Keskin, Personalized Dynamic Pricing with Machine Learning, Management Science 67(9) (2021), p. 5555, §4.1.1, after (7)
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me