Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 13 — relations between k, ⌈k^β⌉ and N(k) = Σ_{k′≤k} ⌈k′^β⌉

Proved
AdaptiveBaseStock.Regret.cycle_count_bounds

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysis

Let β∈(0,1)\beta \in (0,1)β∈(0,1) and, for k≥1k \ge 1k≥1, let N(k)=∑k′=1k⌈k′β⌉N(k) = \sum_{k'=1}^k \lceil k'^\beta\rceilN(k)=∑k′=1k​⌈k′β⌉. Then for every k≥1k \ge 1k≥1:

  1. k≤[(β+1) N(k)]1/(β+1)k \le [(\beta+1)\, N(k)]^{1/(\beta+1)}k≤[(β+1)N(k)]1/(β+1);
  2. k⋅⌈kβ⌉≤2(β+1) N(k)k \cdot \lceil k^\beta\rceil \le 2(\beta+1)\, N(k)k⋅⌈kβ⌉≤2(β+1)N(k);
  3. ⌈kβ⌉≤2 [(β+1) N(k)]β/(β+1)\lceil k^\beta\rceil \le 2\,[(\beta+1)\, N(k)]^{\beta/(\beta+1)}⌈kβ⌉≤2[(β+1)N(k)]β/(β+1);
  4. ⌈kβ⌉α≤2 [(β+1) N(k)]αβ/(β+1)\lceil k^\beta\rceil^\alpha \le 2\,[(\beta+1)\, N(k)]^{\alpha\beta/(\beta+1)}⌈kβ⌉α≤2[(β+1)N(k)]αβ/(β+1) for every α∈(0,1)\alpha \in (0,1)α∈(0,1).

These inequalities convert bounds stated in the number of cycles into bounds in the number of periods N(L)N(L)N(L).

Preamble
import Mathlib
import Definitions.Def_AdaptiveBaseStock_Regret_Algorithm
Formal statement
namespace AdaptiveBaseStock.Regret

/-- Lemma 13, p. 25: with `N(k) = Σ_{k'=1}^k ⌈k'^β⌉` and `β ∈ (0, 1)`, for every `k ≥ 1`:
(i) `k ≤ [(β+1) N(k)]^{1/(β+1)}`; (ii) `k ⌈k^β⌉ ≤ 2(β+1) N(k)`;
(iii) `⌈k^β⌉ ≤ 2 [(β+1) N(k)]^{β/(β+1)}`; (iv) `⌈k^β⌉^α ≤ 2 [(β+1) N(k)]^{αβ/(β+1)}` for
every `α ∈ (0, 1)`. -/
theorem cycle_count_bounds (β : ℝ) (hβ0 : 0 < β) (hβ1 : β < 1) (k : ℕ) (hk : 1 ≤ k) :
    (k : ℝ) ≤ ((β + 1) * (periodsUpTo β k : ℝ)) ^ (1 / (β + 1)) ∧
    (k : ℝ) * (cycleLen β k : ℝ) ≤ 2 * (β + 1) * (periodsUpTo β k : ℝ) ∧
    (cycleLen β k : ℝ) ≤ 2 * ((β + 1) * (periodsUpTo β k : ℝ)) ^ (β / (β + 1)) ∧
    ∀ α : ℝ, 0 < α → α < 1 →
      (cycleLen β k : ℝ) ^ α ≤ 2 * ((β + 1) * (periodsUpTo β k : ℝ)) ^ (α * β / (β + 1)) := by sorry

end AdaptiveBaseStock.Regret
Source
Huh, Janakiraman, Muckstadt, Rusmevichientong, An Adaptive Algorithm for Finding the Optimal Base-Stock Policy in Lost Sales Inventory Systems with Censored Demand, working paper, February 8, 2007 (published version: Math. Oper. Res., 2009, DOI 10.1287/moor.1080.0367), Lemma 13, p. 25 (proof in Appendix A, pp. 32–33)
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