SearcharxivSearch

arXiv · 1805.03985

Ax-Schanuel and strong minimality for the $j$-function

Abstract

Let $\mathcal{K}:=(K;+,\cdot, D, 0, 1)$ be a differentially closed field of characteristic $0$ with field of constants $C$. In the first part of the paper we explore the connection between Ax-Schanuel type theorems (predimension inequalities) for a differential equation $E(x,y)$ and the geometry of the fibres $U_s:=\{ y:E(s,y) \wedge y \notin C \}$ where $s$ is a non-constant element. We show that certain types of predimension inequalities imply strong minimality and geometric triviality of $U_s$. Moreover, the induced structure on the Cartesian powers of $U_s$ is given by special subvarieties. In particular, since the $j$-function satisfies an Ax-Schanuel inequality of the required form (due to Pila and Tsimerman), applying our results to the $j$-function we recover a theorem of Freitag and Scanlon stating that the differential equation of $j$ defines a strongly minimal set with trivial geometry. In the second part of the paper we study strongly minimal sets in the $j$-reducts of differentially closed fields. Let $E_j(x,y)$ be the (two-variable) differential equation of the $j$-function. We prove a Zilber style classification result for strongly minimal sets in the reduct $\mathsf{K}:=(K;+, \cdot, E_j)$. More precisely, we show that in $\mathsf{K}$ all strongly minimal sets are geometrically trivial or non-orthogonal to $C$. Our proof is based on the Ax-Schanuel theorem and a matching Existential Closedness statement which asserts that systems of equations in terms of $E_j$ have solutions in $\mathsf{K}$ unless having a solution contradicts Ax-Schanuel.

Explore related subjects

Keep this discovery

BibTeXRIS

Vahagn Aslanyan. 2018-05-09. Ax-Schanuel and strong minimality for the $j$-function. https://doi.org/10.1016/j.apal.2020.102871

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