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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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.
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.
Naimark, M.A. [1971], Normed Rings. Wolters-Noordhoff Publ., Groningen.
Pontryagin, L.S. [1966], Topological Groups. Gordon and Breach Science Publishers, Inc.
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.
Pour-El, M.B., J. Ian Richards [1989], Computability in Analysis and Physics. Springer-Verlag.
Soare, R.I. [1987], Recursively Enumerable Sets and Degrees. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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