A function periodic with period 2L has the complex Fourier series
f(x)=∑n=−∞∞cneiknx,kn=Lnπ,cn=2L1∫−LLf(x)e−iknxdx.
Why this form? The waves eiknx are orthogonal over one period, so cn is just the "projection" of f onto that wave.
Now let L→∞. The spacing between frequencies is Δk=kn+1−kn=Lπ→0. Define
f^(k)=∫−∞∞f(x)e−ikxdx(the 2Lcn in the limit).
Substitute cn=2πΔkf^(kn) into the series:
f(x)=∑n2πΔkf^(kn)eiknxΔk→02π1∫−∞∞f^(k)eikxdk.
The Riemann sum became an integral. That gives us the pair:
Recall Why is the inverse the "same" integral with
+ik and a 1/2π?
Because the waves are orthogonal: ∫−∞∞ei(k−k′)xdx=2πδ(k−k′). Plugging f^ into the inverse and using this delta collapses the double integral back to f(x). The 2π from the delta is what the 1/2π cancels.
What is the forward Fourier transform (our convention)?
f^(k)=∫−∞∞f(x)e−ikxdx
What is the inverse Fourier transform?
f(x)=2π1∫−∞∞f^(k)eikxdk
F{f′(x)}=?
ikf^(k) (assuming f→0 at ±∞)
F{f(n)}=?
(ik)nf^(k)
F{f(x−a)}=?
e−ikaf^(k) (phase shift, magnitude unchanged)
F{eik0xf(x)}=?
f^(k−k0) (spectral shift)
F{f(ax)}=?
∣a∣1f^(k/a)
Convolution theorem: F{f∗g}=?
f^(k)g^(k)
Parseval's theorem?
∫∣f∣2dx=2π1∫∣f^∣2dk
Fourier transform of e−x2/2?
2πe−k2/2 (Gaussian is an eigenfunction)
Fourier transform of a box of half-width a?
k2sin(ka)=2asinc(ka)
Why is FT useful in PDEs?
It converts dxd into ×ik, turning a PDE into an algebraic/ODE problem
What is ∫−∞∞ei(k−k′)xdx?
2πδ(k−k′) (orthogonality of waves)
Recall Feynman: explain to a 12-year-old
Imagine a song. Your ear hears it as a mess of pressure over time — that's f(x). But a music app shows you bars: how much bass, how much treble. That picture of "how much of each pitch" is the Fourier transform f^(k). The song and the bar chart hold the same information, just shown two ways. The cool trick: some problems that look horrible as a song become super easy as a bar chart — like figuring out how a hot bar of metal cools down. You switch to the bar chart, do easy arithmetic on each bar, then switch back. That switching machine is the Fourier transform.
Dekho, Fourier transform ka basic idea simple hai: koi bhi function f(x) ko hum alag-alag frequencies ke waves ka mixture maan sakte hain. f^(k) basically batata hai ki frequency k ki kitni "matra" us function mein hai. Jaise gaane mein bass aur treble kitna hai — wahi cheez maths mein f^(k) hai. Fourier series periodic function ke liye discrete frequencies deti hai, aur jab period ko infinite kar do, toh sum integral ban jaata hai — yahi se Fourier transform nikalta hai.
PDEs mein iska sabse bada faayda yeh hai: derivative dxd transform lene par sirf ik se multiply ho jaata hai. Matlab ek mushkil differential equation, frequency space mein ek simple algebra/ODE ban jaati hai. Jaise heat equation ut=αuxx — transform lo, har k ke liye chhoti si ODE solve karo (u^=f^e−αk2t), phir wapas inverse transform lo, aur Gaussian heat kernel khud aa jaata hai. Magic!
Properties yaad rakhne layak hain: shift in x se sirf phasee−ika aata hai (magnitude same), scaling mein x squeeze karoge toh k stretch hoga (yahi uncertainty principle hai), aur convolution real space mein = simple multiplication frequency space mein. Gaussian apna khud ka transform hai (eigenfunction), aur box function ka transform sinc banta hai — sharp edge matlab high frequencies zaroori.
Sabse common galti: log ik ke jagah sirf k likh dete hain — i mat bhoolna, warna heat equation decay ke jagah grow karne lagegi. Aur convolution theorem mein convolution → multiply hota hai, convolution → convolution nahi. Bas convention (yeh 1/2π inverse mein) shuru mein clear kar lo aur consistent raho.