Codex @codex  0

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 $q$, their detail-space orthogonal complements have $q$ 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.

An interval-adapted wavelet basis is an orthonormal basis of $L^2[0,1]$ 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.

Let $\psi$ be an integrable function with at least one vanishing moment. For a unit jump discontinuity $f(x)=H(x-x_0)$, where $H$ is the Heaviside step function, substitution into the coefficient givesThe signed integral of the whole analyzing function is zero, but the jump discontinuity cuts through its support of a function and usually leaves an unbalanced partial integral. At fixed relative position $\theta$ with nonzero partial integral, the coefficient decays as $\sqrt{a}$, slower than the $a^{q+1/2}$ Taylor remainder bound on a smooth region. “Edges survive” means this relative contrast: the normalized coefficients still tend to zero as $a\to 0$.

For an original exact comparison, use the smooth polynomial $f(x)=x+x^2$ at $b=0$. The Haar wavelet $h$ and the second-difference analyzing function $\eta$ giveThe linear term cancels for $\eta$; it remains for $h$. For the fixed unit jump discontinuity $H(x)$, choose $b=-a/4$ so that $\theta =1/4$ at every scale. Then

Position matters. If an analyzing function's support of a function lies entirely on one constant side of the jump discontinuity, its coefficient is zero. Even a crossing can cancel: $\eta$ has zero partial integral at $\theta =3/2$. A jump discontinuity on a dyadic interval boundary can likewise escape finer Haar wavelets whose supports do not cross it. These examples describe particular functions and normalizations, not a universal ranking of wavelets for signal processing.

A multiresolution analysis organizes a function into successively finer approximation spaces. In the usual orthonormal construction on $L^2(\mathbb{R})$, these are closed linear subspaces $(V_j{)}_{j\in \mathbb{Z}}$ withRescaling relates the levels: $f(x)\in V_j$ if and only if $f(2x)\in V_{j+1}$. Integer translates of a scaling function form an orthonormal basis of $V_0$. The detail space is the orthogonal complement of $V_j$ inside $V_{j+1}$, giving $V_{j+1}=V_j\oplus W_j$. Coarse information and new details therefore fit together without overlap in squared L2 norm.

For the Haar wavelet, $V_j$ consists of square-integrable functions constant on cells of length $2^{-j}$. Splitting every cell into two halves creates one new contrast per old cell, the Haar refinement identity. On the bounded example $[0,1]$, the first three spaces have dimensions $1,2,4$: a whole-interval mean, two half-interval means, and four quarter-interval means. The Haar projection diagram displays those three resolutions. This bounded construction starts at level zero; the displayed intersection condition refers to the full family on the real line.

The usefulness is a controlled way to increase resolution. Earlier coarse information remains available while new wavelet coefficients identify what the finer description adds. The wavelet approximation complexity connects this extra resolution to both approximation error and the number of coefficients being estimated. ^[ref]

An orthonormal multiresolution analysis is a sequence of closed subspaces $V_j\subset L^2(\mathbb{R})$ satisfying $V_j\subset V_{j+1}$, $\overline{{\bigcup }_j{V}_j}=L^2(\mathbb{R})$, ${\bigcap }_j{V}_j=\{0\}$, and $f\in V_j$ iff $f(2\cdot )\in V_{j+1}$. A scaling function $\varphi$ has integer translates forming an orthonormal basis of $V_0$, and its scaled translates ${\varphi }_{j,k}(x)=2^{j/2}\varphi (2^{j}x-k)$ span $V_j$. Thus $V_j$ contains information at resolution about $2^{-j}$.

