Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.1 — a polyhedral ε\varepsilonε-approximation of LkL^kLk needs q≥Ω(kln⁡(1/ε))q\ge\Omega(k\ln(1/\varepsilon))q≥Ω(kln(1/ε)) inequalities (k≥2k\ge2k≥2)

Proved
PolyhedralSOC.LowerBound.polyhedral_approx_lower_bound

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

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

There is a positive absolute constant ccc such that the following holds. Let k≥2k\ge 2k≥2 be an integer, ε∈(0,12]\varepsilon\in(0,\tfrac12]ε∈(0,21​], and let

Π(y,t,u):Rk×R×Rp→Rq\Pi(y,t,u):\mathbb R^k\times\mathbb R\times\mathbb R^p\to\mathbb R^qΠ(y,t,u):Rk×R×Rp→Rq

be a polyhedral ε\varepsilonε-approximation of the Lorentz cone Lk={(y,t)∣t≥∥y∥2}L^k=\{(y,t)\mid t\ge\|y\|_2\}Lk={(y,t)∣t≥∥y∥2​}. Then the number of linear inequalities satisfies

q ≥ c kln⁡1ε.q\ \ge\ c\,k\ln\frac1\varepsilon .q ≥ cklnε1​.

Together with Theorem 1.1 of the same paper, which constructs polyhedral ε\varepsilonε-approximations with p+q≤O(1) kln⁡(2/ε)p+q\le O(1)\,k\ln(2/\varepsilon)p+q≤O(1)kln(2/ε), this shows that the order kln⁡(1/ε)k\ln(1/\varepsilon)kln(1/ε) of the number of inequalities cannot be improved.

Formalization Note The paper's "q≥O(1)kln⁡1εq\ge O(1)k\ln\frac1\varepsilonq≥O(1)klnε1​ with positive absolute constant O(1)O(1)O(1)" is stated as ∃c>0\exists c>0∃c>0 quantified before kkk, ε\varepsilonε, ppp, qqq and Π\PiΠ. The paper states the proposition for every positive integer kkk; for k=1k=1k=1 it is false, since L1={(y,t)∣∣y∣≤t}L^1=\{(y,t)\mid |y|\le t\}L1={(y,t)∣∣y∣≤t} is polyhedral and Π(y,t)=(t−y, t+y)\Pi(y,t)=(t-y,\,t+y)Π(y,t)=(t−y,t+y) (p=0p=0p=0, q=2q=2q=2) is a polyhedral ε\varepsilonε-approximation for every ε>0\varepsilon>0ε>0. The statement is therefore made for k≥2k\ge 2k≥2. The bound concerns qqq alone.

Preamble
import Mathlib
import Definitions.Def_PolyhedralSOC_Shared_LorentzCone
import Definitions.Def_PolyhedralSOC_Shared_IsPolyhedralApprox
Formal statement
namespace PolyhedralSOC.LowerBound

/-- Ben-Tal & Nemirovski, *On Polyhedral Approximations of the Second-Order Cone*,
Math. Oper. Res. 26(2):193–205 (2001), Proposition 3.1, Eq. (13), p. 202 (PDF p. 10):
there is a positive absolute constant `c` such that, for every `k ≥ 2`, every `ε ∈ (0, 0.5]` and
every polyhedral `ε`-approximation `Π(y, t, u) : ℝ^k × ℝ × ℝ^p → ℝ^q` of the Lorentz cone `L^k`,
`q ≥ c k ln(1/ε)`.
**Correction:** the paper states this for every positive integer `k`; for `k = 1` it is false,
because `L^1 = {(y, t) | |y| ≤ t}` is polyhedral and `Π(y, t) = (t − y, t + y)` (`p = 0`, `q = 2`)
is a polyhedral `ε`-approximation for every `ε > 0`. The result is stated for `k ≥ 2`. -/
theorem polyhedral_approx_lower_bound :
    ∃ c : ℝ, 0 < c ∧ ∀ k : ℕ, 2 ≤ k → ∀ ε : ℝ, 0 < ε → ε ≤ 1 / 2 →
      ∀ (p q : ℕ) (P : (Fin k → ℝ) × ℝ × (Fin p → ℝ) →ₗ[ℝ] (Fin q → ℝ)),
        Shared.IsPolyhedralApprox k p q ε P → c * k * Real.log (1 / ε) ≤ q := by sorry

end PolyhedralSOC.LowerBound
Source
Ben-Tal & Nemirovski, On Polyhedral Approximations of the Second-Order Cone, Math. Oper. Res. 26(2):193–205 (2001), p. 202, Proposition 3.1, Eq. (13); corrected to k ≥ 2
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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