Let $F:[a,b] \to \mathbb R$ be a convex function.
Let $c \in [a,b]$, and let $x < c < y$. Let $\lambda \in (0,1)$ satisfy $c = \lambda \, x + (1-\lambda)\, y$.
Suppose that $F(c)=\lambda \, F(x) + (1-\lambda) \, F(y)$.
How to prove that $F|_{[x,y]}$ is affine?
This "gap-domination" property implies that
$F(c)=\tilde \lambda \, F(\tilde x) + (1-\tilde \lambda) \, F(\tilde y)$ holds for every $\tilde x < c < \tilde y$ and $\tilde \lambda \in [0,1]$ satisfying $c =\tilde \lambda \, \tilde x + (1-\tilde\lambda)\, \tilde y$, but I don't see how that implies the claim, since we need to consider combinations whose mean is different from $c$.