User Tools

Site Tools


math105-s22:notes:lecture_18

Lecture 18

video

\gdef\pa{\partial}

Last time we have given the definition what it means for a map f:URmf: U \to \R^m where URnU \In \R^n to be differentiable at a point pp, and we proved a bunch of nice properties about (Df)p(Df)_p, like linear dependence on ff, chain rules etc.

Higher Derivatives

  • definition of higher order derivatives. CrC^r class means rr-th derivative exists and it is continuous.
  • skip thm 15
  • thm 16: 2nd order derivatives is symmetric. ijf=jif\pa_i \pa_j f = \pa_j \pa_i f. (of course, you say,…., but why?)

Contraction principle

If XX is complete and f:XXf: X \to X is a contraction, namely, there is 0c<10\leq c<1, such that d(f(x),f(y))<cd(x,y)d(f(x), f(y)) < c d(x,y), then ff has a unique fixed point pp. and iterates of ff with any starting point tends to pp.

Implicit function theorem

Let f:URmf: U \to \R^m be a CrC^r function, where URn×RmU \In \R^n \times \R^m. If for any (x0,y0)U(x_0,y_0) \in U, the B=f(x0,y)/yB = \pa f(x_0,y)/\pa y is invertible, then near (x0,y0)(x_0, y_0), the level set {(x,y):f(x,y)=f(x0,y0)}\{(x,y): f(x,y) = f(x_0, y_0)\} is the graph of a function g(x)g(x) from a neighborhood of x0x_0 to a neighorbhood of y0y_0.

Take linear approximation of ff near (x0,y0)(x_0, y_0), then define g(x)g(x) as solution to some equation. Find solution by contraction principle. Need to show g(x)g(x) is differentiable at x0x_0(hard). Then, same argument shows g(x)g(x) is differentiable on the level set near x0x_0. We get explicit expression about (Dg)p(Dg)_p. Finally, upgrade the regularity of (Dg)p(Dg)_p to Cr1C^{r-1}.

math105-s22/notes/lecture_18.txt · Last modified: 2022/03/17 22:17 by pzhou