Theorem 3.1, p. 8 — the induced norm in closed form: ‖x‖c = ‖u(x)‖s
ProvedPermInvConvex.Sparsity.theorem_3_1closed-formgaugek-support-normp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a symmetric gauge function on , , and the gauge of . For every , with the closed-form vector (15),
The norm whose unit ball is the convex hull of the sparse set is thus computable from one sort of and one evaluation of ; for the norm this recovers the -support norm.
Formalization Note is the standing assumption of §3 (p. 6). is Mathlib's gauge of the convex hull.
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 theorem_3_1 {n : ℕ} (ns : (Fin n → ℝ) → ℝ) (hns : IsSymmetricGauge ns)
(K : ℕ) (hK : 1 < K) (hKn : K < n) (x : Fin n → ℝ) :
normC ns K x = ns (uVec K x) := by sorry
end PermInvConvex.Sparsity
Source
Kim, Tawarmalani, Richard, Convexification of Permutation-Invariant Sets and an Application to Sparse PCA, arXiv:1910.02573v2, p. 8, Theorem 3.1 (standing assumption 1 < K < n, p. 6)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.