So I know that if we choose the nodes of the interpolating polynomial to be the roots of the Chebyshev polynomial then the error is minimized. My textbook doesn't fully prove this, they just give a sketch of the proof.
In the sketch they mention $\int_{-1} ^{1} |(x-x_0) \cdot\cdot\cdot (x-x_n)| dx =2^{-n} $ and give no hint as to how they got here.
I know that we get this by integrating both sides of the usual error statement for interpolating polynomials. I think the rest of the proof mainly makes sense but this step has me stumped.
I tried to use induction to prove this to myself but it wasn't working. Maybe I made a silly mistake, but I can't seem to find my error and I cannot find anything on this on the internet. Can someone please give me a hint on how to prove this?
Thanks!