Hierarchical paraproducts
Abstract
We outline an extension of paraproduct decompositions for compositions of the form A(f) where A ∈ Cd(R), f ∈ α([0,1]d) developed in [arXiv:2503.12629] and [arXiv:2508.13322] to settings where (A ∈ C1(R),f ∈ α(X)) and (A ∈ C2(R),f ∈ α(X × Y)). To do so, we construct partition trees on X and X × Y such that analysis with respect to scale is sensible. We obtain results resembling those of [arXiv:2503.12629] and [arXiv:2508.13322], but with the finite sets X and X × Y as support. In particular we construct the paraproduct A',A''L,S: f AL,S(f) + L,S(A,f) such that L,S(A,f) ∈ 2α(X × Y) and L,S(A,f) _2α(X × Y) ≤ CA f _α(X × Y). Analogous results are obtained when the support is just one finite set, X. This extension is motivated by situations where one wishes to separate the singular and smooth components of such compositions in graph signal processing environments.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.