SearcharxivSearch

arXiv · 2401.00327

Ellis groups in model theory and strongly generic sets

Abstract

Assume $G$ is a group and $\mathcal{A}$ is an algebra of subsets of $G$ closed under left translation. We study various ways to understand the Ellis group of the $G$-flow $S(\mathcal{A})$ (the Stone space of $\mathcal{A}$), with particular interest in the model-theoretic setting where $G$ is definable in a first order structure $M$ and $\mathcal{A}$ consists of externally definable subsets of $G$. In one part of the thesis we explore strongly generic sets. Maximal algebras of such sets are shown to carry enough information to retrieve the Ellis group. A subset of $G$ is strongly generic if each non-empty Boolean combination of its translates is generic. Trivial examples include what we call *periodic* sets, which are unions of cosets of finite index subgroups of $G$. We give several characterizations of strongly generic sets, in particular, we relate them to almost periodic points of the flow $2^G$. For groups without a smallest finite index subgroup we show how to construct non-periodic strongly generic subsets in a systematic way. When $G$ is definable in a model $M$, a definable, strongly generic subset of $G$ will remain as such in any elementary extension of $M$ only if it is strongly generic in $G$ in an adequately uniform way. Sets satisfying this condition are called *uniformly strongly generic*. We analyse a few examples of these sets in different groups. In the second part we assume that $G$ is a topological group and consider a particular algebra of its subsets denoted $\mathcal{SBP}$. It consists of subsets of $G$ that have the *strong Baire property*, meaning nowhere dense boundary. We explicitly describe the Ellis group of $S(\mathcal{A})$ for an arbitrary subalgebra $\mathcal{A}$ of $\mathcal{SBP}$ under varying assumptions on the group $G$, including the case when $G$ is a compact topological group. [...] (Full abstract in the article)

Explore related subjects

Keep this discovery

BibTeXRIS

Adam Malinowski. 2023-12-30. Ellis groups in model theory and strongly generic sets. https://arxiv.org/abs/2401.00327

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO