On the Borel complexity of characterized subgroups (Q5963980)

The first author et al. gave in [J. Pure Appl. Algebra 197, No. 1--3, 23--41 (2005; Zbl 1065.22003)] the following definition: Let \(X\) be a compact abelian group. A subgroup \(H\) of \(X\) is called \textit{characterized} if there exists a sequence of characters \(\mathbf{v}=(v_n)_{n\in \mathbb{N}}\) of \(X\) such that \(H=s_{\mathbf{v}}(X)\) with \(s_{\mathbf{v}}(X):=\{x\in X:v_n(x)\rightarrow 0\}\). By Borel complexity of characterized subgroups the authors mean the study of the classes of the following Borel hierarchy which these subgroups belong to: \[ \begin{aligned} \{\text{open sets}\}\subseteq \mathfrak{G}_\delta &=\{G_\delta\text{-sets}\}\subseteq \mathfrak{G}_{\delta\sigma}=\{\text{countable unions of }G_\delta\text{-sets}\}\\ \{\text{closed sets}\}\subseteq \mathfrak{F}_\sigma &=\{F_\sigma\text{-sets}\}\subseteq \mathfrak{F}_{\sigma\delta}=\{\text{countable intersections of }F_\sigma\text{-sets}\}. \end{aligned} \] If \(X\) is infinite, then all the listed inclusions are proper. The first author and \textit{S. S. Gabriyelyan} started in [Topology Appl. 160, No. 18, 2427--2442 (2013; Zbl 1280.22003)] with the study of Borel complexity of \(s_{\mathbf{v}}(X)\) for compact abelian groups \(X\). If \(X\) is metrizable and \(\mathbf{v}\) is a sequence of characters, they associated to \(\mathbf{v}\) a complete metric group topology \(\tau_{\mathbf{v}}\) on \(X\). In the paper under review the authors present a general tool for the problem when \(s_{\mathbf{v}}(X)\) is an \(F_\sigma\)-group. They prove as one of their main results:\newline Let \((X,\tau)\) be a compact metrizable abelian group, and let \(\mathbf{v}\) be a sequence of characters of \(X\). Then \(s_{\mathbf{v}}(X)\) is an \(F_\sigma\)-set of \(X\) if and only if \(s_{\mathbf{v}}(X)\in\tau^*_{\mathbf{v}}\). (Here \(\tau^*_{\mathbf{v}}\) is the so called \(F_\sigma\)-test topology on \(X\), where \(\tau\subseteq \tau^*_{\mathbf{v}}\subseteq \tau_{\mathbf{v}}\) holds.) The interesting paper is very technical, and the proofs are highly non-trivial.