SearcharxivSearch

arXiv subjects

Alexandra Shlapentokh

Publications and source records attributed to Alexandra Shlapentokh.

At least 19 recordsLinked to original sources

First-order definitions of rings of integral functions over algebraic extensions of function fields and undecidability

In this paper, we study questions of definability and decidability for infinite algebraic extensions ${\bf K}$ of $\mathbb{F}_p(t)$ and their subrings of $\mathcal{S}$-integral functions. We focus on fields ${\bf K}$ satisfying a local property which we call $q$-boundedness. This can be considered a function field analogue of prior work of the first author which considered algebraic extensions of $\mathbb{Q}$. One simple consequence of our work states that if ${\bf K}$ is a $q$-bounded Galois extension of $\mathbb{F}_p(t)$, then for infinitely many non-constant $u$ the integral closure $\mathcal{O}_{\bf K}$ of $\mathbb{F}_p[u]$ inside ${\bf K}$ is first-order definable in ${\bf K}$. Under the additional assumption that the constant subfield of ${\bf K}$ is infinite, it follows that both $\mathcal{O}_{\bf K}$ and ${\bf K}$ have undecidable first-order theories, and that $\mathbb{F}_p[w]$ is definable in ${\bf K}$ for every non-constant $w$ in ${\bf K}$. Our primary tools are norm equations and the Hasse Norm Principle, in the spirit of Rumely. Our paper has an intersection with a recent arXiv preprint by Mart\'inez-Ranero, Salcedo, and Utreras, although our definability results are more extensive and undecidability results are much stronger.

math.NT

Defining $\mathbb Z$ using unit groups

We consider first-order definability and decidability questions over rings of integers of algebraic extensions of $\Q$, paying attention to the uniformity of definitions. The uniformity follows from the simplicity of our first-order definition of $\Z$. Namely, we prove that for a large collection of algebraic extensions $K/\Q$, $$ \{x \in \oo_K : \text{$\forall \e \in \oo_K^\times \;\exists δ\in \oo_K^\times$ such that $δ-1 \equiv (\e-1)x \pmod{(\e-1)^2}$}\} = \Z $$ where $\oo_K$ denotes the ring of integers of $K$. One of the corollaries of our results is undecidability of the field of constructible numbers, a question posed by Tarski in 1948.

math.NT

In Memory of Martin Davis

The present paper gives an account for the general mathematical reader of the life and work of Martin Davis. Since two rather comprehensive autobiographical accounts and two long biographical interviews already exist, the present work focusses on Davis's scientific achievements, including work on computably enumerable sets, universal Turing machines, the hyperarithmetical hierarchy, neural networks, Hilbert's Tenth Problem, and automated reasoning.

math.HO

Existential definability and diophantine stability

Let $K$ be a number field, let $L$ be an algebraic (possibly infinite degree) extension of $K$, and let $O_K$ $\subset$ $O_L$ be their rings of integers. Suppose $A$ is an abelian variety defined over $K$ such that $A(K)$ is infinite and $A(L)/A(K)$ is a torsion group. If at least one of the following conditions is satisfied: 1. $L$ is a number field, 2. $L$ is totally real, 3. $L$ is a quadratic extension of a totally real field, then $O_K$ has a diophantine definition over $O_L$.

math.NT

First-order theory of a field and its Inverse Galois Problem

Let $G$ be a finite group. Then there exists a first-order statement $S(G)$ in the language of rings without parameters and depending only on $G$ such that, for any field $K$, we have that $K\models S(G)$ if and only if $K$ has a Galois extension with the Galois group isomorphic to $G$. Further, there is an effective procedure which takes the table of multiplication of $G$ as its input and produces $S_G$. Therefore, given a field $K$, the Inverse Galois Problem for $K$, that is, the problem of deciding whether $K$ has a Galois extension with a particular Galois group as input, is Turing reducible to the first-order theory of $K$. Similar results hold for the Finite Split Embedding Problem and the Inverse Automorphism Problem.

math.NT

Computability in infinite Galois theory and algorithmically random algebraic fields

We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic fields which are not random. We also partially characterize the index set, relative to an oracle, of the set of random algebraic fields computable relative to that oracle. In order to carry out this investigation of randomness for fields, we develop computability in the context of infinite Galois theory (where the relevant Galois groups are uncountable), including definitions of computable and computably enumerable Galois groups and computability of Haar measure on the Galois groups.

math.LO

On existential definitions of C.E. subsets of rings of functions of characteristic 0

