Nyquist–Shannon sampling theorem Created 2026-10-05 Updated 2026-10-14
The Nyquist–Shannon sampling theorem says that a bandlimited function can be recovered exactly from equally spaced samples, provided the sampling rate is high enough. It is the bridge between a continuous waveform and a sequence of numbers: the missing values between samples are determined by the restriction on its frequencies.
Here is a precise finite-energy version. Let , meaning , and suppose its Fourier transform, defined through the Plancherel theorem, is zero outside . Thus is the largest allowed ordinary frequency, in cycles per second, rather than an angular frequency. Set , where is the number of samples per second. If , the continuous representative of is recovered by
The quotient is the normalized sinc function, with value one when its argument is zero. Each shifted sinc function is one at its own sampling time and zero at every other sampling time. Its coefficient is therefore exactly the required sample value. For this L2 space formulation, the reconstruction converges in the L2 space norm and uniformly in . The critical rate is allowed for this class; choosing leaves a gap between the occupied frequencies and the sampling boundary.
For a numerical example, a bandlimited function with no frequencies above cycles per second can be reconstructed from its samples every seconds: . Exact reconstruction uses the whole sequence indexed by . A finite recording and a finite sum of sinc functions introduce truncation error; joining adjacent samples by straight lines is generally a different reconstruction.
The obstruction is aliasing. At sampling rate , the two distinct waveforms
have identical samples at , because
The samples alone cannot tell whether the waveform oscillates twice or eight times per second. If we know in advance that all frequencies are below , the -cycle waveform is excluded and the ambiguity disappears. These pure cosines are an illustrative aliasing example, rather than members of the finite-energy L2 space class in the stated theorem.
Figure 1.
Two and eight cycles per second are distinguishable at twenty samples per second but alias at ten
. Details.
Exactly at a sampling boundary, the function class matters. At rate , the sine has zero values at every . It is a nonzero waveform indistinguishable from zero on that grid, but has infinite energy and is excluded by the finite-energy hypothesis above. This explains why a rule intended to cover arbitrary pure sinusoids should demand a strict inequality. For spatial data, replace seconds by distance: the Nyquist spatial frequency is for sample pitch .
The proof idea is short: the samples are Fourier coefficients of the Fourier transform restricted to a sampling-sized frequency interval. Because a bandlimited function has no contribution outside that interval, its Fourier series determines the whole Fourier transform; Fourier inversion then gives the sinc function expansion. See sampling expansion by periodic Fourier projection for this connection.
Claude E. Shannon's Communication in the Presence of Noise (1949), Section II, Theorem 1 and equation (7), gives the sampling statement and reconstruction using shifted sinc functions in a communication setting. Shannon explicitly notes earlier mathematical forms and credits Nyquist with emphasizing the sampling interval in telegraphy.[ref]
Use and interpret the regularity assumption to include with the continuous representative furnished by Fourier inversion. Write . The bandwidth assumption implies as well as , by the Cauchy-Schwarz inequality on its finite support, so
is continuous and defined at every . The integer samples are precisely the Fourier coefficients of with the sign convention appropriate to the basis :
The completeness and Parseval identity for the exponential orthonormal basis on give in and
The last equality is the Plancherel theorem. Apply the inverse integral to the finite symmetric Fourier partial sums. Since
we obtain the Nyquist–Shannon sampling theorem in this normalization:
where the quotient is one at . This is a sampling expansion by periodic Fourier projection, not merely an almost-everywhere inversion. Indeed, the inverse integral of an error is bounded, uniformly in , by . Hence the symmetric finite sampling sums converge uniformly on all of . Moreover, the Parseval identity applied to gives
The Cauchy-Schwarz inequality therefore makes the sampling series absolutely convergent at every , with its absolute tail bounded uniformly by . Thus the integer samples recover the function everywhere.
For the nonuniqueness beyond this bandwidth, fix and a nonzero smooth function compactly supported in . Let be its inverse Fourier transform and put
The function , and hence , is a Schwartz function. The two shifted spectral supports are disjoint, so , but its support is contained strictly inside . Every integer sample of is zero. Therefore and the zero function have identical samples but are distinct, providing a strictly supercritical sampling alias counterexample for every positive bandwidth enlargement.
Use the transform convention . The given Fourier inversion theorem gives
Here is continuous, vanishes at both endpoints and belongs to . It therefore defines a continuous periodic function. Its Fourier coefficient at index is . By part (i),
Pair this convergence with . Since that function has normalized norm one, the Cauchy-Schwarz inequality yields, uniformly in ,
The elementary integral is the sinc function,
Thus the sampling expansion by periodic Fourier projection is
There is no pointwise interchange with an unproved Fourier series: the calculation first uses finite sums and then an limit.
The convergence can also be made absolute. Parseval's identity gives , and Bessel's inequality applied to gives . Hence
uniformly in . At an integer argument, is one at zero and zero at the other integers, so the expansion interpolates the samples exactly.