Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Feasibility of a penalty cluster point

Proved
VectorSpaceOpt.penalty_cluster_point_feasible

by wenxinzhang · Aug 25, 2026 · Mathlib 0df444a (Lean v4.33.1)

cluster-pointfeasibilitylower-semicontinuitysubsequence

Let x₀ be the limit of a subsequence x ∘ phi, where phi is strictly increasing. Suppose the scalar constraint violation v is lower semicontinuous at x₀ and v (x n) tends to zero along the original sequence. Then x₀ is feasible:

∀i,  Gi(x0)≤0.∀ i,\; G_i(x₀)≤0.∀i,Gi​(x0​)≤0.

Lower semicontinuity forces v x₀ ≤ 0, while the finite sum-of-squares definition is nonnegative and vanishes exactly when every positive part is zero. The theorem isolates the feasibility half of §10.11, Theorem 1 and makes the source's phrase “limit point” precise through an explicit convergent subsequence rather than assuming convergence of the full penalty-minimizer sequence.

Preamble
import Definitions.Def_VectorSpaceOpt_quadratic_penalty

open Filter
Formal statement
namespace VectorSpaceOpt

/-- The feasibility half of Luenberger, Chapter 10, §10.11, Theorem 1. -/
theorem penalty_cluster_point_feasible
    {X : Type*} [TopologicalSpace X] {p : ℕ} (G : X → Fin p → ℝ)
    (x : ℕ → X) (x₀ : X) (phi : ℕ → ℕ)
    (hphi : StrictMono phi)
    (hxlim : Tendsto (x ∘ phi) atTop (nhds x₀))
    (hvlsc : LowerSemicontinuousAt (constraintViolation G) x₀)
    (hvlim : Tendsto (fun n => constraintViolation G (x n)) atTop (nhds 0)) :
    IsConstraintFeasible G x₀ := by
  sorry

end VectorSpaceOpt
Source
David G. Luenberger, Optimization by Vector Space Methods (Wiley, 1969), Chapter 10, §10.11, feasibility part of Theorem 1, printed p. 306 (physical PDF p. 324). Scan: https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf

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