User Tools

Site Tools


math104-s22:notes:start

Lecture Notes

note

2022/03/30 17:05 · pzhou

note .

2022/03/30 17:04 · pzhou

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
2022/03/16 21:49 · pzhou

Lecture 17

Continuous Maps and Compactness, Connectedness

Prop: If f:XYf: X \to Y is continuous, and KXK \In X is compact, then f(K)f(K) is compact.
Proof: any open cover of f(K)f(K) can be pulled back to be an open cover of KK, then we can pick a finite subcover in the domain, and the corresponding cover in the target forms a cover of f(K)f(K).

We can also prove using sequential compactness. To see any sequence in f(K)f(K) subconverge, we can lift that sequence back to KK, find a convergent subsequence, and push them back to f(K)f(K).

Lemma: if f:XYf: X \to Y is continuous, then for any EXE \In X, fE:EYf|_E: E \to Y is continuous.

Lemma: if f:XYf: X \to Y is continuous, then f:Xf(X)f: X \to f(X) is continuous.

Prop: If f:XYf: X \to Y is continuous, and KXK \In X is connected, then f(K)f(K) is connected.
Pf: first, note that map f:Kf(K)f: K \to f(K) is also continuous. If f(K)f(K) is the disjoint union of two non-empty open subsets, f(K)=UVf(K) = U \cap V, then K=f1(U)f1(V)K = f^{-1}(U) \cap f^{-1}(V) the disjoint union of two non-empty open subsets of KK.

Intermediate value theorem: if [a,b]R[a,b] \In \R, and f:RRf: \R \to \R is continuous, then f([a,b])f([a,b]) is also a closed interval.
Proof: since [a,b][a,b] is compact, hence f([a,b])f([a,b]) is compact, hence closed. Since [a,b][a,b] is connected, hence f([a,b])f([a,b]) is connected, hence an interval, a closed interval.

Uniform Continuity

We say a function f:XYf: X \to Y is uniformly continuous, if for any ϵ>0\epsilon >0, there exists δ>0\delta > 0, such that for any pair x1,x2Xx_1, x_2 \in X with d(x1,x2)<δd(x_1, x_2)<\delta, we have d(f(x1),f(x2))<ϵd(f(x_1), f(x_2))< \epsilon.

For example, the function f:(0,1)Rf: (0, 1) \to \R f(x)=1/xf(x) =1 /x is continuous but not uniformly continuous.

Theorem: if f:XYf: X \to Y is continuous, and XX is compact, then ff is uniformly continuous.

Proof: Fix ϵ>0\epsilon>0. For each xXx \in X, let rx>0r_x > 0 be small enough such that f(B2rx(x))Bϵ/2(f(x))f(B_{2r_x}(x)) \In B_{\epsilon/2}(f(x)). Let Bx=Brx(x)B_x = B_{r_x}(x). The, {Bx:xX}\{B_x: x \in X\} forms an open cover of XX. Pass to finite subcover, X=i=1NBxiX = \cup_{i=1}^N B_{x_i}. Then let δ=min{rxi}\delta = \min \{r_{x_i}\}. Then, suppose xx and xx' has distance less than δ\delta, then xx is contained in some Brxi(xi)B_{r_{x_i}}(x_i), and xB2rxi(xi)x' \in B_{2 r_{x_i}}(x_i), thus f(x),f(x)Bϵ/2(f(xi))f(x), f(x') \in B_{\epsilon/2}(f(x_i)), thus f(x)f(x) and f(x)f(x') has distance less than ϵ\epsilon.

Discontinuity

Now we will leave the safe world of continuous functions. We consider more subtle cases of maps.

Def: Let f:XYf: X \to Y be any map, and let xXx \in X be a point, we say ff is continuous at xx, if for any ϵ>0\epsilon>0, there exists δ>0\delta>0, such that f(Bδ(x))Bϵ(f(x))f(B_\delta(x)) \In B_\epsilon(f(x)).

Def: Let EXE \In X and f:EYf: E \to Y. Suppose xEˉx \in \bar E. We say limpxf(p)=y\lim_{p \to x} f(p) = y if for any convergent sequence pnxp_n \to x with pnEp_n \in E, we have f(pn)yf(p_n) \to y.

note that xx may not be in EE.

Prop: f:XYf: X \to Y is continuous at xXx \in X, if and only if limpxf(p)=f(x)\lim_{p \to x} f(p) = f(x).

If f:(a,b)Rf: (a,b) \to \R is a function, and ff is not continuous at some x(a,b)x \in (a,b), then

  • if limtxf(t)\lim_{t \to x-} f(t) and limtx+f(t)\lim_{t \to x+} f(t) both exists, but does not equal to f(x)f(x), we say this is a simple discontinuity, or first kind discontinuity
  • otherwise, it is called a second kind.

Sequences of functions

2022/03/14 23:05 · pzhou

Lecture 16

connectedness

Last time we didn't introduce the notion of a connected space. Let's do it now.

