maths2u
Tier
⌕ Search ⌘K
Theorem

The Weierstrass M-test

T-045Home MU-201Threads space · change
Statement

Let \( E \) be a non-empty set and let \( (f_n)_{n \ge 1} \) be a sequence of functions \( f_n : E \to \mathbb{R} \) (or \( \mathbb{C} \)). Suppose there exists a sequence of real constants \( (M_n)_{n \ge 1} \), independent of \( x \), such that (i) \( |f_n(x)| \le M_n \) for every \( x \in E \) and every \( n \in \mathbb{N} \), and (ii) the numerical series \( \sum_{n=1}^{\infty} M_n \) converges. Then the series \( \sum_{n=1}^{\infty} f_n \) converges absolutely at every point of \( E \), and the sequence of partial sums \( S_N = \sum_{n=1}^{N} f_n \) converges uniformly on \( E \) to the function \( f(x) = \sum_{n=1}^{\infty} f_n(x) \).

Why it matters

Uniform convergence is the currency that lets limit operations pass through an infinite sum: a uniform limit of continuous functions is continuous, a uniformly convergent series may be integrated term by term, and (with a companion hypothesis) differentiated term by term. But verifying uniform convergence from the definition means estimating \( \sup_{x \in E} |f(x) - S_N(x)| \), which requires already knowing the sum \( f \). The M-test removes this obstacle entirely: it converts a question about functions into a question about a single series of non-negative numbers, checkable by the ordinary convergence tests of first-year analysis.

It is the workhorse behind the basic theory of power series, Fourier series, the Riemann zeta function on half-planes, and Weierstrass's own construction of a continuous nowhere-differentiable function. Structurally it is the prototype of a deep principle: in a complete space, absolute convergence implies convergence.

Hypotheses
Uniform domination: \( |f_n(x)| \le M_n \) for all \( x \in E \).The bound must hold at every point with the same constant. On \( [0,1) \) the series \( \sum x^n \) satisfies a pointwise bound \( |x^n| \le r^n \) on each \( [0,r] \), but the only constant valid on all of \( [0,1) \) is \( \sup_{x \in [0,1)} x^n = 1 \), which is not summable — and indeed the convergence of \( \sum x^n \) to \( \frac{1}{1-x} \) is not uniform on \( [0,1) \), since the partial-sum error \( \frac{x^{N+1}}{1-x} \) is unbounded there.
Summability: \( \sum_{n=1}^{\infty} M_n \lt \infty \).Take \( f_n(x) = \tfrac{1}{n} \) constant on any \( E \): the natural (and smallest possible) dominating constants are \( M_n = \tfrac{1}{n} \), the harmonic series diverges, and the function series \( \sum f_n \) diverges at every point. Summability of the dominating sequence is what drives the whole argument.
The constants \( M_n \) do not depend on \( x \).If one only assumes \( |f_n(x)| \le M_n(x) \) with \( \sum M_n(x) \lt \infty \) pointwise, the conclusion collapses to pointwise absolute convergence and nothing more: \( \sum x^n \) on \( [0,1) \) is dominated pointwise by itself, converges absolutely at each point, yet fails to converge uniformly. Uniformity of the domination is exactly what makes the tail estimate independent of \( x \).
Completeness of the codomain.The proof uses that an absolutely convergent series of reals converges, i.e. the completeness of \( \mathbb{R} \). In an incomplete normed space the theorem fails: in the space of polynomials on \( [0,1] \) with the sup norm, the series \( \sum \frac{x^n}{n!} \) is dominated by the summable \( M_n = \frac{1}{n!} \), its partial sums are uniformly Cauchy, yet the limit \( e^x \) lies outside the space. The M-test is valid, verbatim, for functions into any Banach space — and only there.
Proof
1
Fix \( x \in E \). For every \( n \), \( 0 \le |f_n(x)| \le M_n \), and \( \sum_{n=1}^{\infty} M_n \) converges; hence \( \sum_{n=1}^{\infty} |f_n(x)| \) converges.
Comparison test for series of non-negative terms: a series dominated termwise by a convergent series converges. A
2
Therefore \( \sum_{n=1}^{\infty} f_n(x) \) converges for each \( x \in E \). Define \[ f(x) = \sum_{n=1}^{\infty} f_n(x), \qquad S_N(x) = \sum_{n=1}^{N} f_n(x). \]
Absolute convergence implies convergence in \( \mathbb{R} \) — a consequence of the Cauchy criterion, hence ultimately of the completeness of \( \mathbb{R} \). This defines the candidate limit function; uniform convergence to it is what remains to be shown. B
3
For all integers \( N \gt M \ge 1 \) and all \( x \in E \): \[ |S_N(x) - S_M(x)| = \left| \sum_{n=M+1}^{N} f_n(x) \right| \le \sum_{n=M+1}^{N} |f_n(x)| \le \sum_{n=M+1}^{N} M_n . \]
Triangle inequality for finite sums, then the domination hypothesis \( |f_n(x)| \le M_n \) applied to each term. Crucially, the right-hand side is independent of \( x \). B
4
Fix \( M \) and \( x \), and let \( N \to \infty \) in Step 3. Since \( S_N(x) \to f(x) \) (Step 2) and \( \sum_{n=M+1}^{N} M_n \to \sum_{n=M+1}^{\infty} M_n =: T_M \) (tail of a convergent series), we obtain \[ |f(x) - S_M(x)| \le T_M \quad \forall x \in E . \]
The absolute value is continuous, so \( |S_N(x)-S_M(x)| \to |f(x)-S_M(x)| \); non-strict inequalities are preserved under limits of sequences. This step converts the finite Cauchy estimate into a bound on the actual remainder, valid uniformly in \( x \). C
5
\[ T_M = \sum_{n=M+1}^{\infty} M_n \to 0 \quad \text{as } M \to \infty . \]
The tail of a convergent series tends to zero: \( T_M = \sum_{n=1}^{\infty} M_n - \sum_{n=1}^{M} M_n \), and the partial sums converge to the total sum. A
6
Let \( \varepsilon \gt 0 \). Choose \( K \in \mathbb{N} \) with \( T_M \lt \varepsilon \) for all \( M \ge K \). Then for all \( M \ge K \), \[ \sup_{x \in E} |f(x) - S_M(x)| \le T_M \lt \varepsilon . \] Hence \( S_M \to f \) uniformly on \( E \).
Definition of the limit \( T_M \to 0 \) (Step 5), combined with the uniform bound of Step 4. The displayed inequality is precisely the definition of uniform convergence: the index \( K \) depends on \( \varepsilon \) alone, never on \( x \). Together with Step 1 (absolute convergence at each point), this completes the proof. \( \blacksquare \) B
7
Remark: every step above used only the triangle inequality and completeness. The identical argument proves: if \( f_n : E \to X \) with \( X \) a Banach space, \( \lVert f_n(x) \rVert \le M_n \) for all \( x \), and \( \sum M_n \lt \infty \), then \( \sum f_n \) converges uniformly on \( E \).
In Step 2, "absolute convergence implies convergence" holds in any complete normed space (and characterises completeness). No property of \( \mathbb{R} \) beyond its norm and completeness was invoked. C
Result
\[ \Big( \forall x \in E,\ \forall n:\ |f_n(x)| \le M_n \Big) \ \wedge \ \sum_{n=1}^{\infty} M_n \lt \infty \ \Longrightarrow \ \sum_{n=1}^{\infty} f_n \ \text{converges uniformly and absolutely on } E . \]

Reading. If every term of a series of functions can be trapped under a fixed numerical ceiling, and the ceilings themselves add up to a finite number, then the series of functions converges "all at once" across the whole domain — the speed of convergence never degrades as you move the point \( x \).

Scope. Applies to functions from an arbitrary set \( E \) (no topology, measure, or structure on \( E \) is needed) into \( \mathbb{R} \), \( \mathbb{C} \), or any Banach space. It is a sufficient condition only: series can converge uniformly without any summable dominating sequence existing.

