User Tools

Site Tools


math104-s22:notes:lecture_18

Lecture 18: Sequence of functions

“How to measure the distance between two functions?”

Sequence of functions

Just as you can have a sequence

  • of number in R\R
  • of vectors in Rn\R^n
  • of points in a general metric space XX.

You can have a sequence of functions. fn(x)f_n(x)

The space of functions

Let V={f:f:[0,1]R}V = \{f: f: [0,1] \to \R\} be the space of bounded functions from [0,1][0,1] to R\R, we will consider various ways to measure size of a function

  • sup norm: f=sup{f(x):x[0,1]} \| f \|_\infty = \sup \{ f(x) : x \in [0,1]\}
  • L1L^1 norm f1=f(x)dx \| f\|_1 = \int |f(x)| dx
  • L2L^2 norm f2=(f(x)2dx)1/2 \| f\|_2 = (\int |f(x)|^2 dx)^{1/2}
  • in general, for 1p<1 \leq p < \infty, we have LpL^p norm.

The different norms equip the vector space VV with different topologies. This is different from the finite dimensional vector space case.

In sport, sometimes you measure the score using the best score (like freestyle skiing in the winter Olympics); sometimes you use the average score of several try (like Tour de France, you add up the points in each leg); this is like sup or L1L^1 norm.

In this class, we will consider sup norm, and we define distance as d(f,g)=fg d_\infty(f,g) = \| f-g\|_\infty

We say a sequence of functions fnf_n converge to ff uniformly, if limnd(f,f)=0\lim_n d_\infty(f_\infty, f) = 0.

Q: can you find a metric on the space of functions VV so that metric convergence means pointwise convergence? (No, you but you can still define a topology on VV so that convergence in that topology means pointwise convergence)

In general, if M={ff:XY,f(X)bounded}M = \{f| f: X \to Y, f(X) \text{bounded}\} is the space of maps with bounded images, then for any f,gMf, g \in M, we can define d(f,g)=supxd(f(x),g(x))d_\infty(f,g) = \sup_{x} d_\infty(f(x), g(x)).

Pointwise Convergence vs Uniform Convergence

  • The running bump fn=1[n,n+1](x)f_n = 1_{[n,n+1]}(x), which is 1 on [n,n+1][n,n+1] and 00 elsewhere. They converge to 00 pointwise, but not uniformly.
  • The shrinking and rising bump fn=n1(0,1/n)f_n = n 1_{(0,1/n)} converge to 00 pointwise, but not uniformly.

Uniform Convergence Preserves Continuity

Thm: If fn:RRf_n: \R \to \R are continuous and bounded, and fnff_n \to f uniformly, then ff is continuous.

Proof: we need to show that, for any xRx \in \R, for any ϵ>0\epsilon>0, there is δ>0\delta > 0, such that for any xx' with xx<δ|x' - x| < \delta, we have f(x)f(x)<ϵ|f(x') - f(x)|<\epsilon.

First, we choose nn large enough, such that d(fn,f)<ϵ/3d_\infty(f_n, f) < \epsilon/3. Then, for fnf_n and xx and ϵ/3\epsilon/3, we find δ\delta, such that any xx<δ|x'-x|<\delta implies fn(x)fn(x)<ϵ/3|f_n(x) - f_n(x')|<\epsilon/3. Finally, if any xx<δ|x'-x|<\delta, then f(x)f(x)f(x)fn(x)+fn(x)fn(x)+fn(x)fn(x)<ϵ/3+ϵ/3+ϵ/3=ϵ. |f(x) - f(x')| \leq |f(x) - f_n(x)| + |f_n(x) - f_n(x')| + |f_n(x') - f_n(x)| < \epsilon/3 + \epsilon/3 + \epsilon/3 = \epsilon. Done

Examples

  • Devil's staircase
  • power series
  • Weierstrass M-test
math104-s22/notes/lecture_18.txt · Last modified: 2022/03/16 22:37 by pzhou