Filtered backprojection 2026-10-14
The Radon transform records line integrals of a planar density. Apply the transverse Hilbert transform and a derivative to each projection, then average the filtered values over all lines through the reconstruction point. With , the filter has Fourier multiplier . The Fourier inversion theorem, or the jump of the complexified transport Cauchy kernel, proves the displayed formula. The factor is when directions are integrated over a half-circle. The growing Fourier multiplier explains amplification of measurement noise and the need for regularization of an inverse problem.
Fourier analysis Created 2026-09-24 Updated 2026-10-14
Fourier analysis describes a function by the oscillations that compose it. A graph records values at successive positions or times; a frequency spectrum records how much of each frequency is present, together with its wave phase. The same complicated shape can become a short list of simple components. For periodic functions, the components form a Fourier series; on the whole real line, the Fourier transform uses a continuous range of frequencies, and the Fourier inversion theorem puts them back together.
For a concrete example, consider the trigonometric polynomial
With measured in seconds, its three Fourier harmonics have frequencies , , and cycles per second and amplitudes , , and . Each cosine has zero wave phase. Adding them creates the sharper peaks in the figure. The frequency spectrum makes the recipe immediately visible; changing an amplitude changes the shape without changing the component's frequency. Fourier orthogonality lets us recover each Fourier coefficient by averaging against the corresponding sine or cosine, because the other Fourier harmonics cancel over a full period of a function.
The deeper reason these components are so useful is that they simplify operations. By Euler's formula, the exponential function packages a cosine and a sine into one Fourier mode. A translation or a derivative changes only its multiplier:
Thus Fourier modes are simultaneous eigenfunctions of these operations. In Fourier series, this gives a literal diagonalization in the Fourier basis; on the real line, the Fourier transform gives the continuous counterpart, with each frequency handled separately. The Translation property of the Fourier transform and the Fourier transform of a derivative turn shifting and differentiating a whole function into multiplication of its Fourier transform. A convolution likewise becomes multiplication by the convolution theorem. This is beautiful because one description simplifies several apparently different operations at once.
For example, the heat equation , with thermal diffusivity , evolves a spatial Fourier mode as
Fine ripples have larger angular frequencies and decay faster: the formula explains why heating smooths a jagged temperature profile. For a general initial profile with sufficient regularity, the Fourier transform gives , and Fourier inversion recovers the temperature. Similarly, multiplying selected parts of a frequency spectrum suppresses unwanted components. Claude E. Shannon's Communication in the Presence of Noise (1949), Section III, describes ideal filtering as a projection that retains some frequency coordinates and removes others.[ref]
The physical motivation is already visible in Joseph Fourier's Théorie analytique de la chaleur (1822). Chapter III constructs heat profiles using sums of sines and cosines; Chapter IX, articles 355–359, passes from Fourier series to integrals as the spatial interval becomes unbounded. These heat problems explain the motivation for the discrete and continuous descriptions. Their modern formulations specify which functions admit reconstruction and in what sense the expansions converge.[ref][ref]
Fourier cosine transform 2026-10-20
For sufficiently regular decaying data, this half-line transform has inverse . To derive it, extend evenly to the real line. Its Fourier transform with negative exponential is , and its odd sine contribution vanishes. The Fourier inversion theorem then gives the stated factor . If the forward transform is instead defined as , the inverse factor is .
With boundary terms at infinity vanishing, two integrations by parts give the cosine transform of as . Thus a homogeneous Neumann boundary condition makes it a multiplier , paralleling the Fourier sine transform with a homogeneous Dirichlet boundary condition.
Let be compactly supported and continuous, let , and use . If , then
This follows by Fubini's theorem, a change of variables, Fourier inversion theorem, and dominated convergence theorem. It gives a direct proof of the uniqueness theorem for characteristic functions because the right side depends only on .
Fourier inversion theorem Created 2026-09-24 Updated 2026-10-14
The Fourier inversion theorem makes decomposition into frequencies reversible: a complete Fourier transform, including its wave phases, determines the original function up to equality almost everywhere. With the angular-frequency convention
if and belong to the L1 space, then
almost everywhere. The right side is a continuous representative of . If itself is continuous, equality holds everywhere, as explained by the continuous version of Fourier inversion. The integrability hypotheses ensure that both displayed integrals are ordinary absolutely convergent integrals. For arbitrary elements of the L2 space, the Plancherel theorem instead supplies inversion in the L2 space norm.
Each factor is a Fourier mode; the inverse integral adds them with the complex weights . The normalization is part of the recipe. In one dimension, writing ordinary frequency as gives the equivalent pair
where . Reversing both exponential signs gives another equivalent convention, but the forward and inverse formulas must use opposite signs consistently.
For example, the Fourier transform of a Gaussian gives
Fourier inversion says that a weighted continuum of oscillations reconstructs this smooth Gaussian function. Narrowing the original Gaussian function by increasing broadens its frequency spectrum. This is a concrete demonstration that a sharply localized shape needs a wider range of frequencies.
Inversion is what makes a frequency calculation useful: transform a function, solve the simpler problem there, then return to the original variables. A brief proof outline is to multiply by , . The inverse integral becomes convolution with a normalized Gaussian function, an approximate identity. As tends to zero, dominated convergence gives the unregularized inverse integral, while the approximate identity recovers almost everywhere. Joseph Fourier's Théorie analytique de la chaleur (1822), Chapter IX, article 417, contains a cosine double-integral representation antecedent to this modern formula; the hypotheses above are the modern statement.[ref]
If is smooth and supported on and , Fourier inversion gives
Expanding the square of the resulting Möbius-weighted divisor sum turns its mean value into an Euler product controlled by zeta functions near their pole at one.
For , use the Fourier transform convention . Splitting the integral at zero gives . By the Fourier inversion theorem, the dual identity is
This pair connects an exponential function with the kernel of a Cauchy distribution and produces the Poisson kernel for the upper half-plane by inversion of .
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.
For , insert a Gaussian function into the proposed inverse Fourier transform:
The Fourier bounds for Schwartz functions show that is an integrable function, so dominated convergence gives
On the other hand, Fubini's theorem applies because . The given Fourier transform of a Gaussian, rescaled by , yields
The last integrand is bounded by . Since is continuous, another application of dominated convergence makes this tend to . Equating the limits proves the Fourier inversion theorem:
The Gaussian functions above form an approximate identity; no Fourier inversion was used in evaluating their integrals.
Let , and define reflection of a tempered distribution by . The Fourier inversion theorem on the Schwartz space says . Thus
Reflection commutes with the Fourier transform, since and the same relation follows by duality for tempered distributions. Define the inverse Fourier transform on tempered distributions by
It follows that
In particular is the general Fourier inversion formula. When is an integrable function, this is the regular distribution of ; an arbitrary tempered distribution need not have an ordinary integral representation.
Extend by zero to the negative half-line. Its ordinary Fourier transform is then exactly the Half-range Fourier transform . The Fourier inversion theorem gives the real-line term for ; no endpoint convention at is needed.
It remains to show that each extra contour contributes zero, independently of its coefficient. For , the integral defining is holomorphic. With , multiplication by rotates the sector into , and multiplication by rotates into . Thus the two rotated transforms are holomorphic on their respective upper sectors.
Orient the contours as in the PDF: runs from infinity on the ray into zero and then out along the positive real axis; runs from negative real infinity into zero and then out along the ray. Both have their sector on their left. Smooth decay and integration by parts give in closed lower-half-plane sectors. The factor decays in the upper half-plane for . Close each sector by a large arc; the arc integral vanishes by Jordan lemma, including its short portion near the real axis. The Cauchy integral theorem therefore gives the rotated null contours for half-range Fourier inversion:
Adding arbitrary constant multiples of these two zero integrals to ordinary Fourier inversion proves the asserted inversion formula. The constants are arbitrary in this part; selecting them later is what removes an unknown boundary trace.
Figure 1.
The rotated inversion sectors and the middle sector that eliminates an unknown boundary transform
. Details.
Use the Fourier transform convention
Decay alone does not guarantee existence of the ordinary integrals, so impose the usual integrability and regularity assumptions. One sufficient version of the Fourier inversion theorem is that and are integrable and is continuous, in which case the inversion integral recovers . Under the standard piecewise-smooth Dirichlet assumptions, inversion instead gives the midpoint of the two one-sided limits at a jump, with a suitable improper integral interpretation.
For integrable , define . The convolution theorem states
To prove it, absolute integrability permits Fubini's theorem. Set in the inner integral:
The absolute double integral is , justifying the interchange. The computations below assume and use the source PDF's factor in the final integral, omitted in the converted TeX.
Fix Haar measure and use . A positive-definite function satisfies for every finite choice of points and coefficients. The Bochner theorem states that a continuous positive-definite function on a locally compact Hausdorff Abelian group has a unique representation
where is a Radon measure. Conversely, any finite positive Radon measure on the Pontryagin dual group has a continuous positive-definite inverse transform. The sign convention here is the one compatible with the displayed Fourier transform.
First note that the dual is a locally compact Hausdorff topological group. Its group operations are continuous in the compact-open topology proved in question 3. For local compactness, adjoin the zero functional to the character space of an algebra of . All its elements lie in the closed unit ball of , and the equations define a closed subset in the weak-star topology. The Banach-Alaoglu theorem makes that subset compact Hausdorff. Removing the zero functional gives an open, hence locally compact, subspace. This provides the setting for constructing the measure on the dual, without assuming a Fourier inversion theorem.
Let and let be the finite sums of convolution squares , . Each such square is continuous with compact support, and is positive-definite because
Its transform is , so every has . Also : convolution of two squares is , and finite sums distribute. Insert the Bochner representation of into and use the Fubini theorem to obtain
The representing measure on the right is finite and positive. Uniqueness in the Bochner theorem and commutativity now give the Bochner consistency identity for convolution squares
For every compact there is with throughout . Indeed, at any choose , where is a nonzero member of . Then , and continuity supplies a neighbourhood where it stays nonzero. A finite subcover of and the sum of the corresponding squares give such a .
For , choose positive in transform on its support and define
The quotient is set to zero away from the support; its denominator is bounded away from zero there. If is another choice, the consistency identity, multiplied by on that compact support, shows that the integral is unchanged. Choosing one for a union of supports proves linearity; positivity follows from positivity of . On each fixed compact support it is bounded by times the uniform norm. Moreover, for every and , choosing positive on the support of gives
A nonzero square has ; a suitable nonnegative compactly supported consequently makes this last expression positive. Thus is nonzero.
To prove translation invariance, fix and modulate by . This again belongs to , since modulation takes to . Direct calculation and Bochner uniqueness give
Hence, for , using as the denominator function and changing variables gives . The Riesz representation on compactly supported continuous functions now produces a nonzero translation-invariant positive Radon measure on the dual. It is finite on compact sets, so it is Haar measure. This is the compatible dual Haar measure, denoted .
The identity for says, by uniqueness of Radon measures,
Thus and the Bochner representation immediately proves
It also proves the formula for all finite complex linear combinations of these functions. The measure scale is fixed by this identity: at , a nonzero square gives .
A wider inversion class is with . To prove this extension, choose nonnegative with integral one and support in a small identity neighbourhood , and put . These functions form an approximate identity: they are nonnegative, have integral one and support in . Also , and uniformly on compact subsets of the dual. For this uniform convergence use equicontinuity of compact families of characters: evaluation is jointly continuous, as follows from the translation quotient in question 3, and a finite cover of a compact family gives uniform control near the identity.
Convolving the already established inversion formula for with , the Fubini theorem gives
This is justified by . Compact-set uniform convergence and an integrable-tail split imply
Explicitly, first choose a compact set outside which is small, use the bound on that tail, and use uniform convergence on the compact remainder. This argument works for neighbourhood-indexed nets, without assuming metrizability. Consequently converges uniformly to the continuous inverse integral. On the other hand, translation continuity in Lp on a locally compact group gives in ; testing these two limits against shows they agree almost everywhere. At every continuity point of the chosen representative of , the shrinking-support approximate identity also converges pointwise to . We obtain Fourier inversion on a locally compact abelian group:
valid everywhere for continuous with integrable transform, and in general as equality with a continuous representative almost everywhere. This class includes all convolution squares above, and their linear span.
Finally, for arbitrary , apply the inversion formula at zero to :
Thus the integral Fourier transform is linear and norm-preserving on . That space is dense in , so for choose with in and define as the limit of . The norm identity makes this limit exist and independent of the approximating sequence, and preserves linearity. This proves the Plancherel theorem for locally compact abelian groups in the requested form:
On , choose the approximating sequence to converge in both norms; uniform convergence of the integral transforms and their convergence show that this extension agrees almost everywhere with the original transform. For general functions the extension is defined by norm limits, not by presuming that the pointwise integral exists.
Extend by zero to and apply the assumed Fourier inversion theorem. For sufficiently regular, decaying data and this gives , with . If , the exponential in this last integral is bounded in magnitude by one; it defines a holomorphic transform in the lower half-plane, with its boundary values on the real axis.
The PDF orients from down to zero, then from zero to . The function is holomorphic in the upper half-plane, and for its exponential decays there. Close the two rays through a large first-quadrant arc. Cauchy integral theorem and Jordan lemma give
For example, if are integrable, integration by parts gives in that quadrant, which suffices for the arc estimate. Standard limiting arguments extend the identity to the admissible Fourier-inversion class. Adding any constant multiple of this zero integral to ordinary inversion proves
The extra integral is a reflected, zero-supported contribution, not an extra datum.
The half-open translates partition the real line. Exactly one summand is therefore nonzero in the periodization of , giving .
Choose the Shannon scaling mask to be the -periodic extension of . On the support of , its product with is ; outside that support both sides vanish. Thus the scaling refinement equation holds in frequency. The Fourier coefficients give its precise filter normalization:
These coefficients are square summable, so the interpretation in part (b) applies.
The Fourier inversion theorem gives the Shannon scaling function
This is the normalized sinc function. Its Fourier transform is taken in the Plancherel theorem sense: the Shannon scaling function belongs to but not , so its Fourier integral is not absolutely convergent. The inverse integral above is an ordinary integral because the rectangular transform belongs to . The resulting refinement spaces are exactly the functions with Fourier transform supported in ; their union is dense and their intersection is zero. Thus this example also gives a full multiresolution analysis.
Every nonprincipal Dirichlet character modulo the prime is primitive, so its finite Fourier coefficients have modulus one off zero; the coefficient at zero is zero by character orthogonality. Fourier inversion theorem gives
The finite geometric series gives
The printed hint omits from the exponential; its literal constant summand would not obey the bound for arbitrary . The geometric-series calculation proves the needed estimate independently. Pairing with gives
The last sum is a harmonic number. This proves the Pólya–Vinogradov inequality uniformly in and ; complete blocks of length also vanish by Orthogonality of Dirichlet characters.
The Malgrange–Ehrenpreis theorem states that every nonzero constant-coefficient linear differential operator on Euclidean space has a distributional fundamental solution. With and , the conclusion is an such that . If , simply take ; hence assume .
We construct a Hörmander staircase in frequency space. The highest-degree homogeneous part is not identically zero on real vectors, since a polynomial vanishing on all real vectors has all coefficients zero. After an orthogonal transformation of coordinates, we can arrange that . Thus, for each real , the polynomial
has degree in and the same nonzero leading coefficient , independent of . This constant leading coefficient of a polynomial is what makes a uniform staircase possible.
For a fixed , factor , counting repeated roots of a polynomial. Consider the heights , . A given root has imaginary part within distance less than one of at most one of these heights. By the pigeonhole principle, some height avoids every root, and then
This is finite-height polynomial root avoidance. Root labels need not be chosen continuously or even measurably. Instead define the closed sets
Continuity in extends the inequality from rational to every real . These Borel sets partition . The Hörmander staircase assigns the horizontal contour over ; its height is bounded by , and the denominator has the uniform lower bound . For , the transverse space is a single point and only one horizontal contour is needed.
Use the Fourier transform convention , with inverse factor . Define the candidate fundamental solution of a linear differential operator by
For a test function supported in a fixed compact set , Fourier decay in a bounded complex strip gives, for any integer ,
Indeed, this is the real Fourier transform of with reversed frequency, and repeated integration by parts with proves the estimate. Taking and using the denominator bound proves absolute convergence and a continuity estimate on . Thus is a distribution; no unsupported interpretation of a divergent inverse Fourier transform is being used.
For its distributional derivatives, the formal transpose of a differential operator is . Since
applying cancels the denominator. For each fixed , the numerator is an entire function of . The Cauchy integral theorem, applied to a rectangle between the lines and , gives
The two vertical edges tend to zero by the same bounded-strip decay. The resulting contour deformation is performed separately for each transverse frequency, so discontinuities of the staircase height introduce no additional boundary terms. Absolute convergence permits integration over the partition . The Fourier inversion theorem then yields
This proves the Malgrange–Ehrenpreis theorem. Undoing the orthogonal change of coordinates gives the fundamental solution of a linear differential operator for the original operator; the Dirac delta distribution is unchanged by that change of coordinates.
For a one-dimensional operator of degree , with leading coefficient , we may choose the single staircase contour below every pole. Take and integrate on . The corresponding formula is the Bromwich contour version of the construction above, after putting . Its poles all lie above the frequency contour. For , close that contour downwards; the exponential function decays and there are no enclosed poles. For , close upwards, where the exponential function again decays, and apply the residue theorem. The bound justifies the large arcs, including by the Jordan lemma away from their endpoints. Thus away from the retarded fundamental solution is , where
The sum is over distinct roots of a polynomial, with the residue including the whole multiplicity. For simple characteristic roots of a constant-coefficient differential equation, it reduces to . Repeated roots give exponential polynomial solutions of a constant-coefficient differential equation through differentiation of .
To establish the equality also at the origin, rather than leave a possible point-supported term undecided, verify the distributional jump formula for a Heaviside product. The residue expression is an entire function of , and
Its initial derivatives are
These identities follow by integrating over a large circle: for the integrand is , whereas for its coefficient of is . The distributional jump formula for a Heaviside product therefore gives . Moreover, since is a tempered distribution, its Fourier transform satisfies
There are no real zeros of this polynomial, so its reciprocal is the transform. This is exactly the shifted-contour construction, proving equality there as a distribution as well. Hence
The sign of matters: for the operator in the preceding solution, and the last initial derivative is .
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.
For multi-indices , define
These seminorms define the Fréchet space topology of the Schwartz space: exactly when every tends to zero. An equivalent increasing family is
A tempered distribution is a continuous linear functional on this space. Equivalently, for some . The usual weak convergence of tempered distributions means for every fixed Schwartz function. The strong dual topology instead requires uniform convergence on every subset of the Schwartz space that is a bounded set in a topological vector space; the Fourier maps below are continuous in both topologies.
Using , differentiation under the integral and integration by parts give
The omitted coefficient has modulus one. By the Leibniz rule, every integrand is a finite sum of a polynomial times a derivative of . Inserting the integrable weight bounds its L1 norm by finitely many Schwartz space seminorms. In particular . Thus the Fourier transform maps continuously into itself.
For completeness, the Fourier inversion theorem follows here by Gaussian regularization. The inverse transform of is . The Fourier transform of a Gaussian and Fubini's theorem show
As , the right side tends to by the approximate identity property, while the left side tends to the undamped inverse integral by dominated convergence theorem, since . Hence
The inverse is times reflection composed with the continuous Fourier transform, and is therefore continuous on the Schwartz space. This proves a continuous linear isomorphism with continuous inverse.
Define the Fourier transform of a tempered distribution by
The continuous map on Schwartz space makes this a tempered distribution; the transpose of supplies its inverse. Pointwise convergence of pairings proves weak continuity. For the strong dual topology, the transform of a bounded set of Schwartz functions is bounded, so uniform convergence of pairings on bounded sets proves continuity of both Fourier maps there too.
Now let be a rotation matrix in the special orthogonal group and write . A change of variables with unit Jacobian gives
The rotation equivariance of the Fourier transform on tempered distributions follows by duality:
Therefore . Applying this identity and the inverse Fourier transform gives the two directions:
This is precisely preservation of radial tempered distributions. For , acts transitively on spheres, so an invariant smooth function is an ordinary radial function.
Dominated convergence makes continuous, and . Smooth compactly supported functions are dense in . Their Fourier transforms decay at infinity by integration by parts, so uniform approximation proves the Riemann-Lebesgue lemma: .
For density, smooth compactly supported functions are also uniformly dense in by cutoff and mollification. Each such target is a Schwartz function; its inverse Fourier transform is another Schwartz function, hence belongs to , and Fourier inversion recovers . Therefore the image of a function of is dense in .
The Fourier inversion theorem says that if , then agrees almost everywhere with the inverse integral of . If , this applies and gives almost everywhere. Hence the Fourier transform is injective as a map of equivalence classes, with dense image in .