Math 2.0

example

Uniform metric on bounded functions

Example

Let SS be a nonempty set. Let B(S)B(S) be the set of bounded functions f ⁣:S→Rf \colon S \to \mathbb{R}, that is, the functions for which there is a real MM with ∣f(s)∣≤M|f(s)| \le M for all s∈Ss \in S. For f,g∈B(S)f, g \in B(S), let d∞(f,g)=sup⁡s∈S∣f(s)−g(s)∣.d_\infty(f, g) = \sup_{s \in S} |f(s) - g(s)|. Then d∞d_\infty is a metric on B(S)B(S), the uniform metric.

Remarks

The supremum is finite, because ∣f(s)−g(s)∣≤∣f(s)∣+∣g(s)∣|f(s) - g(s)| \le |f(s)| + |g(s)| and both functions are bounded. A sequence (fk)(f_k) converges to ff in this metric if and only if fk→ff_k \to f uniformly on SS. For S={1,…,n}S = \{1, \ldots, n\}, it is the sup metric on R^n. It is d∞(f,g)=∥f−g∥∞d_\infty(f, g) = \|f - g\|_\infty for the sup norm.

Explanations

L1 human

Two functions are close in the uniform metric when their graphs are close at every point at the same time. For example, on [0,1][0, 1] the distance between f(x)=xf(x) = x and g(x)=x2g(x) = x^2 is 1/41/4, the largest gap, at x=1/2x = 1/2.

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 depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Uniform_norm, Uniform metric