Let $f(x)=\binom{x}{2}+\binom{x}{4}+\cdots+\binom{x}{2u}$, where $u\in\mathbb{Z}^+$ and $\binom{x}{l}=\frac{x(x-1)\dots(x-l+1)}{l!}$ for all $l\in\mathbb{Z}^+$. Then can we prove $f(x)$ is a convex function on $[0,+\infty)$?
Updates:
It was pointed out by @user44191 that, observing $\binom{x}{i}=\binom{x-1}{i}+\binom{x-1}{i-1}$, the question is equivalent to $\binom{x-1}{1}+\binom{x-1}{2}+\dots+\binom{x-1}{2u}$ is convex on $[0,+\infty)$.
Pointed out by @FedorPetrov @GeraldEdgar @H.H.Rugh:
For $x<0$ each summand $\binom{x}{2i}$ is obviously convex, thus the question is equivalent to $f(x)$ is convex on $\mathbb{R}$.Pointed out by @WłodzimierzHolsztyński:
It has $(\Delta^2 f_u)(x) = 1+ f_{u-1}(x-2)$, where $(\Delta f_u)(x)=f_u(x)-f_u(x-1)$. Then we can conclude that $f(x)$ is discrete convex.