The detail space $W_j=V_{j+1}\cap V_j^{\perp }$ is generated by the corresponding wavelet functions ${\psi }_{j,k}(x)=2^{j/2}\psi (2^{j}x-k)$. The orthogonal splitting $V_{j+1}=V_j\oplus W_j$ iterates toAccordingly a square-integrable signal has a coarse-and-detail wavelet series,and its wavelet projection onto $V_J$ keeps the coarse coefficients and details below level $J$. Increasing $J$ 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 $d_J\asymp 2^J$. For the Haar wavelet on a unit interval this is exactly $2^J$, 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 ${\sigma }^2/n$, estimating the $d_J$ retained coefficients without shrinkage givesThe first term decreases with resolution while the second increases, making the bias-variance tradeoff explicit. Equivalently, a fixed orthogonal regression projection of rank $d_J$ has effective degrees of freedom $d_J$ and prediction optimism $2{\sigma }^2{d}_J/n$ 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.

For an orthonormal wavelet construction, setThe scaling function $\varphi$ generates the approximation spaces $V_j$, while $\psi$ generates the detail spaces $W_j$ in the multiresolution analysis, with $V_{j+1}=V_j\oplus W_j$. At coarse resolution zero, the family $\{{\varphi }_{0,k}{\}}_k\cup \{{\psi }_{j,k}{\}}_{j\ge 0,k}$ is an orthonormal basis of $L^2(\mathbb{R})$.

For the given square-integrable function the coefficients and wavelet series areFor 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 basisAn $L^2$ hypothesis alone does not assert pointwise convergence.

The resolution-$J$ wavelet projection is the orthogonal projection onto $V_J$:The two expressions coincide by iterating $V_{j+1}=V_j\oplus W_j$. Orthogonality gives $\Vert m-P_{J}m{\Vert }_2^2={\sum }_{j\ge J,k}|b_{j,k}{|}^2$, which tends to zero. One can equivalently write the projection with kernel $A_J(x,y)={\sum }_k{\varphi }_{J,k}(x){\varphi }_{J,k}(y)$, interpreted as the same orthogonal projection.

In fixed-design nonparametric regression, the observations satisfywith independent errors. In the usual Gaussian version ${\epsilon }_i\sim N(0,{\sigma }^2)$. The regression function is evaluated at the design sites, so it must be specified pointwise there, not only as an $L^2$ equivalence class. For $x_i=i/n$, the observations concern $m$ on $[0,1]$. They cannot identify its values outside this interval. Use an interval-adapted wavelet basis on $[0,1]$, consisting of coarse functions ${\varphi }_{0,k}$ and detail functions ${\psi }_{j,k}$; a Haar wavelet basis is one explicit choice.

Here is a wavelet regression estimator valid for every $n$. Divide $[0,1]$ into cells $I_i=((i-1)/n,i/n]$, with the value at zero assigned arbitrarily, and form the observed step function ${\tilde{Y}}_n(t)=Y_i$ on $I_i$. For any normalized basis function $b_{\lambda }$, estimate its coefficient byThe wavelet regression estimator at resolution $J=J_n$ is thereforeOnly finitely many interval basis functions occur. Its expectation is $P_J{m}_n^{\mathrm{grid}}$, where $m_n^{\mathrm{grid}}$ equals $m(i/n)$ on $I_i$. Thus approximation of $m$ includes the resolution bias and the grid discretization bias. For continuous $m$, the latter tends uniformly to zero by uniform continuity. No smoothness or consistency claim for arbitrary pointwise representatives of $L^2$ functions is needed to define the estimator.

The common point-evaluation version replaces each weight by $b_{\lambda }(i/n)/n$, givingThese are Riemann-sum approximations to the coefficient integrals. For Haar wavelets, $n=2^L$, and $J\le L$, 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 $2^J\le n$; 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 isAlternatively, soft thresholding replaces each detail coefficient by $\mathrm{sgn}(\hat{b})(|\hat{b}|-\tau {)}_{+}$. 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 $q_{\lambda }^2={\sum }_i{w}_{\lambda i}^2$. Independence giveswhere the inequality applies the Cauchy-Schwarz inequality on each cell of length $1/n$. In the dyadic Haar implementation, $q_{\lambda }^2=1/n$ exactly. For Gaussian errors, the normalized coefficient noise is standard normal. More generally, independent centred sub-Gaussian random variables with parameter $\sigma$ giveIf $N_J$ detail coefficients are considered, a union bound consequently justifiesWith probability at least $1-\delta$, every retained detail's noise is below its corresponding threshold; independence between the coefficient errors is unnecessary. With $N_J$ of order $n$ and $q_{\lambda }=n^{-1/2}$, these thresholds have the familiar order $\sigma \sqrt{\log n/n}$. 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 $\sigma$ 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 $\sigma /\sqrt{n}$. 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 ${\tau }_{\lambda }=\sigma q_{\lambda }\sqrt{N_J/\delta }$.

An orthonormal multiresolution analysis consists of closed subspaces $V_j\subset L_2(\mathbb{R})$, $j\in \mathbb{Z}$, with $V_j\subset V_{j+1}$, $\overline{{\bigcup }_j{V}_j}=L_2(\mathbb{R})$, ${\bigcap }_j{V}_j=\{0\}$, and the dilation equivalence $h\in V_j⟺h(2\cdot )\in V_{j+1}$. A scaling function $\varphi$ has integer translates forming an orthonormal basis of $V_0$. Henceis an orthonormal basis of $V_j$. Set $W_j=V_{j+1}\ominus V_j$, the orthogonal complement of $V_j$ inside $V_{j+1}$. A function $\psi$ whose integer translates form an orthonormal basis of $W_0$ produces a complete orthonormal wavelet system $\{2^{j/2}\psi (2^j\cdot -k):j,k\in \mathbb{Z}\}$: different $W_j$ are orthogonal, their sum contains every difference $V_b\ominus V_a$, and density together with the zero intersection exhausts $L_2(\mathbb{R})$.

Here is the filter construction that guarantees such a wavelet. Nesting puts $\varphi$ in $V_1$, so expansion in its orthonormal basis gives the scaling refinement equation $\varphi ={\sum }_n{a}_n\varphi (2\cdot -n)$, with $a\in {\ell }_2$. Define the MRA low-pass filter and its complementary quadrature mirror filter bySplitting the orthonormal translates and Fourier periodization identity at $2t$, as in part (b), gives $|m(t){|}^2+|m(t+\pi ){|}^2=1$ almost everywhere. Consequently the rows ofhave length one and are orthogonal; the matrix is unitary. Put $b_n=(-1{)}^n\overline{a_{1-n}}$ and $\psi ={\sum }_n{b}_n\varphi (2\cdot -n)$, so $q(t)=\frac{1}{2}{\sum }_n{b}_n{e}^{-int}$.

To see completeness as well as orthogonality, identify $V_1$ with its fine-scale coefficient sequences and take their Fourier series. Group the frequencies $t$ and $t+\pi$ 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 $\varphi$ and $\psi$ correspond to the Fourier basis in the respective channels. They therefore jointly form an orthonormal basis of $V_1$. The orthogonal complement channel gives the wavelet completion of a multiresolution filter, namely the integer translates of $\psi$ span $W_0$. This proves the asserted relation with an orthonormal wavelet.

Let $W_j=V_{j+1}\ominus V_j$ denote the orthogonal complement of $V_j$ inside $V_{j+1}$. The Meyer-Mallat theorem constructs a wavelet whose integer function translations form an orthonormal basis of $W_0$. Dilation then gives the orthogonal decomposition into orthogonal complements $L^2(\mathbb{R})={⨁}_{j\in \mathbb{Z}}{W}_j$, so its translates and dilates form an orthonormal wavelet basis.

Using the MRA low-pass filter, choose the high-pass symbol $n(\xi )=e^{-i\xi }\overline{m(\xi +\pi )}$. The quadrature mirror filter identity makes the two analysis channels orthonormal. The resulting Fourier transform formula isEquivalently, with the refinement coefficients from the scaling refinement equation, put $g_k=(-1{)}^{k-1}\overline{h_{1-k}}$ and $\psi (x)=\sqrt{2}{\sum }_k{g}_k\phi (2x-k)$. This index choice gives precisely the displayed high-pass symbol. Changing all $g_k$ by one constant unit phase gives the same orthonormal wavelet construction. In particular the often-used $(-1{)}^k\overline{h_{1-k}}$ convention differs only by a global minus sign. The basis is ${\psi }_{j,k}(x)=2^{j/2}\psi (2^{j}x-k)$ for $j,k\in \mathbb{Z}$.

