The Fourier Transform and the Infinite Rod
With no ends to pin things down, an infinite rod can hold every frequency, not just multiples of , so the Fourier series turns into an integral. Each frequency still just fades on its own, and putting them back together shows that heat spreads out from every point as a widening bell curve, the heat kernel.
What the symbols mean
- Fourier transform
How much of the frequency ω is in f.
- Frequency
A continuous range now, not just multiples of π/L.
What the symbols mean
- Initial temperature
At position s.
- Spread
The Gaussian's variance is 2kt, so its width grows like √t.
Explanation
The Fourier transform is simply a way of listing how much of each frequency is in a function, for every , the way a Fourier series did but with every frequency allowed instead of just a few. It's called a "transform" because it turns a function of position into a function of frequency, and the "heat kernel" gets its name because it's the core function everything else is built from. It's good for problems with no ends in sight, like a very long rod, a wide channel of water, or a photo. All we're really saying is that heat dropped on a long rod spreads into a bell curve that gets wider and flatter over time, and any starting temperature is just lots of those bell curves added up. The solution formula looks scary, but it's three parts: (how much heat starts at the spot ), (the bell curve that heat turns into, centered at , getting wider as grows) and (add up the contribution from every starting spot). It's fewer moving parts than it looks; bear with it.
Why series stop working. On a rod of length , the boundary conditions only allowed frequencies . Now let grow without bound. Those allowed frequencies get packed closer and closer together until every is allowed, and the sum over turns into an integral over . That's all the Fourier transform is: the Fourier series of a function on an infinitely long interval.
Derivatives become multiplication. Integrate by parts and the transform of comes out as , so becomes . That's the same thing that happened with series, where two derivatives of just multiplied it by . The heat equation becomes , a plain first-order ODE for each frequency, with solution . High frequencies die fastest, just as with Fourier series.
The heat kernel. Transforming back, multiplication by becomes convolution with the Gaussian . Each point's initial heat spreads out as a bell curve whose width grows like and whose total area stays 1. The area staying 1 makes sense: heat isn't created or destroyed, only moved around.
Infinite speed. At any the kernel is positive everywhere: a little heat is felt instantly at any distance. It's a modeling idealization; the amounts far away are astronomically small.
A common mistake. It's tempting to think doubling the time doubles how far heat spreads. It doesn't. The width grows like , so to spread twice as far you have to wait four times as long. That square root is why diffusion feels quick over a millimeter and hopelessly slow over a meter.
See it
Worked examples
Find the height of the heat kernel at when , .
- 1
With the prefactor is , and at the exponent is , so the value is .
Practice
Type your answer and check it. Solve them all to complete the lesson.
Find the heat kernel's value at for , .
Write the heat kernel for .
How much longer does it take for the kernel's width to double?
What is the Fourier transform of ?
Find the total heat .
A drop of dye spreads along a long, narrow water channel with diffusivity m²/s (no current). Its spread, the standard deviation of the heat kernel, is . How wide is after one day, in centimeters?
The heat kernel is a normal distribution with variance . For and , what fraction of the heat lies within ?
The hardest one here. Get it, and you've got this lesson.
Solve the heat equation on the whole real line with . (Smearing a Gaussian with a Gaussian kernel gives another Gaussian.)
Where it's used
The heat kernel is Gaussian blur in image editing; the Fourier transform underlies signal processing, MRI reconstruction, spectroscopy and the fast algorithms (FFT) that make them practical.