Haar refinement identity Created 2026-10-07 Updated 2026-10-14
The normalized Haar scaling functions and wavelets obey
This 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.
An orthonormal multiresolution analysis is a sequence of closed subspaces satisfying , , , and iff . A scaling function has integer translates forming an orthonormal basis of , and its scaled translates span . Thus contains information at resolution about .
The detail space is generated by the corresponding wavelet functions . The orthogonal splitting iterates to
Accordingly a square-integrable signal has a coarse-and-detail wavelet series,
and its wavelet projection onto keeps the coarse coefficients and details below level . Increasing adds finer-scale oscillations and localized features. On the real line there are infinitely many translates at each level; for a bounded observation interval, with an appropriate interval or periodic construction, the relevant approximation dimension satisfies . For the Haar wavelet on a unit interval this is exactly , corresponding to a separate mean on each dyadic subinterval.
This hierarchy gives a concrete meaning to wavelet approximation complexity. Coarse resolution uses few coefficients and can miss sharp features; fine resolution uses more coefficients and can fit noise. By orthogonality, projection bias is the energy of the omitted details,
For an orthonormal sequence model with independent coefficient noise of variance , estimating the retained coefficients without shrinkage gives
The first term decreases with resolution while the second increases, making the bias-variance tradeoff explicit. Equivalently, a fixed orthogonal regression projection of rank has effective degrees of freedom and prediction optimism under independent equal-variance errors.
Wavelets also permit local rather than only global complexity control. Thresholding small estimated detail coefficients, for example by soft thresholding, retains strong local structure while suppressing fine-scale noise elsewhere. A sparse retained coefficient set can represent localized features much more economically than keeping every coefficient through a high level. Its locations and scales matter as well as its count. If that set is selected using the same noisy responses, however, selection adds adaptivity: its raw coefficient count is not automatically its covariance-based degrees of freedom. Resolution or threshold tuning should therefore account for prediction error, using an appropriate risk estimate or cross-validation, rather than only decreasing training error.
Wavelet complexity is controlled by retained resolutions and coefficients; more detail reduces approximation bias while increasing estimation variance and sensitivity to noise.
For an orthonormal wavelet construction, set
The scaling function generates the approximation spaces , while generates the detail spaces in the multiresolution analysis, with . At coarse resolution zero, the family is an orthonormal basis of .
For the given square-integrable function the coefficients and wavelet series are
For real wavelets these are the real L2 inner products; use complex conjugates for a complex basis. The series converges in the L2 norm, and its coefficients satisfy the Parseval identity for a Hilbertian basis
An hypothesis alone does not assert pointwise convergence.
The resolution- wavelet projection is the orthogonal projection onto :
The two expressions coincide by iterating . Orthogonality gives , which tends to zero. One can equivalently write the projection with kernel , interpreted as the same orthogonal projection.
In fixed-design nonparametric regression, the observations satisfy
with independent errors. In the usual Gaussian version . The regression function is evaluated at the design sites, so it must be specified pointwise there, not only as an equivalence class. For , the observations concern on . They cannot identify its values outside this interval. Use an interval-adapted wavelet basis on , consisting of coarse functions and detail functions ; a Haar wavelet basis is one explicit choice.
Here is a wavelet regression estimator valid for every . Divide into cells , with the value at zero assigned arbitrarily, and form the observed step function on . For any normalized basis function , estimate its coefficient by
The wavelet regression estimator at resolution is therefore
Only finitely many interval basis functions occur. Its expectation is , where equals on . Thus approximation of includes the resolution bias and the grid discretization bias. For continuous , the latter tends uniformly to zero by uniform continuity. No smoothness or consistency claim for arbitrary pointwise representatives of functions is needed to define the estimator.
The common point-evaluation version replaces each weight by , giving
These are Riemann-sum approximations to the coefficient integrals. For Haar wavelets, , and , they equal the integrated-weight coefficients exactly if the dyadic cells and pointwise basis versions are chosen right-closed. Each retained basis function is then constant on every sampling cell. This gives a concrete implementation by the discrete wavelet transform. A sensible finest resolution has ; beyond the grid scale there are details the data cannot resolve.
For wavelet coefficient thresholding, retain the coarse coefficients but discard detail coefficients dominated by noise. A hard-threshold version is
Alternatively, soft thresholding replaces each detail coefficient by . The unthresholded wavelet regression estimator retains all details at the chosen resolution; thresholding retains evidence for local features while suppressing small fluctuations.
The thresholds can be derived from a simultaneous wavelet coefficient noise bound. Write . Independence gives
where the inequality applies the Cauchy-Schwarz inequality on each cell of length . In the dyadic Haar implementation, exactly. For Gaussian errors, the normalized coefficient noise is standard normal. More generally, independent centred sub-Gaussian random variables with parameter give
If detail coefficients are considered, a union bound consequently justifies
With probability at least , every retained detail's noise is below its corresponding threshold; independence between the coefficient errors is unnecessary. With of order and , these thresholds have the familiar order . Coefficients larger than their noise level represent potential signal, and a coefficient zero in the discretized mean is not selected on this simultaneous event. If is unknown, a consistent noise-scale estimate can be substituted; for Gaussian errors and predominantly negligible finest-level signal, the median absolute finest-level coefficients divided by the standard-normal absolute median estimates . Without a Gaussian or sub-Gaussian tail assumption, finite variance alone does not justify the logarithmic thresholds: Chebyshev inequality and the union bound instead permit .
An orthonormal multiresolution analysis consists of closed subspaces , , with , , , and the dilation equivalence . A scaling function has integer translates forming an orthonormal basis of . Hence
is an orthonormal basis of . Set , the orthogonal complement of inside . A function whose integer translates form an orthonormal basis of produces a complete orthonormal wavelet system : different are orthogonal, their sum contains every difference , and density together with the zero intersection exhausts .
Here is the filter construction that guarantees such a wavelet. Nesting puts in , so expansion in its orthonormal basis gives the scaling refinement equation , with . Define the MRA low-pass filter and its complementary quadrature mirror filter by
Splitting the orthonormal translates and Fourier periodization identity at , as in part (b), gives almost everywhere. Consequently the rows of
have length one and are orthogonal; the matrix is unitary. Put and , so .
To see completeness as well as orthogonality, identify with its fine-scale coefficient sequences and take their Fourier series. Group the frequencies and over a half-period. The two rows of the displayed matrix are the normalized coarse and complementary channels; their unitarity is exactly an onto isometry from these two channels to the fine-scale coefficient space. Translates of and correspond to the Fourier basis in the respective channels. They therefore jointly form an orthonormal basis of . The orthogonal complement channel gives the wavelet completion of a multiresolution filter, namely the integer translates of span . This proves the asserted relation with an orthonormal wavelet.
An orthonormal multiresolution analysis consists of closed subspaces of a Hilbert space of the Hilbert space such that
There is a scaling function whose integer function translations form an orthonormal basis of . Consequently form an orthonormal basis of ; in particular is invariant under integer function translations.
Let be the orthogonal complement of in . Nesting, density and the trivial intersection imply the orthogonal direct sum
For example, telescoping and letting , gives this decomposition; the corresponding orthogonal projections converge strongly to zero and the identity by the intersection and density properties.
To construct the orthonormal wavelet, use to write the scaling refinement equation , with and . Put . The orthonormal translates and Fourier periodization criterion proved in part (b), applied to the scaling refinement equation, yields
This is the quadrature mirror filter identity. Define
The Fourier series of is , and . The two rows and form a unitary matrix almost everywhere: both have squared norm one and their inner product is zero. This wavelet completion of a multiresolution filter proves not just orthogonality but completeness. Splitting a finer-scale coefficient Fourier series into its values at and , this invertible two-channel matrix resolves it into a coarse-scale channel and its complementary channel. Thus the integer function translations of form an orthonormal basis of .
The dilated functions therefore form an orthonormal basis of each . The orthogonal direct sum proves the conclusion: every orthonormal multiresolution analysis produces an orthonormal wavelet basis of .
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.
An orthonormal multiresolution analysis consists of closed subspaces of the L2 space with , dense union, intersection , and the dilation rule . A scaling function has integer translates forming an orthonormal basis of . Equivalently,
form an orthonormal basis of . Let . Density and the trivial intersection imply .
Nesting gives the scaling refinement equation , with the coefficients in the normalized finer-scale basis. Orthogonality of the translates gives . Its Fourier form is the quadrature mirror filter identity , where .
Set and define in . Its high-pass symbol is . The matrix
is unitary almost everywhere. Under the identification of with its finer-scale coefficient space, this two-channel unitary transform splits that space into the translates of and the translates of . The latter are therefore an orthonormal basis of . Dilating gives an orthonormal wavelet basis
This wavelet completion of a multiresolution filter explains how the multiresolution analysis supplies a single orthonormal wavelet. The argument uses coefficient-space completeness, not just pairwise orthogonality.
Use the Fourier transform convention . An orthonormal multiresolution analysis is a family of closed vector subspaces , indexed by integers, with , , and . Its dilation condition is if and only if . The space is invariant under integer function translations and admits a scaling function whose integer function translations form an orthonormal basis. Consequently form an orthonormal basis of .
Since , expansion in that orthonormal basis gives the scaling refinement equation
The series converges in the L2 norm. The associated low-pass filter of a multiresolution analysis is the periodic Fourier series symbol
Initially the symbol is defined almost everywhere. Orthonormal integer function translations give the quadrature mirror filter identity almost everywhere. For a Lebesgue integrable scaling function, its Fourier transform is continuous and ; choosing a constant phase makes and the continuous representative near zero has . Different conventions absorb into the refinement coefficients; the displayed convention fixes that ambiguity.
A wavelet with vanishing moments satisfies and for . The moment differentiation of the Fourier transform theorem states that these weighted integrability hypotheses make , with . Hence . The MRA projection Fourier identity, together with density of the approximation spaces and continuity of at zero, gives . These are the two analytic theorems needed in addition to the quadrature mirror filter construction.
For the ordinary derivative conclusion, assume also that the MRA low-pass filter is near and is near zero. These hypotheses hold, for example, for a compactly supported scaling function with a finite refinement filter. The wavelet identity gives
The denominator is nonzero near zero. Its reciprocal and the exponential are , so the product rule and the zero Taylor polynomial of give the smooth-mask vanishing-moment criterion
The printed integrability hypothesis alone does not guarantee ordinary higher derivatives. It gives only a continuous . Without added smoothness, Taylor theorem for still gives for the representative defined by the quotient: a Peano zero. This establishes the value at , and for the first derivative there, but it does not automatically establish iterated derivatives.
Here is a lacunary scaling-phase regularity counterexample for . Start with a compactly supported Daubechies wavelet having vanishing moments, with scaling function and finite MRA low-pass filter . Define the periodic phase
The Fourier coefficients of are absolutely summable. The Wiener algebra is closed under multiplication and the exponential series, so and have absolutely summable Fourier coefficients. Thus is an absolutely summable combination of integer function translations of , belongs to , and generates the same . Unimodularity preserves orthogonality and unit norm of its integer function translations; the inverse phase preserves their complete span. The same approximation spaces therefore give a multiresolution analysis.
The identity gives , so the periodic phase change of a scaling function produces . In the high-pass formula the phases cancel:
The associated wavelet is therefore exactly the original one, with unchanged vanishing moments.
At any dyadic point , the difference quotient of the terms with is per term. The sum of these errors and the remaining tail divided by are bounded; the finitely many earlier terms have finite limits. Hence , which has no finite limit. The exponential has the same failure of differentiability. Dyadic points are dense, and is nonzero for sufficiently small . Thus is not differentiable on any neighborhood of , so an ordinary second derivative at , understood as the derivative of a locally defined first derivative, need not exist. The Peano zero remains valid. This separates the intended smooth-mask theorem from what the literal assumptions establish.
Put , the detail space of the multiresolution analysis. The Meyer-Mallat theorem gives a function whose integer translates form an orthonormal basis of . Dilations then give an orthonormal basis of each , and the density and trivial-intersection axioms imply
For an explicit filter construction, write the scaling refinement equation . With a quadrature mirror filter one may take and . A harmless constant sign or integer translation gives an equivalent orthonormal wavelet.
The answer is no with the integer-translation and dilation conventions of this multiresolution analysis. The orthonormal basis axiom forces to consist of functions constant on the cells . Dilation forces to consist of functions constant on . However, the proposed scaling function changes value at , in the interior of the cell . It is therefore not in , contradicting nesting:
Changing values at endpoints makes no difference in . The usual Haar wavelet instead uses the scaling function ; an arbitrary half-unit translation does not preserve the required refinement grid.
At zero, the partial products are . Their assumed convergence and force and . Uniform convergence on compact sets makes continuous. The identity with gives with squared norm . Define by the inverse Fourier transform in . The Plancherel theorem and the other given integral identities give
Define as the closed span of . These functions form an orthonormal basis of , and dyadic dilation gives the scale axiom. Shifting the infinite product gives
so the finite Fourier series of gives a scaling refinement equation and . The coarse-scale projection argument of part 1(b) proves the trivial-intersection axiom.
For density, take a function with bounded Fourier support. The MRA projection Fourier identity gives, for large ,
Uniform convergence of to one on that support proves the limit. Since is an orthogonal projection, . Such functions are dense in , giving
Thus all the multiresolution analysis axioms hold. Under the strong convergence and orthogonality assumptions supplied here, the additional nonvanishing condition is not needed in this last verification; it is useful when establishing those assumptions from a filter.
For the multiresolution analysis and its detail spaces , take the completed tensor product . Since ,
The three tensor-product wavelets are
Taking products of members of the two one-dimensional families gives an orthonormal basis of each respective completed tensor product. Density and the coarse-scale trivial intersection yield
as an orthonormal basis of . The normalization is in two dimensions. On the square, tensorize the interval-adapted wavelet basis and include the finite coarse scaling function part.
An orthonormal wavelet is such that is an orthonormal basis. A multiresolution analysis is a nested family of closed spaces with trivial intersection, dense union, dyadic scaling, integer-translation invariance of , and a generator whose integer translates form an orthonormal basis of . The Meyer-Mallat theorem says every such analysis has an orthonormal wavelet whose translates span .
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.
Scaling function Created 2026-10-05 Updated 2026-10-14
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.
Scaling refinement equation Created 2026-10-05 Updated 2026-10-06
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.
Tensor-product wavelet basis Created 2026-10-05 Updated 2026-10-14
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.
An orthonormal multiresolution analysis separates coarse scaling functions from progressively finer wavelet details. On a bounded interval, the approximation space at level has dimension of order . Higher resolution reduces projection bias but estimates more noisy coefficients. In an orthonormal Gaussian sequence model with coefficient noise variance , risk is the omitted squared coefficient sum plus . Selecting or shrinking individual detail coefficients yields spatially adaptive complexity; a data-selected subset need not have effective degrees of freedom equal to its raw selected count.