Search arXivSearch

arXiv · 2506.23586

A Galois correspondence for automorphism groups of structures with the Lascar Property

Abstract

Generalizing the $ω$-categorical context, we introduce a notion, which we call the Lascar Property, that allows for a fine analysis of the topological isomorphisms between automorphism groups of countable saturated structures satisfying this property. In particular, under these assumptions, we exhibit a Galois correspondence between pointwise stabilizers of finitely generated algebraically closed subsets of $M$ and finitely generated algebraically closed subsets of $M$. We use this to characterize the group of automorphisms of $\mathrm{Aut}(M)$, for $M$ a countable saturated model of $\mathrm{ACF}_0$ or an infinite-dimensional $\mathbb{K}$-vector space with $\mathbb{K}$ countable, generalizing a classical result of Evans $\&$ Lascar (1997), while at the same time subsuming the analysis of Paolini (2024) for $ω$-categorical structures with weak elimination of imaginaries.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gianluca Paolini, Federico Pisciotta. 2026-06-19. A Galois correspondence for automorphism groups of structures with the Lascar Property. https://arxiv.org/abs/2506.23586

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