Search arXivSearch

arXiv · 2507.03195

Existentially closed measure-preserving actions of approximately treeable groups

Abstract

Given a countable group $Γ$, letting $\mathcal{K}_Γ$ denote the class of {\pmp} actions of $Γ$, we study the question of when the model companion of $\mathcal{K}_Γ$ exists. Berenstein, Henson, and Ibarlucía showed that the model companion of $\mathcal{K}_Γ$ exists when $Γ$ is a nonabelian free group on a countable number of generators. We significantly generalize their result by showing that the model companion of $\cal K_Γ$ exists whenever $Γ$ is an approximately treeable group. The class of approximately treeable groups contain the class of treeable groups as well as the class of universally free groups, that is, the class of groups with the same universal theory as nonabelian free groups. We prove this result using an open mapping characterization of when the model companion exists; moreover, this open mapping characterization provides concrete, ergodic-theoretic axioms for the model companion when it exists. We show how to simplify these axioms in the case of treeable groups, providing an alternate axiomatization for the model companion in the case of the free group, which was first axiomatized by Berenstein, Henson, and Ibarlucía using techniques from model-theoretic stability theory. Along the way, we prove a purely ergodic-theoretic result of independent interest, namely that finitely generated universally free groups (also known as limit groups) have Kechris' property MD. We also show that for groups with Kechris' EMD property, the profinite completion action is existentially closed, and for groups without property (T), the generic existentially closed action is weakly mixing, generalizing results of Berenstein, Henson, and Ibarlucía for the case of nonabelian free groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Isaac Goldbring, Brandon Seward, Robin Tucker-Drob. 2025-07-03. Existentially closed measure-preserving actions of approximately treeable groups. https://arxiv.org/abs/2507.03195

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

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO