Math 2.0

Approximations and expansions Density theorems Theorem

Korovkin's theorem

Builds on Positive linear operatorUniform convergenceUniform continuity

Statement

Let a<ba < b and let C[a,b]C[a, b] be the space of continuous functions [a,b]→ℝ[a, b] \to \R with the supremum norm. Let Ln ⁣:C[a,b]→C[a,b]L_n \colon C[a, b] \to C[a, b], n≥1n \ge 1, be positive linear operators: each LnL_n is linear, and Lnf≥0L_n f \ge 0 whenever f≥0f \ge 0. Let e0(x)=1e_0(x) = 1, e1(x)=xe_1(x) = x and e2(x)=x2e_2(x) = x^2. If Lnei→eiL_n e_i \to e_i uniformly on [a,b][a, b] for i=0,1,2i = 0, 1, 2, then Lnf→fL_n f \to f uniformly on [a,b][a, b] for every f∈C[a,b]f \in C[a, b].

Remarks

The idea of the proof: fix ff and ε>0\varepsilon > 0. By uniform continuity there is δ>0\delta > 0 with ∣f(t)−f(x)∣≤ε+2∥f∥∞(t−x)2/δ2\abs{f(t) - f(x)} \le \varepsilon + 2 \norm{f}_\infty (t - x)^2 / \delta^2 for all t,x∈[a,b]t, x \in [a, b]. Apply the positive operator LnL_n in the variable tt and evaluate at xx. This bounds ∣Lnf(x)−f(x)∣\abs{L_n f(x) - f(x)} by ε\varepsilon plus terms in Lne0−e0L_n e_0 - e_0, Lne1−e1L_n e_1 - e_1 and Lne2−e2L_n e_2 - e_2, which tend to 00 uniformly.

Example: the Bernstein operators BnB_n on [0,1][0, 1] satisfy Bne0=e0B_n e_0 = e_0, Bne1=e1B_n e_1 = e_1 and Bne2=e2+x(1−x)/nB_n e_2 = e_2 + x(1 - x)/n. So Korovkin's theorem gives Bnf→fB_n f \to f uniformly for every continuous ff.

Positivity is needed. In the periodic setting the test functions are 1,cos⁡x,sin⁡x1, \cos x, \sin x. The partial sums of Fourier series reproduce these test functions for n≥1n \ge 1, but they are not positive operators. And there are continuous periodic functions whose Fourier series do not converge uniformly.

Going deeper

For a student

The theorem is the standard tool to prove convergence of the Bernstein, Szász–Mirakyan, Baskakov and Kantorovich operators and of Fejér means. The periodic version uses the test functions 1,cos⁡x,sin⁡x1, \cos x, \sin x, and it proves Fejér's theorem on Cesàro means of Fourier series. Quantitative forms bound ∥Lnf−f∥∞\norm{L_n f - f}_\infty by the modulus of continuity of ff and the errors on the test functions. The theorem also shows a rigidity: a single positive linear operator on C[a,b]C[a, b] that fixes 11, xx and x2x^2 must be the identity.

Reading path

To understand this page from the ground up, read these 12 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. Limit point of a set definition
  2. Positive linear operator concept
  3. Sequence definition
  4. Limit of a function definition
  5. Real sequence definition
  6. Continuity at a point definition
  7. Limit of a sequence definition
  8. Epsilon-delta definition of continuity statement
  9. Pointwise convergence definition
  10. Uniform continuity definition
  11. Uniform convergence definition
  12. Korovkin's theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Korovkin_approximation
About this page
TagQ6KCF4688J
URIm2://Q6KCF4688J
Kindstatement, theorem
WritingW0 stub
MSC41A36, 41A35
StatusThis copy of the site has no build data. Run m2 status Q6KCF4688J.
AboutPositive linear operator, Uniform approximation
UsesPositive linear operator, Uniform convergence, Uniform continuity
Same as

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.