Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.2, p. 6 — for 0 < p < 1, minimizers of ‖x‖_p^p over ℙ_j ∩ FEA(A,b,σ,1) are extreme points

Proved
SparseLpLq.SmallP.lemma_2_2

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

extreme-pointslp-minimizationnonconvex-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sparse-optimization

Assume the blanket assumptions of the paper for q=1q=1q=1: σ≥0\sigma\ge 0σ≥0, FEA(A,b,σ,1)≠∅\mathrm{FEA}(A,b,\sigma,1)\ne\emptysetFEA(A,b,σ,1)=∅ and ∥b∥1>σ\|b\|_1>\sigma∥b∥1​>σ. Let 0<p<10<p<10<p<1 and let Pj\mathbb P_jPj​ be one of the 2n2^n2n closed orthants of Rn\mathbb R^nRn (2.2) with Pj∩FEA(A,b,σ,1)≠∅\mathbb P_j\cap\mathrm{FEA}(A,b,\sigma,1)\ne\emptysetPj​∩FEA(A,b,σ,1)=∅. If xxx is an optimal solution of

min⁡x∈Rn ∥x∥pps.t.x∈Pj∩FEA(A,b,σ,1),(2.3)\min_{x\in\mathbb R^n}\ \|x\|_p^p \quad\text{s.t.}\quad x\in\mathbb P_j\cap\mathrm{FEA}(A,b,\sigma,1), \tag{2.3}x∈Rnmin​ ∥x∥pp​s.t.x∈Pj​∩FEA(A,b,σ,1),(2.3)

that is, x∈Pj∩FEA(A,b,σ,1)x\in\mathbb P_j\cap\mathrm{FEA}(A,b,\sigma,1)x∈Pj​∩FEA(A,b,σ,1) and ∥x∥pp≤∥y∥pp\|x\|_p^p\le\|y\|_p^p∥x∥pp​≤∥y∥pp​ for all yyy in that set, then xxx is an extreme point of Pj∩FEA(A,b,σ,1)\mathbb P_j\cap\mathrm{FEA}(A,b,\sigma,1)Pj​∩FEA(A,b,σ,1).

Combined with the polyhedrality of FEA(A,b,σ,1)\mathrm{FEA}(A,b,\sigma,1)FEA(A,b,σ,1) (Lemma C.1), the lemma confines every optimal solution of problem (1.4) with 0<p<10<p<10<p<1 to the finitely many extreme points of the 2n2^n2n pieces Pj∩FEA(A,b,σ,1)\mathbb P_j\cap\mathrm{FEA}(A,b,\sigma,1)Pj​∩FEA(A,b,σ,1); this is the basis of Proposition 2.1.

Formalization Note The orthant Pj\mathbb P_jPj​ is indexed by a sign pattern s : Fin n → Bool. Extreme points are Mathlib's Set.extremePoints ℝ.

Differences from the source:

  • encoding: orthant index j ∈ {1, …, 2ⁿ} → sign pattern s : Fin n → Bool (true: xᵢ ≥ 0, false: xᵢ ≤ 0); reason: the sign patterns enumerate the 2ⁿ closed orthants of (2.2) one-to-one
Preamble
import Mathlib
import Definitions.Def_SparseLpLq_SmallP_Setting

open scoped ENNReal Matrix
Formal statement
namespace SparseLpLq.SmallP
theorem lemma_2_2 {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (σ : ℝ)
    (hσ : 0 ≤ σ) (hfeas : (FEA A b σ 1).Nonempty) (hb : σ < qNorm 1 b)
    (p : ℝ) (hp : p ∈ Set.Ioo (0 : ℝ) 1) (s : Fin n → Bool)
    (hne : (orthant s ∩ FEA A b σ 1).Nonempty)
    (x : Fin n → ℝ) (hx : x ∈ orthant s ∩ FEA A b σ 1)
    (hopt : ∀ y ∈ orthant s ∩ FEA A b σ 1, lpObj p x ≤ lpObj p y) :
    x ∈ Set.extremePoints ℝ (orthant s ∩ FEA A b σ 1) := by sorry
end SparseLpLq.SmallP
Source
Yang, Chen & Xiang, Sparse solutions of a class of constrained optimization problems, arXiv:1907.00880v5, p. 6, Lemma 2.2 (problem (2.3), orthants (2.2)); proof p. 7
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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