Search arXivSearch

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

Explore connections, maps & timelines

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

Natural Term Logic

In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical meaning. NTL can be seen as a refinement of the ideas of Quine's paper `Variables Explained Away' and the technical concepts introduced by Bealer and Zalta. NTL is more fine-grained than Bealer's first-order intensional logic (BL): there is a many-to-one correspondence $ν$ between NTL terms and closed BL terms as well as a canonical map $β$ which assigns to each closed BL term a corresponding NTL term. The map $ν$ can be seen as assigning a core logical content of the NTL term. We define a series of reductions on NTL terms which intuitivelyy speaking capture meaning-preserving syntactic transformations ( transformations which preserved the basic logical meaning of a term) and our main result is that each NTL term $T$ reduces to a unique normal term $N$. The reductions fall into the structural, predicative and pushing-in categories. Predicative reductions decompose NTL terms so that predication is only applied to a primitive term (such terms are called prenormal). A key ingredient in the proof is the fact that $βνN = N$ when $N$ is normal. This suggests that within NTL the normal form of a term expresses the core logical content of the term.

math.LO

Hyper-hyperfiniteness and complexity

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite, then the complexity of hyperfinite countable Borel equivalence relationsis as high as possible, namely, $Σ^1_2$-complete. We also establish an implication between the question of the effectivity of hyperfiniteness and its complexity.

math.LO

Coordinate recognition: General theory, Groups, and other surprises

A class of structures \emph{recognizes coordinates} if any reduced product of structures from said class witnesses a certain kind of rigidity phenomenon. We provide several equivalent characterizations of this property. This property has (at least) two remarkable consequences, one set-theoretic and one model-theoretic, for reduced products of structures of the said class. First, under appropriate set-theoretic assumptions every isomorphism between such reduced products associated with the Fréchet ideal lifts (modulo a finite change) to an isomorphism between products of the original structures. Second, with an additional mild assumption, it implies a strong quantifier elimination result. Of note, we show that a class recognizes coordinates if and only if an individual formula witnesses a certain syntactic property. We also consider many concrete classes of structures and determine whether or not they recognize coordinates. We place heavy emphasis on well-known classes of groups, such as permutation groups, acylindircally hyperbolic groups, quasisimple groups, free products, and graph products, but we also discuss other classes of structures.

math.LO