Use the periodic modulus of continuity
Subdividing a displacement into at most steps of size at most proves the chaining inequality
For , the sharper bound holds directly.
Set , where and . Positivity and unit normalized mass of the Fejér kernel give
The portion is at most . For , and , so
Apply this bound and the chaining inequality to the two tails:
Let . Calculus gives , attained at , and . Thus a possible explicit constant for the fractional-scale Fejér approximation bound is
The constant depends only on , not on or . Since a continuous periodic function is uniformly continuous, the right-hand side tends to zero. The logarithmic tail estimate is what permits every ; a crude global-oscillation bound would not prove the whole requested range.
For , the Bernstein polynomial is
The weights sum to one by the binomial theorem. Equivalently, if has the binomial distribution with parameters , then . This interpretation makes the cancellation of apparent high-degree terms transparent.
For the falling factorial , with , direct cancellation in the binomial weights gives
The polynomials form a monic triangular basis of the degree-at-most- polynomials. Hence , and
For , its leading coefficient is . If has actual degree and leading coefficient , linearity shows that the leading coefficient of is ; lower-degree terms cannot cancel it. Thus the Bernstein polynomial degree preservation property gives
This includes the requested , and also explains why the property cannot simply be extended to .
The same moments give and . Therefore
The first two approximation errors vanish identically, while
All three convergences are consequently uniform convergence on .

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact