VectorSpaceOpt.perturbationValue
DefinitionVectorSpaceOpt_perturbationValueFor a right-hand side , define the perturbed feasible set by and . The perturbation value is the extended-real infimum
The EReal codomain records for an infeasible perturbation and 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.
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 VectorSpaceOptRead-back
What the Lean code literally says, in plain math · gpt-5
For an arbitrary type , an additive commutative group with a real vector-space structure, a real convex cone in , a set , a function , a map , and , this defines the perturbation value as the infimum in of the embedded real numbers over all satisfying and ; the latter is exactly the custom constraint . If there is no such , the infimum over the empty subtype is ; if feasible objective values are unbounded below, the value is . No norm or topology on either or is needed by the definition.
Confirmed by the mission captain (proposal self-audit).