Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1606.08492

Finiteness theorems on hypersurfaces in partial differential-algebraic geometry

James Freitag·Rahim Moosa
View original source ↗Read source document ↗Export metadata ↓

Abstract

Hrushovski's generalization and application of [Jouanolou, "Hypersurfaces solutions d'une \'equation de Pfaff analytique", Mathematische Annalen, 232 (3):239--245, 1978] is here refined and extended to the partial differential setting with possibly nonconstant coefficient fields. In particular, it is shown that if $X$ is a differential-algebraic variety over a partial differential field F that is finitely generated over its constant field F_0, then there exists a dominant differential-rational map from X to the constant points of an algebraic variety V over F_0, such that all but finitely many codimension one subvarieties of X over F arise as pull-backs of algebraic subvarieties of V over F_0. As an application, it is shown that the algebraic solutions to a first order algebraic differential equation over C(t) are of bounded height, answering a question of Eremenko. Two expected model-theoretic applications to DCF_{0,m} are also given: 1) Lascar rank and Morley rank agree in dimension two, and 2) dimension one strongly minimal sets orthogonal to the constants are \aleph_0-categorical. A detailed exposition of Hrushovski's original (unpublished) theorem is included, influenced by [Ghys, "\`A propos d'un th\'eor\`eme de J.-P. Jouanolou concernant les feuilles ferm\'ees des feuilletages holomorphes", Rend. Circ. Mat. Palermo (2)}, 49(1):175--180, 2000.

Explore related subjects

math.LOmath.AG

Keep this discovery

BibTeXRIS

James Freitag, Rahim Moosa. 2016-06-27. Finiteness theorems on hypersurfaces in partial differential-algebraic geometry. https://arxiv.org/abs/1606.08492

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