Real Analysis reference

[Math 619 home]

Contents

Integrating and differentiating sequences and series

Fundamental Theorem of Calculus.

If f:[a,b]→Rf:[a, b]\to\mathbb{R} is continuous, then

F(x)=def∫axf(ξ)  dξF(x) {\stackrel{\textrm{def}}=}\int_a^x f(\xi)\; d\xi

is a differentiable function, and

F′(x)=ddx∫axf(ξ)  dξ=f(x).F'(x) = \frac{d}{dx}\int_a^x f(\xi)\; d\xi = f(x).

Switching and differentiating integrals

Switching integrals. If f:[a,b]×[c,d]→Rf:[a,b]\times[c,d]\to\mathbb{R} is a Riemann integrable function of two variables, then

∫ab∫cdf(x,y)  dy  dx=∫cd∫abf(x,y)  dx  dy\int_a^b\int_c^d f(x, y)\;dy\;dx = \int_c^d\int_a^b f(x, y)\;dx\;dy

Integrals depending on a parameter. If f:[a,b]×(t0,t1)→Rf : [a, b]\times(t_0, t_1)\to\mathbb{R} is continuous, then the function F:(t0,t1)→RF:(t_0, t_1)\to\mathbb{R} given by

F(t)=def∫abf(x,t)  dxF(t) {\stackrel{\textrm{def}}=}\int_a^b f(x, t)\;dx

is continuous.

Differentiating the parameter in an integral. If f,∂f∂t:[a,b]×(t0,t1)→Rf, \frac{\partial f}{\partial t} : [a, b]\times(t_0, t_1)\to\mathbb{R}

are continuous, then

ddt∫abf(x,t)  dx=∫ab∂f∂t(x,t)  dx\frac{d}{dt}\int_a^b f( x, t)\; dx = \int_a^b \frac{\partial f}{\partial t}(x, t)\; dx

Proof. Let

F(t)=∫abf(x,t)  dx.F(t) = \int _a^b f(x, t)\;dx.

Choose T∈(t0,t1)T\in (t_0, t_1). Then

F(t)=F(T)+∫ab{f(x,t)−f(x,T)}  dx=F(T)+∫ab∫Tt∂f∂t(x,τ)  dτ  dx.\begin{aligned} F(t)& = F(T) + \int_a^b \bigl\{ f(x, t) - f(x, T)\bigr\}\; dx\\ &= F(T) + \int_a^b \int_T^t \frac{\partial f}{\partial t}(x, \tau)\;d\tau\;dx. \end{aligned}

Since ∂f/∂t\partial f/\partial t is continuous we are allowed to switch the order of integration:

F(t)=F(T)+∫Tt∫ab∂f∂t(x,τ)  dx  dτ.F(t) = F(T) + \int_T^t \int_a^b\frac{\partial f}{\partial t}(x, \tau)\;dx\;d\tau.

The Fundamental Theorem of Calculus now implies

F′(t)=ddt∫Tt∫ab∂f∂t(x,τ)  dx  dτ=∫ab∂f∂t(x,t)  dx.F'(t) = \frac{d}{dt} \int_T^t \int_a^b\frac{\partial f}{\partial t}(x, \tau)\;dx\;d\tau =\int_a^b\frac{\partial f}{\partial t}(x, t)\;dx.

Q.E.D.

Norms and inner products

Definition (real inner product) A real inner product on a real vector space VV is a real valued function

on V×VV\times V, usually written as (x,y)(x,y) or ⟨x,y⟩\langle x, y\rangle such that the following properties hold for all x,y,z∈Vx,y,z\in V and a∈Ra\in\mathbb R:

Definition (complex inner product) A complex inner product on a complex vector space VV is a complex valued

function on V×VV\times V, usually written as (x,y)(x,y) or ⟨x,y⟩\langle x, y\rangle such that the following properties hold for all x,y,z∈Vx,y,z\in V and a∈Ca\in\mathbb C:

Example: inner product on a function space.

Let HH be the space of 2π2\pi-periodic continuous functions f:R→Cf:\R\to\mathbb C. Then

⟨f,g⟩=def12π∫02πf(t)g(t)‾ dt\left\langle f,g\right\rangle \stackrel{\rm def}{=} \frac{1}{2\pi}\int_0^{2\pi} f(t)\overline{g(t)} \, dt

defines an inner product on HH.

Definition (norm)

If VV is a real or complex vector space then a function x∈V↦∥x∥∈Rx\in V\mapsto \Vert x\Vert\in\R is called a norm on VV if

Definition (distance between vectors) The distance between two vectors x,y∈Vx, y\in V in a normed vector space is d(x,y)=def∥x−y∥d(x, y) \stackrel{\rm def}{=} \|x-y\|.

Theorem about the norm in an inner product space

If VV is a real or complex inner product space with inner product ⟨x,y⟩\left\langle x, y\right\rangle. Then

∥x∥=⟨x,x⟩.\|x\| = \sqrt{\left\langle x, x\right\rangle} .

is a norm on VV. It satisfies the Cauchy-Schwarz inequality

