Skip to main content

Compactness: Introduction

  • Chapter
  • 703 Accesses

Part of the book series: Universitext: Tracts in Mathematics ((3080))

Abstract

Having established that every composition operator is bounded on H 2, we turn to the most natural follow-up question:

Which composition operators are compact?

The property of “boundedness” for composition operators means that each one takes bounded subsets of H 2 to bounded subsets. The question above asks us to specify precisely how much the inducing map ϕ has to compress the unit disc into itself in order to insure that the operator Cφ, compresses bounded subsets of H 2 into relatively compact ones.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   79.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about 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

© 1993 Springer Science+Business Media New York

About this chapter

Cite this chapter

Shapiro, J.H. (1993). Compactness: Introduction. In: Composition Operators. Universitext: Tracts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0887-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-0887-7_3

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-94067-0

  • Online ISBN: 978-1-4612-0887-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics