Learn

Learning preferences

Make learning more comfortable. Changes apply immediately.

Enlarges page content, including diagrams and their labels. You can also use your browser’s zoom.

Choose the colours that are easiest for you to distinguish. Applies to lesson diagrams and lab plots. Labels, shapes, hatching and line patterns also distinguish meanings. Source photographs and raw image brightness stay unchanged; mask-only views are available for image overlays.

ExampleComparisonSample link

Saved in this browser on this device. Preferences are separate from progress backups.

Lesson 6 of 20

Function series and the Weierstrass M-test

Dominate every pointwise tail by one convergent numerical series.

Loading your saved responses…

Try the optional starting-point checks and targeted refreshers. You can continue directly into this lesson.

Try

A function series is a sequence of partial-sum functions. For Σ from k=1 of sin(kx)/2^k, every term oscillates, but its amplitude is at most 2^(−k). The total remaining amplitude after N terms is bounded by the numerical geometric tail 2^(−N), independently of x. This is the essential mechanism of the Weierstrass M-test: replace spatially varying terms by one summable list of nonnegative bounds.

Predict

Predict whether cancellation is needed in this example. It is not. Even replacing every sine value by its largest possible absolute magnitude leaves a convergent numerical series. The resulting estimate is conservative but uniform. A series that relies on cancellation may still converge uniformly, yet the M-test might not prove it. Sufficient tests should not be turned into necessary conditions.

Experiment

Record the uniform tail enclosure.

Last retained index NNumerical majorant tailGuaranteed absolute function tail
11/2At most 1/2
41/16At most 1/16
N2^(−N)At most 2^(−N)

The bound controls the full infinite tail after convergence is established. First prove the corresponding estimate for every finite tail, then use the uniform Cauchy criterion. Writing an infinite-tail inequality before existence is known can conceal that logical step.

Understand

Suppose |f_k(x)|≤M_k for every x∈D, where M_k≥0 and ΣM_k converges. For m>n, the finite tail satisfies |Σ from k=n+1 to m f_k(x)|≤Σ from k=n+1 to m M_k. The numerical Cauchy criterion makes the right side arbitrarily small beyond a cutoff independent of x. Hence the partial-sum functions are uniformly Cauchy and have a uniform limit. The same bound shows absolute pointwise convergence.

If every term is continuous, every finite partial sum is continuous and the uniform-limit theorem makes the sum continuous. On a fixed compact interval, termwise integration follows from uniform convergence of partial sums. These are consequences requiring their own preservation theorems; the M-test itself establishes convergence, not every conceivable operation on the sum.

Apply

Termwise differentiation requires a different bound. For C¹ terms, convergence of the scalar series at one anchor and uniform convergence of the derivative series allow the derivative-interchange theorem to be applied to partial sums. Uniform convergence of the original series alone is not sufficient. For a series involving sin(kx), differentiation introduces a factor k, so a majorant that worked before differentiation may cease to be summable.

Repair “the M-test fails, therefore the series diverges.” Constant functions f_k(x)=(−1)^(k+1)/k give a uniformly convergent series on any nonempty domain, because its scalar alternating remainder is independent of x. But the series of supremum norms is harmonic and diverges. Cancellation proves convergence here, while absolute norm summability is absent.

Continue

Optional depth treats absolutely summable function series as a series in the complete normed space of bounded functions. The estimate Σ||f_k||∞<∞ is exactly the M-test expressed using a norm. It provides robust control under rearrangement because numerical absolute tails bound any omitted collection of indices.

Save a term bound, a finite-tail estimate and the theorem used to preserve continuity or integration as three separate steps. Next, power series will supply particularly useful majorants: strictly inside their convergence radius, geometric decay dominates the polynomial factors introduced by differentiation.

Apply · explain · revise

Practice and reasoning

Drafts save locally as you type. Reveal worked solutions when useful; the site remembers that exposure. Automatic matches check the requested answer, while written arguments require review against the rubric.

For |f_k(x)|≤2^(−k), k≥1, find the bound on the tail after k=3.

Integers, fractions and finite decimals are accepted. Expressions such as sqrt(2) are not parsed by this checker.

Failure to find a summable M_k bound proves a function series is not uniformly convergent:

Your response

Prove the Weierstrass M-test.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Show Σ from k=1 of sin(kx)/k² is continuous on R.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Give a uniformly convergent function series whose terms have nonsummable supremum norms.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

State sufficient hypotheses for differentiating a series of C¹ functions on [a,b] and justify them.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Reflect and continue

Before marking this lesson complete, explain one key idea without the worked solution and identify a condition that matters. Marking complete records participation, not independent mastery.