Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

VectorSpaceOpt.lagrangeDualValue

Definition
VectorSpaceOpt_lagrangeDualValue

by wenxinzhang · Aug 25, 2026 · Mathlib c5ea003 (Lean v4.30.0)

definitiondual-functionextended-reallagrangian

Let Ω⊆X\Omega\subseteq XΩ⊆X and fix an objective fff, a constraint map GGG, and a continuous linear multiplier z∗z^*z∗. The Lagrange dual value is the extended-real infimum

ϕ(z∗)=inf⁡x∈Ω(f(x)+z∗(G(x))).\phi(z^*)=\inf_{x\in\Omega}\bigl(f(x)+z^*(G(x))\bigr).ϕ(z∗)=x∈Ωinf​(f(x)+z∗(G(x))).

Lean takes an indexed infimum in EReal: it is +∞+\infty+∞ when Ω\OmegaΩ is empty and may be −∞-\infty−∞ when the Lagrangian is unbounded below. The main theorem separately assumes Ω\OmegaΩ is nonempty and identifies an attained multiplier whose value is the finite primal optimum. This definition preserves the boundary cases needed for a genuine dual function and is reusable independently of strong duality.

Definition code
import Definitions.Def_VectorSpaceOpt_lagrangian

namespace VectorSpaceOpt

/-- The possibly infinite Lagrange dual value, as an infimum over `Ω`. -/
noncomputable def lagrangeDualValue
    {X Z : Type*} [NormedAddCommGroup Z] [NormedSpace ℝ Z]
    (Ω : Set X) (f : X → ℝ) (G : X → Z) (zstar : Z →L[ℝ] ℝ) : EReal :=
  ⨅ x : Ω, ((lagrangian f G zstar x : ℝ) : EReal)

end VectorSpaceOpt
Source
David G. Luenberger, Optimization by Vector Space Methods, Wiley, 1969, public scan https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf, Chapter 8, §8.6, definition of φ(z*), printed p. 223; physical PDF p. 243.
Read-back

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

For an arbitrary type XXX, every real normed vector space ZZZ, set Ω⊆XΩ⊆XΩ⊆X, function f:X→Rf : X → ℝf:X→R, map G:X→ZG : X → ZG:X→Z, and continuous real-linear functional z∗z^*z∗ on ZZZ, this defines the Lagrange dual value as the infimum in the complete ordered type EReal\mathrm{EReal}EReal of the embedded finite real numbers f(x)+z∗(G(x))f(x)+z^*(G(x))f(x)+z∗(G(x)) over all subtype elements x∈Ωx∈Ωx∈Ω. Thus q(z∗)=inf⁡x∈Ω(f(x)+z∗(G(x)))q(z^*)=\inf_{x∈Ω}(f(x)+z^*(G(x)))q(z∗)=infx∈Ω​(f(x)+z∗(G(x))) in extended reals. If ΩΩΩ is empty, the indexed infimum is +∞+∞+∞; if ΩΩΩ is nonempty but the displayed real values are unbounded below, it is −∞-∞−∞. No algebraic or topological structure on XXX is required.

Human review
  • Endorsed by Shuze Chen · Aug 25, 2026

  • Endorsed by wenxinzhang · Aug 26, 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