SearcharxivSearch

arXiv · 2408.08370

When invariance implies exchangeability (and applications to invariant Keisler measures)

Abstract

We study the problem of when, given a countable homogeneous structure $M$ and a space $S$ of expansions of $M$, every $\mathrm{Aut}(M)$-invariant probability measure on $S$ is exchangeable (i.e. invariant under all permutations of the domain). We show, for example, that if $M$ is a finitely bounded homogeneous $3$-hypergraph with free amalgamation (including the generic tetrahedron-free $3$-hypergraph), all $\mathrm{Aut}(M)$-invariant random expansions by graphs are exchangeable. Moreover, we extend and recover both the work of Angel, Kechris, and Lyons on invariant random orderings and some of the work of Crane and Towsner, and Ackerman on relative exchangeability. In the second part of the paper, we apply our results to the study of invariant Keisler measures, which we prove to be particular invariant random expansions. Thus, we describe the spaces of invariant Keisler measures of various homogeneous structures, obtaining the first results of this kind since the work of Albert and Ensley. We also show there are $2^{\aleph_0}$ supersimple homogeneous ternary structures for which there are non-forking formulas which are universally measure zero.

Explore related subjects

Keep this discovery

BibTeXRIS

Samuel Braunfeld, Colin Jahel, Paolo Marimon. 2024-08-15. When invariance implies exchangeability (and applications to invariant Keisler measures). https://arxiv.org/abs/2408.08370

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