SearcharxivSearch

arXiv · 1402.4588

Strong minimality and the j-function

Abstract

We show that the order three algebraic differential equation over ${\mathbb Q}$ satisfied by the analytic $j$-function defines a non-$\aleph_0$-categorical strongly minimal set with trivial forking geometry relative to the theory of differentially closed fields of characteristic zero answering a long-standing open problem about the existence of such sets. The theorem follows from Pila's modular Ax-Lindemann-Weierstrass with derivatives theorem using Seidenberg's embedding theorem and a theorem of Nishioka on the differential equations satisfied by automorphic functions. As a by product of this analysis, we obtain a more general version of the modular Ax-Lindemann-Weierstrass theorem, which, in particular, applies to automorphic functions for arbitrary arithmetic subgroups of $SL_2 ({\mathbb Z})$. We then apply the results to prove effective finiteness results for intersections of subvarieties of products of modular curves with isogeny classes. For example, we show that if $\psi:{\mathbb P}^1 \to {\mathbb P}^1$ is any non-identity automorphism of the projective line and $t \in {\mathbb A}^1({\mathbb C}) \smallsetminus {\mathbb A}^1({\mathbb Q}^\text{alg})$, then the set of $s \in {\mathbb A}^1({\mathbb C})$ for which the elliptic curve with $j$-invariant $s$ is isogenous to the elliptic curve with $j$-invariant $t$ and the elliptic curve with $j$-invariant $\psi(s)$ is isogenous to the elliptic curve with $j$-invariant $\psi(t)$ has size at most $36^7$. In general, we prove that if $V$ is a Kolchin-closed subset of ${\mathbb A}^n$, then the Zariski closure of the intersection of $V$ with the isogeny class of a tuple of transcendental elements is a finite union of weakly special subvarieties. We bound the sum of the degrees of the irreducible components of this union by a function of the degree and order of $V$.

Explore related subjects

Keep this discovery

BibTeXRIS

James Freitag, Thomas Scanlon. 2014-02-19. Strong minimality and the j-function. https://arxiv.org/abs/1402.4588

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