Spatial frequency is the number of oscillation cycles per unit length. A ripple with spatial period has frequency ; its angular wavenumber is . In two dimensions the spatial-frequency vector specifies the orientation and period of a plane-wave pattern.
A suitably band-limited function can be reconstructed from equally spaced samples when the sampling rate exceeds twice its largest ordinary frequency. Sampling more slowly aliases distinct frequencies in the Fourier transform. For spatial sampling, the same statement relates sample pitch to the shortest resolvable wavelength.
When the continuous Fourier transform of an integrable function vanishes outside , its periodic Fourier coefficients are the integer samples of , with the sign of the index reversed. Projecting in and then applying the Fourier inversion theorem gives the displayed sinc function reconstruction. The Cauchy-Schwarz inequality controls the reconstruction error uniformly in . Bessel's inequality bounds the shifted sinc coefficient vector, giving absolute uniform tails when the sample sequence belongs to .
Samples spaced by pitch can distinguish spatial frequencies strictly below cycles per unit length. Thus the shortest limiting wavelength is ; exactly at the limit a sinusoid's phase can make all samples vanish. A practical deformable mirror has additional limits from actuator influence functions and finite pupil geometry.
A Euclidean lattice is a discrete subgroup spanning the ambient vector space. Its covolume is the volume of a fundamental parallelepiped.
For the skew matrix , both Euclidean lattices reduce to the tetracode modulo . A reflection depending on the reduction coset matches their vectors coordinatewise in absolute value. Their weighted length spectra agree for all positive diagonal axis weights. Rationally independent weights force any possible linear isometry to be a coordinate sign change; the code then forces an overall sign, which does not identify the two lattices.
The covolume of a full Euclidean lattice is the Lebesgue measure of a fundamental parallelepiped in its ambient inner-product space. In orthonormal coordinates it is for a lattice basis matrix . Scaling the lattice by multiplies the covolume by ; the dual lattice has reciprocal covolume.
In a rank-two Euclidean lattice, a shortest nonzero vector and a shortest vector form a basis. The shortest vector is primitive. If the vertical coordinate of has index in the projection lattice, a vector with smaller positive vertical coordinate can be reduced horizontally to length squared at most , a contradiction. This lemma need not hold in higher rank.
For a full-rank Euclidean lattice of covolume in , bounded fundamental cells compare lattice points in a radius- ball with the volumes of balls of radii . Hence . A lattice norm multiset therefore determines the covolume, which is useful for the spectrum of a flat torus.
Every continuous group homomorphism is for a unique in the dual lattice. Compactness forces unit modulus, and lifting the character to the simply connected cover makes its phase a real linear functional. These characters are the frequencies of torus Fourier series.
For a sufficiently rapidly decreasing function , the Poisson summation formula relates its samples to those of its Fourier transform:under the convention .
For a Schwartz function on the real numbers, its periodization is a smooth periodic function of period one. Rapid decay gives uniform convergence on of the series and each differentiated series. Under the Fourier transform convention , its th Fourier coefficient is : integrate termwise over one period and combine the translated intervals. The rapidly decreasing coefficients give a Fourier series with uniform convergence. Evaluation at zero proves the Poisson summation formula.
For integers and ,This orthogonality extracts matching coefficients when two Fourier series are integrated over one period.
For the trigonometric polynomial , orthogonality of complex exponentials givesIndeed, expand each square and use for every nonzero integer , and one for .
A wavelet is a localized function whose translates and dilates analyze different positions and scales.
From a one-dimensional multiresolution analysis, the simultaneous-scale two-dimensional detail space splits as . Its generating wavelets are , , and . Their normalized dilates are for . Include a coarse scaling family when working on a bounded square.
A finite-length smooth curve meets supports of localized two-dimensional wavelets at scale . For a bounded function, their coefficients are , so their total squared energy at that scale is . Keeping these coefficients through level uses terms and leaves squared error . Polynomial cancellation, or adequate approximation of the remaining smooth regions, therefore gives best N-term approximation squared error .
A tensor-product wavelet is a product of one-dimensional wavelets and scaling functions, with at least one wavelet factor. In two dimensions, the three simultaneous-scale types are , and . Their translates and normalized dilates form a tensor-product wavelet basis.
An interval-adapted wavelet basis is an orthonormal basis of made of a finite coarse scaling function family and resolution-indexed wavelets. A localized construction modifies only a bounded number of functions near each endpoint at every level. Boundary modification must preserve nested refinement spaces and the required vanishing moments; simple restriction of a whole-line basis does not do so.
A boundary wavelet replaces a translated interior wavelet whose support of a function meets a domain endpoint. Compatible finite boundary refinement matrices preserve orthogonality and localization across scales. If the coarse boundary spaces reproduce polynomials of degree less than , their detail-space orthogonal complements have vanishing moments.
This construction adapts compactly supported orthonormal wavelets to an interval by finite changes near its endpoints. It preserves local support, polynomial reproduction, nested approximation spaces and orthogonal detail spaces. The resulting basis contains coarse scaling functions, unchanged interior wavelets, and finitely many boundary wavelets per endpoint and per scale, without forcing periodic or zero boundary values.
A wavelet has vanishing moments when these integrals vanish for . For compact support, this is equivalent to a zero of order at least at the origin of its Fourier transform. Such a wavelet annihilates polynomials of degree less than , and a Taylor polynomial bounds coefficients on smooth regions.
Suppose an integrable orthonormal scaling function has a low-pass filter of a multiresolution analysis that is near , and its Fourier transform is near zero. If the associated wavelet has integrable vanishing moments, then for . Indeed, moment differentiation of the Fourier transform makes , while . In , division by the nonzero smooth factor proves the conclusion. With only continuity of that factor one still obtains a Peano zero, but not automatically higher ordinary derivatives.
Assume the scaling function Fourier transform and the MRA low-pass filter are , and for . For every nonzero integer , write with odd. Iterating the scaling refinement equation at supplies a factor . All its derivatives of order less than vanish at , by periodicity. The product rule gives for .
A Daubechies wavelet of order is a compact support orthonormal wavelet with vanishing moments and a minimal-length finite refinement filter. The minimal filter has taps, giving support length in the standard dyadic normalization. Its low-pass symbol has a zero of order at . Increasing order improves polynomial cancellation and, for sufficiently large order, regularity, at the price of a wider support.
The Haar wavelet has one vanishing moment and compact support of unit length. Its scaling function is , and its refinement coefficients are . The approximation spaces consist of functions constant on dyadic cells. Its discontinuity makes it effective for jump localization but limits smooth-function approximation.
The normalized Haar scaling functions and wavelets obeyThis orthogonal two-by-two transformation gives the multiresolution analysis decomposition . Iterating it expresses a Haar approximation either through level- cell averages or through coarse averages and all wavelet details at lower levels. The identities remain valid locally for coefficient integrals of locally integrable functions, without a global assumption.
The Haar projection at level is the orthogonal projection onto the functions constant on level- dyadic intervals. It replaces a function by its mean on each cell. It can be expressed using level- Haar scaling functions, or using the constant function and Haar wavelets at levels below .
Finite total variation of a function on gives the following error bound for averaging on dyadic cells of length :The cell error is at most its length times the oscillation on that cell, and the sum of the oscillations is at most the total variation. This proves that the difference is integrable even if is not globally in . For an even function decreasing to zero on the positive half-line, and the bound becomes .
In the Gaussian white noise model, estimate a Haar scaling function coefficient by . The resulting Haar projection estimator is an unbiased estimator with independent coefficient errors of variance . On each cell it is the observed path increment divided by the cell length. This gives a finite-dimensional estimator without imposing smoothness on the drift.
The cellwise error of the Haar projection estimator in Gaussian white noise is times a standard normal variable. Its supremum norm is therefore exactly that factor times the Gaussian maximum over cells. The Gaussian maximum bound without independence gives expected error at most . This concerns the stochastic error about the projection; approximation bias must be added when estimating the full drift.
At level , a Haar scaling function is the normalized indicator function of a dyadic interval. The functions at that level form an orthonormal basis of the cellwise-constant subspace. Their normalization is what turns white-noise coefficient variances into and cellwise variances into .
A multiresolution analysis is a nested sequence of approximation spaces related by dyadic dilation and generated at one scale by translates of a scaling function.
A scaling function generates the approximation space of a multiresolution analysis by its integer translates. In an orthonormal construction those translates form an orthonormal basis, and generate . Integrable orthonormal scaling functions have , as follows from density and the MRA projection Fourier identity.
With in the Plancherel theorem sense, the integer translates of are orthonormal exactly whenThe Fourier coefficients of the periodized energy are the translate inner products. Uniqueness of Fourier coefficients in L1 therefore proves both directions. No absolute integrability assumption on is required.
If a periodic unimodular function and its inverse have absolutely summable Fourier coefficients, replacing by preserves the orthonormal integer-translate span and integrability of an integrable scaling function. In physical space this is an absolutely summable combination of integer function translations. The new MRA low-pass filter is . A rough phase can therefore preserve the multiresolution analysis while changing MRA low-pass filter regularity.
LetThe Fourier coefficients of are absolutely summable, so belongs to the Wiener algebra, as does . The identity implies . Starting with a compactly supported Daubechies wavelet having vanishing moments, the periodic phase change of a scaling function gives , while the canonical high-pass construction leaves unchanged.
At a dyadic point , the terms of the difference quotient with and each contribute . Their number tends to infinity, their total error is bounded, and the remaining tail contributes a bounded amount. Hence , so neither nor has a finite derivative there. These points are dense. Away from the isolated zero of near , multiplication by its nonzero smooth value cannot remove this nondifferentiability. Thus the new MRA low-pass filter is not differentiable throughout any neighborhood of , despite integrability of the scaling function and unchanged vanishing moments. Ordinary higher derivatives at cannot be inferred, although the corresponding Peano zero survives.
Nesting in an orthonormal multiresolution analysis expresses a scaling function in the finer-scale orthonormal basis. The associated low-pass symbol is , and . If has compact support, only finitely many coefficients are nonzero. With , iteration gives when the limit exists.
For an orthonormal scaling function satisfying , its low-pass Fourier series symbol is . The scaling refinement equation becomes . The symbol is initially an almost-everywhere defined periodic function; the assumption that the scaling function is Lebesgue integrable alone does not make it smooth. The orthonormal translates give the quadrature mirror filter identity.
For an orthonormal wavelet refinement filter, is equivalent to the displayed identity. A high-pass filter can be chosen with coefficients . In frequency, its symbol is , up to a constant phase. The two channels split an approximation space into a coarser approximation and its orthogonal complement.
For a scaling refinement equation , set . The quadrature mirror filter identity makes the two rows and a unitary matrix, where . The complementary coefficients yield . In a multiresolution analysis, coefficient-space completeness shows its translates form an orthonormal basis of , hence its dilations and translates form an orthonormal wavelet basis of the whole space.
Use and let be the orthogonal projection onto the closed span of the orthonormal translates and dilates of a scaling function. If is supported in and , thenIndeed, the Plancherel theorem writes the coefficient against as . With , these are times the Fourier series coefficients of on . The Parseval identity proves the formula. It shows that continuity and unit modulus at zero imply density of the refinement spaces, and conversely that density forces this unit modulus when the Fourier transform is continuous at zero.
The Meyer-Mallat theorem associates an orthonormal wavelet basis to every orthonormal multiresolution analysis.
With the unnormalized Fourier transform, the scaling function with transform is . Its integer translates are orthonormal by orthonormal translates and Fourier periodization. Its refinement mask is the periodic indicator of , with and . It belongs to but not , so its transform is naturally interpreted through the Plancherel theorem.
A spatial Fourier mode has the form and is an eigenfunction of every constant-coefficient spatial differential operator; in particular, .
The Schwartz space consists of smooth functions whose derivatives decay faster than every inverse polynomial. Its Fréchet topology is generated by the seminormsIt is dense in every .
These seminorms measure all polynomially weighted derivatives and generate the Fréchet topology of the Schwartz space. Finitely many such bounds control each weighted derivative's integrable norm by adding a spatial decay factor stronger than . Continuity of the Fourier transform follows by applying those bounds after differentiation and integration by parts. Equivalent families use powers of instead of individual monomials.
For a non-Archimedean local field , the Schwartz-Bruhat space consists of the locally constant, compactly supported complex-valued functions on .
A Schwartz-Bruhat function on a non-Archimedean local field is a locally constant, compactly supported complex-valued function, or an element of the Schwartz-Bruhat space. A sufficiently small open additive subgroup leaves it invariant under translation, and only finitely many cosets meet its support.
A Schwartz function is an element of the Schwartz space: it is a smooth function and every derivative decreases faster than every inverse polynomial. Equivalently, defines a bounded function for every pair of multi-indices .
A tempered distribution is a continuous linear functional on the Schwartz space. Tempered distributions include functions of at most polynomial growth and admit a Fourier transform by duality.
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 , a tempered distribution on is radial when for every , where . This agrees with the usual radial function definition for regular smooth distributions, because the special orthogonal group acts transitively on spheres.
Choose a radial mollifier with integral one and support in the unit ball, and a radial cutoff function equal to one there. For a radial tempered distribution , the functionsare radial Schwartz functions. Smoothness comes from convolution of a tempered distribution with a Schwartz function, and compact support comes from the cutoff. Pairing with gives . With , the cutoff tail and the mean value theorem giveThe continuity estimate for therefore proves even in the strong dual topology. Inserting a cutoff is essential because convolution alone need not give rapid decay.
A sequence converges weakly to if for every Schwartz function . This is the weak-star topology of the continuous dual of the Schwartz space, and differs from choosing a strong dual topology defined by uniform convergence on bounded sets of test functions.
With , the Fourier transform of a tempered distribution is defined byContinuity of the Fourier transform on the Schwartz space makes this well defined. For regular integrable functions, Fubini's theorem shows that it agrees with the ordinary transform. The inverse convention has factor and the positive exponential.
A real simple pole is not locally integrable in the ordinary improper sense. Its symmetric Cauchy principal value defines a tempered distribution. For the transform convention, contour indentation or sine integration gives the displayed nondecaying oscillatory contribution. Upper and lower boundary-value prescriptions instead change it by before transforming. A pole prescription must therefore be stated before claiming a Fourier asymptotic expansion.
For an orthogonal matrix , a unit-Jacobian change of variables gives . The dual definition of the Fourier transform of a tempered distribution consequently givesSince the Fourier transform is invertible on the Schwartz space and its dual, a tempered distribution is invariant under a rotation group exactly when its transform is invariant. This includes radial tempered distributions.
For , the Fourier transform of a tempered distribution satisfiesThe base cases follow from and integration by parts in the Fourier integral. Iterating gives the multi-index formulas. The convention matters: for the unscaled derivative, .
For , the angular-frequency transform is the tempered distributionThe numerator cancels the singularity at zero and makes this integral absolutely convergent. Differentiating and using determines this expression up to a Dirac delta distribution. That delta coefficient is zero: testing with the expanding Gaussian makes both the proposed expression and tend to zero, while stays fixed. Changing the subtraction convention would change the delta coefficient.
A real distribution is positive when for every nonnegative test function . Every positive distribution has order zero and is represented locally by a positive measure.
For the convention , if , thenalmost everywhere. Reversing both exponential signs gives the equivalent opposite convention.
When , its inverse Fourier integral is continuous by dominated convergence. If is also continuous and Fourier inversion identifies the two functions almost everywhere, then they agree everywhere.
For the angular-frequency convention and sufficient decay,
For the angular-frequency convention,Consequently cosine transforms to the half-sum of the two shifted deltas, while sine transforms to their signed difference divided by .
For the angular-frequency convention,so multiplication by a phase factor in frequency translates a function in physical space.
The squared sinc function is nonnegative and integrable; it occurs as the Fourier transform of a triangular function.
The cutoffs increase pointwise to one, while their Fourier transforms are nonnegative and have integral under the angular-frequency convention.
A periodic convolution operator with continuous periodic kernel is compact on , since its kernel is square integrable. In the normalized Fourier series basis it is diagonal, with multipliers . These multipliers include the full integral rather than its normalized Fourier coefficient.
When all multipliers are nonzero, the Moore–Penrose inverse of an operator acts by dividing each Fourier coefficient by . Its data domain is precisely the square-summability condition displayed. The dense range need not be closed, and writing the formal inverse series does not establish the Picard criterion.
For a continuously differentiable periodic kernel, integration by parts and the Riemann-Lebesgue lemma give . Nonperiodic data with have Fourier coefficients asymptotic to a nonzero multiple of . Their inverse coefficients therefore fail square summability, and there is no Hilbert-space inverse or least-squares minimizer. Periodic exponential data instead give the single-mode solution .
If is a compactly supported distribution and is any distribution, define . The inner function is smooth and supported in , hence is a test function for . Finite-order estimates prove continuity, while the tensor product of distributions proves commutativity after inserting compact cutoffs. For every test function , ; evaluating at zero against reflected test functions proves uniqueness. If both distributions have compact support, and the convolution theorem gives . Without a compact factor or another support/growth condition, arbitrary distributional convolution is not generally defined.
For a distribution and a compactly supported smooth kernel, differentiation with constant coefficients commutes with convolution wherever the kernel support stays inside the domain. The identity follows by testing against the translated kernel and tracking the sign of its derivative. A variable coefficient must remain inside the product before convolution; in general .
For any distribution and any test function , the convolution is a smooth function. On a compact set of values, the translated test functions and all their derivatives have supports in one fixed compact set, so distributional continuity permits every derivative:For constant-coefficient operators, . Hence a fundamental solution of a linear differential operator supplies a smooth particular solution for every compactly supported smooth datum. No temperedness of is needed.
If a Lebesgue-measurable set has positive measure, then its difference set contains an open neighbourhood of zero. For finite measure, the convolution is continuous and positive at zero; the general case follows by taking a finite positive-measure subset.
If a measurable set has measure , then for the sets and lie in an interval of length , soThus . This quantitative overlap argument is a bounded form of the Steinhaus theorem.
An approximate identity is a family of integrable kernels whose total mass is one and whose mass concentrates near zero as . Under standard hypotheses, converges to in norm and at almost every Lebesgue point.
In the distributional sense,This kernel is not positive, but testing it against a smooth compactly supported function and using the Dirichlet integral proves convergence.
The Cauchy approximate identity isIt is a probability density of total mass one, and its mass outside every fixed neighbourhood of zero tends to zero as . It therefore converges to the Dirac delta function as a distribution.
For , Fubini gives .
For , induction in the convolution integral givesIts Fourier transform in the angular-frequency convention is .
If , then its Fourier transform is continuous and tends to zero as . Approximate in by a compactly supported smooth function; integration by parts makes the approximant's transform decay, while transfers the conclusion.
For a continuous real function on , uniform step approximation on a compact interval gives a finite step function with small uniform error. Each cosine integral over an interval has absolute value at most . ThereforeFirst choose to make the first term small, then let grow with fixed. This proves the cosine version of the Riemann-Lebesgue lemma without differentiating ; the sine and complex-exponential versions follow in the same way.
The functions converge weakly to zero in . Indeed, every also belongs to on this finite interval, and the Riemann-Lebesgue lemma gives . However,so does not have the Schur property.
If a radial function on behaves like near zero and like at infinity, then its th power is locally integrable at zero exactly when and integrable at infinity exactly when . This follows from the radial measure factor .
The Dirichlet integral is the conditionally convergent improper integralIt controls the jump behavior of Fourier transforms and Fourier inversion at discontinuities.
For the unnormalized angular-frequency transform,After normalization, the Fourier transform extends unitarily to . For integrable and , inversion and Fubini give the identity directly.
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 .
Articles were limited to the first 100 out of 124 total.
Articles by others on the same topic
Fourier analysis is a mathematical technique used to analyze functions or signals by decomposing them into their constituent frequencies. Named after the French mathematician Jean-Baptiste Joseph Fourier, this method is based on the principle that any periodic function can be expressed as a sum of sine and cosine functions (Fourier series) or, more generally, as an integral of sine and cosine functions (Fourier transform) for non-periodic functions.