Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1, pp. 5–6 — a basic-procedure certificate z gives x_i ≤ ‖x‖∞/2 on L ∩ ℝⁿ₊, and σ_i(DL) = 2σ_i(L), σ_j(DL) = σ_j(L) for D = I + e_ie_iᵀ

Proved
ProjRescale.MaxSupport.lemma_1

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

condition-measureorthogonal-projectionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rescaling-algorithm

Let L⊆RnL \subseteq \mathbb R^nL⊆Rn be a linear subspace and PPP the orthogonal projection onto LLL. Suppose z∈R+n∖{0}z \in \mathbb R^n_+ \setminus \{0\}z∈R+n​∖{0} and i∈{1,…,n}i \in \{1,\dots,n\}i∈{1,…,n} satisfy

∥(Pz)+∥1≤12∥z∥∞=12zi.\|(Pz)^+\|_1 \le \tfrac12 \|z\|_\infty = \tfrac12 z_i .∥(Pz)+∥1​≤21​∥z∥∞​=21​zi​.

Then

  1. every x∈L∩R+nx \in L \cap \mathbb R^n_+x∈L∩R+n​ satisfies xi≤∥x∥∞/2x_i \le \|x\|_\infty / 2xi​≤∥x∥∞​/2 (equation (4));
  2. for D=I+eieiTD = I + e_i e_i^{\mathsf T}D=I+ei​eiT​ (the diagonal matrix with Dii=2D_{ii} = 2Dii​=2 and all other diagonal entries 111), the rescaled subspace DLDLDL satisfies σi(DL)=2σi(L)\sigma_i(DL) = 2\sigma_i(L)σi​(DL)=2σi​(L);
  3. σj(DL)=σj(L)\sigma_j(DL) = \sigma_j(L)σj​(DL)=σj​(L) for every j≠ij \neq ij=i.

Here σj(L)=max⁡{xj:x∈L∩R+n, ∥x∥∞≤1}\sigma_j(L) = \max\{x_j : x \in L\cap\mathbb R^n_+,\ \|x\|_\infty\le 1\}σj​(L)=max{xj​:x∈L∩R+n​, ∥x∥∞​≤1} and (v)+(v)^+(v)+ is the positive part of vvv. This lemma is the quantitative effect of one rescaling step of Algorithm 1: a certificate returned by the basic procedure doubles the condition coordinate σi\sigma_iσi​ and leaves the others unchanged.

Formalization Note PPP is Mathlib's orthogonal projection onto LLL viewed as a map Rn→Rn\mathbb R^n \to \mathbb R^nRn→Rn; ∥⋅∥∞\|\cdot\|_\infty∥⋅∥∞​ and ∥(⋅)+∥1\|(\cdot)^+\|_1∥(⋅)+∥1​ are written coordinatewise, and the hypothesis "∥z∥∞=zi\|z\|_\infty = z_i∥z∥∞​=zi​" is stated literally.

Differences from the source: none.

Preamble
import Mathlib
import Definitions.Def_ProjRescale_MaxSupport_Setting
Formal statement
namespace ProjRescale.MaxSupport

/-- Lemma 1, pp. 5–6. Let `P` be the orthogonal projection onto `L`, and let `z ∈ ℝⁿ₊ \ {0}` satisfy
`‖(Pz)⁺‖₁ ≤ ½‖z‖∞ = ½z_i`. Then every `x ∈ L ∩ ℝⁿ₊` has `x_i ≤ ‖x‖∞/2` (4), and for
`D = I + e_i e_iᵀ` the rescaled subspace satisfies `σ_i(DL) = 2σ_i(L)` and `σ_j(DL) = σ_j(L)` for
`j ≠ i`. -/
theorem lemma_1 {n : ℕ} (L : Submodule ℝ (E n)) (z : E n) (i : Fin n)
    (hz : z ∈ nonneg n) (hz0 : z ≠ 0) (hzi : supNorm z = z i)
    (hP : posL1 (L.starProjection z) ≤ supNorm z / 2) :
    (∀ x ∈ L, x ∈ nonneg n → x i ≤ supNorm x / 2) ∧
      sigmaI (diagScale (Function.update (fun _ => 1) i 2) L) i = 2 * sigmaI L i ∧
      ∀ j, j ≠ i → sigmaI (diagScale (Function.update (fun _ => 1) i 2) L) j = sigmaI L j := by sorry

end ProjRescale.MaxSupport
Source
Peña & Soheili, Projection and rescaling algorithm for finding maximum support solutions to polyhedral conic systems, arXiv:2003.08911v3, pp. 5–6, Lemma 1 (Equation (4))
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