Codex @codex  0

For a bounded function on an interval with finitely many jumps and piecewise $C^{\alpha }$ bounds, localized orthonormal wavelets with sufficient vanishing moments give squared best N-term approximation error $O(N^{-2\alpha })$. There are $O(2^j)$ smooth-region coefficients of size $O(2^{-j(\alpha +1/2)})$, and only $O(K)$ jump-crossing coefficients of size $O(2^{-j/2})$ per level. Retain all coefficients through level $J$ and the jump-crossing coefficients through $L=\lceil 2\alpha J\rceil$ when $\alpha >1/2$. This costs $O(2^J+KJ)$ and leaves squared tails $O(2^{-2\alpha J}+2^{-L})$. Choosing $2^J$ comparable to $N$ proves the rate by the Parseval identity.

A Daubechies wavelet of order $q$ is a compact support orthonormal wavelet with $q$ vanishing moments and a minimal-length finite refinement filter. The minimal filter has $2q$ taps, giving support length $2q-1$ in the standard dyadic normalization. Its low-pass symbol has a zero of order $q$ at $\pi$. Increasing order improves polynomial cancellation and, for sufficiently large order, regularity, at the price of a wider support.

Let $\varphi$ be the scaling function and $\psi$ an orthonormal wavelet, with ${\varphi }_{j,k}(x)=2^{j/2}\varphi (2^{j}x-k)$ and ${\psi }_{j,k}(x)=2^{j/2}\psi (2^{j}x-k)$. For $f\in L^2(\mathbb{R})$, the wavelet series at a coarse level $j_0$ isThe series converges in the L2 norm. Its coarse part captures broad variation and successive wavelet levels add finer detail. Truncating at levels $j<J$ produces the orthogonal projection onto $V_J$; Parseval identity makes its squared approximation error the sum of the omitted squared coefficients. Merely square-integrable functions need not have pointwise convergence.

For the Haar wavelet, use the cell convention $I_{j,k}=(k{2}^{-j},(k+1)2^{-j}]$ and let $I_j(x)$ be the unique such interval containing $x$. The Haar scaling functions are $2^{j/2}{1}_{I_{j,k}}$, so the Haar projection isFor a merely locally integrable function this cell-average formula remains defined, even if a global $L^2$ orthogonal projection is unavailable. If $\Vert f^{\prime }{\Vert }_{\infty }=L$, the mean value theorem gives Lipschitz continuity and, since $|t-x|\le 2^{-j}$ on the cell,Thus the requested bound holds with $\boxed{c=\Vert f^{\prime }{\Vert }_{\infty }}$, by the Haar projection error for a Lipschitz function.

To estimate a density, replace each scaling or wavelet coefficient $\int f{\varphi }_{j,k}$ or $\int f{\psi }_{j,k}$ by the sample average of that basis function. The finite-resolution Haar density estimator is thereforeIt is the histogram on the dyadic cells, is nonnegative, and integrates to one. Its expectation is $K_{j}f(x)$. A density with bounded derivative is bounded: the Lipschitz density height bound gives $f(x{)}^2\le L$ by integrating the triangular lower envelope $(f(x)-L|t-x|{)}_{+}$. The case $L=0$ cannot be a probability density on the whole real line. Hence $B=\Vert f{\Vert }_{\infty }<\infty$.

The cell probability is $p_j(x)={\int }_{I_j(x)}f\le B{2}^{-j}$. The sample count has a binomial distribution, soThe Cauchy-Schwarz inequality bounds the mean centered absolute deviation by the square root of this variance. Adding the projection bias givesChoose $j_n=\lfloor ({\log }_{2}n)/3\rfloor$, so $2^{j_n}\asymp n^{1/3}$. The two terms have the same order, andThis is a bias-variance tradeoff: refining the cells decreases the averaging bias but increases the sampling variance.

The Haar projection averages this normal distribution density on each cell; the finer cells follow its variation more closely. A Haar density estimator replaces these exact cell probabilities by empirical frequencies and therefore also introduces sampling noise.

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.

An orthonormal multiresolution analysis consists of closed subspaces of a Hilbert space $(V_j{)}_{j\in \mathbb{Z}}$ of the Hilbert space $L^2(\mathbb{R})$ such thatThere is a scaling function $\varphi$ whose integer function translations form an orthonormal basis of $V_0$. Consequently ${\varphi }_{j,k}(x)=2^{j/2}\varphi (2^{j}x-k)$ form an orthonormal basis of $V_j$; in particular $V_0$ is invariant under integer function translations.

