Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1, p. 6 — Algorithm 1 halts with a partial-support solution, J = J(L) when σ ≤ σ(L) (corrected: ≤ n(⌊log₂(1/σ)⌋ + 1) rescalings; J_σ(L) ⊆ J only for σ ≤ σ(L))

Proved
ProjRescale.MaxSupport.proposition_1

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

condition-measurelinear-feasibilitymaximum-supportp2o-batch-pfp2ap2o-correctedp2o-gran-per-chapterp2o-plan-paperp2o-v1rescaling-algorithm

Let n≥1n \ge 1n≥1, let L⊆RnL \subseteq \mathbb R^nL⊆Rn be a linear subspace and let σ∈(0,1)\sigma \in (0,1)σ∈(0,1). Consider Algorithm 1 (Partial support) on input (L,σ)(L, \sigma)(L,σ), with any admissible behaviour of the basic procedure and any choice of the maximizer iii in step 5. Then:

  1. (progress) every non-halted state reachable by the algorithm has an admissible next step;
  2. (termination) there is no infinite execution;
  3. (rescaling count) every execution performs at most
n(⌊log⁡2(1/σ)⌋+1)n\big(\lfloor \log_2(1/\sigma) \rfloor + 1\big)n(⌊log2​(1/σ)⌋+1)

rescaling steps; 4. (partial support) whenever the algorithm halts with output (x,J)(x, J)(x,J), we have x∈L∩R+nx \in L \cap \mathbb R^n_+x∈L∩R+n​, xj>0x_j > 0xj​>0 for every j∈Jj \in Jj∈J, and J⊆J(L)J \subseteq J(L)J⊆J(L); 5. (maximum support for a small guess) if σ≤σ(L)\sigma \le \sigma(L)σ≤σ(L), then every output (x,J)(x,J)(x,J) has J=J(L)J = J(L)J=J(L), and the number rrr of rescaling steps of that execution satisfies

r≤∑i∈J(L)⌈log⁡2(1/σi(L))⌉+(n−∣J(L)∣)(⌊log⁡2(1/σ)⌋+1).r \le \sum_{i \in J(L)} \big\lceil \log_2(1/\sigma_i(L)) \big\rceil + \big(n - |J(L)|\big)\big(\lfloor \log_2(1/\sigma)\rfloor + 1\big).r≤i∈J(L)∑​⌈log2​(1/σi​(L))⌉+(n−∣J(L)∣)(⌊log2​(1/σ)⌋+1).

This is the analysis of Algorithm 1 that Theorem 1 runs twice in each main iteration of Algorithm 2.

Formalization Note Algorithm 1 is the transition relation A1Step L σ started at A1Init n (D=ID = ID=I, J={1,…,n}J = \{1,\dots,n\}J={1,…,n}); every statement quantifies over all executions. The counter rescalings of a state is the number of rescaling steps performed so far; clause 3 bounds it at every reachable state. ⌊⋅⌋\lfloor\cdot\rfloor⌊⋅⌋ and ⌈⋅⌉\lceil\cdot\rceil⌈⋅⌉ are Nat.floor and Nat.ceil, whose arguments here are ≥0\ge 0≥0.

