Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

VectorSpaceOpt.lagrangian

Definition
VectorSpaceOpt_lagrangian

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

definitionlagrangianmultiplieroptimization

Let f:X→Rf:X\to\mathbb Rf:X→R be an objective, G:X→ZG:X\to ZG:X→Z a vector constraint map, and z∗∈Z∗z^*\in Z^*z∗∈Z∗ a continuous linear multiplier. Their Lagrangian is

L(x,z∗)=f(x)+z∗(G(x)).L(x,z^*)=f(x)+z^*(G(x)).L(x,z∗)=f(x)+z∗(G(x)).

The plus sign is paired with the feasibility convention G(x)≤P0G(x)\le_P0G(x)≤P​0 and dual-positive multipliers; consequently a feasible point satisfies L(x,z∗)≤f(x)L(x,z^*)\le f(x)L(x,z∗)≤f(x). The definition does not mention the domain Ω\OmegaΩ or the cone PPP, because these enter through minimization and multiplier feasibility rather than through evaluation of LLL. This small interface is reused by saddle-point, complementarity, sensitivity, and dual-value items. Its linear multiplier dependence makes saddle inequalities stateable without auxiliary coercions.

Definition code
import Mathlib

namespace VectorSpaceOpt

/-- The Lagrangian associated with an objective, a constraint map, and a multiplier. -/
def lagrangian
    {X Z : Type*} [NormedAddCommGroup Z] [NormedSpace ℝ Z]
    (f : X → ℝ) (G : X → Z) (zstar : Z →L[ℝ] ℝ) (x : X) : ℝ :=
  f x + zstar (G x)

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.3, Lagrangian appearing in Theorem 1 and its conclusion, printed pp. 217–218; physical PDF pp. 237–238.
Read-back

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

For an arbitrary type XXX, every real normed vector space ZZZ, function f:X→Rf : X → ℝf:X→R, map G:X→ZG : X → ZG:X→Z, continuous real-linear functional z∗z^*z∗ on ZZZ, and point x∈Xx∈Xx∈X, this defines the real-valued Lagrangian by L(x,z∗)=f(x)+z∗(G(x))L(x,z^*)=f(x)+z^*(G(x))L(x,z∗)=f(x)+z∗(G(x)). No set of feasible points, cone, or structure of any kind on XXX is part of this definition.

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