Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1, p. 7 — if 𝒥(L, σ) and 𝒥(L⊥, σ) return index sets covering {1, …, n}, they are J(L), J(L⊥) and the outputs are maximum support points

Proved
ProjRescale.MaxSupport.corollary_1

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

linear-feasibilitymaximum-supportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rescaling-algorithm

Let L⊆RnL \subseteq \mathbb R^nL⊆Rn be a linear subspace and σ>0\sigma > 0σ>0. Suppose Algorithm 1 on input (L,σ)(L, \sigma)(L,σ) outputs (x,J)(x, J)(x,J) and Algorithm 1 on input (L⊥,σ)(L^\perp, \sigma)(L⊥,σ) outputs (x^,J^)(\hat x, \hat J)(x^,J^), and that

J∪J^={1,…,n}.J \cup \hat J = \{1,\dots,n\}.J∪J^={1,…,n}.

Then J=J(L)J = J(L)J=J(L), J^=J(L⊥)\hat J = J(L^\perp)J^=J(L⊥), xxx is a maximum support point of L∩R+nL \cap \mathbb R^n_+L∩R+n​ and x^\hat xx^ is a maximum support point of L⊥∩R+nL^\perp \cap \mathbb R^n_+L⊥∩R+n​ (a point of the cone whose support {j:xj>0}\{j : x_j > 0\}{j:xj​>0} is the maximum support index set).

This is the stopping test of Algorithm 2: the covering condition, which the algorithm can check, certifies maximum support without knowing σ(L)\sigma(L)σ(L) or σ(L⊥)\sigma(L^\perp)σ(L⊥).

Formalization Note "(x,J)=J(L,σ)(x,J) = \mathcal J(L,\sigma)(x,J)=J(L,σ)" is A1Halts L σ x J r: some execution of Algorithm 1 on (L,σ)(L,\sigma)(L,σ), with any admissible behaviour of the basic procedure, halts with output (x,J)(x, J)(x,J) after rrr rescaling steps. Since the conclusion is drawn for every such pair of executions, it covers every implementation of the basic procedure.

Differences from the source:

  • encoding: "(x,J)=J(L,σ)(x,J) = \mathcal J(L,\sigma)(x,J)=J(L,σ), the output of Algorithm 1" → some execution of the transition relation A1Step L σ halts with output (x,J)(x, J)(x,J), for any admissible basic-procedure answers; reason: the basic procedure is any procedure satisfying step 3, so every execution's output is an output of Algorithm 1.
  • reading: the corollary assumes σ>0\sigma > 0σ>0, while J(L,σ)\mathcal J(L,\sigma)J(L,σ) is introduced (p. 7) and Algorithm 1 is stated (p. 6) for σ∈(0,1)\sigma \in (0,1)σ∈(0,1) → hypothesis 0<σ0 < \sigma0<σ, with Algorithm 1's transition relation defined for every real σ\sigmaσ; reason: the page is ambiguous between the two ranges and the Lean takes the corollary's own, wider hypothesis (never the weaker reading); for σ∈(0,1)\sigma \in (0,1)σ∈(0,1) it is exactly the paper's statement.
Preamble
import Mathlib
import Definitions.Def_ProjRescale_MaxSupport_Setting
Formal statement
namespace ProjRescale.MaxSupport

/-- Corollary 1, p. 7. Let `σ > 0`. If `(x, J) = 𝒥(L, σ)` and `(x̂, Ĵ) = 𝒥(L⊥, σ)` satisfy
`J ∪ Ĵ = {1, …, n}`, then `J = J(L)`, `Ĵ = J(L⊥)`, and `x`, `x̂` are maximum support points of
`L ∩ ℝⁿ₊` and `L⊥ ∩ ℝⁿ₊`. -/
theorem corollary_1 {n : ℕ} (L : Submodule ℝ (E n)) (σ : ℝ) (hσ : 0 < σ)
    (x xh : E n) (J Jh : Finset (Fin n)) (r rh : ℕ)
    (hx : A1Halts L σ x J r) (hxh : A1Halts Lᗮ σ xh Jh rh) (hcov : J ∪ Jh = Finset.univ) :
    J = maxSupp L ∧ Jh = maxSupp Lᗮ ∧ IsMaxSupportPoint L x ∧ IsMaxSupportPoint Lᗮ xh := 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, p. 7, Corollary 1 (notation 𝒥(L, σ) on 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