Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.1, Appendix A.2, p. 16 — a vector at least as far from x_c moves away from x_c on its support

Proved
MConvexL1.SD.lemma_A_1

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

l1-distancem-convex-functionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let VVV be a finite set and xc,y,y~∈ZVx_c, y, \tilde y \in \mathbb Z^Vxc​,y,y~​∈ZV with y≠y~y \ne \tilde yy=y~​ and y(V)=y~(V)y(V) = \tilde y(V)y(V)=y~​(V). If ∥y−xc∥1≤∥y~−xc∥1\|y - x_c\|_1 \le \|\tilde y - x_c\|_1∥y−xc​∥1​≤∥y~​−xc​∥1​, then

∃i∈supp+(y~−y): y~(i)>xc(i)or∃j∈supp−(y~−y): y~(j)<xc(j)\exists i \in \mathrm{supp}^+(\tilde y - y):\ \tilde y(i) > x_c(i) \qquad\text{or}\qquad \exists j \in \mathrm{supp}^-(\tilde y - y):\ \tilde y(j) < x_c(j)∃i∈supp+(y~​−y): y~​(i)>xc​(i)or∃j∈supp−(y~​−y): y~​(j)<xc​(j)

(or both). The lemma is a purely metric fact about the ℓ1\ell_1ℓ1​ norm on the hyperplane {x(V)=const}\{x(V) = \text{const}\}{x(V)=const}; it selects the index at which the exchange property is applied in Lemma A.3 and in the proof of Theorem 4.1.

Differences from the source:

  • generalization: N = {1, …, n} with n ≥ 2 (§2, p. 4) → an arbitrary finite type V with decidable equality (any cardinality, including 0 and 1); reason: taking V = Fin n with n ≥ 2 gives the paper's setting; for |V| ≤ 1 two distinct vectors cannot have equal sums, so the hypotheses cannot hold and the statement is vacuously true
  • encoding: ‖x − y‖₁ = Σ |x(i) − y(i)| → L1Dist x y = Σ_v |x v − y v| as a natural number; reason: the norm is a nonnegative integer; same values
Preamble
import Mathlib
import Definitions.Def_MConvexL1_SD_Basic
import Definitions.Def_DiscreteConvex_MConvexFunctions_MExchangeAxiom
import Definitions.Def_DiscreteConvex_MConvexFunctions_ArgMin
open DiscreteConvex.MConvexFunctions DiscreteConvex.Algorithms
Formal statement
namespace MConvexL1.SD

theorem lemma_A_1 {V : Type*} [Fintype V] [DecidableEq V] (xc y yt : V → ℤ) (hne : y ≠ yt)
    (hsum : ∑ v, y v = ∑ v, yt v) (hdist : L1Dist y xc ≤ L1Dist yt xc) :
    (∃ i ∈ SuppPos yt y, xc i < yt i) ∨ (∃ j ∈ SuppNeg yt y, yt j < xc j) := by sorry

end MConvexL1.SD
Source
Shioura, M-convex Function Minimization Under L1-Distance Constraint, arXiv:1809.03126v3, Appendix A.2, p. 16, Lemma A.1
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