Lemma 2.1, p. 3 — a linear map preserving S preserves conv(S)
ProvedPermInvConvex.Sparsity.lemma_2_1convex-hulllinear-mapp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a real matrix and a set with for every . Then
Applied to permutation matrices and sign changes, this shows that the convex hull of a permutation-invariant (sign-invariant) set is again permutation-invariant (sign-invariant), which is how the paper transfers the symmetries of to its convex hull.
Formalization Note is Mathlib's matrix–vector product T *ᵥ x.
Preamble
import Mathlib open Matrix
Formal statement
namespace PermInvConvex.Sparsity
theorem lemma_2_1 {n : ℕ} (T : Matrix (Fin n) (Fin n) ℝ) (S : Set (Fin n → ℝ))
(hS : ∀ x ∈ S, T *ᵥ x ∈ S) :
∀ x ∈ convexHull ℝ S, T *ᵥ x ∈ convexHull ℝ S := by sorry
end PermInvConvex.Sparsity
Source
Kim, Tawarmalani, Richard, Convexification of Permutation-Invariant Sets and an Application to Sparse PCA, arXiv:1910.02573v2, p. 3, Lemma 2.1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.