A general theory of almost convex functions
Abstract
Let m be the standard m-dimensional simplex of non-negative m+1 tuples that sum to unity and let S be a nonempty subset of m. A real valued function h defined on a convex subset of a real vector space is S-almost convex iff for all (t0,...,tm)∈ S and x0,...,xm∈ C the inequality h(t0 x0+ ... +tm xm)≤ 1+ t0 h(x0)+ ... +tm h(xm) holds. A detailed study of the properties of S-almost convex functions is made, including the constriction of the extremal (i.e. pointwise largest bounded) S-almost convex function on simplices that vanishes on the vertices. In the special case that S is the barycenter of m very explicit formulas are given for the extremal function and its maximum. This is of interest as the extremal function and its maximum give the best constants in various geometric and analytic inequalities and theorems.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.