Definition (real inner product) A real inner product on a real vector space V is a real valued function
on V×V, usually written as (x,y) or ⟨x,y⟩ such that the following properties hold for all x,y,z∈V and a∈R:
⟨x,y⟩=⟨y,x⟩
⟨ax,y⟩=a⟨x,y⟩
⟨x+y,z⟩=⟨x,z⟩+⟨y,z⟩
⟨x,x⟩>0 if x=0
Definition (complex inner product) A complex inner product on a complex vector space V is a complex valued
function on V×V, usually written as (x,y) or ⟨x,y⟩ such that the following properties hold
for all x,y,z∈V and a∈C:
⟨x,y⟩=⟨y,x⟩ where z is the complex conjugate of z∈C
⟨ax,y⟩=a⟨x,y⟩
⟨x+y,z⟩=⟨x,z⟩+⟨y,z⟩
⟨x,x⟩>0 if x=0
Example: inner product on a function space.
Let H be the space of 2π-periodic continuous functions f:R→C. Then
⟨f,g⟩=def2π1∫02πf(t)g(t)dt
defines an inner product on H.
Definition (norm)
If V is a real or complex vector space then a function x∈V↦∥x∥∈R is called a norm on V if
∥x∥>0 for all x∈V with x=0
∥ax∥=∣a∣∥x∥ for all x∈V and a∈R or a∈C
∥x+y∥≤∥x∥+∥y∥ (the triangle inequality)
Definition (distance between vectors) The distance between two vectorsx,y∈V in a normed vector space is d(x,y)=def∥x−y∥.
Theorem about the norm in an inner product space
If V is a real or complex inner product space with inner product ⟨x,y⟩. Then
∥x∥=⟨x,x⟩.
is a norm on V. It satisfies the Cauchy-Schwarz inequality
∣⟨x,y⟩∣≤∥x∥∥y∥
for all x,y∈V.
Note that ⟨x,x⟩ is never negative, so the square root is always defined.
Definition (orthogonality)
Two vectors x,y∈V are said to be orthogonal if ⟨x,y⟩=0. Notation: x⊥y means x,y are orthogonal.
In particular, the zero vector is orthogonal to every other vector, because ⟨x,0⟩=0 for all x∈V.
Convergence of sequences and series of functions
Uniform convergence
Let V be the vector space of bounded functions from some set X to the real numbers:
V={f:X→R∣x∈Xsup∣f(x)∣<∞}.
Then
∥f∥∞=defx∈Xsup∣f(x)∣
defines a norm on V, often called the “sup–norm”. By definition a sequence of functions fn:X→R converges uniformly to a function f:X→R if limn→∞∥fn−f∥∞=0.
Weierstrass M-test
Theorem. Let fn:[a,b]→C be a sequence of functions for which we can find real numbers Mn>0 such that
∣fn(x)∣≤Mn for all x∈[a,b], and
∑n=1∞Mn<∞.
Then the series ∑n=1∞fn(x) converges uniformly on [a,b].
Proof. Let s(x)=∑n=1∞fn(x) and sN(x)=∑n=1Nfn(x). We have to show that sN(x) converges uniformly to s(x).
Let ϵ>0 be given. For any x∈[a,b] and any N∈N we have
Since the series ∑Mn is known to converge, an Nϵ∈N exists for which ∑n=Nϵ∞Mn<ϵ. It then follows that for all N≥Nϵ and all x∈[a,b] one has
∣s(x)−sN(x)∣<ϵ.
This implies sN(x)→s(x) uniformly.
Q.E.D.
Example 1. The series ∑n=1∞n2sinnx converges uniformly for all x∈R because the nth term is bounded by n2sinnx≤Mn with Mn=n21, and the series ∑1∞n21 converges.
Each term is continuous and the series converges uniformly. Therefore the function f(x)=∑1∞n2sinnx is a continuous function.
Example 2. The sawtooth function is defined by f(x)=2π−x (0<x<2π) and f(x+2π)=f(x) for all x∈R. Its Fourier series is
f(x)=n=1∑∞nsinnx.
The best upper bound we can find for the nth term is Mn=n1. The series ∑nMn=∑nn1 does not converge, so we cannot apply the Weierstrass M-test.
The sawtooth function f is discontinuous at x=2kπ (k∈Z), so the series cannot converge uniformly.