We extend results of Denef, Zahidi, Demeyer and the second author to show the following. (1) Rational integers have a single-fold Diophantine definition over the ring of integral functions of any function field of characteristic 0. (2) Every c.e. set of integers has a finite-fold Diophantine definition over the ring of integral functions of any function field of characteristic $0$. (3) All c.e. subsets of polynomial rings over totally real number fields have finite-fold Diophantine definitions. (These are the first examples of infinite rings with this property.) (4) If $k$ is algebraic over $\Q$ and is embeddable into a finite extension of $\Q_p$ for odd $p$, and $K$ is a one-variable function field over $k$, then the valuation ring of any function field valuation of $K$ has a Diophantine definition over $K$. (5) If $k$ is algebraic over $\Q$ and is embeddable into $\R$, and $K$ is a function field over $k$, then "almost" all function field valuations of $K$ have a valuation ring Diophantine over $K$. (6) Let $K$ be a one-variable function field over a number field and let $S$ be a finite set of its primes. Then all c.e. subsets of $O_{K,S}$ are existentially definable. (Here $O_{K,S}$ is the ring of $S$-integers or a ring of integral functions.)

math.NT

As Easy as $\mathbb Q$: Hilbert's Tenth Problem for Subrings of the Rationals and Number Fields

Hilbert's Tenth Problem over the field $\mathbb Q$ of rational numbers is one of the biggest open problems in the area of undecidability in number theory. In this paper we construct new, computably presentable subrings $R$ of $\mathbb Q$ having the property that Hilbert's Tenth Problem for $R$, denoted $HTP(R)$, is Turing equivalent to $HTP(\mathbb Q)$. We are able to put several additional constraints on the rings $R$ that we construct. Given any computable nonnegative real number $r \leq 1$ we construct such a ring $R = Z[\frac1p : p \in S]$ with $S$ a set of primes of lower density $r$. We also construct examples of rings $R$ for which deciding membership in $R$ is Turing equivalent to deciding $HTP(R)$ and also equivalent to deciding $HTP(\mathbb Q)$. Alternatively, we can make $HTP(R)$ have arbitrary computably enumerable degree above $HTP(\mathbb Q)$. Finally, we show that the same can be done for subrings of number fields and their prime ideals.

math.NT

A Computable Functor From Graphs to Fields

We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S, there exists a countable field F with the same essential computable-model-theoretic properties as S. Along the way, we develop a new "computable category theory," and prove that our functor and its partially-defined inverse (restricted to the categories of countable graphs and countable fields) are computable functors.

math.LO

On decidable algebraic fields

We prove the following propositions. Theorem 1: Let $M$ be a subfield of a fixed algebraic closure $\tilde \Q$ of $\Q$ whose existential elementary theory is decidable (resp. primitively decidable). Then, M is conjugate to a recursive (resp. primitive recursive) subfield $L \subset \tilde \Q$. Theorem 2: For each positive integer $e$ there are infinitely many $e$-tuples $\boldsymbol σ\in \Gal(\Q)^e$ such that the field $\tilde \Q( {\boldsymbol σ})$ -- the fixed field of $\boldsymbol σ$, is recursive in $\tilde\Q$ and its elementary theory is decidable. Moreover, $\tilde \Q(\boldsymbol σ)$ is PAC and $\Gal(\tilde\Q(\boldsymbol σ))$ is isomorphic to the free profinite group on $e$ generators.

math.LO

On definitions of polynomials over function fields of positive characteristi

We consider the problem of defining polynomials over function fields of positive characteristic. Among other results, we show that the following assertions are true. 1. Let $\G_p$ be an algebraic extension of a field of $p$ elements and assume $\G_p$ is not algebraically closed. Let $t$ be transcendental over $\G_p$, and let $K$ be a finite extension of $\G_p(t)$. In this case $\G_p[t]$ has a definition (with parameters) over $K$ of the form $\forall \exists \ldots \exists P$ with only one variable in the range of the universal quantifier and $P$ being a polynomial over $K$. 2. For any $q$, for all $p \not=q$ and all function fields $K$ as above with $\G_p$ having an extension of degree $q$ and a primitive $q$-th root of unity, there is a uniform in $p$ and $K$ definition (with parameters) of $\G_p[t]$, of the form $\exists \ldots \exists \forall \forall \exists \ldots \exists P$ with only two variables in the range of universal quantifiers and $P$ being a finite collection of disjunction and conjunction of polynomial equations over $\Z/p$. Further, for any finite collection $\calS_K$ of primes of $K$ of fixed size $m$, there is a uniform in $K$ and $p$ definition of the ring of $\calS_K$-integers of the form $\forall\forall\exists \ldots \exists P$ with the range of universal quantifiers and $P$ as above. 3. Let $M$ be a function field of positive characteristic in one variable $t$ over an arbitrary constant field $H,$ and let $\G_p$ be the algebraic closure of a finite field in $H$. Assume $\G_p$ is not algebraically closed. In this case $\G_p[t]$ is first-order definable over $M$.

