2017
DOI: 10.1016/j.bulsci.2017.07.004
|View full text |Cite
|
Sign up to set email alerts
|

Atomic decomposition and weak factorization in generalized Hardy spaces of closed forms

Abstract: We give an atomic decomposition of closed forms on R n , the coefficients of which belong to some Hardy space of Musielak-Orlicz type. These spaces are natural generalizations of weighted Hardy-Orlicz spaces, when the Orlicz function depends on the space variable. One of them, called H log , appears naturally when considering products of functions in the Hardy space H 1 and in BM O. As a main consequence of the atomic decomposition, we obtain a weak factorization of closed forms whose coefficients are in H log… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 19 publications
0
4
0
Order By: Relevance
“…Moreover, Bonami et al in [7,6] deduced that (1.1) is sharp in some sense and, in [8], they proved that, in dimension one, H log (R) is indeed the smallest space, in the sense of the inclusion of sets, having the above property. Recently, in [3,10], a bilinear decomposition theorem for multiplications of functions in H p (R n ) and its dual space C α (R n ) was established when p ∈ (0, 1) and α := 1/p−1, and the sharpness in some sense of this bilinear decomposition was also obtained therein.…”
Section: Introductionmentioning
confidence: 99%
“…Moreover, Bonami et al in [7,6] deduced that (1.1) is sharp in some sense and, in [8], they proved that, in dimension one, H log (R) is indeed the smallest space, in the sense of the inclusion of sets, having the above property. Recently, in [3,10], a bilinear decomposition theorem for multiplications of functions in H p (R n ) and its dual space C α (R n ) was established when p ∈ (0, 1) and α := 1/p−1, and the sharpness in some sense of this bilinear decomposition was also obtained therein.…”
Section: Introductionmentioning
confidence: 99%
“…The question of the optimality of the result was raised in this article, to know whether H ϕ (R n ) can be replaced by a smaller vector space. The pointwise multiplier theorem of Nakai and Yabuta [31] allowed the authors in [7] to answer that the smallest Banach space containing H ϕ (R n ) is in some sense the smallest Banach space containing these products. Optimality was deduced in one dimension in [10] from an exact factorization and in [7] for n ≥ 2 from a weak factorization.…”
Section: Introductionmentioning
confidence: 99%
“…The pointwise multiplier theorem of Nakai and Yabuta [31] allowed the authors in [7] to answer that the smallest Banach space containing H ϕ (R n ) is in some sense the smallest Banach space containing these products. Optimality was deduced in one dimension in [10] from an exact factorization and in [7] for n ≥ 2 from a weak factorization. More related progress on this subject over R n can be found in [12,6,45,46].…”
Section: Introductionmentioning
confidence: 99%
“…By proving that the dual space of H log (R n ) is the generalized BMO space BMO log (R n ) introduced by Nakai and Yabuta [50], which also characterizes the set of multipliers of BMO (R n ) (see also the recent survey [48] on this subject of Nakai), Bonami et al in [8] deduced that H log (R n ) in (1.3) is sharp in some sense. Moreover, Bonami et al in [7] proved that every atom of H log (R n ) can be written as a finite linear combination of product distributions in the space H 1 (R n ) × BMO (R n ) and, in dimension one, Bonami and Ky in [9] proved that H log (R) is indeed the smallest space satisfying (1.3). Recently, in [4,11], a bilinear decomposition theorem for multiplications of elements in H p (R n ) and its dual space C α (R n ) was established when p ∈ (0, 1) and α := 1/p − 1, and the sharpness of this bilinear decomposition was also obtained therein.…”
Section: Introductionmentioning
confidence: 99%