Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (7) — relative interiors of uncertainty set and function domain meet

Proved
FenchelRobust.Counterpart.eq_7_ri_intersection

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

convex-analysisp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1relative-interiorrobust-optimization

Let Z⊆RLZ\subseteq\mathbb R^LZ⊆RL be convex with 0∈ri⁡Z0\in\operatorname{ri}Z0∈riZ, let U=a0+AZU=a^0+AZU=a0+AZ, and suppose the nominal vector is regular: a0∈ri⁡D(x)a^0\in\operatorname{ri}D(x)a0∈riD(x) for every decision xxx. Then

ri⁡U∩ri⁡D(x)≠∅for every x∈Rn.\operatorname{ri}U\cap\operatorname{ri}D(x)\ne\varnothing\qquad\text{for every }x\in\mathbb R^n.riU∩riD(x)=∅for every x∈Rn.

This is the relative-interior qualification used for the Fenchel duality step of Theorem 2.

Formalization Note. The equation itself uses only convexity of ZZZ, its relative-interior condition, and regularity. Compactness from the section setup is unnecessary here.

Preamble
import Mathlib
import Definitions.Def_FenchelRobust_Counterpart_Model
Formal statement
namespace FenchelRobust.Counterpart

/-- Equation (7): the relative interiors of the uncertainty set and every effective domain meet. -/
theorem eq_7_ri_intersection {m n L : ℕ} (a0 : Fin m → ℝ)
    (A : Matrix (Fin m) (Fin L) ℝ) (Z : Set (Fin L → ℝ))
    (D : (Fin n → ℝ) → Set (Fin m → ℝ))
    (hZconvex : Convex ℝ Z) (hZzero : (0 : Fin L → ℝ) ∈ intrinsicInterior ℝ Z)
    (hregular : Regular a0 D) :
    ∀ x : Fin n → ℝ,
      (intrinsicInterior ℝ (uncertaintySet a0 A Z) ∩
        intrinsicInterior ℝ (D x)).Nonempty := by sorry

end FenchelRobust.Counterpart
Source
Ben-Tal, den Hertog, Vial, Deriving robust counterparts of nonlinear uncertain inequalities, CentER Discussion Paper 2012-053 (July 2, 2012), p. 4, Eq. (7) and preceding paragraph
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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