Corollaries & converses
  • Continuity of the sum. If moreover \( E \) is a metric (or topological) space and each \( f_n \) is continuous, then \( f = \sum f_n \) is continuous, by the uniform limit theorem. This is the single most-used consequence.
  • Term-by-term integration. If \( E = [a,b] \) and each \( f_n \) is Riemann integrable, then \( f \) is Riemann integrable and \( \int_a^b f = \sum_{n=1}^{\infty} \int_a^b f_n \), since uniform convergence permits the interchange of limit and integral on a bounded interval.
  • Power series. A power series \( \sum a_n x^n \) with radius of convergence \( R \) converges uniformly on every closed interval \( [-r, r] \) with \( 0 \lt r \lt R \) (take \( M_n = |a_n| r^n \)); hence its sum is continuous on \( (-R, R) \). The same argument in \( \mathbb{C} \) gives uniform convergence on closed subdiscs.
  • Converse fails. Uniform convergence does not imply the existence of summable dominating constants. On \( [0, \infty) \), the series \( \sum_{n=1}^{\infty} \frac{(-1)^n}{n + x} \) converges uniformly (alternating-series remainder \( \le \frac{1}{N+1} \), independent of \( x \)), yet any admissible \( M_n \) must satisfy \( M_n \ge \sup_{x \ge 0} \frac{1}{n+x} = \frac{1}{n} \), so \( \sum M_n \) diverges. The M-test also forces absolute convergence, which this series lacks — a second, structural reason no converse can hold.
  • Abstract form. The M-test is exactly the statement that the space \( B(E) \) of bounded functions on \( E \) with the sup norm is a Banach space, applied to an absolutely convergent series: \( \sum \lVert f_n \rVert_{\infty} \le \sum M_n \lt \infty \) implies norm convergence of \( \sum f_n \).
Fails without
  • No summable uniform bound (domination fails): \( f_n(x) = x^n \) on \( E = [0,1) \). Each \( f_n \) is bounded by \( 1 \), but \( \sup_{x \in E} |f_n(x)| = 1 \) for every \( n \) and no summable \( M_n \) exists. The series converges pointwise to \( \frac{1}{1-x} \), but not uniformly: \( \sup_{x \in [0,1)} \left| \frac{1}{1-x} - S_N(x) \right| = \sup_{x \in [0,1)} \frac{x^{N+1}}{1-x} = \infty \) for every \( N \).
  • \( \sum M_n \) divergent, series divergent: \( f_n(x) = \frac{1}{n} \) on any \( E \). Here \( M_n = \frac{1}{n} \) is the best possible constant, \( \sum \frac{1}{n} = \infty \), and \( \sum f_n(x) \) diverges at every single point — dropping summability can destroy even pointwise convergence.
  • Travelling bumps: let \( f_n \) be the piecewise-linear "tent" of height \( 1 \) supported on \( \left[ \frac{1}{n+1}, \frac{1}{n} \right] \subseteq (0,1] \), zero elsewhere. At each \( x \) at most two terms are non-zero, so \( \sum f_n \) converges pointwise on \( (0,1] \); but \( \sup_x |f_n(x)| = 1 \), the remainder after \( N \) terms still has supremum \( 1 \) (witnessed near \( x = \frac{1}{N+2} \)), and the convergence is not uniform. No summable domination is possible.
  • Incomplete codomain: with values in the (incomplete) normed space of polynomials on \( [0,1] \) under the sup norm, the constant-in-\( x \) series with terms \( \frac{t^n}{n!} \) is dominated by \( M_n = \frac{1}{n!} \), yet has no limit in the space: completeness of the target is genuinely used.