Differences from the source:

  • correction: the right-hand side of (5), n⌈log⁡2(1/σ)⌉n\lceil\log_2(1/\sigma)\rceiln⌈log2​(1/σ)⌉ → n(⌊log⁡2(1/σ)⌋+1)n(\lfloor\log_2(1/\sigma)\rfloor + 1)n(⌊log2​(1/σ)⌋+1); reason: an index is trimmed once Dii=2t>1/σD_{ii} = 2^t > 1/\sigmaDii​=2t>1/σ, i.e. after ⌊log⁡2(1/σ)⌋+1\lfloor\log_2(1/\sigma)\rfloor + 1⌊log2​(1/σ)⌋+1 rescalings; counterexample n=1n = 1n=1, L={0}L = \{0\}L={0}, σ=1/2\sigma = 1/2σ=1/2: P=0P = 0P=0 forces z=e1z = e_1z=e1​ twice (D11D_{11}D11​: 1→2→4>21 \to 2 \to 4 > 21→2→4>2), 2 rescaling steps, while (5) gives 111.
  • correction: "for some Jσ(L)⊆J⊆J(L)J_\sigma(L) \subseteq J \subseteq J(L)Jσ​(L)⊆J⊆J(L) in at most ∑i∈Jσ(L)⌈log⁡2(1/σi(L))⌉+(n−∣Jσ(L)∣)⌈log⁡2(1/σ)⌉\sum_{i\in J_\sigma(L)}\lceil\log_2(1/\sigma_i(L))\rceil + (n-|J_\sigma(L)|)\lceil\log_2(1/\sigma)\rceil∑i∈Jσ​(L)​⌈log2​(1/σi​(L))⌉+(n−∣Jσ​(L)∣)⌈log2​(1/σ)⌉ rescaling steps" for every σ∈(0,1)\sigma \in (0,1)σ∈(0,1) → J⊆J(L)J \subseteq J(L)J⊆J(L) for every σ\sigmaσ, and J=J(L)J = J(L)J=J(L) with the count ∑i∈J(L)⌈log⁡2(1/σi(L))⌉+(n−∣J(L)∣)(⌊log⁡2(1/σ)⌋+1)\sum_{i\in J(L)}\lceil\log_2(1/\sigma_i(L))\rceil + (n-|J(L)|)(\lfloor\log_2(1/\sigma)\rfloor+1)∑i∈J(L)​⌈log2​(1/σi​(L))⌉+(n−∣J(L)∣)(⌊log2​(1/σ)⌋+1) when σ≤σ(L)\sigma \le \sigma(L)σ≤σ(L) (where Jσ(L)=J(L)J_\sigma(L) = J(L)Jσ​(L)=J(L), p. 5); reason: for σ>σ(L)\sigma > \sigma(L)σ>σ(L) an index of Jσ(L)J_\sigma(L)Jσ​(L) can be trimmed; counterexample n=2n = 2n=2, L=span{(1,0.1)}L = \mathrm{span}\{(1, 0.1)\}L=span{(1,0.1)}, σ=1/2\sigma = 1/2σ=1/2, Jσ(L)={1}J_\sigma(L) = \{1\}Jσ​(L)={1}: the admissible answers z=e2,e2z = e_2, e_2z=e2​,e2​ trim index 2, then P=0P = 0P=0 forces z=e1z = e_1z=e1​ twice, and the run ends with x=0x = 0x=0, J=∅⊉Jσ(L)J = \emptyset \not\supseteq J_\sigma(L)J=∅⊇Jσ​(L) after 4 rescaling steps (the printed bound gives 1).
  • encoding: n≥1n \ge 1n≥1 implicit → hypothesis 0<n0 < n0<n; reason: for n=0n = 0n=0, Δ({1,…,n})=∅\Delta(\{1,\dots,n\}) = \emptysetΔ({1,…,n})=∅ and Algorithm 1 cannot run, so the case is undefined on the page.
  • encoding: "Algorithm 1 finds … in at most … rescaling steps" → progress, no infinite execution, and the bound at every reachable state of the transition relation, over every admissible answer of the basic procedure; reason: the basic procedure is any procedure satisfying step 3, so the claim is about every execution.
Preamble
import Mathlib
import Definitions.Def_ProjRescale_MaxSupport_Setting
Formal statement
namespace ProjRescale.MaxSupport

/-- Proposition 1, p. 6, corrected. For `σ ∈ (0, 1)`, every execution of Algorithm 1 on `(L, σ)`
can always continue until it halts, no execution is infinite, every execution performs at most
`n(⌊log₂(1/σ)⌋ + 1)` rescaling steps, and on halting it outputs `x ∈ L ∩ ℝⁿ₊` with `x_J > 0` for
some `J ⊆ J(L)`. If moreover `σ ≤ σ(L)`, then `J = J(L)` and the number of rescaling steps is at most
`∑_{i ∈ J(L)} ⌈log₂(1/σ_i(L))⌉ + (n − |J(L)|)(⌊log₂(1/σ)⌋ + 1)`. -/
theorem proposition_1 (n : ℕ) (hn : 0 < n) (L : Submodule ℝ (E n)) (σ : ℝ)
    (hσ0 : 0 < σ) (hσ1 : σ < 1) :
    (∀ s, Relation.ReflTransGen (A1Step L σ) (A1Init n) s → s.IsRun →
        ∃ s', A1Step L σ s s') ∧
      (¬ ∃ f : ℕ → A1State n, f 0 = A1Init n ∧ ∀ t, A1Step L σ (f t) (f (t + 1))) ∧
      (∀ s, Relation.ReflTransGen (A1Step L σ) (A1Init n) s →
        s.rescalings ≤ n * (⌊Real.logb 2 (1 / σ)⌋₊ + 1)) ∧
      (∀ x J r, A1Halts L σ x J r →
        x ∈ L ∧ x ∈ nonneg n ∧ (∀ j ∈ J, 0 < x j) ∧ J ⊆ maxSupp L) ∧
      (σ ≤ condMeasure L → ∀ x J r, A1Halts L σ x J r →
        J = maxSupp L ∧
          r ≤ ∑ j ∈ maxSupp L, ⌈Real.logb 2 (1 / sigmaI L j)⌉₊ +
            (n - (maxSupp L).card) * (⌊Real.logb 2 (1 / σ)⌋₊ + 1)) := 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. 6, Proposition 1 (Equation (5)), Algorithm 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