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.
Two D4 vanishing moments give a local coefficient bound for smooth periodic samples
Statement
Let , , and let be -periodic and . Its restriction to an open interval belongs to ; write . Form for , and analyze with the multilevel D4 transform. For a detail coefficient at scale (), one has
Facts & Assumptions
Given: , a -periodic function , its restriction on an open interval , and the normalized samples .
Local support, affine cancellation, and normalization of multilevel D4 detail rows: each stage- detail row is supported on at most consecutive lifted samples, has norm at most the square root of this support bound, and annihilates affine data on that lift.
Smooth functions on the unit interval with bounded derivative data: for , the second derivative of is continuous and bounded by on a full period; periodicity gives the same bound on the periodic extension.
Taylor's Lagrange remainder follows from repeated Rolle steps: for a function and a center , differs from its degree-one Taylor polynomial at by for an intermediate point .
Proof
Fix a detail row at stage and lift its fewer-than- periodic support to a consecutive interval of integer indices. Periodicity makes the wrapped samples equal to at these lifted indices. Let be the midpoint of the support interval in physical coordinates. Its length is at most , so every support point is within of . The row's affine cancellation from [F1] removes the degree-one Taylor polynomial of at from the coefficient sum.
By [F3], each remaining Taylor remainder is bounded by . The row coefficient is the sum of these remainders weighted by times the detail-row entries. Using the bound from [F1] gives because . This is the asserted estimate.
Depends on
Used by
Dependency tree · two levels
9 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, Handout 13 (standard reference, not scraped)
- Stéphane Mallat, A Wavelet Tour of Signal Processing, 3rd ed., Chapter 9 (standard reference, not scraped)