(Induction on the number of factors: the base case is the Proposition, and the inductive step applies the Proposition to ei(θ1+⋯+θn−1)⋅eiθn.) Taking every θj=θ, ⇒(eiθ)n=einθ(De Moivre’s Formula)
Note:
One can derive the exponential representations of sin and cos: eiθ=cosθ+isinθ,e−iθ=eiθ=cosθ−isinθ Adding the two kills the sin term, subtracting them kills the cos term: ⇒cosθ=2eiθ+e−iθ,sinθ=2ieiθ−e−iθ
Lecture 2
Periodic functions.
Definition:
We say a function f is periodic of period T if f(t+T)=f(t)∀t∈R
Fact: If f is periodic of period 1, then f can be “represented” as n=−∞∑∞cne2πint,cn∈C
Note that not all infinite sums of exponentiations are convergent, but in most cases that we will encounter in this class, this is an exact representation.
The collection of functions {e2πint:n∈Z} can be used to represent any function of period 1.
Now suppose f is of period 1, and we are told f(t)=n∈Z∑cne2πint
How can we compute cn? e−2πiktf(t)⇒∫01e−2πiktf(t)dt=n∈Z∑cne−2πikte2πint=n∈Z∑cn∫01e2πi(n−k)tdt
Examine ∫01e2πi(n−k)tdt. Antidifferentiating, we see that this must be split into two cases: n=k and n=k. ∫01e2πi(n−k)tdt=⎩⎨⎧∫011dt=12πi(n−k)e2πi(n−k)t01=2πi(n−k)1−1=0n=kn=k (The numerator vanishes because e2πi(n−k)=1 for integer n−k.) So every term of the sum dies except n=k: ⇒∫01f(t)e−2πiktdt=ck
Thus, if f is of period 1, then cn=∫01f(t)e−2πintdt
Now suppose f is of period T. Let g(t)=f(Tt). Then g(t) is of period 1. We can observe this fact g(t+1)=f(T(t+1))=f(Tt+T)=f(Tt)=g(t)
We already know how to represent g(t): g(t)=n=−∞∑∞cne2πint,cn=∫01e−2πintg(t)dt⇒f(Tt)=n=−∞∑∞cne2πint
Let s=Tt⇒t=Ts. We can change variables to obtain: f(s)=n=−∞∑∞cneT2πins
The same substitution in the coefficient formula (s=Tt, so ds=Tdt, and t:0→1 becomes s:0→T): cn=∫01g(t)e−2πintdt=∫01f(Tt)e−2πintdt⇒cn=T1∫0Tf(s)eT−2πinsds
Useful result:
If f∈Ck (k-times differentiable), then cndecays like cn∼∣n∣k1.
Why: integrate by parts once. The boundary term cancels because f and e−2πint/T are both T-periodic, so cn(f′)=T1(f(t)eT−2πint0T+T2πin∫0Tf(t)eT−2πintdt)=T2πincn(f) Iterating k times gives cn(f)=(2πinT)kcn(f(k)), and ∣cn(f(k))∣≤max∣f(k)∣ is bounded, so ∣cn∣≤C/∣n∣k.
The last step shifts the interval [−T,0] over to [0,T], which is legal by the Proposition below.
Proposition:
If g is periodic of period T, then ∫aa+Tg(t)dt=∫0Tg(t)dt
Proof:
Let F(x)=∫xx+Tg(t)dt. F′(x)=g(x+T)−g(x)=0⇒F is constant. In particular F(a)=F(0), which is the claim.
Example:
Consider the square wave f of period 1 defined on [0,1] by f(t)=⎩⎨⎧1,−1,0≤t<2121≤t<1
One can easily find the Fourier coefficients by using casework on the integral between 0 and 1, as this is a piecewise function. Doing it: c0=∫01/21dt+∫1/21(−1)dt=21−21=0 For n=0, with antiderivative −2πine−2πint, cn=∫01/2e−2πintdt−∫1/21e−2πintdt=−2πine−πin−1−−2πine−2πin−e−πin=−2πin[(−1)n−1]−[1−(−1)n]=−2πin2(−1)n−2=πin1−(−1)n=⎩⎨⎧0,πin2,n evenn odd using e−πin=(−1)n and e−2πin=1. This is the series quoted in Lecture 4.
Lecture 3
Suppose f(t) is periodic of period T.
When f is even and real-valued then cn=c−n=cn, or that cn are real.
Example:
The triangle wave is the following. Let f(t) be a periodic function with period 1 f(t)=⎩⎨⎧21+t,21−t,−21≤t<00≤t<21
Find the Fourier series of f. cn=∫−2121e−2πintf(t)dtc0=∫−2121f(t)dt=2∫01/2(21−t)dt=41
For n=0: split e−2πint=cos(2πnt)−isin(2πnt). Since f is even, f(t)sin(2πnt) is odd and integrates to 0, while f(t)cos(2πnt) is even, so the integral is twice the half-range one: cn=∫−210e−2πint(21+t)dt+∫021e−2πint(21−t)dt=2∫021(21−t)cos(2πnt)dt Integrate by parts with u=21−t, dv=cos(2πnt)dt, so du=−dt and v=2πnsin(2πnt). The boundary term dies at both ends (u=0 at t=21, v=0 at t=0): cn=2((21−t)2πnsin(2πnt)01/2+2πn1∫01/2sin(2πnt)dt)=πn1(2πn−cos(2πnt)01/2)=2π2n21−cos(πn)=2π2n21−(−1)n=⎩⎨⎧0,π2n21,n evenn odd
Thus, the Fourier series of f is 41+n odd,n∈Z∑π2n21e2πint
However, since odd numbers come in ± pairs, we can write 41+n odd,n≥1∑π2n21cis(2πnt)+n odd,n≤−1∑π2n21cis(2πnt)=41+π22n odd,n≥1∑n2cos(2πnt)=41+π22k=0∑∞(2k+1)2cos(2π(2k+1)t) pairing n with −n and using e2πint+e−2πint=2cos(2πnt), then substituting n=2k+1.
Rayleigh’s identity (Parseval’s Theorem)
Let f be periodic of period T with Fourier series n=−∞∑∞cneT2πint
Assume f has only a finite number of jump discontinuities on the interval [0,T]. Then n=−∞∑∞∣cn∣2=T1∫0T∣f(t)∣2dt
Proof:
∣f(t)∣2=f(t)f(t)=(n=−∞∑∞cneT2πint)(k=−∞∑∞cke−T2πikt)=n=−∞∑∞k=−∞∑∞cnckeT2πi(n−k)t Integrate over one period. By the same two-case computation as in Lecture 2, ∫0Te2πi(n−k)t/Tdt equals T when n=k and 0 otherwise, so only the diagonal survives: ⇒∫0T∣f(t)∣2dt=n=−∞∑∞k=−∞∑∞cnck∫0TeT2πi(n−k)tdt=Tn=−∞∑∞cncn Divide by T and use cncn=∣cn∣2.
Lecture 4
Example:
Refer back to the square wave diagram. We know that the Fourier series is f(t)∼nodd∑πin2e2πint
Using Parseval’s theorem, and noting ∣f(t)∣=1 everywhere so the left side is just 1: ∫01∣f(t)∣2dt=1=n odd∑π2n24=π28n odd,n≥1∑n21=π28k=0∑∞(2k+1)21⇒k=0∑∞(2k+1)21=8π2 (The 8 is 4 from πin22=π2n24, doubled because n and −n contribute equally.)
Example:
Refer back to the triangle wave. We know that f(t)=41+n odd∑π2n21e2πint The left-hand side of Parseval is, using evenness, ∫−2121∣f(t)∣2dt=2∫01/2(21−t)2dt=23−(21−t)301/2=242=121 so 121=161+π41n odd∑n41⇒481=π42k=0∑∞(2k+1)41⇒k=0∑∞(2k+1)41=96π4. Here 161=∣c0∣2, and the ±n pairing again supplies the factor of 2.
Theorem: (Pointwise convergence of Fourier series)
Let f be a periodic function of period T. Suppose f and f′ are continuous on [0,T] except for a finite number of jump discontinuities. Then the Fourier series converges to 2f(a+)+f(a−) at every number a. That is, n=−∞∑∞cneT2πina=2f(a+)+f(a−)f(a+)=x→a+limf(x),f(a−)=x→a−limf(x)
Example:
Return to the square wave series. Pairing n with −n and using e2πint−e−2πint=2isin(2πnt), πin2e2πint+πi(−n)2e−2πint=πin2⋅2isin(2πnt)=πn4sin(2πnt)⇒f(t)∼π4k=0∑∞2k+11sin(2π(2k+1)t)
At t=0, we have 2f(0+)+f(0−)=0. The Fourier series returns the same result—since sin(0)=0.
At t=41, we get f(t)=1. In the Fourier series: π4k=0∑∞2k+1sin(2(2k+1)π)=π4k=0∑∞2k+1(−1)k
Hence, we get a nice sum from an alternating series: k=0∑∞2k+1(−1)k=4π
Example:
Let’s return to the triangle wave again. At t=0, we get f(t)=21. Test in the Fourier series: 41+π21n odd∑n21=41+π22k=0∑∞(2k+1)2121=41+π22k=0∑∞(2k+1)21⇒k=0∑∞(2k+1)21=8π2
Do the same thing at t=21. The periodic extension is continuous there with f(21)=0, and eπin=(−1)n=−1 for odd n, so 0=41+n odd∑π2n2(−1)n=41−π21n odd∑n21⇒n odd∑n21=4π2
This sum runs over all odd n∈Z, so it is twice the sum over n≥1: 4π2=2k=0∑∞(2k+1)21⇒k=0∑∞(2k+1)21=8π2 the same result as before.
The geometric Fourier Series.
Motivation:
Suppose f is periodic of period T=2l. Then f(x)∼n=−∞∑∞cneT2πinx=n=−∞∑∞cnelπinx=n=−∞∑∞cncos(lnπx)+in=−∞∑∞cnsin(lnπx)
Lecture 5
Trigonometric Fourier Series
Let f(x) be periodic of period T=2l. For example, we could have cos(lkπx).
Then f can be represented as f(x)∼2a0+k=1∑∞akcos(lkπx)+k=1∑∞bksin(lkπx)
Now, how do we compute ak,bj, the coefficients?
Recall:
Trig identities: cos(A+B)=cosAcosB−sinAsinB, sin(A+B)=sinAcosB+sinBcosA. From these, we can derive identities for sinAcosB,sinBcosA,sinAsinB,cosAcosB. Writing down the (A−B) versions too and adding/subtracting: cosAcosB=21[cos(A−B)+cos(A+B)],sinAsinB=21[cos(A−B)−cos(A+B)]sinAcosB=21[sin(A+B)+sin(A−B)]
Return to f(x)∼2a0+k=1∑∞akcos(lkπx)+k=1∑∞bksin(lkπx)(∗)
Let m≥1. Multiply (∗) by cos(lmπx) and integrate over [−l,l] (swapping ∑ and ∫ is fine here, since the series converges uniformly under our assumptions): ∫−llf(x)cos(lmπx)dx=2a0∫−llcos(lmπx)dx+k=1∑∞ak∫−llcos(lkπx)cos(lmπx)dx+k=1∑∞bk∫−llsin(lkπx)cos(lmπx)dx
We know that ∫−llcos(lmπx)dx=mπlsin(lmπx)−ll=mπl[sin(mπ)−sin(−mπ)]=0∫−llcos(lkπx)cos(lmπx)dx=21(∫−llcos(l(k+m)πx)dx+∫−llcos(l(k−m)πx)dx)=21((m+k)πlsin(l(m+k)πx)−ll+∫−llcos(l(k−m)πx)dx) The first piece vanishes since k+m≥2 is a nonzero integer, leaving =21∫−llcos(l(k−m)πx)dx=⎩⎨⎧2π(k−m)lsin(l(k−m)πx)−ll=0,21∫−ll1dx=l,k=mk=m
Now, return to the sum from before. Only the single term k=m survives: k=1∑∞ak∫−llcos(lkπx)cos(lmπx)dx=lam
So we have filled in one nasty sum/integral pair, let’s look at the last one: ∫−llsin(lkπx)cos(lmπx)dx=21(∫−llsin(l(k+m)πx)dx+∫−llsin(l(k−m)πx)dx)=21((k+m)π−lcos(l(k+m)πx)−ll+∫−llsin(l(k−m)πx)dx) Since cos is even, the evaluations at x=l and x=−l agree and the first piece is 0: =21∫−llsin(l(k−m)πx)dx=⎩⎨⎧2(k−m)π−lcos(l(k−m)πx)−ll=0,21∫−ll0dx=0,k=mk=m
Shortcut: that whole computation was unnecessary. sin(lkπx)cos(lmπx) is odd in x (odd times even), and we integrate over the symmetric interval [−l,l], so it is 0 immediately.
Now, combine all the sums to obtain ∫−llf(x)cos(lmπx)dx=0+lam+0=lam⇒am=l1∫−llf(x)cos(lmπx)dx
Now look for a0. Integrate (∗) itself over [−l,l]: ∫−llf(x)dx=2a0∫−lldx+k=1∑∞ak∫−llcos(lkπx)dx+k=1∑∞bk∫−llsin(lkπx)dx The first integral is 2l; the cos integrals vanish as computed above; the sin integrals vanish since sin(lkπx) is odd. So =la0+0+0=la0⇒a0=l1∫−llf(x)dx This is exactly the m=0 case of the formula for am, which is why the constant term of (∗) is written 2a0 and not a0: it lets one formula cover every m≥0.
Using the same methods, we can find bk: multiply (∗) by sin(lmπx) instead. We need one more orthogonality relation, ∫−llsin(lkπx)sin(lmπx)dx=21(∫−llcos(l(k−m)πx)dx−∫−llcos(l(k+m)πx)dx)={0,l,k=mk=m by the identical case analysis. The ∫cos(lkπx)sin(lmπx)dx terms vanish by the oddness shortcut, and ∫−llsin(lmπx)dx=0 kills the 2a0 term, so ∫−llf(x)sin(lmπx)dx=lbm⇒bk=l1∫−llf(x)sin(lkπx)dx
Example:
Let f be periodic of period 2π, and f(x)={0,x,−π≤x≤00≤x≤π
what is the Fourier series of f?
Solution: here 2l=2π, so l=π and every lkπx is just kx. a0=π1∫−ππf(x)dx=π1∫0πxdx=π1⋅2π2=2π For an, integrate by parts with u=x, dv=cos(nx)dx, v=nsin(nx): an=π1∫0πxcos(nx)dx=π1(nxsin(nx)0π−n1∫0πsin(nx)dx)=π1(0+n2cos(nx)0π)=πn21[(−1)n−1]=⎩⎨⎧πn2−2,0,n oddn even For bn, take u=x, dv=sin(nx)dx, v=n−cos(nx): bn=π1∫0πxsin(nx)dx=π1(n−xcos(nx)0π+n1∫0πcos(nx)dx)=π1(n−π(−1)n+n2sin(nx)0π)=n−(−1)n=n(−1)n+1 Assembling, with constant term 2a0=4π: ⇒f(x)∼4π−π2n odd,n≥1∑n2cos(nx)+n=1∑∞n(−1)n+1sin(nx)=4π−π2k=0∑∞(2k+1)2cos((2k+1)x)+n=1∑∞n(−1)n+1sin(nx).