User Tools

Site Tools


math121a-f23:blog

October 11 (Wednesday)

We will do many examples today to get intuition for what's Fourier transform is doing.

Discrete Fourier Transform

General Formula

Let NN be a positive integer.

Let 'x-space' be Vx=Z/NZ={0,1,,N1}V_x = \Z/ N \Z = \{0,1, \cdots, N-1\}, and then (rescaled) 'p-space' is also Vp=Z/NZV_p = \Z / N\Z, then we can build the Fourier transformation kernel K(x,p)=e2πi(xp/N):Vx×VpU(1) K(x,p) = e^{2\pi i (x p / N)} : V_x \times V_p \to U(1) where U(1)U(1) is the unit circle in complex number.

The kernel satisfies the orthonormal condition in both x and p variable. 1NxVxK(x,p1)K(x,p2)=δ(p1,p2) \frac{1}{N} \sum_{x \in V_x} K(x,p_1) \overline{K(x,p_2)} = \delta(p_1, p_2) 1NpVpK(x1,p)K(x2,p)=δ(x1,x2) \frac{1}{N} \sum_{p \in V_p} K(x_1,p) \overline{K(x_2,p)} = \delta(x_1, x_2)

Given a function f(x):VxCf(x): V_x \to \C, we can expand it as f(x)=pVpK(x,p)F(p) f(x) = \sum_{p \in V_p} K(x,p) F(p) for some function F(p):VpCF(p): V_p \to \C. Using the orthonormal condition, we get, for any qVpq \in V_p, we have (1/N)xVxf(x)K(x,q)=(1/N)xVxpVpK(x,p)F(p)K(x,q)=F(q). (1/N) \sum_{x \in V_x} f(x) \overline{K(x,q)} = (1/N) \sum_{x \in V_x} \sum_{p \in V_p} K(x,p) F(p) \overline{K(x,q)} = F(q). that is F(q)=(1/N)xVxf(x)K(x,q). F(q) = (1/N) \sum_{x \in V_x} f(x) \overline{K(x,q)}.

Fourier Transformation is a linear map between two function spaces

Let Fun(Vx,C)Fun(V_x, \C) be the space of functions from VxV_x to C\C. Similarly define Fun(Vp,C)Fun(V_p, \C). Concretely Fun(Vx,C)=CNFun(V_x, \C) = \C^N and Fun(Vp,C)=CNFun(V_p, \C) = \C^N.

Fourier transformation FTFT, sends an element f(x)Fun(Vx,C)f(x) \in Fun(V_x,\C) to an element F(p)Fun(Vp,C)F(p) \in Fun(V_p, \C). FTFT is a linear map.

If we define hermitian inner product on Fun(Vx,C)Fun(V_x,\C) as f,gx=(1/N)xVxf(x)g(x), \langle f, g\rangle_x = (1/N) \sum_{x \in V_x} f(x) \overline{g(x)}, and we define hermitian inner product on Fun(Vp,C)Fun(V_p,\C) as F,Gp=pVpF(p)G(p). \langle F, G \rangle_p = \sum_{p \in V_p} F(p) \overline{G(p)}. then we find that Fourier transformation is compatible with the two inner products, namely f,gx=F,Gp,F=FT(f),G=FT(g). \langle f, g \rangle_x = \langle F, G \rangle_p, \quad F = FT(f), G = FT(g).

Example 1: N = 2

A function f(x)f(x) is determined by its values f(0),f(1)f(0), f(1). Similarly for F(p)F(p). We have relations F(0)=(1/2)(f(0)+f(1)),F(1)=(1/2)(f(0)f(1)). F(0) = (1/2) (f(0) + f(1)), \quad F(1) = (1/2) (f(0) - f(1)). So, we can reconstruct f(x)f(x) from F(p)F(p), by f(0)=F(0)+F(1),f(1)=F(0)F(1). f(0) = F(0) + F(1), \quad f(1) = F(0) - F(1).

An important equality

1+(1)=0.1 + (-1) = 0. and less obviously 1+e2πi/3+e2πi(2/3)=01 + e^{2\pi i / 3} + e^{2\pi i (2/3)} = 0 more generally j=0N1e2πi(j/N)=0 \sum_{j=0}^{N-1} e^{2\pi i (j/N)} = 0

How to see this? You can say, this is the sum of all the NN-th roots of unity, and we have zN1=j=0N1(ze2πi(j/N)). z^N - 1 = \prod_{j=0}^{N-1} ( z - e^{2\pi i (j/N)}). hence by looking at the coefficient of zN1z^{N-1}, we see the sum of all the roots is 0.