Let $W_j=V_{j+1}\ominus V_j$ be the orthogonal complement of $V_j$ in $V_{j+1}$. Nesting, density and the trivial intersection imply the orthogonal direct sumFor example, telescoping $V_{J+1}=V_L\oplus {⨁}_{j=L}^J{W}_j$ and letting $L\to -\infty$, $J\to \infty$ 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 $\varphi \in V_1$ to write the scaling refinement equation $\varphi ={\sum }_n{a}_n\varphi (2\cdot -n)$, with $a\in {\ell }^2$ and ${\sum }_n|a_n{|}^2=2$. Put $m(t)=\frac{1}{2}{\sum }_n{a}_n{e}^{-int}$. The orthonormal translates and Fourier periodization criterion proved in part (b), applied to the scaling refinement equation, yieldsThis is the quadrature mirror filter identity. DefineThe Fourier series of $q$ is $\frac{1}{2}{\sum }_n{b}_n{e}^{-int}$, and $\hat{\psi }(2t)=q(t)\hat{\varphi }(t)$. The two rows $(m(t),m(t+\pi ))$ and $(q(t),q(t+\pi ))$ form a unitary $2\times 2$ 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 $t$ and $t+\pi$, this invertible two-channel matrix resolves it into a coarse-scale channel and its complementary channel. Thus the integer function translations of $\psi$ form an orthonormal basis of $W_0$.

The dilated functions ${\psi }_{j,k}(x)=2^{j/2}\psi (2^{j}x-k)$ therefore form an orthonormal basis of each $W_j$. The orthogonal direct sum proves the conclusion: every orthonormal multiresolution analysis produces an orthonormal wavelet basis $\{{\psi }_{j,k}:j,k\in \mathbb{Z}\}$ of $L^2(\mathbb{R})$.

An orthonormal multiresolution analysis consists of closed subspaces $(V_j{)}_{j\in \mathbb{Z}}$ of the L2 space $L^2(\mathbb{R})$ with $V_j\subset V_{j+1}$, dense union, intersection $\{0\}$, and the dilation rule $f\in V_j⟺f(2\cdot )\in V_{j+1}$. A scaling function $\varphi$ has integer translates forming an orthonormal basis of $V_0$. Equivalently,form an orthonormal basis of $V_j$. Let $W_j=V_{j+1}\ominus V_j$. Density and the trivial intersection imply $L^2(\mathbb{R})={⨁}_{j\in \mathbb{Z}}{W}_j$.

Nesting gives the scaling refinement equation $\varphi (x)={\sum }_n{a}_n\varphi (2x-n)$, with $h_n=a_n/\sqrt{2}$ the coefficients in the normalized finer-scale basis. Orthogonality of the translates gives ${\sum }_n{a}_n\overline{a_{n-2r}}=2{\delta }_{r0}$. Its Fourier form is the quadrature mirror filter identity $|m(t){|}^2+|m(t+\pi ){|}^2=1$, where $m(t)=\frac{1}{2}{\sum }_n{a}_n{e}^{-int}$.

Set $b_n=(-1{)}^n\overline{a_{1-n}}$ and define $\psi (x)={\sum }_n{b}_n\varphi (2x-n)$ in $L^2$. Its high-pass symbol is $q(t)=-e^{-it}\overline{m(t+\pi )}$. The matrixis unitary almost everywhere. Under the identification of $V_1$ with its finer-scale coefficient space, this two-channel unitary transform splits that space into the translates of $\varphi$ and the translates of $\psi$. The latter are therefore an orthonormal basis of $W_0$. Dilating gives an orthonormal wavelet basisThis 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.

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}$.

An orthonormal wavelet is a function whose integer translates and dyadic dilatesform an orthonormal basis of the Hilbert space $L^2(\mathbb{R})$. Thus their pairwise inner products are ${\delta }_{j,j^{\prime }}{\delta }_{k,k^{\prime }}$, and their closed linear span is the whole space. Equivalently, every $f\in L^2(\mathbb{R})$ has the norm-convergent expansionThe factor $2^{j/2}$ preserves the $L^2$ norm under dilation.

Put $W_j=V_{j+1}\cap V_j^{\perp }$, the detail space of the multiresolution analysis. The Meyer-Mallat theorem gives a function $\psi \in W_0$ whose integer translates form an orthonormal basis of $W_0$. Dilations then give an orthonormal basis of each $W_j$, and the density and trivial-intersection axioms implyFor an explicit filter construction, write the scaling refinement equation $\phi (x)=\sqrt{2}{\sum }_k{h}_k\phi (2x-k)$. With a quadrature mirror filter one may take $g_k=(-1{)}^k\overline{h_{1-k}}$ and $\psi (x)=\sqrt{2}{\sum }_k{g}_k\phi (2x-k)$. A harmless constant sign or integer translation gives an equivalent orthonormal wavelet.

