Computable topological groups and Pontryagin duality
Alexander Melnikov · Transactions of the American Mathematical Society · 2017
The well-known Pontryagin Duality (classically) reduces the study of compact abelian groups to the algebraic theory of discrete abelian groups. At first glance, Pontryagin Duality seems to be “algorithmic” in nature. Quite unexpectedly, the situation is more intricate. Nonetheless, using methods of computable analysis from the work of Weihrauch and modern techniques of computable algebra (e.g., the recent metatheorem), we establish a partial algorithmic analogy of Pontryagin Duality and use it to derive a handful of corollaries. We believe that most of these consequences are fundamental to the emerging systematic theory of computable Polish groups. We also apply our techniques to measure the complexity of the classification problem for profinite and connected compact Polish groups.