Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

RobustOptimization.isPsi_dual_iff

Disproved

by junyihjy · Sep 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

The Psi\\PsiPsi value is symmetric under duality.

Fix a setup: source space mathbbRp\\mathbb{R}^pmathbbRp with norm ∣cdot∣E\\|\\cdot\\|_E∣cdot∣E​ (conjugate norm ∣cdot∣E∗\\|\\cdot\\|_E^*∣cdot∣E∗​) and closed convex cone mathbfKE\\mathbf{K}^EmathbfKE, destination space mathbbRq\\mathbb{R}^qmathbbRq with norm ∣cdot∣F\\|\\cdot\\|_F∣cdot∣F​ (conjugate ∣cdot∣F∗\\|\\cdot\\|_F^*∣cdot∣F∗​) and closed convex cone mathbfKF\\mathbf{K}^FmathbfKF. For a linear map mathcalM:mathbbRptomathbbRq\\mathcal{M} : \\mathbb{R}^p \\to \\mathbb{R}^qmathcalM:mathbbRptomathbbRq, a real number psi\\psipsi is the Psi\\PsiPsi-value of this setup if and only if it is the Psi\\PsiPsi-value of the dual setup (source mathbbRq\\mathbb{R}^qmathbbRq with ∣cdot∣F∗\\|\\cdot\\|_F^*∣cdot∣F∗​ and (mathbfKF)∗(\\mathbf{K}^F)_*(mathbfKF)∗​, destination mathbbRp\\mathbb{R}^pmathbbRp with ∣cdot∣E∗\\|\\cdot\\|_E^*∣cdot∣E∗​ and (mathbfKE)∗(\\mathbf{K}^E)_*(mathbfKE)∗​) for the adjoint map mathcalM∗\\mathcal{M}^*mathcalM∗.

\\Psi_\\Xi(\\mathcal{M}) = \\psi \\iff \\Psi_{\\Xi_*}(\\mathcal{M}^*) = \\psi.

This is the core of Proposition 11.4.1 of Ben-Tal, El Ghaoui and Nemirovski. It is what allows a bound on Psi\\PsiPsi to be computed on whichever side of the duality is tractable: the two Psi\\PsiPsi-values coincide as real numbers, not merely as abstract quantities.

Formal statement
import Definitions.Def_RobustOptimization_GRCConic
import Mathlib

open Matrix Finset

namespace RobustOptimization

/-- The Psi value is symmetric under duality (Ben-Tal et al., Prop. 11.4.1, core).

    A real number is the Psi-value of a setup (source norm NE, destination norm
    NF, closed convex cones KE, KF, linear map M) if and only if it is the
    Psi-value of the dual setup (conjugate norms NFs, NEs, dual cones,
    adjoint map Mᵀ). The forward direction unfolds Psi as a double supremum
    and swaps the order of maximization using dual-norm symmetry; the reverse
    is the same argument applied to the bidual setup. -/
theorem isPsi_dual_iff {p q : ℕ} (NE NEs : (Fin p → ℝ) → ℝ)
    (NF NFs : (Fin q → ℝ) → ℝ)
    (KE : Set (Fin p → ℝ)) (KF : Set (Fin q → ℝ))
    (hNE : IsNormOn NE) (hNF : IsNormOn NF)
    (hNEs : IsDualNorm NE NEs) (hNFs : IsDualNorm NF NFs)
    (hKEcl : IsClosed KE) (hKEcv : Convex ℝ KE)
    (hKEcone : ∀ c : ℝ, 0 ≤ c → ∀ z ∈ KE, c • z ∈ KE)
    (hKFcl : IsClosed KF) (hKFcv : Convex ℝ KF)
    (hKFcone : ∀ c : ℝ, 0 ≤ c → ∀ z ∈ KF, c • z ∈ KF)
    (M : Matrix (Fin q) (Fin p) ℝ) (ψ : ℝ) :
    IsPsi NE NF KE KF M ψ ↔ IsPsi NFs NEs (DualCone KF) (DualCone KE) Mᵀ ψ := by sorry

end RobustOptimization

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