Common errors
  • Letting \( M_n \) depend on \( x \). Writing \( |x^n| \le x^n \) and "summing" is circular; the test requires one constant per term, valid across the entire domain. Always compute or bound \( \sup_{x \in E} |f_n(x)| \) first.
  • Reading the test as an equivalence. Concluding "the M-test fails, therefore the convergence is not uniform." The test is sufficient, not necessary — see \( \sum \frac{(-1)^n}{n+x} \) above. Failure of the M-test proves nothing.
  • Forgetting to check summability. Finding \( M_n = \sup |f_n| \) correctly and then never testing \( \sum M_n \). E.g. \( \sup_{x \in [0,1]} x^n (1-x) = \frac{1}{n+1} \left( \frac{n}{n+1} \right)^n \sim \frac{1}{e\,n} \), which is not summable.
  • Ignoring the domain. \( \sum \frac{x^n}{n} \) passes the M-test on \( [-r, r] \) for each \( r \lt 1 \) but on no neighbourhood of \( 1 \); "uniform on every compact subset" and "uniform on the whole open interval" are different conclusions, and only the former follows.
  • Differentiating term by term on the strength of the M-test alone. Uniform convergence of \( \sum f_n \) says nothing about \( \sum f_n' \); the term-by-term differentiation theorem needs uniform convergence of the derived series (plus convergence of the original at one point). The Weierstrass function is the canonical warning.
Discussion

The test is due to Karl Weierstrass, who used it in his Berlin lectures from the 1860s onward as part of his programme to rebuild analysis on \( \varepsilon \)–\( \delta \) foundations. The historical backdrop is Cauchy's famous 1821 misstep — the claim that a convergent series of continuous functions has a continuous sum — refuted by Abel with Fourier-type series such as \( \sum \frac{\sin nx}{n} \), whose sum jumps. The repair required isolating the notion of uniform convergence (Seidel, Stokes, and above all Weierstrass), and the M-test was the tool that made the notion usable: it is often the only uniform-convergence criterion a working analyst ever needs.

Its most spectacular early application was Weierstrass's 1872 example \( W(x) = \sum_{n=0}^{\infty} a^n \cos(b^n \pi x) \) with \( 0 \lt a \lt 1 \): the M-test with \( M_n = a^n \) shows instantly that \( W \) is continuous on \( \mathbb{R} \), while a delicate separate argument (for \( ab \) large enough) shows it is differentiable nowhere. The test thus certified the existence of objects that shattered the era's geometric intuition — continuity with no tangent anywhere — and marks the point where analysis decisively outgrew pictures.

Within the standard curriculum the M-test is the engine behind the elementary theory of power series (uniform convergence on compact subdiscs, hence continuity, term-by-term integration, and — applied to the derived series, which has the same radius — term-by-term differentiation), behind the continuity of \( \zeta(s) = \sum n^{-s} \) on half-planes \( \operatorname{Re} s \ge 1 + \delta \), and behind the routine manipulation of Fourier series with summable coefficients.

The modern view absorbs the theorem into Banach space theory. For a normed space \( X \), the following are equivalent: (i) \( X \) is complete; (ii) every series in \( X \) with \( \sum \lVert x_n \rVert \lt \infty \) converges in \( X \). The M-test is precisely implication (i) \( \Rightarrow \) (ii) applied to \( X = B(E) \), the bounded functions on \( E \) under \( \lVert \cdot \rVert_{\infty} \), whose completeness is the uniform Cauchy criterion in disguise; when \( E \) is a compact metric space one may take \( X = C(E) \) instead, and closedness of \( C(E) \) in \( B(E) \) is the uniform limit theorem. The converse implication (ii) \( \Rightarrow \) (i) explains why no version of the M-test can survive in an incomplete space, and the same skeleton — dominate, sum the dominants, invoke completeness — reappears in Bochner integration, in the Weierstrass factorisation of entire functions via uniformly convergent products, and in the convergence theory of Neumann series \( \sum T^n \) in operator algebras.

Common misconceptions. The M-test does not characterise uniform convergence (it is one-directional); it proves absolute convergence as a by-product, so it can never establish uniform convergence of a conditionally convergent series — for those one needs Dirichlet's or Abel's uniform tests; and it never, by itself, licenses term-by-term differentiation.

Worked examples

Example 1. Show that \( f(x) = \sum_{n=1}^{\infty} \frac{\cos(nx)}{n^2} \) defines a continuous function on all of \( \mathbb{R} \).

1
For every \( x \in \mathbb{R} \) and every \( n \ge 1 \): \[ \left| \frac{\cos(nx)}{n^2} \right| \le \frac{1}{n^2} =: M_n . \]
\( |\cos t| \le 1 \) for all real \( t \); the bound is independent of \( x \), as the test requires. A
2
\[ \sum_{n=1}^{\infty} M_n = \sum_{n=1}^{\infty} \frac{1}{n^2} \lt \infty . \]
Convergent \( p \)-series with \( p = 2 \gt 1 \) (its value \( \frac{\pi^2}{6} \) is irrelevant here — only finiteness matters). A
3
By the Weierstrass M-test, \( \sum_{n=1}^{\infty} \frac{\cos(nx)}{n^2} \) converges uniformly on \( \mathbb{R} \).
Both hypotheses of T-045 verified in Steps 1–2, with \( E = \mathbb{R} \). B
4
Each partial sum \( S_N(x) = \sum_{n=1}^{N} \frac{\cos(nx)}{n^2} \) is continuous on \( \mathbb{R} \), and \( S_N \to f \) uniformly; hence \( f \) is continuous on \( \mathbb{R} \).
Finite sums of continuous functions are continuous; the uniform limit theorem transfers continuity to the limit. A
\[ f(x) = \sum_{n=1}^{\infty} \frac{\cos(nx)}{n^2} \ \text{converges uniformly on } \mathbb{R} \ \text{and is continuous everywhere.} \]

Reading. A single summable ceiling \( \frac{1}{n^2} \), valid for every \( x \) at once, settles both convergence and continuity in four lines.

Scope. The same argument handles \( \sum \frac{\cos(nx)}{n^p} \) and \( \sum \frac{\sin(nx)}{n^p} \) for any \( p \gt 1 \); it says nothing for \( p \le 1 \), where the M-test is inapplicable and finer tools (Dirichlet's test) are needed.

Example 2. Show that \( g(x) = \sum_{n=1}^{\infty} n e^{-nx} \) converges uniformly on \( [\delta, \infty) \) for every \( \delta \gt 0 \), hence defines a continuous function on \( (0, \infty) \) — but that the convergence is not uniform on \( (0, \infty) \).

1
Fix \( \delta \gt 0 \). For \( x \ge \delta \): \[ |n e^{-nx}| = n e^{-nx} \le n e^{-n\delta} =: M_n , \] since \( t \mapsto e^{-nt} \) is decreasing.
Monotonicity of the exponential; the supremum of \( n e^{-nx} \) over \( [\delta, \infty) \) is attained at the left endpoint \( x = \delta \). A
2
\[ \frac{M_{n+1}}{M_n} = \frac{n+1}{n} e^{-\delta} \to e^{-\delta} \lt 1 , \] so \( \sum_{n=1}^{\infty} n e^{-n\delta} \) converges.
Ratio test (d'Alembert) with limit strictly below \( 1 \), legal because \( \delta \gt 0 \) is fixed. A
3
By the M-test, \( \sum n e^{-nx} \) converges uniformly on \( [\delta, \infty) \); as each term is continuous, \( g \) is continuous on \( [\delta, \infty) \). Since \( \delta \gt 0 \) was arbitrary and continuity is a local property, \( g \) is continuous on \( (0, \infty) \).
T-045 plus the uniform limit theorem on each \( [\delta, \infty) \); every point of \( (0,\infty) \) has a neighbourhood inside some \( [\delta, \infty) \). B
4
On \( (0, \infty) \) the convergence is not uniform: \[ \sup_{x \gt 0} n e^{-nx} = n \quad (\text{as } x \to 0^{+}) , \] so the terms \( f_n \) do not tend to \( 0 \) uniformly. But if \( \sum f_n \) converged uniformly, then \( f_n = S_n - S_{n-1} \to 0 \) uniformly — contradiction.
Uniform convergence of a series forces its terms to converge uniformly to zero (difference of two uniformly convergent sequences of partial sums). This also shows no summable dominating sequence can exist on \( (0,\infty) \): any valid \( M_n \) must be \( \ge n \). C
\[ \sum_{n=1}^{\infty} n e^{-nx} \ \text{converges uniformly on every } [\delta, \infty),\ \delta \gt 0, \ \text{but not on } (0, \infty). \]

Reading. The M-test is domain-sensitive: pushing the domain up to the boundary \( x = 0 \), where the terms blow up, destroys the uniform ceiling. "Uniform on every closed sub-ray" is the honest, and optimal, conclusion.

Scope. This exhaustion-by-compacta pattern is the standard idiom for Dirichlet series and power series alike: uniformity on the natural open domain typically fails, while uniformity on each slightly-shrunken closed subset survives.

Problems
  1. Prove that \( \sum_{n=1}^{\infty} \frac{\sin(nx)}{n^3} \) converges uniformly on \( \mathbb{R} \) and that its sum is continuous.
    Solution For all \( x \in \mathbb{R} \), \( \left| \frac{\sin(nx)}{n^3} \right| \le \frac{1}{n^3} =: M_n \), since \( |\sin t| \le 1 \). The series \( \sum \frac{1}{n^3} \) is a convergent \( p \)-series (\( p = 3 \gt 1 \)). By the Weierstrass M-test the function series converges uniformly on \( \mathbb{R} \). Each term \( x \mapsto \frac{\sin(nx)}{n^3} \) is continuous, so every partial sum is continuous, and by the uniform limit theorem the sum is continuous on \( \mathbb{R} \). \( \blacksquare \)
  2. Let \( f_n(x) = x^n (1 - x) \) on \( [0,1] \). Compute \( \sup_{x \in [0,1]} |f_n(x)| \), show the M-test does not apply, and decide (with proof) whether \( \sum_{n=0}^{\infty} f_n \) converges uniformly on \( [0,1] \).
    Solution On \( [0,1] \), \( f_n \ge 0 \) and \( f_n'(x) = x^{n-1} \left( n - (n+1)x \right) \), so the maximum is at \( x_n = \frac{n}{n+1} \): \[ \sup_{[0,1]} f_n = \left( \frac{n}{n+1} \right)^n \frac{1}{n+1} = \frac{1}{n+1} \left( 1 + \frac{1}{n} \right)^{-n} \to 0 \cdot e^{-1}, \quad \text{i.e. } \sup f_n \sim \frac{1}{e\,n} . \] Any admissible \( M_n \) must be at least this supremum, and \( \sum \frac{1}{e\,n} \) diverges (harmonic), so the M-test cannot apply. Directly: the partial sums telescope for \( x \in [0,1) \): \[ S_N(x) = (1-x) \sum_{n=0}^{N} x^n = 1 - x^{N+1} \to 1, \] while \( S_N(1) = 0 \to 0 \). The pointwise sum is \( 1 \) on \( [0,1) \) and \( 0 \) at \( x = 1 \): discontinuous. Since every \( S_N \) is continuous, a uniform limit would be continuous (uniform limit theorem); hence the convergence is not uniform on \( [0,1] \). (It is uniform on each \( [0, r] \), \( r \lt 1 \), since there \( \sup |1 - S_N| = r^{N+1} \to 0 \).) \( \blacksquare \)
  3. Let \( \sum_{n=0}^{\infty} a_n x^n \) be a power series with radius of convergence \( R \gt 0 \). Prove that it converges uniformly on \( [-r, r] \) for every \( 0 \lt r \lt R \), and deduce that its sum is continuous on \( (-R, R) \).
    Solution Fix \( 0 \lt r \lt R \). Since \( r \lt R \), the point \( x = r \) lies strictly inside the interval of convergence, and by the Cauchy–Hadamard theorem (root-test form: \( \limsup_n |a_n|^{1/n} = \frac{1}{R} \)) the series converges absolutely at \( x = r \); that is, \( \sum_{n=0}^{\infty} |a_n| r^n \lt \infty \). For \( |x| \le r \), \[ |a_n x^n| \le |a_n| r^n =: M_n , \] a bound independent of \( x \), with \( \sum M_n \lt \infty \). The Weierstrass M-test gives uniform convergence on \( [-r, r] \). Each monomial \( a_n x^n \) is continuous, so the sum is continuous on \( [-r, r] \) by the uniform limit theorem. Every point of \( (-R, R) \) lies in the interior of some \( [-r, r] \) with \( r \lt R \), and continuity is local, so the sum is continuous on \( (-R, R) \). \( \blacksquare \)
  4. Define \( W(x) = \sum_{n=0}^{\infty} 2^{-n} \cos(4^n x) \). (a) Show \( W \) is continuous on \( \mathbb{R} \). (b) Show that the formally differentiated series \( -\sum_{n=0}^{\infty} 2^n \sin(4^n x) \) does not converge uniformly on \( \mathbb{R} \), so the term-by-term differentiation theorem cannot be applied to \( W \).
    Solution (a) \( |2^{-n} \cos(4^n x)| \le 2^{-n} =: M_n \) for all \( x \), and \( \sum 2^{-n} = 2 \lt \infty \) (geometric, ratio \( \frac{1}{2} \)). By the M-test the series converges uniformly on \( \mathbb{R} \); the terms are continuous, so \( W \) is continuous by the uniform limit theorem. (b) If a series \( \sum g_n \) converges uniformly on \( E \), its terms satisfy \( g_n = S_n - S_{n-1} \to 0 \) uniformly, i.e. \( \sup_E |g_n| \to 0 \). Here \( g_n(x) = -2^n \sin(4^n x) \) and \[ \sup_{x \in \mathbb{R}} |g_n(x)| = 2^n \quad \left( \text{attained at } x = \frac{\pi}{2 \cdot 4^n} \right) , \] which tends to \( \infty \), not \( 0 \). Hence the derived series does not converge uniformly on \( \mathbb{R} \) (indeed not even pointwise at typical points), and the hypothesis of the term-by-term differentiation theorem — uniform convergence of the derived series — fails. (Weierstrass proved more: for suitable parameters such functions are differentiable at no point whatsoever; that requires a separate, harder argument and does not follow from the M-test alone.) \( \blacksquare \)
  5. (Converse fails.) Let \( f_n(x) = \frac{(-1)^n}{n + x} \) on \( E = [0, \infty) \). Prove: (a) \( \sum_{n=1}^{\infty} f_n \) converges uniformly on \( E \); (b) the convergence is not absolute at any point of \( E \); (c) there is no sequence \( (M_n) \) with \( |f_n(x)| \le M_n \) on \( E \) and \( \sum M_n \lt \infty \). Conclude that the Weierstrass M-test admits no converse.
    Solution (a) Fix \( x \ge 0 \). The numbers \( a_n(x) = \frac{1}{n+x} \) are positive, strictly decreasing in \( n \), and tend to \( 0 \), so by the alternating series test \( \sum (-1)^n a_n(x) \) converges, and by the alternating-series remainder estimate, \[ \left| \sum_{n=N+1}^{\infty} \frac{(-1)^n}{n+x} \right| \le a_{N+1}(x) = \frac{1}{N+1+x} \le \frac{1}{N+1} . \] The bound \( \frac{1}{N+1} \) is independent of \( x \) and tends to \( 0 \), so \( \sup_{x \ge 0} |f(x) - S_N(x)| \le \frac{1}{N+1} \to 0 \): the convergence is uniform on \( [0, \infty) \). (b) For fixed \( x \ge 0 \), \( \sum_{n=1}^{\infty} |f_n(x)| = \sum_{n=1}^{\infty} \frac{1}{n+x} \) diverges by limit comparison with the harmonic series ( \( \frac{1/(n+x)}{1/n} \to 1 \) ). So the convergence is conditional at every point. (c) Suppose \( |f_n(x)| \le M_n \) for all \( x \ge 0 \). Taking \( x = 0 \) gives \( M_n \ge \frac{1}{n} \), whence \( \sum M_n \ge \sum \frac{1}{n} = \infty \). No summable dominating sequence exists. Conclusion: uniform convergence on \( E \) neither implies absolute convergence nor the existence of summable dominants; the implication in the M-test is strictly one-way. (Positive counterpart: for alternating-type series, Dirichlet's uniform test and Abel's uniform test are the correct tools.) \( \blacksquare \)