Paper VReading edition

Singular packets and exact reconstruction

Reading tools
Reading libraryFind statementsInspect Lean
Switch work

Saved reading

Read side by side

Start reading

Resources & source

Original TeX with line links · Download TeX

The wording and mathematics follow the retained manuscript. This reading format does not add a proof review or extend Lean coverage.

Skip contents and start reading

E7 Singular packets and exact reconstruction

Trace data identify the singular part

A value jump needs a step packet. A jump in a derivative needs a truncated power of the corresponding order. Subtracting these finite packets matches the one sided traces and leaves the regular remainder covered by the theorem's Sobolev assumptions. The packet construction and the approximation operator play separate roles.

A packet decomposition becomes useful for approximation when it separates a component that should be retained from a component that should be compressed. The simplest singular packets are steps. Higher order packets record jumps in derivatives.

For \(m\geq0\) and \(0<\tau<1\), define

\[ \phi_{m,\tau}(t) = \frac{(t-\tau)_+^m}{m!}. \]

Thus \(\phi_{0,\tau}={\mathbf 1}_{[\tau,1]}\). On each side of \(\tau\), the packet is a polynomial. Its derivative of order \(m\) has a unit jump at \(\tau\).

Definition E7.1: Sobolev step packet class

Fix \(r\geq1\), \(1\leq p\leq\infty\), and an integer \(Q\geq0\). The class \({\mathcal F}_{r,p}(Q)\) consists of functions

\[ f=s+\sum_{q=1}^{Q}a_q\phi_{0,\tau_q} \]

with \(s\in W^{r,p}(0,1)\) and

\[ 0<\tau_1<\cdots<\tau_Q<1. \]

No lower bound on the jump amplitudes is required for representation. Recovery results later impose such a bound.

Theorem E7.2: Higher order singular packet decomposition

Let

\[ 0=\tau_0<\tau_1<\cdots<\tau_Q<\tau_{Q+1}=1. \]

Suppose the restriction of \(f\) to every interval \((\tau_q,\tau_{q+1})\) belongs to \(W^{r,p}\), and choose the one dimensional Sobolev representatives whose derivatives through order \(r-1\) have one sided traces at the endpoints. Define

\[ a_{q,m} = {\left[f^{(m)}\right]}_{\tau_q} = f^{(m)}(\tau_q+)-f^{(m)}(\tau_q-) \]

and

\[ j_f(t) = \sum_{q=1}^{Q}\sum_{m=0}^{r-1}a_{q,m}\phi_{m,\tau_q}(t). \]

Then

\[ s_f=f-j_f \]

has matching one sided derivatives through order \(r-1\) at every breakpoint and belongs to \(W^{r,p}(0,1)\). Its weak derivative of order \(r\) equals the piecewise classical derivative \(f^{(r)}\) almost everywhere.

Proof of Theorem E7.2

For \(0\leq \ell\leq m\), the classical derivative of \(\phi_{m,\tau}\) on the two open sides is

\[ \phi_{m,\tau}^{(\ell)}(t) = \frac{(t-\tau)_+^{m-\ell}}{(m-\ell)!}. \]

This derivative has zero jump when \(\ell<m\) and a unit jump when \(\ell=m\). Derivatives of order larger than \(m\) vanish on both open sides. It follows that subtracting the term \(a_{q,m}\phi_{m,\tau_q}\) removes exactly the jump in the derivative of order \(m\) without changing the other classical trace jumps. Hence \(s_f\) has matching traces through order \(r-1\).

On each partition interval, \(j_f\) is a polynomial of degree at most \(r-1\), so its weak derivative of order \(r\) is zero there. A piecewise \(W^{r,p}\) function whose traces through order \(r-1\) match across every breakpoint belongs to \(W^{r,p}(0,1)\). Repeated integration by parts on the partition intervals shows that all boundary terms cancel. Thus the weak derivative of order \(r\) is the piecewise weak derivative of \(f\).

Corollary E7.3: Uniqueness of the trace packet

Fix the breakpoints \(\tau_q\). If

\[ f=s+\sum_{q=1}^{Q}\sum_{m=0}^{r-1}b_{q,m}\phi_{m,\tau_q} \]

with \(s\in W^{r,p}(0,1)\), then

\[ b_{q,m}={\left[f^{(m)}\right]}_{\tau_q}. \]

The finite truncated power packet is therefore the unique packet supported at the declared breakpoints that removes all trace jumps through order \(r-1\).

Proof of Corollary E7.3

Every representative in \(W^{r,p}(0,1)\) has derivatives through order \(r-1\) that admit absolutely continuous representatives on compact subintervals, with matching one sided traces at each interior point. Taking the jump of the derivative of order \(m\) therefore removes the contribution of \(s\). The packet \(\phi_{m,\tau_q}\) has unit jump in its derivative of order \(m\), while all other declared packets have zero jump at that derivative order and breakpoint. Hence the remaining jump is exactly \(b_{q,m}\).

Remark E7.4

The theorem isolates only finitely many trace jumps. More general free discontinuity models may contain jump sets, Cantor parts, or singular derivatives that are not represented by a finite truncated power sum. The natural ambient theory is related to bounded variation and free discontinuity spaces [AmbrosioFuscoPallara2000].

Truncated-power packets represent jumps in a function and successive derivatives.
Truncated power packets encode jumps in a function and in its successive derivatives.

View full-size figure (new tab)

Let \(X\) be a normed linear space and let \(Q:X\to X\) be bounded and linear. The next identity is elementary, but it is the central separation principle.

Theorem E7.5: Exact retained packet identity

Let \(f=s+j\) in \(X\). Define

\[ \widetilde f=Qs+j. \]

Then

\[ \boxed{ f-\widetilde f=(I-Q)s. } \]

Consequently,

\[ \|f-\widetilde f\|=\|s-Qs\|. \]

Proof of Theorem E7.5

Subtract:

\[ f-\widetilde f =s+j-Qs-j =(I-Q)s. \]

Remark E7.6

The theorem assumes that the packet \(j\) is known. It does not supply a detector. It also does not say that every representation of \(f\) as \(s+j\) is useful. The point is that once a meaningful packet has been identified, its approximation error can be removed from the smooth approximation problem exactly.

Corollary E7.7: Sobolev rate after packet separation

Suppose \(Q_m\) satisfies

\[ \|s-Q_ms\|_{L^p} \leq C2^{-mr}\|s\|_{W^{r,p}} \]

for every \(s\in W^{r,p}(0,1)\). If \(f=s+j\) and \(j\) is retained, then

\[ \|f-(Q_ms+j)\|_{L^p} \leq C2^{-mr}\|s\|_{W^{r,p}}. \]

The same conclusion applies to the higher order decomposition in Theorem E7.2.

Proof of Corollary E7.7

Use Theorem E7.5 and the assumed approximation estimate.

Theorem E7.8: Reconstruction with an estimated packet

Let \(Q_m:X\to X\) be linear, let \(f=s+j\), let \(\widehat j\) be an estimated packet, and define

\[ \widehat f_m = Q_m(f-\widehat j)+\widehat j. \]

Then

\[ \boxed{ f-\widehat f_m = (I-Q_m)s+(I-Q_m)(j-\widehat j). } \]

If \(Q_m\) is bounded, then

\[ \|f-\widehat f_m\| \leq \|s-Q_ms\| + (1+\|Q_m\|)\|j-\widehat j\|. \]

Proof of Theorem E7.8

Since \(f-\widehat j=s+(j-\widehat j)\),

\[ \widehat f_m = Q_ms+Q_m(j-\widehat j)+\widehat j. \]

Subtract this expression from \(s+j\). The norm bound follows from

\[ \|(I-Q_m)u\| \leq (1+\|Q_m\|)\|u\|. \]
Global Fourier reconstruction compared with retaining a known jump and approximating its smooth background.
A global Fourier approximation must represent the jumps. A retained packet approximation applies the Fourier truncation only to the smooth component.

View full-size figure (new tab)

Source and conversion record

Source SHA-256: 5d3c6b2e5709c37ea551eb8fd1d823e5249c5fbc411d36b806241af4df888f36

Unsupported prose commands stop the build. The mathematical expression sequence is checked against the source, with manuscript macros expanded for display.

Conversion records

Notation in Paper V

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index