Derivatives
If (X,|−|) is a metric space and f:X→X with |f(x)−f(y)|≤c|x−y| for some c<1,∀x,y∈X, then f is a contraction. If X is complete, then f has a unique fixed point x0 such that f(x0)=x0.
proof (?):
Uniqueness: if x,y are two fixed points, then 0≤|x−y|=|f(x)−f(y)|≤c|x−y|≤|x−y|, forcing |x−y|=0
Existence: Define a sequence by picking x0 arbitrarily and setting xk\coloneqqf(xk−1). Then |xk+1−xk|=|f(xk)−f(xk−1)|≤c|xk−xk−1|, so inductively |xk+1−xk|≤ck|x1−x0|. The claim is that this makes {xk} a Cauchy sequence, this follows from the fact that if n<m then |xn−xm|≤∑n+1≤k≤m|xk−xk−1|≤∑n≤k≤m−1ck|x1−x0|≤cn|x1−x01−c|→0.
Implicit Function Theorem
Suppose f∈C1(Rn+m,Rn), that f(a,b)=0, and the derivative Df(a,b) at (a,b) is an invertible linear map. Then there exists a neighborhood U⊆Rn containing a and a unique g∈C1(U,Rm) such that g(a)=b and f(a,g(a))=0 for all x∈U.
A relation is locally the graph of a function wherever the derivative is nonsingular.
Inverse Function Theorem
For f∈C1(R;R) with f′(a)≠0, then f is invertible in a neighborhood U∋a, g\coloneqqf−1∈C1(U;R), and at b\coloneqqf(a) the derivative of g is given by g′(b)=1f′(a). For F∈C1(Rn,Rn) with Df invertible in a neighborhood of a, so det(Jf)≠0, then setting b\coloneqqF(a), JF−1(q)=\qtyJF(p)−1.
The version for holomorphic functions: if f∈Hol(C;C) with f′(p)≠0 then there is a neighborhood V∋p with that f∈BiHol(V,f(V)).
A C1 function is invertible in any neighborhood in which its derivative f′ is invertible.
Recall that absolutely convergent implies convergent, but not conversely: ∑k−1=∞ but ∑(−1)kk−1<∞. This converges because the even (odd) partial sums are monotone increasing/decreasing respectively and in (0,1), so they converge to a finite number. Their difference converges to 0, and their common limit is the limit of the sum.
Integrals
Green’s Theorem
If Ω⊆C is bounded with ∂Ω piecewise smooth and f,g∈C1(¯Ω), then ∫∂Ωfdx+gdy=∬Ω\qty∂g∂x−∂f∂ydA. In vector form, ∫γF⋅dr=∬RcurlFdA. As a consequence, areas can be computed as μ(Ω)=12∮∂Ω\qtyydx−xdy=∮∂Ωxdy=−∮∂Ωydx.
In general, μ(Ω)=∫Ω|f′(z)|dz.
Some basic facts needed for line integrals in the plane:
- Green’s theorem requires C1 partial derivatives.
-
gradf=[∂f∂x,∂f∂y].
- If F=gradf for some f, F is a vector field.
- Given f(x,y) and γ(t), the chain rule yields ∂∂t(f∘γ)(t)=⟨gradf∘γ)(t), γ′(t)⟩.
- For F(x,y)=[M(x,y),N(x,y)], curlF=∂N∂x−∂M∂y and DivF=∂M∂x+∂N∂y.
- ∫γF⋅dr=∫baF(γ(t))⋅γ′(t)dt.
Stokes Theorem
Suppose ω\coloneqqf(z)dz is a differential 1-form on an orientable manifold Ω, then ∫∂Ωω=∫Ωdωi.e.∫∂Ωf(z)dz=∫Ωd(f(z)dz)
Series and Sequences
- For every root ri of multiplicity 1, include a term A/(x−ri).
- For any factors g(x) of multiplicity k, include terms A1/g(x),A2/g(x)2,⋯,Ak/g(x)k.
- For irreducible quadratic factors hi(x), include terms of the form Ax+Bhi(x).
A series of functions ∑∞n=1fn(x) converges uniformly iff lim
If \left\{{f_n}\right\} with f_n: \Omega \to {\mathbb{C}} and there exists a sequence \left\{{M_n}\right\} with {\left\lVert {f_n} \right\rVert}_\infty \leq M_n and \sum_{n\in {\mathbb{N}}} M_n < \infty, then f(x) \coloneqq\sum_{n\in {\mathbb{N}}} f_n(x) converges absolutely and uniformly on \Omega. Moreover, if the f_n are continuous, by the uniform limit theorem, f is again continuous.
Note that if a power series converges uniformly, then summing commutes with integrating or differentiating.
Consider \sum c_k z^k, set R = \lim {\left\lvert {c_{k+1} \over c_k} \right\rvert}, and recall the ratio test:
- R\in (0, 1) \implies convergence.
- R\in (1, \infty] \implies divergence.
- R=1 yields no information.
For f(z) = \sum_{k\in {\mathbb{N}}} c_k z^k, defining \begin{align*} {1\over R} \coloneqq\limsup_{k} {\left\lvert {a_k} \right\rvert}^{1\over k} ,\end{align*} then f converges absolutely and uniformly for D_R \coloneqq{\left\lvert {z} \right\rvert} < R and diverges for {\left\lvert {z} \right\rvert} > R. So the radius of convergence is given by \begin{align*} R = {1\over \limsup_n {\left\lvert {a_n} \right\rvert}^{1\over n}} .\end{align*}
Moreover f is holomorphic in D_R, can be differentiated term-by-term, and f' = \sum_{k\in {\mathbb{N}}} n c_k z^k.
Recall the p{\hbox{-}}test: \begin{align*} \sum n^{-p} < \infty \iff p \in (1, \infty) .\end{align*}
Function Convergence
A sequence of functions f_n is said to converge locally uniformly on \Omega \subseteq {\mathbb{C}} iff f_n\to f uniformly on every compact subset K \subseteq \Omega.
Exercises
Compute \int_\Gamma \Re(z) \,dz for \Gamma the unit square.
solution:
Write \Gamma = \sum_{1\leq k \leq 4}\gamma_k, starting at zero and traversing clockwise:
Compute:
- \gamma_1: parameterize to get \int_0^1t1\,dt= 1/2.
- \gamma_2: \int_0^1 i \,dt= i
- \gamma_2: -\int_0^1 (1-t)\,dt= -1/2
- \gamma_2: - \int_0^1 0 \,dt= 0
So \int_\Gamma \Re(z) \,dz= i.
Show that if f is a differentiable contraction, f is uniformly continuous.
Show that a continuous function on a compact set is uniformly continuous.
Show that a uniform limit of continuous functions is continuous, and a uniform limit of uniformly continuous functions is uniformly continuous. Show that this is not true if uniform convergence is weakened to pointwise convergence.
solution:
Suppose {\left\lVert {f_n - f} \right\rVert}_\infty\to 0, fix {\varepsilon}, we then need to produce a \delta so that \begin{align*} {\left\lvert {z-w} \right\rvert}\leq \delta \implies {\left\lvert {f(z) - f(w) } \right\rvert} < {\varepsilon} .\end{align*}
Write \begin{align*} {\left\lvert {f(z) - f(w)} \right\rvert} \leq {\left\lvert {f(z) - f_n(z)} \right\rvert} + {\left\lvert {f_n(z) - f_n(w)} \right\rvert} + {\left\lvert {f_n(w) - f(w)} \right\rvert} .\end{align*}
- Bound the first term by {\varepsilon}/3 using that f_n\to f
- Bound the second term by {\varepsilon}/3 using that f_n is continuous
- Bound the third term by {\varepsilon}/3 using that f_n\to f
- Pick \delta to be the minimum \delta supplied by these three bounds.
Why uniform convergence is necessary: need these bounds to holds for all z, w where {\left\lvert {z-w} \right\rvert} < \delta. Why pointwise convergence doesn’t work: f_n(z) \coloneqq z^n \overset{n\to\infty}\longrightarrow\chi_{z=1}
For uniform continuity: take \sup_{z, w} on both sides: \begin{align*} \sup_{z, w} {\left\lvert {f(z) - f(w)} \right\rvert} &\leq \sup_{z} {\left\lvert {f(z) - f_n(z)} \right\rvert} + \sup_{z, w} {\left\lvert {f_n(z) - f_n(w)} \right\rvert} + \sup_{w} {\left\lvert {f_n(w) - f(w)} \right\rvert} \\ &\leq {\left\lVert {f - f_n} \right\rVert}_\infty + \sup_{z, w} {\left\lvert {f_n(z) - f_n(w)} \right\rvert} + {\left\lVert {f-f_n} \right\rVert}_\infty ,\end{align*} where now the middle term is bounded by uniform continuity of f_n.
Determine where the following real-valued function is or is not uniformly convergent: \begin{align*} f_n(x) \coloneqq{\sin(nx)\over 1+nx} .\end{align*}
solution:
This converges uniformly on [a, \infty) for a any constant: \begin{align*} {\left\lvert {\sin(nx) \over 1+nx} \right\rvert} \leq {1\over 1 + na} < {\varepsilon}= {\varepsilon}(n, a) .\end{align*}
This does not converge uniformly on (0, \infty): \begin{align*} x_n \coloneqq{1\over n} \implies {\left\lvert {f_n(x_n)} \right\rvert} = {\left\lvert {\sin(1) \over 2} \right\rvert} > {\varepsilon} .\end{align*}
Show that \sum_{k\geq 0}z^k/k! converges locally uniformly to e^z.
solution:
Apply the M{\hbox{-}}test on a compact set K with z\in K \implies {\left\lvert {z} \right\rvert} \leq M: \begin{align*} {\left\lVert {e^z - \sum_{0\leq k \leq n} z^k/k!} \right\rVert}_\infty &= {\left\lVert {\sum_{k\geq n+1}z^k/k! } \right\rVert}_{\infty} \\ &\leq \sum_{k\geq n+1} {\left\lVert {z} \right\rVert}_\infty^k /k! \\ &\leq \sum_{k\geq 0} {\left\lVert {z} \right\rVert}_\infty^k /k! \\ &= e^{{\left\lVert {z} \right\rVert}_\infty} \\ &\leq e^{{\left\lvert {M} \right\rvert}} \\ &< \infty .\end{align*}
Show that if f_n\to f uniformly then \int_\gamma f_n\to \int_\gamma f.
solution:
\begin{align*} {\left\lvert { \int_\gamma f_n(z) \,dz- \int_\gamma f(z) \,dz } \right\rvert} &= {\left\lvert {\int_\gamma f_n(z) - f(z) \,dz} \right\rvert} \\ &\leq \int_\gamma {\left\lvert {f_n - f} \right\rvert} {\left\lvert {\,dz} \right\rvert} \\ &\leq \int_\gamma {\left\lVert {f_n - f} \right\rVert}_{\infty, \gamma} \cdot {\left\lvert {\,dz} \right\rvert} \\ &= {\varepsilon}\cdot \mathop{\mathrm{length}}(\gamma) \\ &\overset{n\to\infty}\longrightarrow 0 .\end{align*}