Skip to main content

Computability in Unitary Representations of Compact Groups

  • Chapter
Logical Methods

Part of the book series: Progress in Computer Science and Applied Logic ((PCS,volume 12))

Abstract

This paper deals with the computability of unitary representations of compact groups. An algorithm is given to effectively decompose a unitary representation into its irreducible parts. Difficulties in finding the effective procedure are caused by the absolute lack of a priori information about the irreducible representations and the obligation of making decisions from inexact data. Several lemmas on group representations (classical, i.e. computability not mentioned) have been proved in order to design the algorithm which overcomes these difficulties.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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.

References

  • Crossley, J.N. [1981], (ed.) Aspects of Effective Algebra. Proceedings of a Conference at Monash University, Australia, 1-4 August 1979, Upside Down A Book Company, Yarra Glen, Victoria, Australia.

    MATH  Google Scholar 

  • Metakides, G., A. Nerode, R.A. Shore [1985], Recursive limits on the Hahn-Banach theorem. E. Bishop — Reflections on Him and Research, 1983 San Diego; ed. M. Rosenblatt, Contemp. Math. 39, 85–91, Amer. Math. Soc: Providence.

    Article  MathSciNet  Google Scholar 

  • Naimark, M.A. [1971], Normed Rings. Wolters-Noordhoff Publ., Groningen.

    Google Scholar 

  • Pontryagin, L.S. [1966], Topological Groups. Gordon and Breach Science Publishers, Inc.

    Google Scholar 

  • Pour-El, M.B., J. Ian Richards [1983], Noncomputability in analysis and physics: a complete determination of the class of noncomputable linear operators. Advances in Mathematics, 48, 44–47.

    Article  MathSciNet  Google Scholar 

  • Pour-El, M.B., J. Ian Richards [1989], Computability in Analysis and Physics. Springer-Verlag.

    Google Scholar 

  • Soare, R.I. [1987], Recursively Enumerable Sets and Degrees. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer Science+Business Media New York

About this chapter

Cite this chapter

Ge, X., Richards, J.I. (1993). Computability in Unitary Representations of Compact Groups. In: Crossley, J.N., Remmel, J.B., Shore, R.A., Sweedler, M.E. (eds) Logical Methods. Progress in Computer Science and Applied Logic, vol 12. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0325-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-0325-4_12

  • Publisher Name: Birkhäuser, Boston, MA

  • Print ISBN: 978-1-4612-6708-9

  • Online ISBN: 978-1-4612-0325-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics