Paper VReading edition

Exact error formulas for estimated packets

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

E8 Exact error formulas for estimated packets

The error of an estimated packet is often described by a segmentation score. For approximation, an exact norm formula is more useful because it separates value errors from geometric disagreement.

Theorem E8.1: Exact scalar region formula

Let \(E,F\) be measurable subsets of a measure space, let \(a,b\in{\mathbb C}\), and let \(1\leq p<\infty\). Then

\[ \begin{aligned} \|a{\mathbf 1}_E-b{\mathbf 1}_F\|_p^p ={}& |a-b|^p\mu(E\cap F) +|a|^p\mu(E\setminus F)\\ &+|b|^p\mu(F\setminus E). \end{aligned} \]

For equal amplitudes,

\[ \|a{\mathbf 1}_E-a{\mathbf 1}_F\|_p = |a|\mu(E\mathbin\triangle F)^{1/p}. \]

Proof of Theorem E8.1

The sets \(E\cap F\), \(E\setminus F\), and \(F\setminus E\) are disjoint. The difference takes the values \(a-b\), \(a\), and \(-b\) on these three sets and is zero elsewhere. Integrating its \(p\)th power gives the formula.

Corollary E8.2: Location error for one step

Let \(0\leq\tau,\widehat\tau\leq1\) and \(H_\tau={\mathbf 1}_{[\tau,1]}\). For \(1\leq p<\infty\),

\[ \|aH_\tau-aH_{\widehat\tau}\|_p = |a||\tau-\widehat\tau|^{1/p}. \]

In the supremum norm, the error equals \(|a|\) whenever \(\tau\neq\widehat\tau\).

Proof of Corollary E8.2

The symmetric difference of the two intervals has length \(|\tau-\widehat\tau|\). The supremum statement follows because the two steps differ by \(a\) on a nonempty interval.

Theorem E8.3: Location stability for higher order packets

Let \(m\geq1\), \(1\leq p<\infty\), and \(0\leq\tau,\widehat\tau\leq1\). Then

\[ \|\phi_{m,\tau}-\phi_{m,\widehat\tau}\|_{L^p(0,1)} \leq \frac{|\tau-\widehat\tau|} {(m-1)!((m-1)p+1)^{1/p}}. \]

For \(p=\infty\),

\[ \|\phi_{m,\tau}-\phi_{m,\widehat\tau}\|_\infty \leq \frac{|\tau-\widehat\tau|}{(m-1)!}. \]

Thus location error is Lipschitz for every derivative jump packet of positive order, while a value jump has only the finite \(L^p\) modulus in Corollary E8.2.

Proof of Theorem E8.3

Assume \(\tau<\widehat\tau\). Differentiation with respect to the location parameter gives

\[ \frac{\partial}{\partial u}\phi_{m,u}(t) =-\phi_{m-1,u}(t) \]

for almost every \(t\). Hence

\[ \phi_{m,\tau}-\phi_{m,\widehat\tau} = \int_\tau^{\widehat\tau}\phi_{m-1,u}{\,\mathrm d} u. \]

Minkowski's inequality gives

\[ \|\phi_{m,\tau}-\phi_{m,\widehat\tau}\|_p \leq |\tau-\widehat\tau| \sup_u\|\phi_{m-1,u}\|_p. \]

The supremum is bounded by the norm of \(t^{m-1}/(m-1)!\) on \([0,1]\), which is the stated constant. The supremum norm argument is identical.

E8.1 Several regions

Let \((E_i)_{i=0}^{I}\) and \((F_j)_{j=0}^{J}\) be measurable partitions of the same domain, up to null sets. Let \(a_i\) and \(b_j\) be the corresponding values. The index zero may be used for a background region.

Theorem E8.4: Overlap matrix formula

Define

\[ M_{ij}=\mu(E_i\cap F_j). \]

For \(1\leq p<\infty\),

\[ \left\| \sum_{i=0}^{I}a_i{\mathbf 1}_{E_i} - \sum_{j=0}^{J}b_j{\mathbf 1}_{F_j} \right\|_p^p = \sum_{i=0}^{I}\sum_{j=0}^{J}|a_i-b_j|^pM_{ij}. \]

The row sums of \(M\) are \(\mu(E_i)\), and the column sums are \(\mu(F_j)\).

Proof of Theorem E8.4

The intersections \(E_i\cap F_j\) form a measurable partition. On such an intersection, the two piecewise constant functions have values \(a_i\) and \(b_j\). Integrate the constant error over every intersection. The marginal identities follow by summing the partition pieces in a fixed row or column.

Corollary E8.5: Background and packet error

Suppose the true and estimated packets use the same amplitude list \((a_i)_{i=0}^{I}\), but possibly different regions. Then

\[ \|j-\widehat j\|_p^p = \sum_{i,k}|a_i-a_k|^p\mu(E_i\cap F_k). \]

Only off diagonal overlaps contribute.

Proof of Corollary E8.5

Apply Theorem E8.4 with \(b_k=a_k\). The diagonal terms vanish.

An overlap matrix records correct and misclassified regions for an exact packet-error calculation.
An overlap matrix records both correct regions and every type of misclassification. The exact packet norm weights each entry by the corresponding value difference.

View full-size figure (new tab)

E8.2 Boundary tube control

For a closed set \(\Gamma\), write

\[ N_\delta(\Gamma) = \{x:{\operatorname{dist}}(x,\Gamma)<\delta\}. \]

Definition E8.6: Linear tube bound

A boundary \(\Gamma\) has a linear tube bound if there are constants \(C_\Gamma\) and \(\delta_0>0\) such that

\[ \mu(N_\delta(\Gamma)) \leq C_\Gamma\delta \]

for \(0<\delta<\delta_0\).

Bounded Lipschitz domains and many finite perimeter sets have estimates of this form, with constants controlled by geometric size. The next theorem only requires the displayed bound.

Theorem E8.7: Geometric packet bound

Let \(E\) be a region with boundary \(\Gamma\), and suppose

\[ E\mathbin\triangle F \subseteq N_\delta(\Gamma). \]

If \(\Gamma\) has a linear tube bound and \(0<\delta<\delta_0\) lies in its stated range, then for \(1\leq p<\infty\),

\[ \|a{\mathbf 1}_E-a{\mathbf 1}_F\|_p \leq |a|(C_\Gamma\delta)^{1/p}. \]

If amplitudes \(a\) and \(b\) differ, then

\[ \|a{\mathbf 1}_E-b{\mathbf 1}_F\|_p \leq |a-b|\mu(E\cap F)^{1/p} + (|a|+|b|)(C_\Gamma\delta)^{1/p}. \]

Proof of Theorem E8.7

The equal amplitude case follows from Theorem E8.1 and the tube inclusion. For unequal amplitudes, split the error into its value mismatch on \(E\cap F\) and the two disagreement pieces. Apply the triangle inequality and the same tube estimate.

Example E8.8: A perturbed disk

Let \(E\) and \(F\) be concentric disks of radii \(r\) and \(r+\delta\) in \({\mathbb R}^2\), with \(\delta>0\). Then

\[ \mu(E\mathbin\triangle F) = \pi\bigl((r+\delta)^2-r^2\bigr) = 2\pi r\delta+\pi\delta^2. \]

For equal amplitude \(a\), the exact \(L^2\) packet error is

\[ |a|\sqrt{2\pi r\delta+\pi\delta^2}. \]

This gives the expected square root dependence on boundary displacement.

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