Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Hypersphere activity sets: sup_{aⱼ∈Kⱼ} eᵢ·aⱼ = aᵢⱼ + ρⱼ, so āⱼ = aⱼ + ρⱼ·e

Proved
SoysterInexactLP.Auxiliary.hyperBall_support

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimizationsupport-function

Let A0=(a1,…,an)A_0=(a_1,\dots,a_n)A0​=(a1​,…,an​) be an m×nm\times nm×n matrix and ρ1,…,ρn≥0\rho_1,\dots,\rho_n\ge0ρ1​,…,ρn​≥0. For the Euclidean balls Kj={a∈Rm∣∥a−aj∥2≤ρj}K_j=\{a\in\mathbb R^m\mid\|a-a_j\|_2\le\rho_j\}Kj​={a∈Rm∣∥a−aj​∥2​≤ρj​},

δ∗(ei∣Kj)=sup⁡a∈Kjai=aij+ρjfor all i,j,\delta^*(e_i\mid K_j)=\sup_{a\in K_j}a_i=a_{ij}+\rho_j\qquad\text{for all }i,j,δ∗(ei​∣Kj​)=a∈Kj​sup​ai​=aij​+ρj​for all i,j,

that is, aˉj=aj+ρje\bar a_j=a_j+\rho_j eaˉj​=aj​+ρj​e with eee the vector of all ones, so Aˉ=A0+(ρj)i,j\bar A=A_0+(\rho_j)_{i,j}Aˉ=A0​+(ρj​)i,j​.

This computes the auxiliary linear program explicitly in the paper's inexact linear programming application.

Formalization Note The radii are assumed nonnegative (a "magnitude"); a negative radius would give an empty set. The norm is Euclidean.

Preamble
import Mathlib
import Definitions.Def_SoysterInexactLP_Auxiliary_Problems
open Pointwise Matrix
Formal statement
namespace SoysterInexactLP.Auxiliary

theorem hyperBall_support {m n : ℕ} (A₀ : Matrix (Fin m) (Fin n) ℝ)
    (ρ : Fin n → ℝ) (hρ : ∀ j, 0 ≤ ρ j) :
    (∀ i j, supportFun (hyperBall A₀ ρ j) (Pi.single i 1) = ((A₀ i j + ρ j : ℝ) : EReal)) ∧
      Abar (hyperBall A₀ ρ) = A₀ + Matrix.of (fun _ j => ρ j) := by sorry

end SoysterInexactLP.Auxiliary
Source
Soyster, Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming, Operations Research 21 (1973), p. 1157 (PDF p. 5), §Inexact Linear Programming, second paragraph
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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