Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTopological dynamics and the complexity of strong types
55
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We develop topological dynamics for the group of automorphisms of a monster model of any given theory. In particular, we find strong relationships between objects from topological dynamics (such as the generalized Bohr compactification introduced by Glasner) and various Galois groups of the theory in question, obtaining essentially new information about them, e.g. we present the closure of the identity in the Lascar Galois group of the theory as the quotient of a compact, Hausdorff group by a dense subgroup. We apply this to describe the complexity of bounded, invariant equivalence relations, obtaining comprehensive results, subsuming and extending the existing results and answering some open questions from earlier papers. We show that, in a countable theory, any such relation restricted to the set of realizations of a complete type over $emptyset$ is type-definable if and only if it is smooth. Then we show a counterpart of this result for theories in an arbitrary (not necessarily countable) language, obtaining also new information involving relative definability of the relation in question. As a final conclusion we get the following trichotomy. Let $mathfrak{C}$ be a monster model of a countable theory, $p in S(emptyset)$, and $E$ be a bounded, (invariant) Borel (or, more generally, analytic) equivalence relation on $p(mathfrak{C})$. Then, exactly one of the following holds: (1) $E$ is relatively definable (on $p(mathfrak{C})$), smooth, and has finitely many classes, (2) $E$ is not relatively definable, but it is type-definable, smooth, and has $2^{aleph_0}$ classes, (3) $E$ is not type definable and not smooth, and has $2^{aleph_0}$ classes. All the results which we obtain for bounded, invariant equivalence relations carry over to the case of bounded index, invariant subgroups of definable groups.
rate research
Read More
The following strong form of density of definable types is introduced for theories T admitting a fibered dimension function d: given a model M of T and a definable subset X of M^n, there is a definable type p in X, definable over a code for X and of the same d-dimension as X. Both o-minimal theories and the theory of closed ordered differential fields (CODF) are shown to have this property. As an application, we derive a new proof of elimination of imaginaries for CODF.
Let $G$ be the group $mathbb{Z}^d$ or the monoid $mathbb{N}^d$ where $d$ is a positive integer. Let $X$ be a subshift over $G$, i.e., a closed and shift-invariant subset of $A^G$ where $A$ is a finite alphabet. We prove that the topological entropy of $X$ is equal to the Hausdorff dimension of $X$ and has a sharp characterization in terms of the Kolmogorov complexity of finite pieces of the orbits of $X$. In the version of this paper that has been published in Theory of Computing Systems, the proof of Lemma 4.3 contains a confusing typographical error. This version of the paper corrects that error.
For a group $G$ definable in a first order structure $M$ we develop basic topological dynamics in the category of definable $G$-flows. In particular, we give a description of the universal definable $G$-ambit and of the semigroup operation on it. We find a natural epimorphism from the Ellis group of this flow to the definable Bohr compactification of $G$, that is to the quotient $G^*/{G^*}^{00}_M$ (where $G^*$ is the interpretation of $G$ in a monster model). More generally, we obtain these results locally, i.e. in the category of $Delta$-definable $G$-flows for any fixed set $Delta$ of formulas of an appropriate form. In particular, we define local connected components ${G^*}^{00}_{Delta,M}$ and ${G^*}^{000}_{Delta,M}$, and show that $G^*/{G^*}^{00}_{Delta,M}$ is the $Delta$-definable Bohr compactification of $G$. We also note that some deeper arguments from the topological dynamics in the category of externally definable $G$-flows can be adapted to the definable context, showing for example that our epimorphism from the Ellis group to the $Delta$-definable Bohr compactification factors naturally yielding a continuous epimorphism from the $Delta$-definable generalized Bohr compactification to the $Delta$-definable Bohr compactification of $G$. Finally, we propose to view certain topological-dynamic and model-theoretic invariants as Polish structures which leads to some observations and questions.
The Omitting Types Theorem in model theory and the Baire Category Theorem in topology are known to be closely linked. We examine the precise relation between these two theorems. Working with a general notion of logic we show that the classical Omitting Types Theorem holds for a logic if a certain associated topological space has all closed subspaces Baire. We also consider stronger Baire category conditions, and hence stronger Omitting Types Theorems, including a game version. We use examples of spaces previously studied in set-theoretic topology to produce abstract logics showing that the game Omitting Types statement is consistently not equivalent to the classical one.
A general theme of computable structure theory is to investigate when structures have copies of a given complexity $Gamma$. We discuss such problem for the case of equivalence structures and preorders. We show that there is a $Pi^0_1$ equivalence structure with no $Sigma^0_1$ copy, and in fact that the isomorphism types realized by the $Pi^0_1$ equivalence structures coincide with those realized by the $Delta^0_2$ equivalence structures. We also construct a $Sigma^0_1$ preorder with no $Pi^0_1$ copy.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
