Search arXivSearch

arXiv · 1911.06165

Differential Galois cohomology and parameterized Picard-Vessiot extensions

Abstract

Assuming that the differential field $(K,δ)$ is differentially large, in the sense of León Sánchez and Tressl, and "bounded" as a field, we prove that for any linear differential algebraic group $G$ over $K$, the differential Galois (or constrained) cohomology set $H^1_δ(K,G)$ is finite. This applies, among other things, to closed ordered differential fields $K$, in the sense of Singer, and to closed $p$-adic differential fields in the sense of Tressl. As an application, we prove a general existence result for parameterized Picard-Vessiot extensions within certain families of fields; if $(K,δ_x,δ_t)$ is a field with two commuting derivations, and $δ_x Z = AZ$ is a parameterized linear differential equation over $K$, and $(K^{δ_x},δ_t)$ is "differentially large" and $K^{δ_x}$ is bounded, and $(K^{δ_x}, δ_t)$ is existentially closed in $(K,δ_t)$, then there is a PPV extension $(L,δ_x,δ_t)$ of $K$ for the equation such that $(K^{δ_x},δ_t)$ is existentially closed in $(L,δ_t)$. For instance, it follows that if the $δ_x$-constants of a formally real differential field $(K,δ_x,δ_t)$ is a closed ordered $δ_t$-field, then for any homogeneous linear $δ_x$-equation over $K$ there exists a PPV extension that is formally real. Similar observations apply to $p$-adic fields.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Omar Leon Sanchez, Anand Pillay. 2020-09-13. Differential Galois cohomology and parameterized Picard-Vessiot extensions. https://arxiv.org/abs/1911.06165

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