Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1, p. 8 — the induced norm in closed form: ‖x‖c = ‖u(x)‖s

Proved
PermInvConvex.Sparsity.theorem_3_1

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

closed-formgaugek-support-normp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let ∥⋅∥s\|\cdot\|_s∥⋅∥s​ be a symmetric gauge function on Rn\mathbb R^nRn, 1<K<n1 < K < n1<K<n, and ∥⋅∥c\|\cdot\|_c∥⋅∥c​ the gauge of conv⁡(N∥⋅∥sK)\operatorname{conv}(N^K_{\|\cdot\|_s})conv(N∥⋅∥s​K​). For every x∈Rnx \in \mathbb R^nx∈Rn, with u(x)u(x)u(x) the closed-form vector (15),

∥x∥c=∥u(x)∥s.\|x\|_c = \|u(x)\|_s.∥x∥c​=∥u(x)∥s​.

The norm whose unit ball is the convex hull of the sparse set is thus computable from one sort of ∣x∣|x|∣x∣ and one evaluation of ∥⋅∥s\|\cdot\|_s∥⋅∥s​; for the ℓ2\ell_2ℓ2​ norm this recovers the KKK-support norm.

Formalization Note 1<K<n1 < K < n1<K<n is the standing assumption of §3 (p. 6). ∥⋅∥c\|\cdot\|_c∥⋅∥c​ 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
  • 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