Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma B.4 — Two-point inequality for a convex function

Proved
FourBlockIP350.Main.Supplement.two_point_majorization

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-analysisp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let ϕ:R→R\phi:\mathbb R\to\mathbb Rϕ:R→R be convex. Suppose a,b,c,d∈Ra,b,c,d\in\mathbb Ra,b,c,d∈R satisfy

a+b=c+d,min⁡{a,b}≤c,d≤max⁡{a,b}.a+b=c+d,\qquad \min\{a,b\}\le c,d\le\max\{a,b\}.a+b=c+d,min{a,b}≤c,d≤max{a,b}.

Then

ϕ(c)+ϕ(d)≤ϕ(a)+ϕ(b).\phi(c)+\phi(d)\le\phi(a)+\phi(b).ϕ(c)+ϕ(d)≤ϕ(a)+ϕ(b).

The paper cites this as Theorem 1 of Kadelburg, Đukić, Lukić and Matić (2005). It is applied coordinatewise, to the component functions of the objective and to t↦∣t∣t\mapsto|t|t↦∣t∣, in the proof of Lemma B.5.

Differences from the source: none.

Preamble
import Mathlib
Formal statement
namespace FourBlockIP350.Main.Supplement

/-- Lemma B.4 (Theorem 1 of [KÐLM05]), p. 24. -/
theorem two_point_majorization (ϕ : ℝ → ℝ) (hϕ : ConvexOn ℝ Set.univ ϕ)
    (a b c d : ℝ) (hsum : a + b = c + d)
    (hc : min a b ≤ c ∧ c ≤ max a b) (hd : min a b ≤ d ∧ d ≤ max a b) :
    ϕ c + ϕ d ≤ ϕ a + ϕ b := by sorry

end FourBlockIP350.Main.Supplement
Source
Klaus Jansen, Felix Ohnesorge, Corinna Wambsganz, A Fixed-Parameter Algorithm for 4-Block Integer Programming, STOC 2027 submission #350 (October 2026), p. 24, Lemma B.4 (Theorem 1 of [KÐLM05])

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