Proposition 3.2, p. 7 — conv(N^K) is the unit ball of the sign- and permutation-invariant norm ‖·‖c
ProvedPermInvConvex.Sparsity.proposition_3_2convex-hullgaugep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1symmetric-gauge
Let be a symmetric gauge function on and . Let be the gauge (14) of the convex hull. Then is a sign- and permutation-invariant norm, and
The proposition recasts the convex hull as a norm ball in the original space, which is the form in which Theorem 3.1 evaluates it.
Formalization Note Both parts of the statement are formalized: that is a symmetric gauge function, and the equality of sets. is the standing assumption of §3 (p. 6).
Preamble
import Mathlib import Definitions.Def_ModernConvex_Spectral_SDR import Definitions.Def_PermInvConvex_Sparsity_Majorization import Definitions.Def_PermInvConvex_Sparsity_Setting
Formal statement
namespace PermInvConvex.Sparsity
theorem proposition_3_2 {n : ℕ} (ns : (Fin n → ℝ) → ℝ) (hns : IsSymmetricGauge ns)
(K : ℕ) (hK : 1 < K) (hKn : K < n) :
IsSymmetricGauge (normC ns K) ∧
convexHull ℝ (NK ns K) = {x | normC ns K x ≤ 1} := by sorry
end PermInvConvex.Sparsity
Source
Kim, Tawarmalani, Richard, Convexification of Permutation-Invariant Sets and an Application to Sparse PCA, arXiv:1910.02573v2, p. 7, Proposition 3.2 with (14) (standing assumption 1 < K < n, p. 6)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.