Math 2.0

definition

Series of functions

Definition

Let SS be a set and let fn ⁣:S→Rf_n \colon S \to \mathbb{R} for n≥0n \ge 0. The series of functions ∑n=0∞fn\sum_{n=0}^{\infty} f_n is the sequence of partial sums sN=∑n=0Nfns_N = \sum_{n=0}^{N} f_n. The series converges pointwise, or uniformly, on SS if the sequence (sN)(s_N) converges pointwise, or uniformly, on SS. The limit is the sum ∑n=0∞fn(x)\sum_{n=0}^{\infty} f_n(x).

Remarks

Power series and Fourier series are series of functions. The Weierstrass M-test is the main tool to prove uniform convergence. By the uniform limit theorem, a uniformly convergent series of continuous functions has a continuous sum.

Explanations

L1 human

A series of functions adds infinitely many functions, point by point. At each xx it is an ordinary series of numbers.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 7 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Sequence definition
  2. Real sequence definition
  3. Limit of a sequence definition
  4. Series definition
  5. Pointwise convergence definition
  6. Uniform convergence definition
  7. Series of functions definition

What depends on this

33 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Function_series, Convergence