Computability in Unitary Representations of Compact Groups
Xiaolin Ge, J. Ian Richards · Birkhäuser Boston eBooks · 1993
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.