How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Local support, affine cancellation, and normalization of multilevel D4 detail rows
Statement
In the multilevel transform of Periodic multilevel transform using the four-tap Daubechies filter, a detail row at stage has translates, is supported on at most consecutive input indices on a periodic lift, has Euclidean norm , and annihilates every affine function of the lifted sample index. Its norm, meaning the sum of absolute row entries, is at most the square root of its support size. Since , this support has fewer than indices and so its lifted support contains no repeated residue modulo .
Facts & Assumptions
Given: , , the D4 filter pair, and the multilevel periodic procedure defined above.
Periodic multilevel transform using the four-tap Daubechies filter: stage applies the four-tap low-pass filter to the approximation branch times before taking a four-tap high-pass detail, with all indices periodic modulo the current length.
The explicit four-tap Daubechies pair satisfies the orthogonal filter and two-moment conditions: and , and the D4 filters satisfy the QMF conditions.
Inverse and Parseval identity for a periodic orthogonal compact-filter transform: every applied one-level D4 analysis matrix and their multilevel composition are orthogonal.
Proof
Expanding the recursion shows that the detail row at stage , translated to its first input index, has taps at indices , where each of ranges over ; each tuple contributes at that index, and the effective coefficient at is the sum of these products over all tuples with that index. This follows by substituting the low-pass sum at each earlier stage into the current high-pass sum. The largest such index is , so the row is supported in at most consecutive locations. Because , this number is , so the locations are distinct modulo .
Regard the effective taps in step 1.1 before reducing their input positions modulo . A low-pass stage maps an affine input sequence to an affine sequence: , which is affine in . Repeating this argument keeps the coarse sequence affine. The next high-pass stage applied to an affine sequence gives by [F2]. Therefore the effective detail tap row has zero sum and zero first moment. After summing all tuple contributions at each lifted location, periodic reduction assigns the resulting effective coefficients to residues. Step 1.1 confines these locations to one interval of fewer than consecutive integers, so reduction modulo is injective on that interval and the row lifts back to the same interval.
By [F3], each row of the full multilevel analysis matrix has squared Euclidean norm . If its support has locations with coefficients , then , since . Hence its norm is at most . The detail block at stage has the length of the current approximation after downsampling, namely rows. This and the affine cancellation from step 2.1 establish every clause of the Statement.
Depends on
Used by
Dependency tree · two levels
6 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Gilbert Strang and Kevin Amaratunga, Wavelets and Filter Banks, MIT OpenCourseWare 18.327, Handouts 7, 8 and 13 (standard reference, not scraped)
- Stéphane Mallat, A Wavelet Tour of Signal Processing, 3rd ed., Chapter 9 (standard reference, not scraped)