∣⟨x,y⟩∣≤∥x∥ ∥y∥\left|\left\langle x, y \right\rangle\right|\leq \|x\|\,\|y\|

for all x,y∈Vx, y\in V.

Note that ⟨x,x⟩\langle x, x\rangle is never negative, so the square root is always defined.

Definition (orthogonality)

Two vectors x,y∈Vx,y\in V are said to be orthogonal if ⟨x,y⟩=0\langle x, y\rangle =0. Notation: x⊥yx\perp y means x,yx, y are orthogonal.

In particular, the zero vector is orthogonal to every other vector, because ⟨x,0⟩=0\langle x, 0\rangle =0 for all x∈Vx\in V.

Convergence of sequences and series of functions

Uniform convergence

Let VV be the vector space of bounded functions from some set XX to the real numbers:

V={f:X→R∣sup⁡x∈X∣f(x)∣<∞}.V = \bigl\{ f:X\to\R \mid \sup_{x\in X} |f(x)| <\infty \bigr\}.

Then

∥f∥∞=defsup⁡x∈X∣f(x)∣\|f\|_\infty \stackrel{\sf def}{=} \sup_{x\in X}|f(x)|

defines a norm on VV, often called the “sup–norm”. By definition a sequence of functions fn:X→Rf_n:X\to\R converges uniformly to a function f:X→Rf:X\to\R if lim⁡n→∞∥fn−f∥∞=0\lim_{n\to\infty} \|f_n-f\|_\infty = 0.

Weierstrass M-test

Theorem. Let fn:[a,b]→Cf_n:[a,b]\to\mathbb{C} be a sequence of functions for which we can find real numbers Mn>0M_n>0 such that

Then the series ∑n=1∞fn(x)\sum_{n=1}^\infty f_n(x) converges uniformly on [a,b][a,b].

Proof. Let s(x)=∑n=1∞fn(x)s(x)=\sum_{n=1}^\infty f_n(x) and sN(x)=∑n=1Nfn(x)s_N(x)=\sum_{n=1}^Nf_n(x). We have to show that sN(x)s_N(x) converges uniformly to s(x)s(x).

Let ϵ>0\epsilon\gt 0 be given. For any x∈[a,b]x\in [a,b] and any N∈NN\in\N we have

∣s(x)−sN(x)∣=∣s(x)−∑n=1Nfn(x)∣=∣∑n=1∞fn(x)−∑n=1Nfn(x)∣=∣∑n=N+1∞fn(x)∣≤∑n=N+1∞∣fn(x)∣≤∑n=N+1∞Mn\begin{aligned} |s(x)-s_N(x)| &= \left\vert s(x) - \sum_{n=1}^N f_n(x) \right\vert \\ &= \left\vert \sum_{n=1}^\infty f_n(x) - \sum_{n=1}^N f_n(x) \right\vert \\ &= \left\vert \sum_{n=N+1}^\infty f_n(x) \right\vert \\ &\leq \sum_{n=N+1}^\infty |f_n(x)| \\ &\leq \sum_{n=N+1}^\infty M_n \end{aligned}

Since the series ∑Mn\sum M_n is known to converge, an Nϵ∈NN_\epsilon\in\N exists for which ∑n=Nϵ∞Mn<ϵ\sum_{n=N_\epsilon}^\infty M_n <\epsilon. It then follows that for all N≥NϵN\geq N_\epsilon and all x∈[a,b]x\in [a,b] one has

∣s(x)−sN(x)∣<ϵ.|s(x) - s_N(x)|< \epsilon.

This implies sN(x)→s(x)s_N(x)\to s(x) uniformly.

Q.E.D.

Example 1. The series ∑n=1∞sin⁡nxn2\sum_{n=1}^\infty \dfrac{\sin nx}{n^2} converges uniformly for all x∈Rx\in\R because the nthn^{\rm th} term is bounded by ∣sin⁡nxn2∣≤Mn\left\vert\dfrac{\sin nx}{n^2}\right\vert \leq M_n with Mn=1n2M_n = \frac1{n^2}, and the series ∑1∞1n2\sum_1^\infty \frac{1}{n^2} converges.
Each term is continuous and the series converges uniformly. Therefore the function f(x)=∑1∞sin⁡nxn2f(x)=\sum_1^\infty \dfrac{\sin nx}{n^2} is a continuous function.

Example 2. The sawtooth function is defined by f(x)=π−x2f(x)=\frac{\pi-x}{2} (0<x<2π0\lt x\lt 2\pi) and f(x+2π)=f(x)f(x+2\pi)=f(x) for all x∈Rx\in\R. Its Fourier series is

f(x)=∑n=1∞sin⁡nxn.f(x) = \sum_{n=1}^\infty \frac{\sin nx}{n}.

The best upper bound we can find for the nthn^{\rm th} term is Mn=1nM_n=\frac 1n. The series ∑nMn=∑n1n\sum_nM_n = \sum_n \frac1n does not converge, so we cannot apply the Weierstrass M-test.
The sawtooth function ff is discontinuous at x=2kπx=2k\pi (k∈Zk\in\Z), so the series cannot converge uniformly.

The integral and derivative of a limit