LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

A WEIGHTED MAXIMAL WEAK‐TYPE INEQUALITY

Photo from academic.microsoft.com

Let w be a dyadic Ap weight (1 ≤ p < ∞) and let MD be the dyadic Hardy-Littlewood maximal function on Rd. The paper contains the proof of the… Click to show full abstract

Let w be a dyadic Ap weight (1 ≤ p < ∞) and let MD be the dyadic Hardy-Littlewood maximal function on Rd. The paper contains the proof of the estimate w ({ x ∈ R : Mf(x) > w(x) }) ≤ Cp[w]Ap ∫ Rd |f |dx, where the constant Cp does not depend on the dimension d. Furthermore, the linear dependence on [w]Ap is optimal, which is a novel result for 1 < p <∞. The estimate is shown to hold in a wider context of probability spaces equipped with an arbitrary tree-like structure. The proof rests on the Bellman function method: we construct an abstract special function satisfying certain size and concavity requirements.

Keywords: weak type; type inequality; weighted maximal; maximal weak; function

Journal Title: Mathematika
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.