Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Convexity of the optimal cost in the right-hand side bbb

Proved
LinearOptimization.lp_optimal_cost_convex_in_rhs

by Shuze Chen · Aug 5, 2026 · Mathlib c5ea003 (Lean v4.30.0)

convexitylinear-programmingsensitivity

(Theorem 5.1, p. 213) The optimal cost F(b)F(b)F(b) is a convex function of bbb on the set SSS.

(Standing hypotheses in force, made explicit: standard form with the rows of AAA linearly independent, and the dual feasible set {p∣p′A≤c′}\{p \mid p'A \le c'\}{p∣p′A≤c′} nonempty — so that F(b)F(b)F(b) is finite for every b∈Sb \in Sb∈S.)

Preamble
import Mathlib.Analysis.Convex.Function
import Mathlib.LinearAlgebra.LinearIndependent.Defs
import Definitions.Def_LinearOptimization_OptimalCostFunction


open Matrix

/-- **Bertsimas & Tsitsiklis, Theorem 5.1 (p. 213).** The optimal cost `F(b)` of the standard
form problem `min c'x, Ax = b, x ≥ 0` (rows of `A` linearly independent,
dual feasible set nonempty) is a convex function of `b` on the set `S` of
feasible right-hand sides. -/
Formal statement
theorem LinearOptimization.lp_optimal_cost_convex_in_rhs {m n : ℕ}
    (A : Matrix (Fin m) (Fin n) ℝ) (c : Fin n → ℝ) (F : (Fin m → ℝ) → ℝ)
    (hrank : LinearIndependent ℝ (fun i => A i))
    (hdual : (dualFeasibleStd A c).Nonempty)
    (hF : ∀ b ∈ feasibleRhsSet A, ((F b : ℝ) : EReal) = lpOptimalCostRhs A c b) :
    ConvexOn ℝ (feasibleRhsSet A) F := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Theorem 5.1, p. 213 (standing assumptions pp. 202, 212)
Read-back

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

Data: m,n≥0m, n \ge 0m,n≥0, an m×nm \times nm×n real matrix AAA, a cost vector c∈Rnc \in \mathbb{R}^nc∈Rn, and a function F:Rm→RF : \mathbb{R}^m \to \mathbb{R}F:Rm→R. Hypotheses: (a) the mmm rows of AAA form a linearly independent family in Rn\mathbb{R}^nRn (full row rank; this forces m≤nm \le nm≤n); (b) the set {p∈Rm:ATp≤c componentwise}\{p \in \mathbb{R}^m : A^{\mathsf T} p \le c \text{ componentwise}\}{p∈Rm:ATp≤c componentwise} is nonempty; (c) for every bbb in D={b:∃x≥0, Ax=b}D = \{b : \exists x \ge 0,\ A x = b\}D={b:∃x≥0, Ax=b} (the right-hand sides making the standard-form program feasible), the real number F(b)F(b)F(b), viewed as an extended real, equals inf⁡{c⋅x:Ax=b, x≥0}\inf\{c \cdot x : A x = b,\ x \ge 0\}inf{c⋅x:Ax=b, x≥0} — so hypothesis (c) in particular forces this optimal value to be finite at every b∈Db \in Db∈D, while FFF is completely unconstrained outside DDD. Conclusion: FFF is convex on DDD in the standard sense that includes convexity of the domain: DDD is a convex set, and F(αb1+βb2)≤αF(b1)+βF(b2)F(\alpha b_1 + \beta b_2) \le \alpha F(b_1) + \beta F(b_2)F(αb1​+βb2​)≤αF(b1​)+βF(b2​) for all b1,b2∈Db_1, b_2 \in Db1​,b2​∈D and all α,β≥0\alpha, \beta \ge 0α,β≥0 with α+β=1\alpha + \beta = 1α+β=1.

Human review
  • Endorsed by Community (Bot) · Aug 5, 2026

  • Endorsed by Shuze Chen · Aug 5, 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