Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2, p. 14 — ∑k=1K−1τ(k)≤T/2\sum_{k=1}^{K-1}\tau^{(k)}\le T/2∑k=1K−1​τ(k)≤T/2 for n≥exp⁡((8/T)1/ϵ)n\ge\exp((8/T)^{1/\epsilon})n≥exp((8/T)1/ϵ)

Proved
PrimalDualPricing.Regret.lemma_2

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

learning-algorithmp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let ϵ>0\epsilon>0ϵ>0, T>0T>0T>0, and let n≥3n\ge3n≥3 satisfy n≥exp⁡((8/T)1/ϵ)n\ge\exp\big((8/T)^{1/\epsilon}\big)n≥exp((8/T)1/ϵ). Then the total length of the phases before the last phase KKK satisfies

∑k=1K−1τ(k)≤T2,τ(k)=n−12(3/5)k−1(log⁡n)1+15ϵ.\sum_{k=1}^{K-1}\tau^{(k)}\le\frac T2,\qquad \tau^{(k)}=n^{-\frac12(3/5)^{k-1}}(\log n)^{1+15\epsilon}.k=1∑K−1​τ(k)≤2T​,τ(k)=n−21​(3/5)k−1(logn)1+15ϵ.

The last phase therefore takes at least half of the season.

Formalization Note The page states the threshold n≥exp⁡((8/T)1/ϵ)n\ge\exp((8/T)^{1/\epsilon})n≥exp((8/T)1/ϵ) only. The condition n≥3n\ge3n≥3 is added because KKK is defined only for n≥3n\ge3n≥3.

Preamble
import Mathlib
import Definitions.Def_PrimalDualPricing_Regret_Params
Formal statement
namespace PrimalDualPricing.Regret

/-- Lemma 2 (Chen–Gallego, arXiv:1812.09234v3, p. 14). For `ε > 0`, `T > 0` and `n ≥ 3` with
`n ≥ exp((8/T)^{1/ε})`, the total length of the phases before phase `K` satisfies
`∑_{k=1}^{K−1} τ^{(k)} ≤ T/2`. (`n ≥ 3` is added: below it `K` is undefined.) -/
theorem lemma_2 (eps T : ℝ) (heps : 0 < eps) (hT : 0 < T) (n : ℕ) (hn : 3 ≤ n)
    (hn' : Real.exp ((8 / T) ^ (1 / eps)) ≤ n) :
    ∑ k ∈ Finset.Ico 1 (numPhases eps n), tau eps n k ≤ T / 2 := by sorry

end PrimalDualPricing.Regret
Source
Chen, Gallego, A Primal-dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint, arXiv:1812.09234v3, p. 14, Lemma 2 (parameters p. 13)
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