SearcharxivSearch

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-07. 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

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