Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

VectorSpaceOpt.perturbationValue

Definition
VectorSpaceOpt_perturbationValue

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

definitionextended-realperturbationvalue-function

For a right-hand side z∈Zz\in Zz∈Z, define the perturbed feasible set by x∈Ωx\in\Omegax∈Ω and G(x)≤PzG(x)\le_P zG(x)≤P​z. The perturbation value is the extended-real infimum

ω(z)=inf⁡{f(x):x∈Ω, G(x)≤Pz}.\omega(z)=\inf\{f(x):x\in\Omega,\ G(x)\le_P z\}.ω(z)=inf{f(x):x∈Ω, G(x)≤P​z}.

The EReal codomain records +∞+\infty+∞ for an infeasible perturbation and −∞-\infty−∞ for an objective unbounded below, instead of inheriting an arbitrary real sInf value. This is the value function used in both convexity and monotonicity milestones and is the sensitivity object underlying Luenberger's multiplier interpretation. It also provides reusable infrastructure for later perturbation and stability results. The indexing subtype records feasibility without selecting an optimizer.

Definition code
import Definitions.Def_VectorSpaceOpt_coneLE

namespace VectorSpaceOpt

/-- The possibly infinite optimal value under the perturbed constraint `G x ≤_P z`. -/
noncomputable def perturbationValue
    {X Z : Type*}
    [AddCommGroup Z] [Module ℝ Z]
    (P : ConvexCone ℝ Z) (Ω : Set X) (f : X → ℝ) (G : X → Z) (z : Z) : EReal :=
  ⨅ x : {x : X // x ∈ Ω ∧ coneLE P (G x) z}, ((f 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.3, definition of ω(z), printed p. 216; physical PDF p. 236.
Read-back

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

For an arbitrary type XXX, an additive commutative group ZZZ with a real vector-space structure, a real convex cone PPP in ZZZ, a set Ω⊆XΩ⊆XΩ⊆X, a function f:X→Rf : X → ℝf:X→R, a map G:X→ZG : X → ZG:X→Z, and z∈Zz∈Zz∈Z, this defines the perturbation value as the infimum in EReal\mathrm{EReal}EReal of the embedded real numbers f(x)f(x)f(x) over all xxx satisfying x∈Ωx∈Ωx∈Ω and z−G(x)∈Pz-G(x)∈Pz−G(x)∈P; the latter is exactly the custom constraint G(x)≤PzG(x)≤_P zG(x)≤P​z. If there is no such xxx, the infimum over the empty subtype is +∞+∞+∞; if feasible objective values are unbounded below, the value is −∞-∞−∞. No norm or topology on either XXX or ZZZ is needed by the 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