Autocorrelation of a square-integrable function Created 2026-10-18 Updated 2026-10-20
This deterministic, unnormalized cross-correlation of a function with itself exists for every shift when , by the Cauchy-Schwarz inequality. It satisfies and . With Fourier transform convention , its transform is , in the tempered distribution sense when the correlation is not integrable. Fourier inversion at zero gives the Parseval identity, first for Schwartz functions and then by approximation in L2 space. Unlike the normalized statistical autocorrelation, its value at zero is not generally one.
Cauchy principal value Created 2026-09-24 Updated 2026-10-14
The Cauchy principal value assigns an integral a value by a specified symmetric limit. Its simplest example is on : delete , integrate what remains, and obtain zero for every . The positive signed area under a graph cancels the negative one, although each grows without bound as the gap closes. This is a useful cancellation rule, but it does not make the ordinary improper integral exist.
Figure 1.
Equal local cutoffs cancel the signed areas of 1/x; unequal cutoffs leave a logarithmic remainder, even when both shrink to zero
. Details.
Precisely, let be finite and suppose that the two truncated integrals below exist for every sufficiently small . The local Cauchy principal value at is
provided the combined limit is finite. The same removes equal distances on the two sides of ; the outer endpoints need not be equally distant from . By contrast, the ordinary improper integral requires both one-sided limits to be finite separately before adding them. Whenever those separate limits exist, the Cauchy principal value agrees with their sum.[ref]
For , the natural logarithm gives
Their sum is zero at every positive cutoff, so . This calculation adds two finite truncated integrals and then takes a limit; it never assigns a meaning to . If the left and right deletion widths are instead and , then
Thus a ratio tending to produces : choosing gives , and choosing makes the sum tend to . Both widths can tend to zero without selecting a unique answer. The local Cauchy principal value selects the ratio .
Unequal outer endpoints leave a finite contribution even with symmetric local deletion. For ,
More generally, for a function with continuous derivative on , subtract its value at the possible simple pole:
The quotient in the last integral extends continuously to at . This formula explains both the cancellation and a practical way to compute it: integrate a continuous remainder instead of subtracting two large, nearly equal divergent contributions.
A finite Cauchy principal value is weaker than absolute convergence. Indeed,
Taking the absolute value destroys the cancellation. Even the Cauchy principal value need not exist: gives on the same truncated interval. Absolute integrability makes the cutoff prescription unnecessary; an ordinary improper integral can also converge without absolute convergence, as the Dirichlet integral illustrates. The three notions should therefore be checked separately.
There is an independent Cauchy principal value at infinity. For a function integrable on every finite interval, define
when the limit is finite. The ordinary improper integral instead requires convergence of the two tails separately.[ref] For example, the odd function has no finite singularity and its symmetric integral is always zero, whereas its two tails diverge. Unequal truncations give
Letting as yields . Symmetry at infinity is therefore a separate choice from symmetry near a finite pole. When both are needed, state both prescriptions, for example first take the local Cauchy principal value at fixed and then let ; coupling the two cutoffs requires its own justification.
The local cancellation also defines the principal-value reciprocal distribution. Since is not a locally integrable function across zero, its action on a test function is prescribed by
The test function is smooth with compact support, so the last numerator removes the singular constant contribution: its quotient tends to at zero and vanishes sufficiently far away. This defines a distribution, not a finite pointwise value of at zero. It extends to Schwartz functions as a tempered distribution, and is also the distributional derivative of the logarithmic modulus.[ref] Using an asymmetric local cutoff ratio would add to this action, equivalently adding times the Dirac delta function. Thus the cutoff choice matters even after passing to distributions.
Why keep this prescription? A Fourier transform naturally encounters such a kernel. With , pairing and gives, for and ,
The cosine contribution is an odd function and cancels locally; the sine contribution has a removable singularity and its tail converges by the Dirichlet integral. This is the Fourier transform of a principal-value reciprocal, with the sign function. The displayed computation is a prescribed limit for each nonzero ; the corresponding Fourier transform identity is understood as an identity of tempered distributions, rather than the transform of an absolutely integrable reciprocal function.
Figure 2.
Fourier cancellation for 1/x: the odd cosine contribution disappears, the sine contribution approaches minus i times pi, and the Hilbert transform turns a cosine into a sine
. Details.
The Hilbert transform uses exactly this principal-value reciprocal distribution as a convolution kernel. In the convention already used here,
for Schwartz functions , with the second identity interpreted through tempered distributions. Hence the singular integral has a simple description as a Fourier multiplier.[ref] For the bounded pure tone with , the same calculation with symmetric deletion about and symmetric truncation of at infinity gives and . These tones lie outside the Schwartz space; their prescribed Cauchy principal values explain the quarter-cycle shift in the figure. Both figures are calculated mathematical illustrations. Reversing the Hilbert denominator reverses these signs; NIST uses that opposite convention.[ref]
For and , define . Translations are smooth in the Schwartz space, so every derivative is . The finite-seminorm continuity estimate for implies for one . Thus the result is a smooth function defining a tempered distribution, but it need not be a Schwartz function: when . If both factors are radial, testing the rotation action on the translated shows that the convolution is radial.
For arbitrary real , the convolution of and has a canonical definition as a tempered distribution. With , write and , both in the L2 space. Then by Cauchy-Schwarz inequality, and
Thus the product defines a tempered distribution, and the displayed inverse Fourier transform defines . This extends ordinary convolution of Schwartz functions by the convolution theorem and density in the Sobolev norm.
The result need not belong to any Sobolev space, even when both inputs belong to every Sobolev space. For , each weighted squared input is integrable, but the squared product is , which is not locally integrable at zero. Every weight is bounded above and below there, proving the failure for all real .
Cross-correlation Created 2026-10-18 Updated 2026-10-20
For this sign convention, cross-correlation compares a function with translated copies of another, conjugating the first factor. If , Fubini's theorem gives Fourier transform . Indeed, the substitution factors the double integral into and . The zero-lag value for is the squared L2 norm. Fourier inversion applied to this correlation proves the Parseval identity, first for Schwartz functions and then by density for L2 space.
Edgeworth series Created 2026-10-05 Updated 2026-11-05
An Edgeworth expansion refines the central limit theorem by adding corrections determined by higher cumulants. Let be independent and identically distributed with mean zero, variance and skewness . For the standardized sum , the first density correction is
Here is the standard normal density. This is an asymptotic statement for a sequence, not a universal density formula for one arbitrary random variable. Sufficient smoothness and moment conditions are needed; one strong sufficient setting is that the common probability density function is a non-degenerate Schwartz function. In that setting the displayed remainder is valid for each fixed . Lattice-valued variables need additional corrections rather than this density formula.[ref]
To identify the coefficient, expand the log characteristic function of the standardized sum:
for fixed . Exponentiation and Fourier inversion turn into the Hermite polynomial times . The smoothness assumptions justify inversion beyond this formal calculation. Higher-order terms use further cumulants and Hermite polynomials.
The approximation improves central asymptotics, but it need not be a nonnegative normalized density after truncation. In particular the cubic correction can become negative in a far tail, where a fixed-point expansion does not provide a small relative error. Inverting a distribution-function Edgeworth expansion produces the Cornish-Fisher expansion for fixed quantiles.
Choose a real even smooth compactly supported Fourier transform equal to one near zero and let be its inverse Fourier transform. Repeated integration by parts makes a Schwartz function. It is real, integrable and square-integrable, with unit integral. Moment differentiation of the Fourier transform gives for every positive integer . Such a kernel for density estimation therefore satisfies arbitrary finite-order moment cancellation, and necessarily takes negative values. If the transform plateau contains the frequency support of a bandlimited function , the convolution theorem proves .
Fourier product formula 2026-10-25
For Schwartz functions and the Fourier transform convention , the displayed formula exchanges a pointwise product for a convolution. Substitute Fourier inversion for into the Fourier transform of . Fubini's theorem, justified by , gives
Unlike the convolution theorem , this version cannot be asserted for arbitrary pairs in without additional hypotheses, since their pointwise product need not be an integrable function.
Fourier restriction theory Created 2026-09-24 Updated 2026-11-05
A Fourier transform defined only as an function in an Lp space cannot generally be evaluated on a lower-dimensional surface: changing its representative on a set of ambient Lebesgue measure zero leaves that function unchanged. Fourier restriction theory asks when the integral transform of a sufficiently regular input admits a bounded restriction to a curved surface.
For a surface with measure , a typical estimate is , initially for Schwartz functions. Its dual form bounds the Fourier extension operator. The surface's curvature creates oscillatory cancellation, while concentration in small caps obstructs some exponent choices.
For a circle, a cap of angular width gives a nearly coherent extension on a rectangle with tangential length of order and normal length of order . Comparing these scales with input and output norms yields necessary conditions, as in the circle cap Fourier lower bound. Restriction estimates then connect oscillatory geometry with partial differential equations and decoupling inequalities.
Fourier transform of a derivative Created 2026-09-24 Updated 2026-10-14
For a Schwartz function, with the angular-frequency convention,
More generally, the identity holds when integration by parts is justified and the boundary term vanishes. Repeated differentiation gives . The short proof transfers the derivative from to by integration by parts. High frequencies receive larger multipliers, so rapid ripples contribute more strongly to a derivative. For the heat equation, the second derivative becomes multiplication by , directly explaining the faster decay of fine spatial structure.
For , put . The regular distribution of is a tempered distribution, since the function is bounded. Its Fourier transform is the integrable function
with arbitrary finite value at zero when the displayed integral diverges there. To prove the identity, the gamma function gives . Pair this with a Schwartz function, use the Fourier transform of a Gaussian, and interchange integrals by Fubini's theorem. The absolute bound for the transformed pairing follows from Tonelli's theorem:
The positive kernel and dominated convergence give positivity and continuity away from zero. It has a continuous representative at zero exactly when , in which case . For , Fatou's lemma gives as , so no change on a set of zero Lebesgue measure can give continuity.
For a periodic distribution , choose a smooth periodic partition of unity , and define . A finite Schwartz seminorm bound on the fixed compact support gives . For a Schwartz function , the Poisson summation formula and Fourier inversion imply . Localizing the pairing for gives
proving the displayed Fourier transform formula. The series converges in tempered distributions because its coefficients have polynomial growth while decreases rapidly. Applying the inverse Fourier transform gives in tempered distributions. These are the smooth-window Fourier coefficients of a periodic distribution, and the transform formula shows independence of .
Fourier transform of inverse distance in three dimensions Created 2026-09-24 Updated 2026-11-05
For the angular-frequency convention , the inverse-distance tempered distribution on has the exact transform
Both sides are locally integrable in three dimensions and have at most polynomial growth, so they define distributions even though the original function is not integrable at infinity.
One direct proof introduces , with . Angular integration of the radial Fourier transform gives, for ,
The damped sine integral follows by taking the imaginary part of . Letting against a Schwartz function is justified by the locally integrable majorants and together with rapid decay. This proves the distributional identity with its constant.
The result agrees with : the Fourier transform of a derivative multiplies the transformed potential by . Changing to a cycles-per-unit convention changes the numerical coefficient, so the transform convention is part of the statement.
Take the Gaussian function with . Every derivative is a polynomial times the same Gaussian function, so is a Schwartz function. The Fourier transform of a Gaussian gives, in the cycles convention,
Thus the Poisson summation formula gives the exact identity
The Gaussian Fourier transform is given in scaled form in Exercise 41 of Terence Tao's 245C, Notes 2: The Fourier transform.[ref] The identity is also the imaginary-axis transformation of the Jacobi theta function. At the Gaussian function is its own Fourier transform; at reciprocal values of its spatial and spectral widths exchange.
For a short derivation of the Gaussian Fourier transform, write . Differentiation under the integral and integration by parts, using , give
The Gaussian integral gives , so this ordinary differential equation yields the claimed formula. The decay of the Gaussian function justifies these steps and removes the boundary term.[ref]
Figure 1.
Gaussian weights at integer physical and dual points for reciprocal parameters 0.04 and 25
. Details.
For , the physical Gaussian function has width parameter , while its Fourier transform has width parameter . Many physical samples matter, but the dual zero sample already gives
For , use the physical side instead:
These are bounds on the full positive tails, obtained below, rather than estimates based only on the first omitted term. Ordinary floating-point arithmetic rounds these sums to and ; the exact real numbers are slightly larger. A Gaussian sum truncation bound lets us choose the cheaper side and certify its truncation error before evaluating it.
Heisenberg uncertainty relation Created 2026-10-06 Updated 2026-10-14
The Heisenberg uncertainty relation constrains the standard deviations of position and momentum in one preparation:
On the real line, the position operator acts by multiplication, and the momentum operator is , with the reduced Planck constant. Their canonical commutation relation and the Robertson uncertainty principle give the bound on normalized quantum states satisfying the moment and product-domain assumptions above; Schwartz functions are a convenient sufficient class. Thus making a preparation more sharply localized in position forces a wider momentum distribution, even for ideal measurement in quantum mechanics.
An explicit saturating example is the normalized Gaussian wave packet, for ,
The wavefunction is a probability amplitude; its squared magnitude is the probability density function, by the Born rule. That density is a normal distribution of mean zero and standard deviation , rather than a density whose width is read directly from the amplitude's exponent. With the unitary, negative-exponent convention for the Fourier transform, its momentum amplitude is
The Gaussian integral evaluates this Fourier transform. Consequently is another normal distribution, with mean zero and standard deviation
For example, in dimensionless units with , give . The Gaussian wave packets all saturate the same bound: narrowing one density broadens the other. More precisely, choose a reference length and set , ; then , and the plotted widths are and .
Figure 1.
Position and momentum probability densities for three minimum-uncertainty Gaussian preparations: dimensionless widths 0.5, 1, and 2 in position give reciprocal momentum widths 1, 0.5, and 0.25
. Details.
The Heisenberg uncertainty relation connects localization to the cost in kinetic energy. In a quantum harmonic oscillator with mass and angular frequency , the variance contribution to the expectation value of the energy is bounded using the arithmetic-geometric mean inequality:
The mean-dependent contributions are nonnegative. The Gaussian eigenstate for a quadratic potential with and zero means reaches this ground state energy. This is why the tradeoff is more than a limitation on preparation: it predicts an unavoidable positive minimum energy.
Heisenberg's original article appeared in March 1927 as "Über den anschaulichen Inhalt der quantentheoretischen Kinematik und Mechanik", Zeitschrift für Physik 43, pp. 172–198. Its abstract discusses simultaneous imprecision of canonically conjugate quantities and explanatory thought experiments. The precise standard deviation formulation here distinguishes preparation spreads from a slogan about measurement disturbance. [ref].
Hilbert transform Created 2026-09-24 Updated 2026-11-05
With the sign convention
the Hilbert transform is a singular integral operator. For a Schwartz function, the Cauchy principal value removes equal small intervals on both sides of . Subtracting locally makes the remaining quotient bounded there, while rapid decay controls infinity. Reversing the denominator reverses the operator sign.
For the angular-frequency Fourier transform, its Fourier multiplier is , as derived under Hilbert-transform Fourier multiplier. Plancherel theorem therefore extends it to an isometry on , and on that space because the squared multiplier is minus one almost everywhere. This frequency-dependent phase shift connects real and imaginary boundary parts of suitable holomorphic functions; Hilbert transform of the sinc function supplies an explicit example.
The transform need not preserve boundedness. For the indicator function of , direct integration gives
It diverges logarithmically near the endpoints and has tail . This example also explains why a compactly supported input can produce a long-range response. The finite Hilbert transform instead restricts the integration interval and has its own endpoint and null-space issues.
Inverse Fourier transform Created 2026-10-18 Updated 2026-10-24
With the Fourier transform convention , the inverse Fourier transform is the displayed linear operator. The integral is defined directly for an integrable function . The Fourier inversion theorem ensures under its hypotheses, in particular for Schwartz functions, and for integrable and at continuity points of . The operation also extends to tempered distributions; the normalization and sign depend on the chosen Fourier transform convention.
L2 density from a square-integrable Fourier transform Created 2026-10-07 Updated 2026-10-14
If a finite measure on has square-integrable Fourier transform, the Plancherel theorem gives an inverse transform . Pairing with every Schwartz function and using Fourier inversion identifies the measure with . This establishes absolute continuity, rather than presuming it. For a positive measure, and as well. Multiplication by yields .
Large-distance tail of the Hilbert transform Created 2026-10-06 Updated 2026-10-14
For a Schwartz function , the Hilbert transform satisfies at both infinities. Splitting the inverse Fourier transform at the sign multiplier's jump and integrating each half-line by parts extracts the zero-frequency value ; the remainder vanishes by the Riemann-Lebesgue lemma. A nonzero zeroth moment therefore obstructs Schwartz decay.
Local constancy principle Created 2026-09-24 Updated 2026-11-05
Fourier localization controls the variation of a demodulated envelope at reciprocal scales. Suppose the Fourier support lies in a rectangular box centered at , with widths of order in spatial-frequency coordinates and in a time-frequency coordinate. Set . Choose a Schwartz function whose transform is one on the centered box and rescale it to obtain a kernel . Then
for spatial coordinates. The convolution averages on spatial scale and temporal scale . For bounded , differentiating the kernel gives and .
These are quantitative variation bounds, not literal constancy on boxes. Removing the center frequency is essential: multiplying a slowly varying envelope by can make its phase rotate rapidly while leaving its Fourier-support width unchanged. The principle controls a localized envelope or a smoothed magnitude, rather than forbidding carrier oscillations.