Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§5 — the limit of an infinite relaxation sequence lies on the boundary of AAA

Proved
RelaxationMethod.FullDim.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 in EnE_nEn​ and let 0<λ≤20 < \lambda \le 20<λ≤2. Let p0,p1,…p_0, p_1, \dotsp0​,p1​,… be a run of the relaxation process with parameter λ\lambdaλ that never terminates (pν∉Ap_\nu \notin Apν​∈/A for all ν\nuν). If

lim⁡ν→∞pν=l,\lim_{\nu\to\infty} p_\nu = l ,ν→∞lim​pν​=l,

then lll belongs to the boundary of AAA: l∈Al \in Al∈A, and lll is not an interior point of AAA.

Together with Lemma 1 this completes the proof of Theorem 1, Case 1, and it is the second step of the proof of Theorem 1, Case 2.

Formalization Note The paper proves this in §5 for 0<λ<20 < \lambda < 20<λ<2 and uses the same argument in §6 for λ=2\lambda = 2λ=2; we state it for 0<λ≤20 < \lambda \le 20<λ≤2. No dimension hypothesis is needed. "Boundary" is the topological frontier frontier A; since AAA is closed this means l∈A∖int⁡Al \in A \setminus \operatorname{int} Al∈A∖intA. The parameter λ\lambdaλ is named lam.

Preamble
import Mathlib
import Definitions.Def_RelaxationMethod_FullDim_RelaxStep
import Definitions.Def_RelaxationMethod_FullDim_FejerMonotone
open Filter Topology
Formal statement
namespace RelaxationMethod.FullDim

/-- §5, p. 399 (reused in §6): if an infinite run of the relaxation process with `0 < lam ≤ 2`
converges to `l`, then `l` lies on the boundary of the nonempty polytope `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 : IsRelaxRun a b lam p)
    (hinf : ∀ ν : ℕ, p ν ∉ polytope a b) (l : EuclideanSpace ℝ (Fin n))
    (hl : Tendsto p atTop (𝓝 l)) :
    l ∈ frontier (polytope a b) := by sorry

end RelaxationMethod.FullDim
Source
Motzkin and Schoenberg, The relaxation method for linear inequalities, Canad. J. Math. 6 (1954), p. 399, §5, (2.10)–(2.11), and §6
Read-back

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

Fix natural numbers nnn and mmm. Take vectors a0,…,am−1∈Rna_0,\dots,a_{m-1}\in\mathbb{R}^na0​,…,am−1​∈Rn and reals b0,…,bm−1b_0,\dots,b_{m-1}b0​,…,bm−1​. Let Hi={x:⟨ai,x⟩+bi≥0}H_i=\{x:\langle a_i,x\rangle+b_i\ge 0\}Hi​={x:⟨ai​,x⟩+bi​≥0} and A=⋂i<mHiA=\bigcap_{i<m}H_iA=⋂i<m​Hi​.

Hypotheses:

  • AAA is nonempty.
  • λ\lambdaλ is a real number with 0<λ≤20<\lambda\le 20<λ≤2.
  • p0,p1,…p_0,p_1,\dotsp0​,p1​,… is a relaxation run with parameter λ\lambdaλ. That is, whenever pν∉Ap_\nu\notin Apν​∈/A, there is an index jjj with 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, and a point 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​), such that pν+1=pν+λ(q−pν)p_{\nu+1}=p_\nu+\lambda(q-p_\nu)pν+1​=pν​+λ(q−pν​). Here ddd is the infimum distance, taken as 000 to an empty set.
  • pν∉Ap_\nu\notin Apν​∈/A for every ν\nuν.
  • l∈Rnl\in\mathbb{R}^nl∈Rn and pν→lp_\nu\to lpν​→l.

Conclusion. lll lies in the topological boundary of AAA:

l∈A‾∖int⁡A,l\in\overline{A}\setminus\operatorname{int}A ,l∈A∖intA,

where A‾\overline{A}A is the closure of AAA and int⁡A\operatorname{int}AintA its interior. No assumption is made on the dimension of AAA. If AAA has empty interior, the conclusion just says that lll is in the closure of AAA.

Degenerate cases:

  • m=0m=0m=0: A=RnA=\mathbb{R}^nA=Rn, so the hypothesis that every 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 again the statement is vacuous.
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