§3 after (3.1) — and
ProvedNieYangPareto.epigraph_eq_add_orthantmoment-conemulti-objective-optimizationp2o-gran-per-chapterp2o-plan-paperp2o-v1pareto-optimalitypolynomial-optimization
For the problem (1.1), with the set of nonnegative vectors, the epigraph set and its convex hull are orthant sums:
No hypothesis on is needed. This is the description of used throughout §3.
Differences from the source:
- encoding: disjoint finite label sets ℰ, ℐ → two finite types E, I (
[Finite E] [Finite I]), each with its own constraint family; reason: separate types encode disjointness; the same instances
Preamble
import Mathlib import Definitions.Def_NieYangPareto_MOP import Definitions.Def_NieYangPareto_MOP_U open Pointwise
Formal statement
namespace NieYangPareto
/-- **`𝒰 = f(K) + ℝ^m_+` and `conv(𝒰) = conv(f(K)) + ℝ^m_+`.** Nie–Yang, arXiv:2108.04336v2, §3 after
(3.1), p.6: "Then, 𝒰 = f(K) + ℝ^m_+ and its convex hull conv(𝒰) = conv(f(K)) + ℝ^m_+."
**Formalization Note** `ℝ^m_+` is `{q | 0 ≤ q}` in the pointwise order, and `+` is the pointwise sum
of sets. -/
theorem epigraph_eq_add_orthant {n m : ℕ} {E I : Type*} [Finite E] [Finite I]
(P : MOP n m E I) :
P.U = (P.obj '' P.K) + {q : Fin m → ℝ | 0 ≤ q} ∧
convexHull ℝ P.U = convexHull ℝ (P.obj '' P.K) + {q : Fin m → ℝ | 0 ≤ q} := by sorry
end NieYangPareto
Source
Nie–Yang, The multi-objective polynomial optimization, arXiv:2108.04336v2, §3 after (3.1), p.6
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.