For uniform convergence to on , for every there is such that for all and all . The bound proves uniform convergence to zero, whereas its derivative is . On an interval containing zero these derivatives diverge at zero, so they cannot converge uniformly. This supplies a counterexample to differentiating a uniformly convergent sequence without additional hypotheses.
For uniform derivative convergence with an anchored value, put and . A uniform limit of continuous functions is continuous. The fundamental theorem of calculus gives
Thus , with error bounded by
This is uniform on bounded subintervals, and on all of if it is bounded. The fundamental theorem of calculus now gives , so is continuously differentiable. For an unbounded , no global uniform convergence of follows merely from the displayed hypotheses, but local uniform convergence and the claimed differentiability do.
For the series, use partial sums and differentiate their individual terms:
For , their absolute values are at most , a summable bound. The Weierstrass M-test makes the derivative series uniformly convergent, while every partial sum is zero at . The anchored-value result therefore proves continuous differentiability on , with derivative equal to the displayed termwise derivative series.
The original PDF has indices ; the exponent is lost in the TeX transcription. This lacunary indexing is essential to the positive lacunary Chebyshev series argument below.
Let be the least nonnegative integer with , so for . Define
For the sum is empty and means the zero polynomial. Each included Chebyshev polynomial has degree at most . Also on the interval, so summability of the positive coefficients gives uniform convergence by the Weierstrass M-test, and
Choose and the points , . For every omitted index , the integer is odd. Consequently,
Every term of the tail has the same sign at a given point, and therefore
This shows both that the error norm is exactly and that it alternates at distinct points. The points are in decreasing order; reversing their order still gives alternation. The Chebyshev alternation theorem proves that this partial sum is the unique best uniform approximation. Hence
In particular, and . The equal signs of all tail terms at the same extrema are the reason positivity and the odd integer frequency ratios are useful.
An explicit construction gives Bernstein's lethargy theorem in the requested inequality form. Set
Strict decrease makes every coefficient positive. Telescoping and the limit assumption give
Thus
defines a continuous function by the Weierstrass M-test and the uniform limit theorem. Apply the positive lacunary Chebyshev series calculation. At ,
For , choose so that . Its error is
Therefore the function satisfies
This explicit Chebyshev construction for Bernstein lethargy also has . It shows that continuity imposes no universal speed of convergence of best polynomial approximation, even though convergence itself follows from the Weierstrass approximation theorem.
By the Weierstrass M-test, absolute summability of the Fourier coefficients makes uniformly convergent to a continuous periodic function . Termwise integration is justified by that uniform convergence, and orthogonality gives
Part (ii) then implies . Thus the Fourier series converges uniformly to the original function, not merely to some continuous limit. In particular,
For , , and the numerical series converges. The Weierstrass M-test therefore gives uniform convergence to . More explicitly,
The bound is independent of , including points arbitrarily close to one.
The Chebyshev polynomial identity implies on . Since , the Weierstrass M-test shows that
converges uniformly on . Every partial sum is continuous, so the uniform limit theorem makes a well-defined continuous function.
Let
Then . Since every is odd and, for , is an odd integer,
It follows that
Thus the error has equal alternating extrema at ordered points. The Chebyshev alternation theorem shows that is a best uniform approximation among polynomials of degree at most , and in particular
Now let be the prescribed decreasing positive sequence. Define
Then decreases strictly to zero, so every , the series converges, and
Given , choose with . Monotonicity of best-approximation errors and of gives
Hence this continuous satisfies
for every polynomial of degree at most . This is the polynomial form of Bernstein's lethargy theorem.
For the period lattice , define the Weierstrass elliptic function by
To prove Normal convergence of the Weierstrass elliptic-function series, let be compact and choose with on . For ,
The comparison series converges by the stated lattice-sum criterion. The Weierstrass M-test gives uniform convergence on ; since was arbitrary, the series converges locally uniformly away from . The locally uniform convergence of holomorphic functions makes its sum holomorphic there, and the displayed principal term gives a double pole at every lattice point.
The function is even and satisfies
The three nonzero two-torsion points are distinct modulo and each equals its own negative modulo . Therefore no two can have the same -value, so are distinct. Equivalently, is a degree-two branched map and each half-lattice point already occupies its fiber with multiplicity two.
For a transitive example, take the equianharmonic lattice
and define . Multiplication by preserves , so is a conformal equivalence. On the nonzero half-lattice points it acts by
because . Thus it acts transitively.
For a compact subset , the real-linear map
has inverse norm bounded uniformly for . Hence there is such that
Therefore the absolute value of the defining series is bounded locally uniformly by
which converges for . The Weierstrass M-test gives locally uniform absolute convergence, so termwise holomorphy proves that is holomorphic.