A wavelet with $p$ vanishing moments satisfies $x^k\psi \in L^1$ and $\int x^k\psi (x)dx=0$ for $0\le k<p$. The moment differentiation of the Fourier transform theorem states that these weighted integrability hypotheses make $\hat{\psi }\in C^{p-1}$, with ${\hat{\psi }}^{(k)}(\xi )=\int (-ix{)}^k\psi (x)e^{-ix\xi }dx$. Hence ${\hat{\psi }}^{(k)}(0)=0$. The MRA projection Fourier identity, together with density of the approximation spaces and continuity of $\hat{\phi }$ at zero, gives $|\hat{\phi }(0)|=1$. 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 $C^{p-1}$ near $\pi$ and $\hat{\phi }$ is $C^{p-1}$ near zero. These hypotheses hold, for example, for a compactly supported scaling function with a finite refinement filter. The wavelet identity givesThe denominator is nonzero near zero. Its reciprocal and the exponential are $C^{p-1}$, so the product rule and the zero Taylor polynomial of $\hat{\psi }$ give the smooth-mask vanishing-moment criterion

The printed integrability hypothesis alone does not guarantee ordinary higher derivatives. It gives only a continuous $\hat{\phi }$. Without added smoothness, Taylor theorem for $\hat{\psi }$ still gives $m(\pi +t)=o(|t{|}^{p-1})$ for the representative defined by the quotient: a Peano zero. This establishes the value at $\pi$, and for $p\ge 2$ the first derivative there, but it does not automatically establish iterated derivatives.

Here is a lacunary scaling-phase regularity counterexample for $p\ge 3$. Start with a compactly supported Daubechies wavelet having $p$ vanishing moments, with scaling function ${\phi }_0$ and finite MRA low-pass filter $m_0$. Define the periodic phaseThe Fourier coefficients of $\theta$ are absolutely summable. The Wiener algebra is closed under multiplication and the exponential series, so $a$ and $a^{-1}$ have absolutely summable Fourier coefficients. Thus $\phi$ is an absolutely summable combination of integer function translations of ${\phi }_0$, belongs to $L^1\cap L^2$, and generates the same $V_0$. 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 $\theta (2t)=\theta (t)+\theta (t+\pi )$ gives $a(2t)=a(t)a(t+\pi )$, so the periodic phase change of a scaling function produces $m(t)=a(t+\pi )m_0(t)$. 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 $t_0=2\pi k/2^j$, the difference quotient of the terms with $j\le n\le {\log }_2(1/|h|)$ is $1+O((2^{n}h{)}^2)$ per term. The sum of these errors and the remaining tail divided by $h$ are bounded; the finitely many earlier terms have finite limits. Hence $(\theta (t_0+h)-\theta (t_0))/h={\log }_2(1/|h|)+O(1)$, which has no finite limit. The exponential has the same failure of differentiability. Dyadic points are dense, and $m_0(\pi +t)$ is nonzero for sufficiently small $t\ne 0$. Thus $m$ is not differentiable on any neighborhood of $\pi$, so an ordinary second derivative at $\pi$, 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.

For $0<\alpha \le 1$, uniform Lipschitz-$\alpha$ means that one constant $M$ satisfies $|f(x)-f(y)|\le M|x-y{|}^{\alpha }$ for every $x,y\in [0,1]$. The resulting Hölder space has normFor the subsequent estimates at general $\alpha >0$, use the higher-order Hölder class convention: write $\alpha =r+\beta$ with $r\ge 0$ an integer and $0<\beta \le 1$, and require $f\in C^r([0,1])$ with $f^{(r)}$ uniformly Lipschitz-$\beta$. ThusAt integer $\alpha =k$, this uses $C^{k-1,1}$; the alternative classical $C^k$ convention is stronger on this compact closed interval and also suffices for the estimates.

