📚 Fourier Transform: Core Principles for IB Mathematics | 傅里叶变换的基本原理
The Fourier transform is one of the most powerful tools in modern mathematics and physics. For IB Mathematics students, understanding its core principles bridges the gap between calculus, complex numbers, and real-world applications such as signal processing and quantum mechanics.
傅里叶变换是现代数学和物理学中最强大的工具之一。对于IB数学学生而言，理解其基本原理能够将微积分、复数与实际应用（如信号处理和量子力学）联系起来。
1. What is a Fourier Transform? | 什么是傅里叶变换？
At its heart, the Fourier transform takes a function of time and expresses it as a continuous combination of sinusoidal waves. It answers the question: “Which frequencies are present in this signal, and how strong are they?”
傅里叶变换的核心是将时间的函数表示为一系列正弦波的连续组合。它回答了这样一个问题：“这个信号中包含哪些频率，它们的强度如何？”
Unlike the Fourier series, which works only for periodic functions, the Fourier transform applies to non-periodic functions as well. This makes it ideal for analysing transient signals, pulses, and noise.
与仅适用于周期函数的傅里叶级数不同，傅里叶变换也适用于非周期函数。这使得它非常适合分析瞬态信号、脉冲和噪声。
2. From Fourier Series to Fourier Transform | 从傅里叶级数到傅里叶变换
Recall that a periodic function with period T can be written as a sum of sines and cosines with discrete frequencies. The Fourier series coefficients are obtained by integrating the function over one period.
回顾一下，周期为 T 的周期函数可以写成具有离散频率的正弦和余弦之和。傅里叶级数的系数是通过在一个周期内对函数进行积分得到的。
For non-periodic functions, we let T approach infinity. The discrete frequencies become a continuous spectrum, and the infinite sum becomes an integral. This transition leads directly to the Fourier transform.
对于非周期函数，我们令 T 趋于无穷大。离散频率变成连续频谱，无穷级数变成积分。这一过渡直接引出了傅里叶变换。
F(ω) = ∫₋∞⁺∞ f(t) e−iωt dt
Here, ω is the angular frequency, and i is the imaginary unit. The function F(ω) is called the spectrum of f(t).
这里 ω 是角频率，i 是虚数单位。函数 F(ω) 称为 f(t) 的频谱。
3. Definition of the Fourier Transform | 傅里叶变换的定义
The forward Fourier transform is defined as shown above. It maps a time-domain function f(t) into the frequency domain F(ω). For the transform to exist, f(t) must be absolutely integrable, meaning the integral of |f(t)| from −∞ to +∞ is finite.
正变换如上式定义。它将时域函数 f(t) 映射到频域 F(ω)。变换要存在，f(t) 必须绝对可积，即 |f(t)| 从 −∞ 到 +∞ 的积分有限。
There are different conventions. Some use a factor of 1/√(2π) in front of both forward and inverse transforms. In physics and engineering, the definition above is common. Always check the convention used in your syllabus.
这里存在不同的约定。有的在正变换和逆变换前都加 1/√(2π) 的因子。在物理和工程中，上述定义较为常见。务必确认你的课程大纲所使用的约定。
F(ω) = ∫₋∞⁺∞ f(t) e−iωt dt
The variable t is often time, but it can represent spatial position x. In that case, ω is replaced by a spatial frequency called the wave number k.
变量 t 通常是时间，但也可以表示空间位置 x。此时 ω 被替换为空间频率，即波数 k。
4. The Inverse Fourier Transform | 傅里叶逆变换
Given the spectrum F(ω), we can recover the original function using the inverse transform. It reconstructs f(t) by integrating over all frequencies.
给定频谱 F(ω)，我们可以利用逆变换恢复原始函数。它通过对所有频率积分来重构 f(t)。
f(t) = (1 / 2π) ∫₋∞⁺∞ F(ω) eiωt dω
Notice the factor 1/(2π) appears in the inverse formula. This balances the energy between the two domains. Without it, the round-trip would not return the original function.
注意逆变换公式中包含因子 1/(2π)。这平衡了两个域之间的能量。如果没有该因子，往返变换将无法恢复原函数。
5. Key Properties | 主要性质
The Fourier transform behaves linearly: the transform of a sum equals the sum of the transforms. This makes it easy to analyse complicated signals built from simple parts.
傅里叶变换具有线性性质：和的变换等于变换之和。这使得分析由简单部分构成的复杂信号变得容易。
- Linearity | 线性性: If g(t) = a f(t) + b h(t), then G(ω) = a F(ω) + b H(ω).
- Time shift | 时移: f(t − t₀) transforms to e−iωt₀ F(ω).
- Frequency shift | 频移: eiω₀t f(t) transforms to F(ω − ω₀).
- Scaling | 尺度变换: f(at) transforms to (1/|a|) F(ω/a).
- Convolution | 卷积定理: The transform of a convolution f * g equals F(ω) G(ω).
These properties are essential for solving differential equations and filtering signals. They also appear in IB extended essays and higher-level projects.
这些性质对于求解微分方程和信号滤波至关重要。它们也常出现在IB拓展论文和高难度课题中。
6. Worked Example: Rectangular Pulse | 实例：矩形脉冲
Consider the function f(t) which equals 1 for −a ≤ t ≤ a and 0 otherwise. This is a rectangular pulse. Its Fourier transform reveals the frequency content of such a pulse.
考虑函数 f(t)，当 −a ≤ t ≤ a 时等于 1，否则为 0。这是一个矩形脉冲。其傅里叶变换揭示了该脉冲的频率成分。
F(ω) = ∫₋ₐᵃ 1 · e−iωt dt = [e−iωt / (−iω)] from −a to a
Evaluating the integral gives:
计算积分得到：
F(ω) = (2 sin(ωa)) / ω = 2a · sinc(ωa)
Here, sinc(x) = sin(x)/x. The spectrum decays as 1/ω, showing that a sharp pulse contains high-frequency components.
这里 sinc(x) = sin(x)/x。频谱按 1/ω 衰减，说明陡峭的脉冲包含高频分量。
7. Fourier Transform of a Gaussian | 高斯函数的傅里叶变换
The Gaussian function f(t) = e−t² is especially important because its Fourier transform is another Gaussian. This property is crucial in probability and quantum mechanics.
高斯函数 f(t) = e−t² 尤其重要，因为它的傅里叶变换仍是高斯函数。这一性质在概率论和量子力学中至关重要。
F(ω) = ∫₋∞⁺∞ e−t² e−iωt dt = √π · e−ω²/4
This shows that narrow functions produce broad spectra and vice versa. This is the mathematical origin of the Heisenberg uncertainty principle.
这表明窄函数产生宽的频谱，反之亦然。这正是海森堡不确定性原理的数学根源。
8. Common Pitfalls and Exam Tips | 常见错误与考试建议
IB students often forget the factor of 1/(2π) in the inverse transform. Always write the definition from your formula booklet and match the convention.
IB学生经常忘记逆变换中的因子 1/(2π)。始终从公式册中写出定义，并匹配其约定。
- Check integrability | 检查可积性: f(t) must be absolutely integrable for the standard transform to exist.
- Use Euler’s formula | 使用欧拉公式: e−iωt = cos(ωt) − i sin(ωt) when separating real and imaginary parts.
- Even functions | 偶函数: If f(t) is even, the transform is real and only involves cosines.
- Odd functions | 奇函数: If f(t) is odd, the transform is purely imaginary and involves sines.
In IB examinations, you will not be asked to compute a full Fourier transform from scratch unless the integral is simple. Focus on understanding properties and interpreting results.
在IB考试中，除非积分很简单，否则不会要求你从头计算完整的傅里叶变换。重点在于理解性质并解释结果。
9. Applications and Further Study | 应用与进阶学习
Fourier transforms are used everywhere: audio compression, medical imaging, solving partial differential equations, and studying wave phenomena.
傅里叶变换无处不在：音频压缩、医学成像、求解偏微分方程以及研究波动现象。
For students wishing to explore further, the discrete Fourier transform (DFT) and the fast Fourier transform (FFT) are practical algorithms used in computers. These are natural extensions of the continuous theory described here.
希望进一步探索的学生可以学习离散傅里叶变换（DFT）和快速傅里叶变换（FFT），它们是计算机中使用的实际算法，也是此处连续理论的自然延伸。
Mastering the principles of the Fourier transform gives you a deeper understanding of how mathematics connects to the physical world.
掌握傅里叶变换的基本原理，将帮助你更深入地理解数学如何与物理世界相连接。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply