Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§2, Eqs. (6)–(7) — composing planar approximations along the tower

Proved
PolyhedralSOC.UpperBound.tower_composition

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

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

Let θ≥1\theta\ge1θ≥1 and k=2θk=2^\thetak=2θ. For ℓ=1,…,θ\ell=1,\dots,\thetaℓ=1,…,θ let εℓ>0\varepsilon_\ell>0εℓ​>0 and let Πℓ:R2×R×Rpℓ→Rqℓ\Pi_\ell:\mathbb R^2\times\mathbb R\times\mathbb R^{p_\ell}\to\mathbb R^{q_\ell}Πℓ​:R2×R×Rpℓ​→Rqℓ​ be a polyhedral εℓ\varepsilon_\ellεℓ​-approximation of L2={(x1,x2,x3)∣x12+x22≤x3}L^2=\{(x_1,x_2,x_3)\mid\sqrt{x_1^2+x_2^2}\le x_3\}L2={(x1​,x2​,x3​)∣x12​+x22​​≤x3​}. Consider the linear system

Πℓ(y2i−1ℓ−1,y2iℓ−1,yiℓ,uiℓ)≥0,i=1,…,2θ−ℓ, ℓ=1,…,θ,(6)\Pi_\ell\big(y_{2i-1}^{\ell-1},y_{2i}^{\ell-1},y_i^\ell,u_i^\ell\big)\ge0,\qquad i=1,\dots,2^{\theta-\ell},\ \ell=1,\dots,\theta,\tag{6}Πℓ​(y2i−1ℓ−1​,y2iℓ−1​,yiℓ​,uiℓ​)≥0,i=1,…,2θ−ℓ, ℓ=1,…,θ,(6)

in the tower variables yiℓy_i^\ellyiℓ​ (with yi0=yiy_i^0=y_iyi0​=yi​, y1θ=ty_1^\theta=ty1θ​=t) and auxiliary vectors uiℓu_i^\elluiℓ​. Then this system is a polyhedral ε\varepsilonε-approximation of LkL^kLk with

ε=∏ℓ=1θ(1+εℓ)−1,(7)\varepsilon=\prod_{\ell=1}^{\theta}(1+\varepsilon_\ell)-1,\tag{7}ε=ℓ=1∏θ​(1+εℓ​)−1,(7)

in the sense that

  1. every (y,t)∈Lk(y,t)\in L^k(y,t)∈Lk can be extended to tower variables and auxiliary vectors solving (6);
  2. whenever (y,t)(y,t)(y,t) extends to a solution of (6), ∥y∥2≤∏ℓ=1θ(1+εℓ) t\|y\|_2\le\prod_{\ell=1}^\theta(1+\varepsilon_\ell)\,t∥y∥2​≤∏ℓ=1θ​(1+εℓ​)t.

This reduces the approximation of LkL^kLk to the approximation of the three-dimensional cone L2L^2L2.

Formalization Note The statement is made on solution sets of (6); the packaging of (6) into a single linear map Π(y,t,u)\Pi(y,t,u)Π(y,t,u) (with the intermediate tower variables as part of uuu) is not formalized here. The norm is the Euclidean norm.

Preamble
import Mathlib
import Definitions.Def_PolyhedralSOC_Shared_IsPolyhedralApprox
import Definitions.Def_PolyhedralSOC_UpperBound_Tower
Formal statement
namespace PolyhedralSOC.UpperBound

/-- Ben-Tal & Nemirovski, *On Polyhedral Approximations of the Second-Order Cone*,
Math. Oper. Res. 26(2):193–205 (2001), §2, Eqs. (6)–(7), p. 199 (PDF p. 7): if, for
`ℓ = 1, …, θ`, `Ps ℓ` is a polyhedral `ε_ℓ`-approximation of `L²`, then the system (6)
along the tower of `k = 2^θ` is a polyhedral `ε`-approximation of `L^k` with
`1 + ε = ∏_{ℓ=1}^θ (1 + ε_ℓ)` (Eq. (7)), stated on solution sets:
(i) every `(y, t) ∈ L^k` extends to tower variables and auxiliary vectors solving (6);
(ii) every solution of (6) satisfies `‖y‖₂ ≤ ∏_{ℓ=1}^θ (1 + ε_ℓ) · t`. -/
theorem tower_composition (θ : ℕ) (hθ : 1 ≤ θ) (p q : ℕ → ℕ) (ε : ℕ → ℝ)
    (Ps : (ℓ : ℕ) → (Fin 2 → ℝ) × ℝ × (Fin (p ℓ) → ℝ) →ₗ[ℝ] (Fin (q ℓ) → ℝ))
    (hε : ∀ ℓ : ℕ, 1 ≤ ℓ → ℓ ≤ θ → 0 < ε ℓ)
    (hP : ∀ ℓ : ℕ, 1 ≤ ℓ → ℓ ≤ θ → Shared.IsPolyhedralApprox 2 (p ℓ) (q ℓ) (ε ℓ) (Ps ℓ)) :
    (∀ (y : Fin (2 ^ θ) → ℝ) (t : ℝ), (y, t) ∈ Shared.LorentzCone (2 ^ θ) →
      ∃ (Y : ℕ → ℕ → ℝ) (U : (ℓ : ℕ) → ℕ → Fin (p ℓ) → ℝ),
        IsTowerOf θ y t Y ∧ TowerSystem6 θ p q Ps Y U) ∧
    (∀ (y : Fin (2 ^ θ) → ℝ) (t : ℝ) (Y : ℕ → ℕ → ℝ) (U : (ℓ : ℕ) → ℕ → Fin (p ℓ) → ℝ),
      IsTowerOf θ y t Y → TowerSystem6 θ p q Ps Y U →
        Shared.eucNorm y ≤ (∏ ℓ ∈ Finset.Icc 1 θ, (1 + ε ℓ)) * t) := 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), §2, p. 199, Eqs. (6)–(7)
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