Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 2.1, Eq. (9) — δ(ν)=O(1/4ν)\delta(\nu)=O(1/4^\nu)δ(ν)=O(1/4ν)

Proved
PolyhedralSOC.UpperBound.delta_decay

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1polyhedral-approximationsecond-order-cone

The accuracy δ(ν)=1/cos⁡(π/2ν+1)−1\delta(\nu)=1/\cos(\pi/2^{\nu+1})-1δ(ν)=1/cos(π/2ν+1)−1 of system (8) decays geometrically: there is an absolute constant C>0C>0C>0 such that for every positive integer ν\nuν

δ(ν)≤C4ν.\delta(\nu)\le\frac{C}{4^\nu}.δ(ν)≤4νC​.

This is what makes the size of the approximation logarithmic in the accuracy: ν=O(ln⁡(1/ε))\nu=O(\ln(1/\varepsilon))ν=O(ln(1/ε)) steps suffice for accuracy ε\varepsilonε.

Formalization Note The paper writes δ(ν)=O(1/4ν)\delta(\nu)=O(1/4^\nu)δ(ν)=O(1/4ν); this states exactly that, with an existential constant chosen before ν\nuν.

Preamble
import Mathlib
import Definitions.Def_PolyhedralSOC_UpperBound_System8
Formal statement
namespace PolyhedralSOC.UpperBound

/-- Ben-Tal & Nemirovski, *On Polyhedral Approximations of the Second-Order Cone*,
Math. Oper. Res. 26(2):193–205 (2001), Proposition 2.1, Eq. (9), p. 199 (PDF p. 7):
`δ(ν) = 1/cos(π/2^{ν+1}) − 1 = O(1/4^ν)`, i.e. there is an absolute constant `C > 0`
with `δ(ν) ≤ C / 4^ν` for every positive integer `ν`. -/
theorem delta_decay :
    ∃ C : ℝ, 0 < C ∧ ∀ ν : ℕ, 1 ≤ ν → delta ν ≤ C / 4 ^ ν := by sorry

end PolyhedralSOC.UpperBound
Source
Ben-Tal & Nemirovski, On Polyhedral Approximations of the Second-Order Cone, Math. Oper. Res. 26(2):193–205 (2001), p. 199, Proposition 2.1, Eq. (9)
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me