Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.1, p. 3 — a linear map preserving S preserves conv(S)

Proved
PermInvConvex.Sparsity.lemma_2_1

by mikedeng1 · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-hulllinear-mapp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let TTT be a real n×nn \times nn×n matrix and S⊆RnS \subseteq \mathbb R^nS⊆Rn a set with Tx∈STx \in STx∈S for every x∈Sx \in Sx∈S. Then

x∈conv⁡(S)  ⟹  Tx∈conv⁡(S).x \in \operatorname{conv}(S) \implies Tx \in \operatorname{conv}(S).x∈conv(S)⟹Tx∈conv(S).

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 N∥⋅∥sKN^K_{\|\cdot\|_s}N∥⋅∥s​K​ to its convex hull.

Formalization Note TxTxTx 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
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 23, 2026

    Confirmed by the mission captain (proposal self-audit).

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