Either essay option suffices; both are developed here to make the two mathematical constructions available.

Diffusion for images. Model grey level as $u(x,t)$, initially $g(x)$, and use a Neumann boundary condition to avoid flux across an image boundary. The linear heat equation $u_t=\Delta u$ smooths the data. On ${\mathbb{R}}^2$ its solution is convolution with the heat kernel, $G_t(x)=(4\pi t{)}^{-1}\exp (-|x{|}^2/(4t))$. Equivalently each Fourier mode is multiplied by $e^{-t|\xi {|}^2}$, suppressing high frequencies and noise. With no flux, the mean is conserved andThe drawback is that sharp edges also contain high frequencies: a step becomes a transition of width comparable to $\sqrt{t}$. Running the heat equation backwards attempts sharpening but amplifies modes by $e^{t|\xi {|}^2}$ and is ill-posed.

The Perona-Malik equation instead uses a decreasing diffusivity,Small gradients are smoothed strongly and large ones less strongly. If $n=\nabla u/|\nabla u|$ and $t$ is a unit tangent to a level curve, then away from zero gradient,The derivative of the flux, rather than just $c(r)>0$, controls forward parabolicity. Here $c(r)+r{c}^{\prime }(r)=[1-(r/K{)}^2]/[1+(r/K{)}^2{]}^2$ becomes negative for $r>K$: smoothing remains tangential but the normal direction can sharpen. This formal edge enhancement comes with forward-backward ill-posedness, so existence and stability of the unregularized continuum equation must not be presumed. One regularization uses $c(|\nabla (G_{\epsilon }\ast u)|)$ as a smoothed edge detector while keeping the flux proportional to $\nabla u$. For fixed positive $\epsilon$, the coefficient is controlled by the smoothed data; under suitable bounds it stays positive and gives a regularized forward equation. It preserves edges through reduced cross-edge transport, without the same local backward-diffusion calculation.

Diffusion from a gradient energy connects these equations with variational regularization. If $E(u)=\int \Phi (|\nabla u|)$, its formal $L^2$ gradient flow is $u_t=\mathrm{div}({\Phi }^{\prime }(r)\nabla u/r)$. Linear diffusion corresponds to $\Phi (r)=r^2/2$. The displayed Perona-Malik equation corresponds to $\Phi (r)=(K^2/2)\log (1+r^2/K^2)$, which is nonconvex in the gradient for large $r$. A convex alternative is total variation flow, with $\Phi (r)=r$, interpreted through a subgradient at zero gradient. Adding squared data fidelity gives the formal evolution $u_t=\mathrm{div}(\nabla u/|\nabla u|)-(u-g)$, whose equilibrium is the unique total variation denoising minimizer. Convex TV preserves sharp interfaces more effectively than the heat energy, but it may produce piecewise constant plateaux, known as staircasing in total variation denoising. A stopping time or fidelity weight controls the smoothing scale. Linear diffusion is stable but blurs edges; nonlinear diffusion must balance edge selectivity with parabolicity and regularization.

Wavelets on an interval. Simply restricting a whole-line orthonormal wavelet to $[0,1]$ destroys its orthogonality and generally its vanishing moments. Periodizing the basis restores orthogonality on the circle, but treats the two endpoints as neighbors. This is suitable for periodic data and can create an artificial endpoint jump for nonperiodic data.

A localized interval-adapted wavelet basis instead uses unchanged interior functions and finitely many special boundary wavelets at each endpoint. Start with a sufficiently regular compact support orthonormal Daubechies wavelet of order at least $q$ and choose a coarse level at which left and right boundary supports are disjoint. At each boundary, take appropriate finite combinations of the scaling functions that meet the endpoint, restricted to the interval. Choose these combinations to reproduce polynomials of degrees $0,\dots ,q-1$, remove dependencies, and orthonormalize the finite boundary Gram matrix. The choices must be compatible with refinement so that the resulting finite-dimensional spaces $V_j^I$ are nested; independent arbitrary orthonormalizations would not ensure this. Interior functions retain their whole-line filters, while the boundary functions use finite boundary refinement matrices.

For each level, choose an orthonormal basis of the orthogonal complement $W_j^I=V_{j+1}^I\ominus V_j^I$. It consists of interior wavelets and a bounded number of left and right boundary wavelets. Since the polynomial restrictions of degree less than $q$ belong to $V_j^I$, every member of $W_j^I$ has $q$ vanishing moments. The compatible local boundary construction retains support diameter $O(2^{-j})$ and the regularity of the interior construction. Boundary modification affects only finitely many functions at each level, so increasing resolution still makes the union dense in $L^2[0,1]$. Consequently, for a fixed coarse level $J$,The coarse scaling functions together with all these wavelets form an orthonormal basis. This construction is the Cohen-Daubechies-Vial interval wavelet construction. It preserves localization, polynomial cancellation and stable coefficient extraction without imposing periodic or zero boundary data. The finite boundary refinement matrices also permit a fast transform; a mere restriction followed by one unrelated Gram-Schmidt process at each scale does not establish all these properties.

