Search arXivSearch

arXiv · math/0409567

Turbulence, amalgamation and generic automorphisms of homogeneous structures

Abstract

We study topological properties of conjugacy classes in Polish groups, with emphasis on automorphism groups of homogeneous countable structures. We first consider the existence of dense conjugacy classes (the topological Rokhlin property). We then characterize when an automorphism group admits a comeager conjugacy class (answering a question of Truss) and apply this to show that the homeomorphism group of the Cantor space has a comeager conjugacy class (answering a question of Akin-Hurley-Kennedy). Finally, we study Polish groups that admit comeager conjugacy classes in any dimension (in which case the groups are said to admit ample generics). We show that Polish groups with ample generics have the small index property (generalizing results of Hodges-Hodkinson-Lascar-Shelah) and arbitrary homomorphisms from such groups into separable groups are automatically continuous. Moreover, in the case of oligomorphic permutation groups, they have uncountable cofinality and the Bergman property. These results in particular apply to automorphism groups of many $ω$-stable, $\aleph_0$-categorical structures and of the random graph. In this connection, we also show that the infinite symmetric group $S_\infty$ has a unique non-trivial separable group topology. For several interesting groups we also establish Serre's properties (FH) and (FA).

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander S. Kechris, Christian Rosendal. 2006-04-26. Turbulence, amalgamation and generic automorphisms of homogeneous structures. https://arxiv.org/abs/math/0409567

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