Skip to content

Uniform Norm

Definition

On a nonempty set XX, the uniform norm ∥f∥∞\|f\|_\infty of a bounded function f ⁣:X→Rf\colon X\to\mathbb{R} is defined as:

∥f∥∞=sup⁡x∈X∣f(x)∣.\|f\|_\infty = \sup_{x \in X} |f(x)|.

Interpretation

The uniform norm measures the size of a bounded function by its worst case: the supremum of the absolute value ∣f(x)∣|f(x)| over the whole set XX. Applied to a difference, ∥f−g∥∞\|f-g\|_\infty is the largest vertical gap between the graphs of ff and gg, and it serves as the distance between the two functions.

Two functions f and g with horizontal lines at the maximum absolute value of f, and a vertical arrow at the place where the gap between f and g is largest.

The dashed lines in the figure are at ±∥f∥∞\pm\|f\|_\infty, and the dot marks where ∣f∣|f| reaches its supremum. The green arrow marks where the vertical gap between ff and gg is largest; its length is ∥f−g∥∞\|f-g\|_\infty. That gap is longer than ∥f∥∞\|f\|_\infty itself, because gg is negative where ff is large, so the norm of a difference cannot be read off from the norms of ff and gg alone.

The red segment marks the largest gap between fnf_n and ff: that is ∥fn−f∥∞\|f_n-f\|_\infty. Uniform convergence means it tends to 00.

Boundedness of ff makes the supremum finite. The supremum need not be attained: for f(x)=e−xf(x)=\mathrm{e}^{-x} on (0,+∞)(0,+\infty) in the Examples, ∥f∥∞=1\|f\|_\infty=1 while ∣f(x)∣<1|f(x)|<1 everywhere. It behaves like a length on the bounded functions: ∥f∥∞=0\|f\|_\infty=0 only for the zero function, ∥λf∥∞=∣λ∣ ∥f∥∞\|\lambda f\|_\infty=|\lambda|\,\|f\|_\infty, and the triangle inequality ∥f+g∥∞≤∥f∥∞+∥g∥∞\|f+g\|_\infty\le\|f\|_\infty+\|g\|_\infty holds because ∣f(x)+g(x)∣≤∥f∥∞+∥g∥∞|f(x)+g(x)|\le\|f\|_\infty+\|g\|_\infty for every xx.

The norm turns uniform convergence into convergence of numbers, as in the Key Results. It also appears in normal convergence, in the Weierstrass MM-test and in the Weierstrass approximation theorem.

A common slip is to confuse ∥fn−f∥∞→0\|f_n-f\|_\infty\to0 with fn(x)→f(x)f_n(x)\to f(x) at every xx. On [0,1)[0,1) the functions xnx^n tend to 00 at every point, yet ∥xn∥∞=1\|x^n\|_\infty=1 for every nn.

These three properties return later as the definition of a norm; for vectors in Rn\mathbb{R}^n the same recipe gives the maximum norm.


Key Results

  • A sequence of functions (fn)n=1∞(f_n)_{n=1}^\infty converges uniformly to a function ff on XX if and only if:
lim⁡n→∞∥fn−f∥∞=0.\lim_{n \to \infty} \|f_n - f\|_\infty = 0.
  • For possibly unbounded functions, the same supremum of the error ∣fn−f∣|f_n-f| may be +∞+\infty; it is an extended error measure rather than a norm on the space of all functions. Uniform convergence means these errors eventually become finite and tend to zero.

Examples

  • For the function f ⁣:(0,+∞)→Rf\colon (0,+\infty) \to \mathbb{R} defined by f(x)=e−xf(x) = \mathrm{e}^{-x}, we have ∥f∥∞=1.\|f\|_\infty = 1.
  • For the function g ⁣:R→Rg\colon \mathbb{R} \to \mathbb{R} defined by g(x)=sin⁡xg(x) = \sin x, we have ∥g∥∞=1.\|g\|_\infty = 1.

Prerequisites

Sources

Aliases: sup norm, supremum norm Keywords: infinity norm, Chebyshev norm Symbols: element of, infinity, lambda, real numbers

Last updated: 20 October 2026 03:02