Lemma 8 — for convex f on [a, b] and ε ∈ [0, b − a], f(a + ε) + f(b − ε) ≤ f(a) + f(b)
ProvedRegMatroidXC.Main.lemma_8convexityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be convex. For every ,
The proof of the main theorem applies this to to push the sizes of the parts of a decomposition to the extremes.
Formalization Note is a function on that is assumed convex on only; its values outside play no role.
Preamble
import Mathlib
Formal statement
namespace RegMatroidXC.Main
theorem lemma_8 (f : ℝ → ℝ) (a b : ℝ) (hf : ConvexOn ℝ (Set.Icc a b) f) (ε : ℝ)
(hε₀ : 0 ≤ ε) (hε₁ : ε ≤ b - a) :
f (a + ε) + f (b - ε) ≤ f a + f b := by sorry
end RegMatroidXC.Main
Source
Aprile & Fiorini, Regular Matroids Have Polynomial Extension Complexity, arXiv:1909.08539v2, p. 3, Lemma 8
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.