Sometimes, we can tell from a glance, whether a space is connected or not: the interval [0,1][0,1] is connected, the set {1,2,3}\{1,2,3\} (with induced topology from R\R) is not (there are gaps between points). But, we also know that topological space can be weird.

Ex: let X={1,2,3,}X = \{1,2,3,\cdots \} be a set, we declare the following subsets in XX are open:

  • \emptyset and XX,
  • {1,2,,n}\{1,2,\cdots, n\}, for some n1n \geq 1.

One can easily check that this collection of open sets are closed under arbitrary union and finite intersections. Hmm, is it connected? What does it mean when we ask this question?

Here is the general definition:

We say a metric space XX is connected, if XX cannot be written as disjoint union of two non-emtpy open subset. In other word, the only subsets in XX that is both open and closed are XX and \emptyset.

For example, Q\Q is not connected, since (,5)(-\infty, \sqrt{5}) is both open and closed in QQ. (why?)

For example, X={1,2,3}X=\{1,2,3\} (with induced metric from R\R) is not connected, since {1}\{1\} is both open and closed in XX. (Discussion: Equip XX with the induced metric, can you show that {1}\{1\} is both open and closed? Equip XX with the induced topology, can you show that {1}\{1\} is both open and closed? )

For example, in that weird topology example above, XX is connected, since XX cannot be written as disjoint union of two open sets.

Theorem: a subset ERE \In \R is connected, if and only if, for any x,yEx,y \in E, we have [x,y]E[x,y] \In E. Proof: suppose EE is connected, and x,yEx,y \in E, we need to show that [x,y]E[x,y] \In E. If not, say z(x,y)z \in (x,y) is not in EE, then let E1=E(,z)E_1 = E \cap (-\infty,z), E2=E(z,+)E_2 = E \cap (z,+\infty), they are open subsets of EE (since they are open subsets of R\R intersecting EE), they are non-empty (containing xx and yy respectively), and E=E1E2E = E_1 \sqcup E_2, therefore EE is not connected. Contradiction.

Suppose for any x,yEx,y \in E, we have [x,y]E[x,y] \In E, and suppose EE is not connected. Then EE can be written as disjoint union of two non-empty open sets E=ABE = A \sqcup B, where A,BA, B open in EE. Pick xAx \in A and yBy \in B, w.l.o.g, assuming x<yx<y. By hypothesis, [x,y]E[x,y] \In E. Let A=A[x,y]A' = A \cap [x,y] and B=B[x,y]B' = B \cap [x,y]. Then [x,y]=AB[x,y] = A' \cup B', and A,BA', B' are open in [x,y][x,y], and xAx \in A', yBy \in B'. Let z=supAz = \sup A'. We discuss the following cases:

  • if z=xz=x, then A={x}A' = \{x\}, and AA' cannot be an open subset of [x,y][x,y]
  • If x<z<yx< z < y, we split into two case:
    • (a) if zAz \in A', then AA' is not an open subset of [x,y][x,y] at point zz.
    • (b) if zBz \in B', then BB' is not an open subset of [x,y][x,y] at zz.
  • if z=yz = y, then zBz \in B', we claim that BB' is not open in [x,y][x,y].

Thus, we get a contradiction.


Remark: Rudin uses a seeming different definition of connectedness, but it is equivalent. We say two subsets A,BA, B are 'separated', if AˉB=\bar A \cap B = \emptyset and ABˉ=A \cap \bar B = \emptyset. It is possible for two sets to be disjoint, but not separated, like A=(0,1),B=[1,2)A = (0,1), B=[1,2).

Prop: A subset EXE \In X is connected \Leftrightarrow if EE cannot be written as the union of two non-empty separated sets.

Proof: \Rightarrow Suppose EXE \In X is connected, and E=GHE = G \sqcup H with G,HG, H non-empty separated subsets in XX. Then, GˉE=Gˉ(GH)=(GˉG)(GˉH)=G=G \bar G \cap E = \bar G \cap (G \sqcup H) = (\bar G \cap G) \sqcup (\bar G \cap H) = G \sqcup \emptyset = G , hence GG is closed in EE. Similarly, HH is closed in EE. That means the complement of GG in EE, ie. HH is open, similarly, GG is open. Thus, E=GHE = G \sqcup H writes EE as disjoint union of two non-emptyset open subsets of EE, contradicting with EE being connected.

\Leftarrow: suppose EE is not connected, thus E=GHE = G \sqcup H with G,HG, H open in EE (hence both G,HG, H are closed in EE, since G=E\HG = E \RM H, H=E\GH = E\RM G). Let GXG' \In X be a closed subset, such that GE=GG' \cap E = G, then GH=G' \cap H = \emptyset. In particular, GˉG\bar G \In G', hence GˉH=\bar G \cap H = \emptyset. Similarly HˉG=\bar H \cap G=\emptyset, thus G,HG,H are separated.

2022/03/09 23:37 · pzhou
math104-s22/notes/start.txt · Last modified: 2022/01/19 09:26 by pzhou