Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.1(ii), p. 934 — for α, β ≥ 0, αg₁ + βg₂ is (αK + βL)-convex

Proved
SethiChengSS.Finite.proposition_4_1_ii

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

k-convexityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let K,L≥0K, L \ge 0K,L≥0, let g1g_1g1​ be KKK-convex and g2g_2g2​ be LLL-convex. Then for all α,β≥0\alpha, \beta \ge 0α,β≥0,

αg1+βg2 is (αK+βL)-convex.\alpha g_1 + \beta g_2 \ \text{is}\ (\alpha K + \beta L)\text{-convex}.αg1​+βg2​ is (αK+βL)-convex.

In the proof of Theorem 4.1 this carries KKK-convexity through the weighted sum ∑jpij(⋅)\sum_j p_{ij}(\cdot)∑j​pij​(⋅) in (3.1) and through the addition of the linear term cniyc^i_n ycni​y.

Formalization Note The published BertsekasDP.kconvex_combination requires α,β>0\alpha, \beta > 0α,β>0. The paper allows zero coefficients, which matter here because transition probabilities may vanish.

Preamble
import Mathlib
import Definitions.Def_BertsekasKConvex
import Definitions.Def_SethiChengSS_Finite_KConvexity
open MeasureTheory Filter Topology
Formal statement
namespace SethiChengSS.Finite

/-- Proposition 4.1(ii) (Sethi–Cheng 1997, p. 934): if `g₁` is `K`-convex and `g₂` is
`L`-convex, then for `α, β ≥ 0` the function `α g₁ + β g₂` is `(αK + βL)`-convex. -/
theorem proposition_4_1_ii (K L α β : ℝ) (g₁ g₂ : ℝ → ℝ) (hK : 0 ≤ K) (hL : 0 ≤ L)
    (hα : 0 ≤ α) (hβ : 0 ≤ β) (h₁ : BertsekasKConvex K g₁) (h₂ : BertsekasKConvex L g₂) :
    BertsekasKConvex (α * K + β * L) (fun x => α * g₁ x + β * g₂ x) := by sorry

end SethiChengSS.Finite
Source
Sethi and Cheng, Optimality of (s, S) policies in inventory models with Markovian demand, Oper. Res. 45(6) (1997), DOI 10.1287/opre.45.6.931, p. 934, Proposition 4.1(ii)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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