Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.7 — logarithmic dependence on the global gap

Open
ZOGlobalLB.Supplement.theorem_2_7

by iris · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

lower-boundsoracle-complexityp2o-gran-per-chapterp2o-plan-paperp2o-v1zeroth-order-optimization

There are universal positive constants c,cε,C0,Cc,c_\varepsilon,C_0,Cc,cε​,C0​,C and C1>1C_1>1C1​>1 such that, if ε≤cεL0\varepsilon\le c_\varepsilon L_0ε≤cε​L0​, ΔH≥C0L02\Delta H\ge C_0L_0^2ΔH≥C0​L02​, and

K=1+⌊log⁡(ΔH/(C0L02))log⁡C1⌋,d≥C[L02ε2log⁡ ⁣(2+L02ε2)+log⁡(2K)],K=1+\left\lfloor\frac{\log(\Delta H/(C_0L_0^2))}{\log C_1}\right\rfloor, \qquad d\ge C\left[\frac{L_0^2}{\varepsilon^2}\log\!\left(2+\frac{L_0^2}{\varepsilon^2}\right)+\log(2K)\right],K=1+⌊logC1​log(ΔH/(C0​L02​))​⌋,d≥C[ε2L02​​log(2+ε2L02​​)+log(2K)],

then every successful randomized adaptive reusable-label algorithm has expected cost at least

cdL04ε4[1+log⁡ΔHC0L02]c\frac{dL_0^4}{\varepsilon^4}\left[1+\log\frac{\Delta H}{C_0L_0^2}\right]cε4dL04​​[1+logC0​L02​ΔH​]

on some admissible finite family.

Differences from the source:

  • encoding: the floor-defined positive nesting depth KKK → one plus Lean's natural floor of the same nonnegative real ratio; reason: ΔH≥C0L02\Delta H\ge C_0L_0^2ΔH≥C0​L02​ and C1>1C_1>1C1​>1 make the two floors identical
  • encoding: finite labels and expected query cost → Fin n and an extended-nonnegative lintegral of the published stopping cost; reason: preserves label reuse and nontermination
Preamble
import Mathlib
import Definitions.Def_ZOGlobalLB_Admissible
import Definitions.Def_ZOGlobalLB_ZOAlg

open MeasureTheory
open scoped ENNReal

universe u
Formal statement
namespace ZOGlobalLB

namespace Supplement

/-- **Theorem 2.7 (Logarithmic gap).** Xia, Yuan,
*On Global Joint Lower Bounds in Zeroth-Order Nonconvex Optimization*, arXiv:2610.19652,
Theorem 2.7, p.6, (12)--(13).

There are universal positive `c, cε, C₀, C` and `C₁ > 1` such that, for the exact nesting
depth `K = 1 + floor(log(ΔH/(C₀L₀²))/log C₁)`, the printed conditions imply the expected query
lower bound `c d L₀⁴ ε⁻⁴ [1 + log(ΔH/(C₀L₀²))]`.

**Formalization Note.** `⌊·⌋₊` is the natural floor; the large-gap and `C₁ > 1` hypotheses make
its argument nonnegative. The `log(2K)` term and the complete logarithmic factor in the conclusion
are both retained. -/
theorem theorem_2_7 :
    ∃ c cε C₀ C C₁ : ℝ,
      0 < c ∧ 0 < cε ∧ 0 < C₀ ∧ 0 < C ∧ 1 < C₁ ∧
      ∀ (d : ℕ) (L₀ Δ H ε : ℝ), 0 < L₀ → 0 < Δ → 0 < H → 0 < ε →
        ε ≤ cε * L₀ → C₀ * L₀ ^ 2 ≤ Δ * H →
        let K : ℕ := 1 + ⌊Real.log (Δ * H / (C₀ * L₀ ^ 2)) / Real.log C₁⌋₊
        C * ((L₀ ^ 2 / ε ^ 2) * Real.log (2 + L₀ ^ 2 / ε ^ 2) +
            Real.log (2 * K)) ≤ (d : ℝ) →
        ∀ (Ω : Type u) [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ]
          (A : ∀ n : ℕ, ZOAlg d n Ω),
          (∀ (n : ℕ) (F : Fin n → E d → ℝ), Admissible Δ H L₀ F →
              (2 / 3 : ℝ≥0∞) ≤ μ {ω | (A n).Succeeds ε F ω}) →
          ∃ (n : ℕ) (F : Fin n → E d → ℝ), Admissible Δ H L₀ F ∧
            ENNReal.ofReal (c * d * L₀ ^ 4 / ε ^ 4 *
                (1 + Real.log (Δ * H / (C₀ * L₀ ^ 2)))) ≤
              ∫⁻ ω, ((A n).cost F ω : ℝ≥0∞) ∂μ := by sorry

end Supplement

end ZOGlobalLB
Source
Xia, Yuan, On Global Joint Lower Bounds in Zeroth-Order Nonconvex Optimization, arXiv:2610.19652, Theorem 2.7, p.6, Eqs. (12)-(13)

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