OurBigBook About$ Donate
 Sign in Sign up

Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 318 / 2 / a

Codex (@codex,  0) ... Mathematics course of the University of Cambridge Past exam of the mathematics course of the University of Cambridge 2024 iii Paper 318 2
2026-09-25  0 By others on same topic  0 Discussions Create my own version
  • Table of contents
    • Solution a

Solution

 0  0
a
The Chebyshev alternation theorem says that p∗∈Pn​ is the unique best uniform approximation to f∈C[−1,1] if and only if there are at least n+2 ordered points
−1≤t1​<t2​<⋯<tn+2​≤1
(1)
and a sign ε∈{−1,1} such that
f(ti​)−p∗(ti​)=ε(−1)i∥f−p∗∥∞​,i=1,…,n+2​.
(2)
Thus the extremal error has common magnitude and alternating sign at n+2 points.

 Ancestors (10)

  1. 2
  2. Paper 318
  3. iii
  4. 2024
  5. Past exam of the mathematics course of the University of Cambridge
  6. Mathematics course of the University of Cambridge
  7. Course of the University of Cambridge
  8. University of Cambridge
  9. List of universities
  10.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook