Math 2.0

Sequences, series, summability Definition

Uniform convergence on a set

Builds on Uniform convergence

Definition

Let DD be a set, let fn ⁣:D→ℝf_n \colon D \to \mathbb{R} for n≥1n \ge 1 and f ⁣:D→ℝf \colon D \to \mathbb{R} be functions, and let S⊆DS \subseteq D. The sequence (fn)(f_n) converges uniformly to ff on SS if for every ε>0\varepsilon > 0 there is NN with ∣fn(x)−f(x)∣<ε|f_n(x) - f(x)| < \varepsilon for all n≥Nn \ge N and all x∈Sx \in S.

Remarks

This is uniform convergence of the restrictions of fnf_n and ff to SS. A sequence can converge uniformly on each [0,r][0, r] with r<1r < 1, but not on [0,1)[0, 1). The sequence xnx^n is an example. Mathlib defines it as TendstoUniformlyOn.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Sequence definition
  2. Real sequence definition
  3. Limit of a sequence definition
  4. Pointwise convergence definition
  5. Uniform convergence definition
  6. Uniform convergence on a set definition

Where this leads

56 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Uniform_convergence, Definition
About this page
Tag08HJRTG5N7
URIm2://08HJRTG5N7
Kinddefinition
WritingW0 stub
MSC40A30
DefinesUniform convergence on a set
UsesUniform convergence

Markdown · JSON · Edit on GitHub

What this page 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 page is. They do not measure its truth.

What links here

Used by