Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§5 — the limit of a convergent infinite relaxation sequence is a boundary point of AAA

Proved
RelaxationMethod.LowDim.limit_mem_frontier

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

convergencep2o-batch-p100bp2o-gran-per-chapterp2o-plan-paperp2o-v1relaxation-method

Let AAA be the nonempty solution polytope of a system of linear inequalities, let 0<λ⩽20 < \lambda \leqslant 20<λ⩽2, and let {pν}\{p_\nu\}{pν​} be an infinite relaxation sequence (every pν∉Ap_\nu \notin Apν​∈/A, each obtained from the previous one by a relaxation step with parameter λ\lambdaλ). If pν→lp_\nu \to lpν​→l, then

l∈Aandl∈∂A.l \in A \quad\text{and}\quad l \in \partial A.l∈Aandl∈∂A.

The argument of §5 uses the function d(x)=max⁡idist⁡(x,Hi)d(x) = \max_i \operatorname{dist}(x, H_i)d(x)=maxi​dist(x,Hi​) that vanishes exactly on AAA. It is invoked in the proof of Theorem 2, Case 1 (§7) and, for λ=2\lambda = 2λ=2, in §6 and §8.

Formalization Note The paper proves this in §5 for r=nr = nr=n and 0<λ<20 < \lambda < 20<λ<2; the argument uses neither assumption, and §7 (r<nr < nr<n) and §8 (λ=2\lambda = 2λ=2) reuse it, so it is stated without a dimension hypothesis and for 0<λ⩽20 < \lambda \leqslant 20<λ⩽2. The boundary is the topological frontier.

Preamble
import Mathlib
import Definitions.Def_RelaxationMethod_LowDim_RelaxStep

open Filter Topology
Formal statement
namespace RelaxationMethod.LowDim

/-- §5, p. 399: if an infinite relaxation sequence with `0 < λ ⩽ 2` converges to `l`, then `l`
belongs to `A`, and lies on the boundary of `A`. -/
theorem limit_mem_frontier {n m : ℕ} (a : Fin m → EuclideanSpace ℝ (Fin n)) (b : Fin m → ℝ)
    (hA : (polytope a b).Nonempty) (lam : ℝ) (hlam0 : 0 < lam) (hlam2 : lam ≤ 2)
    (p : ℕ → EuclideanSpace ℝ (Fin n))
    (hrun : ∀ ν, p ν ∉ polytope a b → IsRelaxStep a b lam (p ν) (p (ν + 1)))
    (hinf : ∀ ν, p ν ∉ polytope a b) (l : EuclideanSpace ℝ (Fin n))
    (hl : Tendsto p atTop (𝓝 l)) :
    l ∈ polytope a b ∧ l ∈ frontier (polytope a b) := by sorry

end RelaxationMethod.LowDim
Source
Motzkin and Schoenberg, The relaxation method for linear inequalities, Canad. J. Math. 6 (1954), DOI 10.4153/CJM-1954-038-x, p. 399, §5, (2.10)–(2.11)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Setting. Work in Rn\mathbb{R}^nRn with the standard inner product.

  • There are mmm vectors a1,…,am∈Rna_1,\dots,a_m\in\mathbb{R}^na1​,…,am​∈Rn and mmm reals b1,…,bmb_1,\dots,b_mb1​,…,bm​.
  • Each iii gives a half-space Hi={x:⟨ai,x⟩+bi≥0}H_i=\{x:\langle a_i,x\rangle+b_i\ge0\}Hi​={x:⟨ai​,x⟩+bi​≥0}.
  • The polytope is A=⋂iHiA=\bigcap_i H_iA=⋂i​Hi​. It is assumed nonempty.
  • d(p,S)d(p,S)d(p,S) is the distance from a point to a set, with d(p,∅)=0d(p,\emptyset)=0d(p,∅)=0.
  • λ\lambdaλ is a real number with 0<λ≤20<\lambda\le20<λ≤2.
  • (pν)ν≥0(p_\nu)_{\nu\ge0}(pν​)ν≥0​ is a sequence in Rn\mathbb{R}^nRn.
  • lll is a point of Rn\mathbb{R}^nRn.

Hypotheses.

  • pν∉Ap_\nu\notin Apν​∈/A for every ν\nuν.
  • For every ν\nuν, pν+1p_{\nu+1}pν+1​ comes from pνp_\nupν​ by a relaxation step with parameter λ\lambdaλ. This means there is an index jjj (it may depend on ν\nuν) such that:
    • d(pν,Hi)≤d(pν,Hj)d(p_\nu,H_i)\le d(p_\nu,H_j)d(pν​,Hi​)≤d(pν​,Hj​) for all iii;
    • there is a q∈Hjq\in H_jq∈Hj​ with ∣pν−q∣=d(pν,Hj)|p_\nu-q|=d(p_\nu,H_j)∣pν​−q∣=d(pν​,Hj​) and pν+1=pν+λ(q−pν)p_{\nu+1}=p_\nu+\lambda(q-p_\nu)pν+1​=pν​+λ(q−pν​).
  • pν→lp_\nu\to lpν​→l as ν→∞\nu\to\inftyν→∞.

Claim.

l∈Aandl∈∂A.l\in A \qquad\text{and}\qquad l\in\partial A.l∈Aandl∈∂A.

Here ∂A\partial A∂A is the topological boundary of AAA: the closure of AAA minus its interior.

Degenerate cases:

  • m=0m=0m=0. A=RnA=\mathbb{R}^nA=Rn, so the hypothesis pν∉Ap_\nu\notin Apν​∈/A cannot hold and the statement is vacuous.
  • n=0n=0n=0. A nonempty AAA is the whole one-point space, so the statement is vacuous.
  • No convergent sequence. If no sequence satisfying the hypotheses converges, the statement is vacuous for all lll.
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me