Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix B.1, p. 12: the round and query thresholds imply m/(48ε)

Proved
CompositeLB.DetLip.query_count

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

lower-boundoracle-complexityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1query-count

For an integer m≥1m\ge1m≥1 and 0<ε≤1/120<\varepsilon\le1/120<ε≤1/12, the two query thresholds in Appendix B.1 obey

min⁡{mε, ⌊112ε⌋⌈m2⌉}≥m48ε.\min\left\{\frac m\varepsilon,\ \left\lfloor\frac1{12\varepsilon}\right\rfloor\left\lceil\frac m2\right\rceil\right\}\ge\frac m{48\varepsilon}.min{εm​, ⌊12ε1​⌋⌈2m​⌉}≥48εm​.

It converts the number of completed rounds into the explicit query lower bound for the normalized hard instance.

Formalization Note Floors and ceilings are natural numbers cast to real numbers. The main theorem itself retains an unspecified absolute Ω constant because the printed hard function is not 1-Lipschitz without rescaling.

Preamble
import Mathlib
import Definitions.Def_CompositeLB_DetLip_Model
Formal statement
namespace CompositeLB.DetLip

/-- Appendix B.1, p. 12: the two stopping thresholds both give enough queries. -/
theorem query_count (m : ℕ) (ε : ℝ) (hm : 1 ≤ m)
    (hε : 0 < ε) (hε_bound : ε ≤ 1 / 12) :
    (m : ℝ) / (48 * ε) ≤
      min ((m : ℝ) / ε)
        (((⌊1 / (12 * ε)⌋₊ : ℕ) : ℝ) *
          ((⌈(m : ℝ) / 2⌉₊ : ℕ) : ℝ)) := by sorry

end CompositeLB.DetLip
Source
Woodworth & Srebro, arXiv:1605.08003v3, App. B.1, p. 12, query-count display before Lemma 2
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