Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1 — the convex problem (12) with bounded sublevel sets has a solution

Proved
MartinetReg.ConvexMin.exists_solution

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

convex-optimizationexistence-of-minimizershilbert-spacep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let HHH be a real Hilbert space, C⊆HC\subseteq HC⊆H a nonempty closed convex set, and f:H→Rf:H\to\mathbb Rf:H→R convex and lower semicontinuous, such that {x∈C∣f(x)≤a}\{x\in C\mid f(x)\le a\}{x∈C∣f(x)≤a} is bounded for every a∈Ra\in\mathbb Ra∈R. Then problem (12) has a solution: there is xˉ∈C\bar x\in Cxˉ∈C with

f(xˉ)≤f(x)for all x∈C.f(\bar x)\le f(x)\qquad\text{for all } x\in C .f(xˉ)≤f(x)for all x∈C.

This is the existence statement Martinet makes right after the hypotheses of §4.1 ("Ces hypothèses assurent l'existence d'une solution pour (12)"). It is used to make sense of "the solution set of (12)" in Théorème 3 and of "la solution unique" in Remarque 1.

Formalization Note The paper leaves C≠∅C\neq\emptysetC=∅ implicit; the claim is false for C=∅C=\emptysetC=∅, so nonemptiness is a hypothesis (inside Standing).

Preamble
import Mathlib
import Definitions.Def_MartinetReg_ConvexMin_Setting
Formal statement
namespace MartinetReg.ConvexMin

/-- §4.1, p. 157: under the hypotheses of §4.1, problem (12) has a solution. -/
theorem exists_solution {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H]
    [CompleteSpace H] (f : H → ℝ) (C : Set H) (hS : Standing f C) :
    (solSet f C).Nonempty := by sorry

end MartinetReg.ConvexMin
Source
Martinet, Régularisation d'inéquations variationnelles par approximations successives, R.I.R.O. 4(R-3) (1970), p. 157, §4.1, after (12)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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