math.NT

First Order Decidability and Definability of Integers in Infinite Algebraic Extensions of Rational Numbers

We extend results of Videla and Fukuzaki to define algebraic integers in large classes of infinite algebraic extensions of Q and use these definitions for some of the fields to show the first-order undecidability. We also obtain a structural sufficient condition for definability of the ring of integers over its field of fractions. In particular, we show that the following propositions hold. (1) For any rational prime $q$ and any positive rational integer $m$, algebraic integers are definable in any Galois extension of Q where the degree of any finite subextension is not divisible by $q^{m}$. (2) Given a prime $q$, and an integer $m>0$, algebraic integers are definable in a cyclotomic extension (and any of its subfields) generated by any set $\{ξ_{p^{\ell}}| \ell \in \Z_{>0}, p \not=q {is any prime such that} q^{m +1}\not | (p-1)\}$. (3) The first-order theory of any abelian extension of Q with finitely many ramified rational primes is undecidable. We also show that under a condition on the splitting of one rational prime in an infinite algebraic extension of Q, the existence of a finitely generated elliptic curve over the field in question is enough to have a definition of Z and to show that the field is indecidable.

math.NT

Categoricity Properties for Computable Algebraic Fields

We examine categoricity issues for computable algebraic fields. We give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is computably categorical, but not relatively computably categorical. Finally, we show that computable categoricity for this class of fields is $Π^0_4$-complete.

math.LO

Hilbert's Tenth Problem over Function Fields of Positive Characteristic Not Containing the Algebraic Closure of a Finite Field

We prove that the existential theory of any function field $K$ of characteristic $p> 0$ is undecidable in the language of rings provided that the constant field does not contain the algebraic closure of a finite field. We also extend the undecidability proof for function fields of higher transcendence degree to characteristic 2 and show that the first-order theory of {\bf any} function field of positive characteristic is undecidable in the language of rings without parameters.

math.NT

Turing degrees of isomorphism types of geometric objects

We initiate the computability-theoretic study of ringed spaces and schemes. In particular, we show that any Turing degree may occur as the least degree of an isomorphic copy of a structure of these kinds. We also show that these structures may fail to have a least degree.

math.LO

Computable Categoricity for Algebraic Fields with Splitting Algorithms

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of elements of $F$ belong to the same orbit under automorphisms. We also show that this criterion is equivalent to the relative computable categoricity of $F$.

math.LO

Hilbert's Tenth Problem and Mazur's Conjectures in Complementary Subrings of Number Fields

We show that Hilbert's Tenth Problem is undecidable for complementary subrings of number fields and that the p-adic and archimedean ring versions of Mazur's conjectures do not hold in these rings. More specifically, given a number field K, a positive integer t>1, and t nonnegative computable real numbers delta_1,..., delta_t whose sum is one, we prove that the nonarchimedean primes of K can be partitioned into t disjoint recursive subsets S_1,..., S_t of densities delta_1,..., delta_t, respectively such that Hilbert's Tenth Problem is undecidable for each corresponding ring O_{K,S_i}. We also show that we can find a partition as above such that each ring O_{K,S_i} possesses an infinite Diophantine set which is discrete in every topology of the field. The only assumption on K we need is that there is an elliptic curve of rank one defined over K.

math.LO

Using Indices of Points on an Elliptic Curve to Construct A Diophantine Model of $\Z$ and Define $\Z$ Using One Universal Quantifier in Very Large Subrings of Number Fields, Including $\Q$

Let $K$ be a number field and let $E$ be an elliptic curve defined and of rank one over $K$. For a set $\calW_K$ of primes of $K$, let $O_{K,\calW_K}=\{x\in K: \ord_{\pp}x \geq 0, \forall \pp \not \in \calW_K\}$. Let $P \in E(K)$ be a generator of $E(K)$ modulo the torsion subgroup. Let $(x_n(P),y_n(P))$ be the affine coordinates of $[n]P$ with respect to a fixed Weierstrass equation of $E$. We show that there exists a set $\calW_K$ of primes of $K$ of natural density one such that in $O_{K,\calW_K}$ multiplication of indices (with respect to some fixed multiple of $P$) is existentially definable and therefore these indices can be used to construct a Diophantine model of $\Z$. We also show that $\Z$ is definable over $O_{K,\calW_K}$ using just one universal quantifier. Both, the construction of a Diophantine model using the indices and the first-order definition of $\Z$ can be lifted to the integral closure of $O_{K,\calW_K}$ in any infinite extension $K_{\infty}$ of $K$ as long as $E(K_{\infty})$ is finitely generated and of rank one.

math.NT