Math 2.0

definition

Uniform convergence on a set

Definition

Let DD be a set, let fn ⁣:D→Rf_n \colon D \to \mathbb{R} for n≥1n \ge 1 and f ⁣:D→Rf \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.

Explanations

L1 human

We often get uniform convergence only on part of the domain. This definition measures the distance between fnf_n and ff only on that part.

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 6 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. Pointwise convergence definition
  5. Uniform convergence definition
  6. Uniform convergence on a set definition

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Uniform_convergence, Definition