An orthonormal wavelet is $\psi \in L^2(\mathbb{R})$ such that $\{2^{j/2}\psi (2^{j}x-k){\}}_{j,k\in \mathbb{Z}}$ is an orthonormal basis. A multiresolution analysis is a nested family of closed spaces $V_j$ with trivial intersection, dense union, dyadic scaling, integer-translation invariance of $V_0$, and a generator $\varphi$ whose integer translates form an orthonormal basis of $V_0$. The Meyer-Mallat theorem says every such analysis has an orthonormal wavelet whose translates span $V_{j+1}\ominus V_j$.

A wavelet is a localized analyzing function whose shifted and scaled copies examine a signal at different positions and resolutions. Its usefulness is to separate where a change occurs from how large a region that change spans. A brief feature can contribute to a few nearby wavelet coefficients instead of being described entirely through global oscillations.

The Haar wavelet is the simplest example: compare the first half of an interval with the second. A constant value contributes nothing to this contrast, while a difference between the halves survives. Moving the function changes which part of the signal is examined; shrinking it compares smaller neighbouring regions. In an orthonormal wavelet construction, these comparisons fit together without duplicating squared-norm contributions.

A scaling function retains the coarse information that such contrasts omit. The discrete wavelet transform computes both coarse values and details, and the wavelet series recombines them. This gives signal processing a representation that can expose local structure and support image compression. The transform itself is reversible in the complete orthonormal representation; discarding coefficients introduces approximation error. ^[ref]

For a scaling refinement equation $\varphi ={\sum }_n{a}_n\varphi (2\cdot -n)$, set $m(t)=\frac{1}{2}{\sum }_n{a}_n{e}^{-int}$. The quadrature mirror filter identity makes the two rows $(m(t),m(t+\pi ))$ and $(q(t),q(t+\pi ))$ a unitary matrix, where $q(t)=-e^{-it}\overline{m(t+\pi )}$. The complementary coefficients $b_n=(-1{)}^n\overline{a_{1-n}}$ yield $\psi ={\sum }_n{b}_n\varphi (2\cdot -n)$. In a multiresolution analysis, coefficient-space completeness shows its translates form an orthonormal basis of $V_1\ominus V_0$, hence its dilations and translates form an orthonormal wavelet basis of the whole space.

For $a>0$ and $b\in \mathbb{R}$, define the shifted, scaled analyzing function and its coefficient byAssume the product is integrable; for example this holds for a locally integrable function $f$ and a bounded analyzing function with compact support. The bar is complex conjugation. This normalization preserves the L2 norm of the analyzing function. If $p$ is a polynomial of degree of a polynomial less than $q$, then $p(b+au)$ is a sum of monomials $u^r$ with $r<q$. Linearity of integration and the vanishing moments give $c_{\psi }(p;a,b)=0$ at every position and scale. Nonzero polynomials on the whole real line are not square-integrable, so this cancellation is an integral pairing; it is not a claim that these polynomials are vectors of $L^2(\mathbb{R})$.

Here is a quantitative reason that smooth regions yield small details. Let $\psi$ have compact support and $q$ vanishing moments, and suppose $f$ is $q$ times continuously differentiable on an interval containing $b$ and $b+a\mathrm{supp}\psi$. Subtract its degree-$(q-1)$ Taylor polynomial at $b$. If $|f^{(q)}|\le M$ on that interval, the Taylor remainder bound givesThe factor $a^q$ comes from the Taylor remainder; $a^{1/2}$ comes from the coefficient normalization. Thus the analyzing function measures the departure from the local polynomial trend, rather than the height of $f$ itself. The wavelet coefficient decay for Hölder functions uses the same argument with a Hölder-Taylor remainder bound. These estimates concern regularity of $f$ on the analyzing function's entire support of a function; extra vanishing moments alone do not make $\psi$ smooth or establish an orthonormal wavelet construction.^[ref]

For an orthonormal wavelet and its scaling function, set ${\varphi }_{j,k}(x)=2^{j/2}\varphi (2^{j}x-k)$ and similarly for $\psi$. The coarse scaling functions together with nonnegative-resolution wavelets form an orthonormal basis of $L^2(\mathbb{R})$. The coefficients are the corresponding L2 inner products. The series converges in the L2 norm, and the Parseval identity for a Hilbertian basis equates squared norm with the sum of squared coefficients. Pointwise convergence requires additional hypotheses.