Search arXivSearch

arXiv · 2601.04076

Galois theory, automorphism groups of prime models, and the Picard-Vessiot closure

Abstract

We work in the context of a complete totally transcendental theory $T = T^{eq}$. We consider the prime model $M_{A}$ over a set $A$. For intermediate sets $B$ with $A\subseteq B \subseteq M_{A}$ which are normal ($Aut(M_{A}/A)$-invariant) and ``minimal" we give a full Galois correspondence between intermediate definably closed sets $A\subseteq B \subseteq M_{A}$ and ``closed" subgroups of $Aut(B/A)$ (the group of $A$-elementary permutations of $B$). The unique greatest such minimal normal $B$ coincides with Poizat's ``minimal closure" $A_{min}$, so our paper extends (from $acl(A)$ to $A_{min}$) the well-known Galois correspondence between closed subgroups of the profinite group $Aut(acl(A)/A)$ and intermediate definably closed sets. The main result applies to the ``Picard-Vessiot closure" $K^{PV_{\infty}}$ of a differential field $K$ of char $0$ with algebraically closed field $C_{K}$ of constants. We also show that normal differential subfields of $K^{PV_{\infty}}$ containing $K$ are ``iterated $PV$-extensions" of $K$, and the Galois correspondence above holds for these extensions. This fills in some missing parts of Magid's paper [5]. We also discuss exact sequences $1 \to N \to G \to H \to 1$, where $G = Aut(K_2/K)$, $N = Aut(K_2/K_1)$ and $H = Aut(K_1/K)$, $K_1$ is a (maybe infinite type) $PV$ extension of $K$, $K_2$ is a (maybe infinite type) $PV$ extension of $K_1$ and $K_2$ is normal over $K$ and again $C_K$ is algebraically closed. Both $N$ and $H$ have the structure of proalgebraic groups over $C_K$. We show that conjugation by any given element of $G$ is a proalgebraic automorphism of $N$. Moreover if $G$ splits as a semidirect product $N\rtimes H$, then left multiplication by any fixed element of $G$ is a morphism of proalgebraic varieties $N\times H \to N\times H$. This improves and extends observations in Section 4 of [5] which dealt with one example.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David Meretzky, Anand Pillay. 2026-01-13. Galois theory, automorphism groups of prime models, and the Picard-Vessiot closure. https://arxiv.org/abs/2601.04076

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