I wonder if we can replace the binomial terms in Bernstein polynomial with multinomial terms. To be more specific, given a vector $f=(f\_1, f\_2,\dotsc, f\_M)\in \mathbb{Z}^M$ such that $\forall m, f\_m\ge0, \sum\_mf\_m=N\in\mathbb{Z}$, define
$F\_{N,f}(\sigma)=\frac{N!}{\prod\_{m} f\_{m}!}\prod\_{m:\sigma\_m>0}(\sigma\_{m})^{f\_{m}}$, where $\sigma\in\Delta^{M-1}$.


I think when $M=2$, this is Bernstein polynomial. Is there a name for $F\_{N, f}$ for cases $M>2$ and what are its properties?



Is there a name for an extension of Bernstein basis polynomial based on multinomial distribution?
$\newcommand{\de}{\delta}\newcommand{\De}{\Delta}\newcommand\R{\mathbb R}\newcommand{\om}{\omega}\newcommand{\si}{\sigma}$Such polynomials are called [multivariate Bernstein polynomials](https://www.google.com/search?q=multivariate%20Bernstein%20polynomials&oq=multivariate%20Bernstein%20polynomials&aqs=chrome..69i57.448j0j1&sourceid=chrome&ie=UTF-8).


Many of the [properties of Bernstein polynomials](https://en.wikipedia.org/wiki/Bernstein_polynomial#Properties) should be extendible to these multivariate versions.


Perhaps the most interesting of the properties of Bernstein polynomials is that they provide an explicit bound on the uniform approximation error of continuous functions by polynomials.


Let us show that such a property holds in the multivariate case as well.


Let $g\colon\De^{M-1}\to\R$ be any continuous function with the modulus of continuity $\om$ given by the formula
\begin{equation\*}
 \om(\de):=\sup\{|g(x)-g(y)|\colon\|x-y\|\_2\le\de\}
\end{equation\*}
for real $\de>0$, where $\|\cdot\|\_2$ is the Euclidean norm.


For any $\si=(\si\_1,\dots,\si\_M)\in\De^{M-1}$, let a random $M$-tuple $X=(X\_1,\dots,X\_M)$ have the multinomial distribution with parameters $N;\si\_1,\dots,\si\_M$. Then
\begin{equation\*}
 F\_{N,f}(\si)=P(X\_1=f\_1,\dots,X\_M=f\_M)
\end{equation\*}
for $f=(f\_1,\dots,f\_M)\in\{0,1,\dots\}^M$ with $\sum\_{j=1}^M f\_j=N$. So,
\begin{equation\*}
 p\_{N,f}(\si):=Eg\Big(\frac XN\Big)=\sum\_f g\Big(\frac fN\Big)F\_{N,f}(\si),
\end{equation\*}
and $p\_{N,f}$ is a polynomial; of course, here $\sum\_f$ denotes the summation over all $f=(f\_1,\dots,f\_M)\in\{0,1,\dots\}^M$ with $\sum\_{j=1}^M f\_j=N$.


Moreover, for any real $\de>0$ and all $\si\in\De^{M-1}$,
\begin{equation\*}
\begin{aligned}
|p\_{N,f}(\si)-g(\si)|&\le E\Big|g\Big(\frac XN\Big)-g(\si)\Big| \\ 
&=E\Big|g\Big(\frac XN\Big)-g(\si)\Big|\,1\Big(\Big\|\frac XN-\si\Big\|\_2\le\de\Big) \\ 
&+E\Big|g\Big(\frac XN\Big)-g(\si)\Big|\,1\Big(\Big\|\frac XN-\si\Big\|\_2>\de\Big) \\ 
&\le\om(\de)+2\|g\|\_\infty\,P\Big(\Big\|\frac XN-\si\Big\|\_2>\de\Big) \\ 
&\le\om(\de)+\frac{2\|g\|\_\infty}{\de^2}\,E\Big\|\frac XN-\si\Big\|\_2^2 \\ 
&\le\om(\de)+\frac{2\|g\|\_\infty}{\de^2}\,\sum\_{j=1}^M E\Big(\frac{X\_j}N-\si\_j\Big)^2 \\ 
&=\om(\de)+\frac{2\|g\|\_\infty}{\de^2\,N}\,\sum\_{j=1}^M \si\_j(1-\si\_j) \\ 
&\le\om(\de)+\frac{2\|g\|\_\infty}{\de^2\,N}, 
\end{aligned}
\tag{1}\label{1} 
\end{equation\*}
where $\|g\|\_\infty:=\max\_{\si\in\De^{M-1}}|g(\si)|$.
The penultimate inequality and the last equality in \eqref{1} follow because the $X\_j$'s are negatively correlated random variables with respective binomial distributions with parameters $N,\si\_j$, and the last equality in \eqref{1} follows because $\si\in\De^{M-1}$.


So, $\limsup\_{N\to\infty}\|p\_{N,f}(\si)-g(\si)\|\_\infty\le\om(\de)$, for any real $\de>0$. Since $g$ is continuous, it is uniformly continuous on $\De^{M-1}$, so that $\om(\de)\to0$ as $\de\downarrow0$. We conclude that
\begin{equation}
 \lim\_{N\to\infty}\|p\_{N,f}(\si)-g(\si)\|\_\infty=0,
\end{equation}
as claimed. $\quad\Box$


