SearcharxivSearch

arXiv · 0711.3864

Difference fields and descent in algebraic dynamics - I

Abstract

We draw a connection between the model-theoretic notions of modularity (or one-basedness), orthogonality and internality, as applied to difference fields, and questions of descent in in algebraic dynamics. In particular we prove in any dimension a strong dynamical version of Northcott's theorem for function fields, answering a question of Szpiro and Tucker and generalizing a theorem of Baker's for the projective line. The paper comes in three parts. This first part contains an exposition some of the main results of the model theory of difference fields, and their immediate connection to questions of descent in algebraic dynamics. We present the model-theoretic notion of internality in a context that does not require a universal domain with quantifier-elimination. We also note a version of canonical heights that applies well beyond polarized algebraic dynamics. Part II sharpens the structure theory to arbitrary base fields and constructible maps where in part I we emphasize finite base change and correspondences. Part III will include precise structure theorems related to the Galois theory considered here, and will enable a sharpening of the descent results for non-modular dynamics.

Explore related subjects

Keep this discovery

BibTeXRIS

Zoé Chatzidakis, Ehud Hrushovski. 2008-07-04. Difference fields and descent in algebraic dynamics - I. https://arxiv.org/abs/0711.3864

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