Topics in invariant descriptive set theory (Q5946084): Difference between revisions

The author generalizes two concepts from special cases of Polish group actions on Polish spaces: the logic actions by the group~\(S_\infty\) (the group of permutations of~\(\mathbb N\)) on the set of codes for countable infinite \(L\)-structures where \(L\)~is a~countable relational language and the analytic sets (which are invariant with respect to the trivial action \(g\cdot x=x\)). The concept of logic actions is generalized to a~generalization of elementary embeddability or of \(F\)-embeddability where \(F\)~is a~countable fragment of \(L_{\omega_1,\omega}\) for a~countable relational language~\(L\). The invariant descriptive set theory then involves generalizations from logic actions to other actions by other Polish groups. The generalization of analytic sets is a so-called satisfactory set which are analytic and in some sense sufficiently closed sets; invariant Borel sets are satisfactory and satisfactory sets are invariant analytic sets. This generalization is new and nontrivial also in the special case of logic actions. Another generalization yields the so-called actively-\(\omega\)-Souslin sets which are roughly speaking those \(\omega\)-Souslin sets for which the action \(a:G\times X\to X\) extends in a~coherent way to an action of~\(G\) on the tree used in the Souslin representation. The main theorem of the paper states that for any continuous action \(a:G\times X\to X\) by a~closed subgroup~\(G\) of~\(S_\infty\), for any \(S\subseteq X\), \(S\)~is satisfactory if and only if \(S\)~is actively-\(\omega\)-Souslin. This theorem is the reason for the author's belief that the ``right'' generalization of the analytic sets are satisfactory sets and not the invariant analytic sets. The main theorem is used to produce a~new type of a~finer topology on~\(X\) for which a~given action \(a:G\times X\to X\) remains continuous.