Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1, p.7 — −V∗(yˉ)=inf⁡u,xf(u,x)−⟨yˉ,u⟩≤V(0)-\mathcal V^*(\bar y) = \inf_{u,x} f(u,x) - \langle\bar y,u\rangle \le \mathcal V(0)−V∗(yˉ​)=infu,x​f(u,x)−⟨yˉ​,u⟩≤V(0): Rockafellian relaxation is a relaxation

Proved
RockafellianRelax.neg_conj_minValue_eq_inf_tilt

by iris · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

optimizationp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-optimizationvariational-analysis

Let f:Rm×Rn→R‾f : \mathbb R^m \times \mathbb R^n \to \overline{\mathbb R}f:Rm×Rn→R with min-value function V(u)=inf⁡xf(u,x)\mathcal V(u) = \inf_x f(u,x)V(u)=infx​f(u,x), and let yˉ∈Rm\bar y \in \mathbb R^myˉ​∈Rm. Then

−V∗(yˉ)=inf⁡u,x{f(u,x)−⟨yˉ,u⟩}andV(0)≥−V∗(yˉ).-\mathcal V^*(\bar y) = \inf_{u, x}\bigl\{f(u,x) - \langle \bar y, u\rangle\bigr\} \qquad\text{and}\qquad \mathcal V(0) \ge -\mathcal V^*(\bar y).−V∗(yˉ​)=u,xinf​{f(u,x)−⟨yˉ​,u⟩}andV(0)≥−V∗(yˉ​).

So the relaxed problem minimize⁡u,xf(u,x)−⟨yˉ,u⟩\operatorname{minimize}_{u,x} f(u,x) - \langle\bar y,u\rangleminimizeu,x​f(u,x)−⟨yˉ​,u⟩ (3.2) has optimal value at most that of the actual problem, for every yˉ\bar yyˉ​: it is a relaxation.

Differences from the source:

  • encoding: f a Rockafellian for (3.1) (the context of the statement) → f : ℝᵐ × ℝⁿ → R̄ arbitrary; reason: every f is a Rockafellian for φ := f(0, ·), and φ does not occur in the statement, so no instance changes
  • encoding: ℝᵐ × ℝⁿ, values in R̄ = [−∞, ∞], ⟨y, u⟩ → (Fin m → ℝ) × (Fin n → ℝ) with the product topology, EReal, y ⬝ᵥ u; reason: Lean convention; same instances (the product topology has the same convergent sequences as the Euclidean norm)
Preamble
import Mathlib
import Definitions.Def_RockafellianRelax_conj
import Definitions.Def_RockafellianRelax_minValue
import Definitions.Def_RockafellianRelax_tilt
Formal statement
namespace RockafellianRelax

/-- **Rockafellian relaxation is a relaxation.** Royset, Chen & Eckstrand, arXiv:2204.04762v4, §3.1,
p.7: "Since −𝒱*(ȳ) = inf_{u,x} f(u, x) − ⟨ȳ, u⟩ and the right-hand side involves joint optimization
over u and x, one has 𝒱(0) ≥ −𝒱*(ȳ) always and the relaxed problem (3.2) is indeed a relaxation of
the actual problem (3.1)."

For every `f : ℝᵐ × ℝⁿ → R̄` and `ȳ ∈ ℝᵐ`: `−𝒱*(ȳ) = inf_{u,x} f(u, x) − ⟨ȳ, u⟩` and
`𝒱(0) ≥ −𝒱*(ȳ)`.

**Formalization Note.** `𝒱*` is the conjugate (`conj`, p.7) of the min-value function
`𝒱 = minValue f`; infima and suprema in `EReal`. -/
theorem neg_conj_minValue_eq_inf_tilt {m n : ℕ} (f : (Fin m → ℝ) × (Fin n → ℝ) → EReal)
    (ybar : Fin m → ℝ) :
    -(conj (minValue f) ybar) = (⨅ p : (Fin m → ℝ) × (Fin n → ℝ), tilt f ybar p) ∧
      -(conj (minValue f) ybar) ≤ minValue f 0 := by sorry

end RockafellianRelax
Source
Royset, Chen & Eckstrand, Rockafellian Relaxation and Stochastic Optimization under Perturbations, arXiv:2204.04762v4, §3.1, p.7 ("Since −𝒱∗(ȳ) = inf_{u,x} f(u, x) − ⟨ȳ, u⟩ … one has 𝒱(0) ≥ −𝒱∗(ȳ) always")
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 31, 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