From Heat to Harmony
Joseph Fourier's 1822 insight was radical: any periodic function, no matter how jagged, can be represented as a sum of smooth sine waves. He developed this theory to solve the heat equation, but it became one of the most powerful tools in all of mathematics. Today, Fourier analysis underpins everything from MRI scanners to streaming music.
Building Waves from Circles
Each term in a Fourier series corresponds to a rotating circle (epicycle) with a specific radius and frequency. When you chain these circles together, the tip of the last one traces the target waveform. Adding more circles (harmonics) produces a more accurate approximation. This simulation shows both the epicycle mechanism and the resulting waveform.
The Gibbs Phenomenon
No matter how many Fourier terms you add, the approximation of a discontinuous function (like a square wave) always overshoots by about 9% at the jump. This Gibbs phenomenon is a fundamental property of Fourier convergence at discontinuities. The ringing narrows but never disappears — a deep result about the nature of function approximation.
Modern Applications
The Fast Fourier Transform (FFT) algorithm, developed by Cooley and Tukey in 1965, made Fourier analysis computationally practical. It reduces the complexity from O(N squared) to O(N log N), enabling real-time audio processing, image compression, and spectral analysis. Every digital device you own relies on FFT thousands of times per second.