Math 2.0

Approximations and expansions Rates of approximation: direct and inverse theorems Theorem

Bernstein's theorem on analytic functions

Builds on Error of best approximationHolomorphic functionEllipseChebyshev polynomials

Statement

Let f ⁣:[−1,1]→ℝf \colon [-1, 1] \to \R be continuous and let En(f)E_n(f) be the uniform distance on [−1,1][-1, 1] from ff to the polynomials of degree at most nn. For ρ>1\rho > 1, let ℰρ\mathcal{E}_\rho be the open region bounded by the ellipse with foci ±1\pm 1 whose semi-axes have sum ρ\rho. Then ff extends to a holomorphic function on ℰρ\mathcal{E}_\rho if and only if lim sup⁡n→∞En(f)1/n≤1ρ.\limsup_{n \to \infty} E_n(f)^{1/n} \le \frac{1}{\rho}.

Remarks

The region ℰρ\mathcal{E}_\rho is the image of the annulus 1<∣z∣<ρ1 < \abs{z} < \rho under the map z↦(z+z−1)/2z \mapsto (z + z^{-1})/2, together with [−1,1][-1, 1]. Proof idea for the direct half: for 1<s<ρ1 < s < \rho, the coefficients of the Chebyshev series of ff are O(s−n)O(s^{-n}), by a contour integral over the image of ∣z∣=s\abs{z} = s. Truncating the series gives En(f)=O(s−n)E_n(f) = O(s^{-n}). For the converse, write f=p0+∑(pn+1−pn)f = p_0 + \sum (p_{n+1} - p_n) with best approximations pnp_n and bound each difference on ℰs\mathcal{E}_s for s<ρs < \rho by its size on [−1,1][-1, 1].

Example: for a>1a > 1 and f(x)=1/(x−a)f(x) = 1/(x - a), the pole aa lies on the boundary of ℰρ\mathcal{E}_\rho with ρ=a+a2−1\rho = a + \sqrt{a^2 - 1}. So En(f)E_n(f) decays like (a+a2−1)−n(a + \sqrt{a^2 - 1})^{-n}, up to factors that grow slower than any exponential. For the Runge function 1/(1+25x2)1/(1 + 25x^2), the poles ±i/5\pm i/5 give ρ=(1+26)/5≈1.22\rho = (1 + \sqrt{26})/5 \approx 1.22.

Going deeper

For a student

This explains why Chebyshev methods converge so fast for analytic functions, and why nearby complex singularities slow them down even when ff looks harmless on the real line. It is an inverse and a direct theorem at once: geometric decay of En(f)E_n(f) and analyticity in an ellipse are equivalent. The ellipses ∂ℰρ\partial \mathcal{E}_\rho are the level curves of the Green function of the complement of [−1,1][-1, 1], which leads to the general theory of Walsh for other sets.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Chebyshev polynomials object
  2. Ellipse concept
  3. Error of best approximation concept
  4. Holomorphic function concept
  5. Bernstein's theorem on analytic functions statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Bernstein%27s_theorem_(approximation_theory)
About this page
Tag9X3QFZEHM1
URIm2://9X3QFZEHM1
Kindstatement, theorem
WritingW0 stub
MSC41A25, 41A27, 30E10
StatusThis copy of the site has no build data. Run m2 status 9X3QFZEHM1.
AboutDirect and inverse theorems of approximation
UsesError of best approximation, Holomorphic function, Ellipse, Chebyshev polynomials

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.