SearcharxivSearch

arXiv · 1911.01096

Ax's theorem with an additive character

Abstract

Motivated by Emmanuel Kowalski's exponential sums over definable sets in finite fields, we generalize Ax's theorem on pseudo-finite fields to a continuous-logic setting allowing for an additive character. The role played by Weil's Riemann hypothesis for curves over finite fields is taken by the `Weil bound' on exponential sums. Subsequent model-theoretic developments, including simplicity and the Chatzidakis-Van den Dries-Macintyre definable measures, also generalize. Analytically, we have the following consequence: consider the algebra of functions $\Ff_p^n \to \Cc$ obtained from the additive characters and the characteristic functions of subvarieties by pre- or post-composing with polynomials, applying min and sup operators to the real part, and averaging over subvarieties. Then any element of this class can be approximated, uniformly in the variables and in the prime $p$, by a polynomial expression in $\Psi_p(\xi)$ at certain algebraic functions $\xi$ of the variables, where $\Psi(n \mod p) = exp(2 \pi i n/p)$ is the standard additive character.

Explore related subjects

Keep this discovery

BibTeXRIS

Ehud Hrushovski. 2019-11-04. Ax's theorem with an additive character. https://arxiv.org/abs/1911.01096

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