Let $F:[a,b) \to [0,\infty)$ be a $C^1$ function, and let $\hat F$ be the (lower) convex envelope of $F$, i.e. $$ \hat F(x) = \sup \{ h(x) \mid \text{$h$ is convex on $[a, b)$}\,,\, h \le F \} \, . $$
Let $c \in (a,b)$. Do there exist $x,y \in [a,b)$ and $\lambda \in [0,1]$ such that $c = \lambda \, x + (1-\lambda)\, y$ and $\hat F(c) = \lambda \, F(x) + (1-\lambda) \, F(y)$?
We always have $$ \hat F(c) \le \lambda \, \hat F(x) + (1-\lambda) \, \hat F(y) \le \lambda \, F(x) + (1-\lambda) \, F(y), $$ so $\hat F(c) = \lambda \, F(x) + (1-\lambda) \, F(y)$ implies that $\hat F(x)=F(x), \hat F(y)=F(y)$.
Here is an attempt at a proof:
Suppose that $\hat F(c)<F(c)$. Define $$ x=\sup \{ t<c \, | \, \hat F(t)=F(t)\}, y=\inf \{ t>c \, | \, \hat F(t)=F(t)\}. $$ Then $x<c<y$, and $\hat F(x)=F(x), \hat F(y)=F(y)$.
My guess is that $\hat F$ should be affine on $[x,y]$, which implies the claim.
I think that this can be proved by assuming by contradiction...but I am having trouble completing the proof.
Noe that $F$ is $C^1$ implies that $\hat F$ is $C^1$, and we also have $F'(x)=\hat F'(x), F'(y)=\hat F'(y)$.
Comment:
I actually don't think that $F \in C^1$ is necessary here. I think that $F$ being continuous should be sufficient.