Skip to main content

Estimates of Multipliers in L 1

  • Chapter
Haar Series and Linear Operators

Part of the book series: Mathematics and Its Applications ((MAIA,volume 367))

  • 322 Accesses

Abstract

Here we use the notations of Chapter 12, 13. If |λ n,k | ≤ 1 for (n, k) ∈ Ω, then the corresponding multiplier Λ is of week type (1,1) and its norm is less than 2. This statement was proved in Chapter 5. This chapter is devoted to the unimprovability of the mentioned result.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Novikov, I., Semenov, E. (1997). Estimates of Multipliers in L 1 . In: Haar Series and Linear Operators. Mathematics and Its Applications, vol 367. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1726-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-1726-7_14

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4693-2

  • Online ISBN: 978-94-017-1726-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics