Skip to main content

9. The Sz.-Nagy-Halmos similarity problem

  • Chapter
  • First Online:
Similarity Problems and Completely Bounded Maps

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1618))

  • 758 Accesses

Abstract

We present the author’s recent counterexample to the Halmos similarity problem (described above as Problem 0.3): there is a polynomially bounded operator on Hilbert space which is not similar to a contraction. We also include two related finite dimensional estimates related to n x n-matrices. For one of them, the estimate for polynomially bounded n x n-matrices, the sharp order of growth, when n tends to infinity, is not yet known.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gilles Pisier .

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin/Heidelberg

About this chapter

Cite this chapter

Pisier, G. (2001). 9. The Sz.-Nagy-Halmos similarity problem. In: Similarity Problems and Completely Bounded Maps. Lecture Notes in Mathematics, vol 1618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44563-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-44563-0_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41524-4

  • Online ISBN: 978-3-540-44563-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics