📚 Educational Theory: Sampling Density & Discrete Fourier Approximations
How numerical discrete samples $M$ approximate continuous integrals and introduce Nyquist limits.
1. Discrete Summation Approximation (Trapezoidal Rule)
When dealing with $M$ discrete data points sampled at $x_k = \frac{2\pi k}{M}$, we approximate continuous Fourier integrals using discrete Riemann / trapezoidal sums:
As the number of data points $M \to \infty$, this approximation converges directly to the exact continuous Fourier series coefficients.
2. The Nyquist-Shannon Sampling Constraint & Aliasing
By the Nyquist-Shannon sampling theorem, to resolve a harmonic of frequency $n$, your discrete sampling frequency must be at least twice the frequency of that harmonic:
Try lowering the sample slider to $M = 16$ while requesting $N = 25$ harmonics. Notice how higher harmonics fail to resolve or alias into spurious lower frequencies.