First, let us fix some Notation:


Let $n\in\mathbb{N}$ and $x\_i=\cos(\tfrac{(i+1/2)\pi}{(n+1)})$, $i=0,\dots,n$, be the Chebyshev points. Let
\begin{align}L\_i(x)={\displaystyle\prod\_{\substack{0\leq j\leq n\\i\neq j}}}\frac{x-x\_j}{x\_i-x\_j}, \end{align}
$i=0,\dots,n$, be the Lagrange polynomials. Now let $f\in C^{\infty}([-1,1],\mathbb{R})$ with $\sup\_{x\in[-1,1]}|f(x)|\leq 1$. We can now consider the interpolating polynomial given by
\begin{align}
P\_n(x)=\sum\_{i=0}^n f(x\_i)L\_i(x).
\end{align}
Now to the question:


By definition of the $L\_i$ we know that $P\_n$ is a polynomial of degree $n$, i.e. there exists coefficients $c\_{n,j}$, $j=0,\dots,n$, such that
\begin{align}
P\_n(x)=\sum\_{j=0}^n c\_{n,j}x^j.
\end{align}  

We are looking for an estimate on the size of the coefficients $c\_{n,j}$, specifically we would like something like 
\begin{align}
\max\_{j=0,\dots,n}|c\_{n,j}|\leq \pi(n)
\end{align}
for some polynomial $\pi$. (Or alternatively an argument of why this is not possible).


As we are not all that familiar with this topic, we have been trying find such a result in the literature. While there is huge amount of work on Lagrange interpolation and Chebyshev polynomials, this kind of estimate does not seem to be of interest for the usual applications. I would, however, find it surprising if no one had ever considered this question. If someone could point us to an answer, we would be very grateful.



Lagrangian interpolation at Chebyshev points - estimate on coefficients in monomic basis
A bound of the kind you're looking for is not possible, and it doesn't even matter what interpolation points you use (much less which particular polynomial basis you choose to work with, since that has no effect on the $c\_{n,j}$ anyway).


For a given value of $n$, let $f$ be (for instance) the Chebyshev polynomial of the first kind, $T\_n$. Then the interpolation will be exact, so also $P\_n = T\_n$. But the largest coefficient of $T\_n$ in the monomial basis is $2^n$, as can be easily proved using the standard recursive formula for these polynomials. Of course, $2^n$ grows faster than any polynomial of $n$.


For an introduction to this kind of thing, I highly recommend L.N. Trefethen's text [Approximation Theory and Approximation Practice](https://people.maths.ox.ac.uk/trefethen/ATAP/).