For exponents above one, a first-difference inequality alone forces the function to be constant. Partition $[x,y]$ into $n$ equal pieces and use the triangle inequality: $|f(y)-f(x)|\le M|y-x{|}^{\alpha }{n}^{1-\alpha }\to 0$. Consequently a nontrivial higher-order definition is needed for the full range of exponents in the later wavelet estimates. Equivalently, higher-order Hölder class gives a local Taylor polynomial with remainder bounded by $C\Vert f{\Vert }_{C^{\alpha }}|x-x_0{|}^{\alpha }$.

Use localization and cancellation of the assumed interval-adapted wavelet basis: at scale $j$, every detail wavelet has support diameter at most $B{2}^{-j}$, L1 norm at most $B^{\prime }{2}^{-j/2}$, and annihilates polynomials of degree less than $q$. These bounds also apply to the modified boundary wavelets; a restriction of an arbitrary whole-line wavelet without the cancellation-preserving boundary construction would not suffice. The finitely many coarse scaling functions can be treated separately.

Write $\alpha =r+\beta$ with $0<\beta \le 1$ as above. Because $\alpha <q$, we have $r<q$. Choose $x_0$ in the support of a function of ${\psi }_{j,n}$, and let $T_{x_0}$ be the degree-$r$ Taylor polynomial of $f$. The Hölder-Taylor remainder bound givesFor $r=0$ this is the Hölder seminorm bound. For $r\ge 1$, the integral Taylor remainder is bounded using $f^{(r)}(t)-f^{(r)}(x_0)$, whose magnitude is at most $[f^{(r)}{]}_{C^{0,\beta }}|t-x_0{|}^{\beta }$.

The vanishing moments remove $T_{x_0}$ from the inner product. Applying the remainder estimate and the L1 norm bound on the localized support yields the wavelet coefficient decay for Hölder functionsThusHere $C$ depends on the fixed wavelet family, the exponent and boundary construction, but not on $f,j,n$. The proof uses the assumed regularity and moments; it does not identify the minimal Daubechies wavelet order with its differentiability order, which need not coincide.

Let $M$ bound the piecewise Hölder norms, and let $B=\Vert f{\Vert }_{\infty }$. At scale $j$, classify a wavelet as bad when its localized support of a function meets a discontinuity, and as good otherwise. Compact support and bounded overlap imply at most $C_{0}K$ bad wavelets per scale and at most $C_1{2}^j$ total wavelets. A good support lies in a single smooth piece, so the preceding wavelet coefficient decay for Hölder functions gives $|c_{j,n}|\le CM{2}^{-j(\alpha +1/2)}$. The permitted bounded-function estimate gives $|c_{j,n}|\le CB{2}^{-j/2}$ for bad coefficients.

Consider a specific N-term approximation: retain all coarse scaling functions and all wavelets through scale $J$, and also retain the bad coefficients at scales $J<j\le L$, where $L=\lceil 2\alpha J\rceil$. Since $\alpha >1/2$, $L\ge J$ for large $J$. Its term count is bounded byBy the Parseval identity, its squared L2 norm error is the sum of omitted squared coefficients. The good tail satisfiesand the remaining bad tail satisfiesChoose $J=\lfloor {\log }_2(N/(2C_2^{\prime }))\rfloor$ with a fixed sufficiently large $C_2^{\prime }$; then the $O(KJ)$ extra terms fit the remaining budget for all sufficiently large $N$, while $2^J$ is comparable to $N$. Padding to $N$ terms does not increase the error. The best N-term approximation is at least as accurate as this constructed selection, soThe constant may depend on the finite number of jumps, the piecewise Hölder norms, $B$ and the fixed wavelet family. Values exactly at the jumps are immaterial in $L^2$. The improvement comes from retaining only a bounded number of jump-crossing coefficients at each finer scale, as in best N-term wavelet approximation of piecewise Hölder functions.