Or, draw these roots as vectors on the complex plane, they show up as evenly distributed on the unit circle, since the summands are invariant under rotation by 2π/N2\pi/N, hence the result is invariant under such a rotation. And the only possible number is 0.

Example 2: N = 3

try it yourself.

2023/10/11 09:35 · pzhou

Homework 6

Due on Monday (Oct 9th)

1. Find the Fourier transformation of the following function. f(x)={10<x<10else f(x) = \begin{cases} 1 & 0<x<1 \cr 0 & \text{else} \end{cases}

2. Find the Fourier transformation of the following function. f(x)={1+x1<x<01x0<x<10else f(x) = \begin{cases} 1+x & -1<x<0 \cr 1-x & 0<x<1 \cr 0 & \text{else} \end{cases}

3. Let f(x)=a/(xi)+b/(x+i)+c/(x5i)f(x) = a / (x - i) + b / (x+i) + c / (x - 5i) for some complex numbers a,b,ca,b, c.

  • Describe for what choices of a,b,ca,b,c the function f(x)f(x) is absolutely integrable.
  • Take a=2,b=1,c=1a=2, b=-1, c=-1, where we know f(x)f(x) is integrable, compute its Fourier transformation.

4. Compute the inverse Fourier transform for F(p)=πep F(p) = \pi e^{-|p|} you should get back f(x)=1/(1+x2)f(x) = 1/(1+x^2).

(my convention is f(x)=12πF(p)eipxdp.f(x) = \frac{1}{2\pi} \int F(p) e^{ipx} dp. )

2023/10/06 12:05 · pzhou

October 6 (Friday)

Topics:

  • Fourier inversion formula
  • Fourier Series for periodic function
  • Interpretation of complex vector space, hermitian inner product, orthonormal basis.

Inversion Formula

Suppose you started from f(x)f(x), and did some hard work to get the Fourier transformation F(p)F(p). Can you recover f(x)f(x) from F(p)F(p)? Did you lose information when you throw away f(x)f(x) and only keep F(p)F(p)?

If f(x)f(x) is continuous and absolutely integrable, we can recover f(x)f(x) from F(p)F(p) by f(x)=12πpRF(p)eipxdp f(x) = \frac{1}{2\pi} \int_{p \in \R} F(p) e^{ipx} dp The proof of this theorem is beyond the scope of this class. You might be happy to just accept the formal 'rule' that 12πReipxipydp=δ(xy). \frac{1}{2\pi} \int_\R e^{ipx - ipy} dp = \delta(x-y). and that f(x)=δ(xy)f(y)dy f(x) = \int \delta(x-y) f(y) dy

We can try some example to see if it works.

Fourer Series

If the function f(x)f(x) is a periodic function, of period LL, meaning f(x)=f(x+L)f(x) = f(x+L), then we cannot do Fourier transform (why?), but instead, we need to do Fourier series.

We are not going to use all eipxe^{ipx} for all pp, but only those that satisfies eipx=eip(x+L)e^{ipx} = e^{ip(x+L)} have the same periodicity. Which mean pp needs to satisfy p=(2π/L)n p = (2\pi / L) n for some integer nn.

So, we define en(x)=ei(2π/L)nx. e_n(x) = e^{i(2\pi/L) n x}. We define the Fourer series coefficient as cn=1L0Lf(x)en(x)dx c_n = \frac{1}{L} \int_{0}^L f(x) \overline{e_n(x)} dx

Given these coefficient cnc_n, can we recover f(x)f(x)? Yes, under some smoothness condition of f(x)f(x), we have f(x)=nZcnen(x). f(x) = \sum_{n \in \Z} c_n e_n(x).

2023/10/05 21:14 · pzhou

October 4 (Wednesday)

What's coming in the second part of this course?

  • Fourier transform. Given f(x)f(x), we want to express f(x)=eikxg(k)dkf(x) = \int e^{ikx} g(k) dk, since eikxe^{ikx} is easy to deal with.
  • Laplace transform. Given f(t)f(t), on t[0,)t \in [0, \infty), we want to write f(t)=c+iReptF(p)dpf(t) = \int_{c + i \R} e^{pt} F(p) dp.
  • Gamma function, Stirling Formula

What is Fourier Transformation

When we solve equation of the form df(x)dx=λf(x), \frac{df(x)}{dx} = \lambda f(x), the general soluition is f(x)=ceλx. f(x) = c e^{\lambda x}. We say eλxe^{\lambda x} is an eigenfunction for the operator d/dxd/dx with eigenvalue λ\lambda, here λ\lambda can be any complex number.

  • For λ\lambda purely imaginary, λ=ik\lambda = i k, the function eikxe^{i k x}, which has constant size eikx=1|e^{ikx}| = 1.
  • For λ\lambda purely real, λR\lambda \in \R, the function eλxe^{\lambda x}, which is real, and has exponential growth (if λ>0\lambda > 0) or exponential decay.
  • For λ\lambda general complex number, say λ=a+ib\lambda = a + i b for a,bRa,b\in\R, then eλx=eaxeibxe^{\lambda x} = e^{ax} e^{ibx} has both oscillation factor eibxe^{ibx} and exponential growth/decay eaxe^{ax}.

If you give me a function f(x)f(x), we can try to write it as a linear combination of these easy to understand pieces eλxe^{\lambda x}. Say f(x)=Cc(λ)eλxdλ f(x) = \int_{C} c(\lambda) e^{\lambda x} d\lambda The benefit for doing this? If a differential operator d/dxd/dx walk to it, we would have (d/dx)f(x)=λc(λ)(d/dx)eλxdλ=λc(λ)λeλxdλ. (d/dx) f(x) = \int_{\lambda} c(\lambda) (d/dx) e^{\lambda x} d\lambda = \int_{\lambda} c(\lambda) \lambda e^{\lambda x} d\lambda. Of course, you would immediately complain:

  • what is this integration contour CC? Is it along the real axis of λ\lambda? Is it along the imaginary axis of λ\lambda?
  • Why we can switch the order of integration and differentiation?

Let's keep these questions in our head, we will return to those.

So, what is Fourier transformation? If you go on wiki, or open some textbook, you see the following definition: given a function f(x)f(x) (with some condition on it), we can define F(p):=xRf(x)eipxdx. F(p) := \int_{x \in \R} f(x) e^{-ipx} dx. This is called the Fourier transformation.

Let's throw in some input and see what we get.

Example 1

f(x)=cosh(x)=(ex+ex)/2. f(x) = \cosh(x) = (e^{x} + e^{-x} )/2. This function grows to infinity when x±x \to \pm \infty, indeed, when x+x \to +\infty, exe^x dominate, and xx \to -\infty we have exe^{-x} dominate. Either way, you blow up. Good luck when integrating Rf(x)dx\int_\R f(x) dx.

But, let's try to do the Fourier transformation anyway. We get F(p)=xf(x)eipxdx=(1/2)Re(1ip)xdx+(1/2)Re(1ip)xdx. F(p) = \int_x f(x) e^{-ipx} dx = (1/2) \int_\R e^{(1-ip)x} dx + (1/2) \int_\R e^{(-1-ip)x} dx. OK, we cannot continue.

Lesson 1

f(x)f(x) need to have sufficient 'decay' near infinity for the Fourier transformation to make sense. More precisely, a sufficient condition is that f(x)f(x) is 'absolutely integrable', which means Rf(x)dx<. \int_\R |f(x)|dx < \infty. Given this condition, we know F(p)=Reipxf(x)dxReipxf(x)dx=Rf(x)dx<. |F(p)| = | \int_\R e^{-ipx} f(x) dx | \leq \int_\R |e^{-ipx} f(x)| dx = \int_\R |f(x)| dx < \infty. so we are safe.

Example 2

The Gaussian. f(x)=ex2.f(x) = e^{-x^2}. It decays pretty nicely in both directions.

Since we learned our lesson, we need to do a check first Rex2dx=π. \int_\R e^{-x^2} dx = \sqrt{\pi}. Great, it is finite.

Now, let's Fourier transform. F(p)=eipxx2dx=Re(xip/2)2p2/4dx=ep2/4uip/2+Reu2du F(p) = \int e^{-ipx - x^2} dx = \int_\R e^{- (x-ip/2)^2 - p^2/4} dx = e^{-p^2/4} \int_{u \in -ip/2+\R} e^{-u^2} du where we used the new variable u=ip/2+xu = -ip/2+x.

We can move the contour for uu as long as the integral is convergent. Recall from last Wednesday's lecture, eu2e^{-u^2} decays fast to 00 when u|u| \to \infty in the sectors arg(u)(π/4,π/4)\arg(u) \in (-\pi/4, \pi/4) and arg(u)π+(π/4,π/4)\arg(u) \in \pi + (-\pi/4, \pi/4). So, we are going to move the integration contour of uu from the shifted real line ip/2+R-ip/2+\R back to R\R. We get uip/2+Reu2du=uReu2du=π. \int_{u \in -ip/2+\R} e^{-u^2} du = \int_{u \in \R} e^{-u^2} du = \sqrt{\pi}. Thus, we get F(p)=πep2/4. F(p) = \sqrt{\pi} e^{-p^2/4}.

Success!

Example 3

Let f(x)=1/(1+x2)f(x) = 1/(1+x^2). Let's check that f(x)f(x) is absolutely integrable first Rf(x)dx=CRf(z)dz=2πiResz=if(z)=2πi12i=π. \int_\R f(x) dx = \int_{C_R} f(z) dz = 2\pi i Res_{z=i} f(z) = 2\pi i \frac{1}{2i } = \pi. where C+,RC_{+,R} is the contour consist of two part

  • [R,R][-R, R]
  • a semi-circle in the upper half plane of radius RR.

Equivalently, we can choose a different contour C,RC_{-,R}, which also consist of two part

  • [R,R][-R, R]
  • a semi-circle in the lower half plane of radius RR.

Note that when we go around C,RC_{-,R} it goes around the singularity of f(z)f(z) at z=iz=-i in the 'negative' (clockwise) direction, hence we get C,Rf(z)dz=(2πi)Resz=if(z)=2πi12i=π. \int_{C_{-,R}} f(z) dz = (-2\pi i) Res_{z=-i} f(z) = -2\pi i \frac{1}{-2i} = \pi. Whew! the two minus sign cancels, we get the same answer.

Now, let's compute the little variation F(p)=Reipxf(x)dx. F(p) = \int_\R e^{-ipx} f(x) dx. We first take the 'truncation' approximation, which recovers the original limit under the limit RR \to \infty. F(p)=limRRReipxf(x)dx. F(p) = \lim_{R \to \infty} \int_{-R}^R e^{-ipx} f(x) dx. Then, we try to 'close the contour', by connecting the point RR to R-R along some way. Due to this exponential factor eipze^{-ipz}, it matters whether we close the contour in the upper half-plane, or the lower one. Indeed, we have eipz=eRe(ip(x+iy))=eRe(ipx+py)=epy=epIm(z). |e^{-ipz}| = e^{Re(-ip(x+iy))} = e^{Re(-ipx + py)} = e^{py} = e^{p Im(z)}. So,

  • if p0p \geq 0, to avoid eipz|e^{-ipz}| blow up to infinity, we need to keep Im(z)Im(z) bounded from above on the contour.
  • if p0p \leq 0, to avoid eipz|e^{-ipz}| blow up to infinity, we need to keep Im(z)Im(z) bounded from below on the contour.

Thus, for p0p \geq 0, we can complete the by the lower-half-semicircle C,RC_{-,R}. We get (p0)F(p)=C,Reipz1+z2dz=(2πi)Resz=ieipz1+z2=πep. (p\geq 0) F(p) = \int_{C_{-,R}} \frac{e^{-ipz}}{1+z^2} dz = (-2\pi i) Res_{z=-i} \frac{e^{-ipz}}{1+z^2} = \pi e^{-p}. Similarly, for p0p \geq 0, we get (p0)F(p)=C+,Reipz1+z2dz=(2πi)Resz=ieipz1+z2=πep. (p\leq 0) F(p) = \int_{C_{+,R}} \frac{e^{-ipz}}{1+z^2} dz = (2\pi i) Res_{z=i} \frac{e^{-ipz}}{1+z^2} = \pi e^{p}. We can write the result in a cool way as F(p)=πep. F(p) = \pi e^{-|p|}. So when p|p| \to \infty, we see F(p)0F(p) \to 0 very quickly.

Exercise

warm up:Does the function f(x)=1f(x)=1 admits Fourier transformation? Why? How about f(x)=1/(1+x)f(x) = 1 / (1+|x|)?

Find the Fourier transformation of the following functions. f(x)={10<x<10else f(x) = \begin{cases} 1 & 0<x<1 \cr 0 & \text{else} \end{cases}

f(x)={1+x1<x<01x0<x<10else f(x) = \begin{cases} 1+x & -1<x<0 \cr 1-x & 0<x<1 \cr 0 & \text{else} \end{cases}

2023/10/04 09:39 · pzhou

October 11 (Wednesday)

We will do many examples today to get intuition for what's Fourier transform is doing.

Discrete Fourier Transform

General Formula

Let NN be a positive integer.

Let 'x-space' be Vx=Z/NZ={0,1,,N1}V_x = \Z/ N \Z = \{0,1, \cdots, N-1\}, and then (rescaled) 'p-space' is also Vp=Z/NZV_p = \Z / N\Z, then we can build the Fourier transformation kernel K(x,p)=e2πi(xp/N):Vx×VpU(1) K(x,p) = e^{2\pi i (x p / N)} : V_x \times V_p \to U(1) where U(1)U(1) is the unit circle in complex number.

The kernel satisfies the orthonormal condition in both x and p variable. 1NxVxK(x,p1)K(x,p2)=δ(p1,p2) \frac{1}{N} \sum_{x \in V_x} K(x,p_1) \overline{K(x,p_2)} = \delta(p_1, p_2) 1NpVpK(x1,p)K(x2,p)=δ(x1,x2) \frac{1}{N} \sum_{p \in V_p} K(x_1,p) \overline{K(x_2,p)} = \delta(x_1, x_2)

Given a function f(x):VxCf(x): V_x \to \C, we can expand it as f(x)=pVpK(x,p)F(p) f(x) = \sum_{p \in V_p} K(x,p) F(p) for some function F(p):VpCF(p): V_p \to \C. Using the orthonormal condition, we get, for any qVpq \in V_p, we have (1/N)xVxf(x)K(x,q)=(1/N)xVxpVpK(x,p)F(p)K(x,q)=F(q). (1/N) \sum_{x \in V_x} f(x) \overline{K(x,q)} = (1/N) \sum_{x \in V_x} \sum_{p \in V_p} K(x,p) F(p) \overline{K(x,q)} = F(q). that is F(q)=(1/N)xVxf(x)K(x,q). F(q) = (1/N) \sum_{x \in V_x} f(x) \overline{K(x,q)}.

Fourier Transformation is a linear map between two function spaces

Let Fun(Vx,C)Fun(V_x, \C) be the space of functions from VxV_x to C\C. Similarly define Fun(Vp,C)Fun(V_p, \C). Concretely Fun(Vx,C)=CNFun(V_x, \C) = \C^N and Fun(Vp,C)=CNFun(V_p, \C) = \C^N.

Fourier transformation FTFT, sends an element f(x)Fun(Vx,C)f(x) \in Fun(V_x,\C) to an element F(p)Fun(Vp,C)F(p) \in Fun(V_p, \C). FTFT is a linear map.

If we define hermitian inner product on Fun(Vx,C)Fun(V_x,\C) as f,gx=(1/N)xVxf(x)g(x), \langle f, g\rangle_x = (1/N) \sum_{x \in V_x} f(x) \overline{g(x)}, and we define hermitian inner product on Fun(Vp,C)Fun(V_p,\C) as F,Gp=pVpF(p)G(p). \langle F, G \rangle_p = \sum_{p \in V_p} F(p) \overline{G(p)}. then we find that Fourier transformation is compatible with the two inner products, namely f,gx=F,Gp,F=FT(f),G=FT(g). \langle f, g \rangle_x = \langle F, G \rangle_p, \quad F = FT(f), G = FT(g).

Example 1: N = 2

A function f(x)f(x) is determined by its values f(0),f(1)f(0), f(1). Similarly for F(p)F(p). We have relations F(0)=(1/2)(f(0)+f(1)),F(1)=(1/2)(f(0)f(1)). F(0) = (1/2) (f(0) + f(1)), \quad F(1) = (1/2) (f(0) - f(1)). So, we can reconstruct f(x)f(x) from F(p)F(p), by f(0)=F(0)+F(1),f(1)=F(0)F(1). f(0) = F(0) + F(1), \quad f(1) = F(0) - F(1).

An important equality

1+(1)=0.1 + (-1) = 0. and less obviously 1+e2πi/3+e2πi(2/3)=01 + e^{2\pi i / 3} + e^{2\pi i (2/3)} = 0 more generally j=0N1e2πi(j/N)=0 \sum_{j=0}^{N-1} e^{2\pi i (j/N)} = 0

How to see this? You can say, this is the sum of all the NN-th roots of unity, and we have zN1=j=0N1(ze2πi(j/N)). z^N - 1 = \prod_{j=0}^{N-1} ( z - e^{2\pi i (j/N)}). hence by looking at the coefficient of zN1z^{N-1}, we see the sum of all the roots is 0.

Or, draw these roots as vectors on the complex plane, they show up as evenly distributed on the unit circle, since the summands are invariant under rotation by 2π/N2\pi/N, hence the result is invariant under such a rotation. And the only possible number is 0.

Example 2: N = 3

try it yourself.

2023/10/11 09:35 · pzhou

Homework 6

Due on Monday (Oct 9th)

1. Find the Fourier transformation of the following function. f(x)={10<x<10else f(x) = \begin{cases} 1 & 0<x<1 \cr 0 & \text{else} \end{cases}

2. Find the Fourier transformation of the following function. f(x)={1+x1<x<01x0<x<10else f(x) = \begin{cases} 1+x & -1<x<0 \cr 1-x & 0<x<1 \cr 0 & \text{else} \end{cases}

3. Let f(x)=a/(xi)+b/(x+i)+c/(x5i)f(x) = a / (x - i) + b / (x+i) + c / (x - 5i) for some complex numbers a,b,ca,b, c.

  • Describe for what choices of a,b,ca,b,c the function f(x)f(x) is absolutely integrable.
  • Take a=2,b=1,c=1a=2, b=-1, c=-1, where we know f(x)f(x) is integrable, compute its Fourier transformation.

4. Compute the inverse Fourier transform for F(p)=πep F(p) = \pi e^{-|p|} you should get back f(x)=1/(1+x2)f(x) = 1/(1+x^2).

(my convention is f(x)=12πF(p)eipxdp.f(x) = \frac{1}{2\pi} \int F(p) e^{ipx} dp. )

2023/10/06 12:05 · pzhou

October 6 (Friday)

Topics:

  • Fourier inversion formula
  • Fourier Series for periodic function
  • Interpretation of complex vector space, hermitian inner product, orthonormal basis.

Inversion Formula

Suppose you started from f(x)f(x), and did some hard work to get the Fourier transformation F(p)F(p). Can you recover f(x)f(x) from F(p)F(p)? Did you lose information when you throw away f(x)f(x) and only keep F(p)F(p)?

If f(x)f(x) is continuous and absolutely integrable, we can recover f(x)f(x) from F(p)F(p) by f(x)=12πpRF(p)eipxdp f(x) = \frac{1}{2\pi} \int_{p \in \R} F(p) e^{ipx} dp The proof of this theorem is beyond the scope of this class. You might be happy to just accept the formal 'rule' that 12πReipxipydp=δ(xy). \frac{1}{2\pi} \int_\R e^{ipx - ipy} dp = \delta(x-y). and that f(x)=δ(xy)f(y)dy f(x) = \int \delta(x-y) f(y) dy

We can try some example to see if it works.

Fourer Series

If the function f(x)f(x) is a periodic function, of period LL, meaning f(x)=f(x+L)f(x) = f(x+L), then we cannot do Fourier transform (why?), but instead, we need to do Fourier series.

We are not going to use all eipxe^{ipx} for all pp, but only those that satisfies eipx=eip(x+L)e^{ipx} = e^{ip(x+L)} have the same periodicity. Which mean pp needs to satisfy p=(2π/L)n p = (2\pi / L) n for some integer nn.

So, we define en(x)=ei(2π/L)nx. e_n(x) = e^{i(2\pi/L) n x}. We define the Fourer series coefficient as cn=1L0Lf(x)en(x)dx c_n = \frac{1}{L} \int_{0}^L f(x) \overline{e_n(x)} dx

Given these coefficient cnc_n, can we recover f(x)f(x)? Yes, under some smoothness condition of f(x)f(x), we have f(x)=nZcnen(x). f(x) = \sum_{n \in \Z} c_n e_n(x).

2023/10/05 21:14 · pzhou

October 4 (Wednesday)

What's coming in the second part of this course?

  • Fourier transform. Given f(x)f(x), we want to express f(x)=eikxg(k)dkf(x) = \int e^{ikx} g(k) dk, since eikxe^{ikx} is easy to deal with.
  • Laplace transform. Given f(t)f(t), on t[0,)t \in [0, \infty), we want to write f(t)=c+iReptF(p)dpf(t) = \int_{c + i \R} e^{pt} F(p) dp.
  • Gamma function, Stirling Formula

What is Fourier Transformation

When we solve equation of the form df(x)dx=λf(x), \frac{df(x)}{dx} = \lambda f(x), the general soluition is f(x)=ceλx. f(x) = c e^{\lambda x}. We say eλxe^{\lambda x} is an eigenfunction for the operator d/dxd/dx with eigenvalue λ\lambda, here λ\lambda can be any complex number.

  • For λ\lambda purely imaginary, λ=ik\lambda = i k, the function eikxe^{i k x}, which has constant size eikx=1|e^{ikx}| = 1.
  • For λ\lambda purely real, λR\lambda \in \R, the function eλxe^{\lambda x}, which is real, and has exponential growth (if λ>0\lambda > 0) or exponential decay.
  • For λ\lambda general complex number, say λ=a+ib\lambda = a + i b for a,bRa,b\in\R, then eλx=eaxeibxe^{\lambda x} = e^{ax} e^{ibx} has both oscillation factor eibxe^{ibx} and exponential growth/decay eaxe^{ax}.

If you give me a function f(x)f(x), we can try to write it as a linear combination of these easy to understand pieces eλxe^{\lambda x}. Say f(x)=Cc(λ)eλxdλ f(x) = \int_{C} c(\lambda) e^{\lambda x} d\lambda The benefit for doing this? If a differential operator d/dxd/dx walk to it, we would have (d/dx)f(x)=λc(λ)(d/dx)eλxdλ=λc(λ)λeλxdλ. (d/dx) f(x) = \int_{\lambda} c(\lambda) (d/dx) e^{\lambda x} d\lambda = \int_{\lambda} c(\lambda) \lambda e^{\lambda x} d\lambda. Of course, you would immediately complain:

  • what is this integration contour CC? Is it along the real axis of λ\lambda? Is it along the imaginary axis of λ\lambda?
  • Why we can switch the order of integration and differentiation?

Let's keep these questions in our head, we will return to those.

So, what is Fourier transformation? If you go on wiki, or open some textbook, you see the following definition: given a function f(x)f(x) (with some condition on it), we can define F(p):=xRf(x)eipxdx. F(p) := \int_{x \in \R} f(x) e^{-ipx} dx. This is called the Fourier transformation.

Let's throw in some input and see what we get.

Example 1

f(x)=cosh(x)=(ex+ex)/2. f(x) = \cosh(x) = (e^{x} + e^{-x} )/2. This function grows to infinity when x±x \to \pm \infty, indeed, when x+x \to +\infty, exe^x dominate, and xx \to -\infty we have exe^{-x} dominate. Either way, you blow up. Good luck when integrating Rf(x)dx\int_\R f(x) dx.

But, let's try to do the Fourier transformation anyway. We get F(p)=xf(x)eipxdx=(1/2)Re(1ip)xdx+(1/2)Re(1ip)xdx. F(p) = \int_x f(x) e^{-ipx} dx = (1/2) \int_\R e^{(1-ip)x} dx + (1/2) \int_\R e^{(-1-ip)x} dx. OK, we cannot continue.

Lesson 1

f(x)f(x) need to have sufficient 'decay' near infinity for the Fourier transformation to make sense. More precisely, a sufficient condition is that f(x)f(x) is 'absolutely integrable', which means Rf(x)dx<. \int_\R |f(x)|dx < \infty. Given this condition, we know F(p)=Reipxf(x)dxReipxf(x)dx=Rf(x)dx<. |F(p)| = | \int_\R e^{-ipx} f(x) dx | \leq \int_\R |e^{-ipx} f(x)| dx = \int_\R |f(x)| dx < \infty. so we are safe.

Example 2

The Gaussian. f(x)=ex2.f(x) = e^{-x^2}. It decays pretty nicely in both directions.

Since we learned our lesson, we need to do a check first Rex2dx=π. \int_\R e^{-x^2} dx = \sqrt{\pi}. Great, it is finite.

Now, let's Fourier transform. F(p)=eipxx2dx=Re(xip/2)2p2/4dx=ep2/4uip/2+Reu2du F(p) = \int e^{-ipx - x^2} dx = \int_\R e^{- (x-ip/2)^2 - p^2/4} dx = e^{-p^2/4} \int_{u \in -ip/2+\R} e^{-u^2} du where we used the new variable u=ip/2+xu = -ip/2+x.

We can move the contour for uu as long as the integral is convergent. Recall from last Wednesday's lecture, eu2e^{-u^2} decays fast to 00 when u|u| \to \infty in the sectors arg(u)(π/4,π/4)\arg(u) \in (-\pi/4, \pi/4) and arg(u)π+(π/4,π/4)\arg(u) \in \pi + (-\pi/4, \pi/4). So, we are going to move the integration contour of uu from the shifted real line ip/2+R-ip/2+\R back to R\R. We get uip/2+Reu2du=uReu2du=π. \int_{u \in -ip/2+\R} e^{-u^2} du = \int_{u \in \R} e^{-u^2} du = \sqrt{\pi}. Thus, we get F(p)=πep2/4. F(p) = \sqrt{\pi} e^{-p^2/4}.

Success!

Example 3

Let f(x)=1/(1+x2)f(x) = 1/(1+x^2). Let's check that f(x)f(x) is absolutely integrable first Rf(x)dx=CRf(z)dz=2πiResz=if(z)=2πi12i=π. \int_\R f(x) dx = \int_{C_R} f(z) dz = 2\pi i Res_{z=i} f(z) = 2\pi i \frac{1}{2i } = \pi. where C+,RC_{+,R} is the contour consist of two part

  • [R,R][-R, R]
  • a semi-circle in the upper half plane of radius RR.

Equivalently, we can choose a different contour C,RC_{-,R}, which also consist of two part

  • [R,R][-R, R]
  • a semi-circle in the lower half plane of radius RR.

Note that when we go around C,RC_{-,R} it goes around the singularity of f(z)f(z) at z=iz=-i in the 'negative' (clockwise) direction, hence we get C,Rf(z)dz=(2πi)Resz=if(z)=2πi12i=π. \int_{C_{-,R}} f(z) dz = (-2\pi i) Res_{z=-i} f(z) = -2\pi i \frac{1}{-2i} = \pi. Whew! the two minus sign cancels, we get the same answer.

Now, let's compute the little variation F(p)=Reipxf(x)dx. F(p) = \int_\R e^{-ipx} f(x) dx. We first take the 'truncation' approximation, which recovers the original limit under the limit RR \to \infty. F(p)=limRRReipxf(x)dx. F(p) = \lim_{R \to \infty} \int_{-R}^R e^{-ipx} f(x) dx. Then, we try to 'close the contour', by connecting the point RR to R-R along some way. Due to this exponential factor eipze^{-ipz}, it matters whether we close the contour in the upper half-plane, or the lower one. Indeed, we have eipz=eRe(ip(x+iy))=eRe(ipx+py)=epy=epIm(z). |e^{-ipz}| = e^{Re(-ip(x+iy))} = e^{Re(-ipx + py)} = e^{py} = e^{p Im(z)}. So,

  • if p0p \geq 0, to avoid eipz|e^{-ipz}| blow up to infinity, we need to keep Im(z)Im(z) bounded from above on the contour.
  • if p0p \leq 0, to avoid eipz|e^{-ipz}| blow up to infinity, we need to keep Im(z)Im(z) bounded from below on the contour.

Thus, for p0p \geq 0, we can complete the by the lower-half-semicircle C,RC_{-,R}. We get (p0)F(p)=C,Reipz1+z2dz=(2πi)Resz=ieipz1+z2=πep. (p\geq 0) F(p) = \int_{C_{-,R}} \frac{e^{-ipz}}{1+z^2} dz = (-2\pi i) Res_{z=-i} \frac{e^{-ipz}}{1+z^2} = \pi e^{-p}. Similarly, for p0p \geq 0, we get (p0)F(p)=C+,Reipz1+z2dz=(2πi)Resz=ieipz1+z2=πep. (p\leq 0) F(p) = \int_{C_{+,R}} \frac{e^{-ipz}}{1+z^2} dz = (2\pi i) Res_{z=i} \frac{e^{-ipz}}{1+z^2} = \pi e^{p}. We can write the result in a cool way as F(p)=πep. F(p) = \pi e^{-|p|}. So when p|p| \to \infty, we see F(p)0F(p) \to 0 very quickly.

Exercise

warm up:Does the function f(x)=1f(x)=1 admits Fourier transformation? Why? How about f(x)=1/(1+x)f(x) = 1 / (1+|x|)?

Find the Fourier transformation of the following functions. f(x)={10<x<10else f(x) = \begin{cases} 1 & 0<x<1 \cr 0 & \text{else} \end{cases}

f(x)={1+x1<x<01x0<x<10else f(x) = \begin{cases} 1+x & -1<x<0 \cr 1-x & 0<x<1 \cr 0 & \text{else} \end{cases}

2023/10/04 09:39 · pzhou

<< Newer entries | Older entries >>

2023/10/04 09:31 · pzhou

<< Newer entries | Older entries >>

math121a-f23/blog.txt · Last modified: 2023/10/04 09:31 by pzhou