SearcharxivSearch

arXiv · 2405.02209

Zilber's Trichotomy in Hausdorff Geometric Structures

Abstract

We give a new axiomatic treatment of the Zilber trichotomy, and use it to complete the proof of the trichotomy for relics of algebraically closed fields, i.e., reducts of the ACF-induced structure on ACF-definable sets. More precisely, we introduce a class of geometric structures equipped with a Hausdorff topology, called \textit{Hausdorff geometric structures}. Natural examples include the complex field; algebraically closed valued fields; o-minimal expansions of real closed fields; and characteristic zero Henselian fields (in particular $p$-adically closed fields). We then study the Zilber trichotomy for relics of Hausdorff geometric structures, showing that under additional assumptions, every non-locally modular strongly minimal relic on a real sort interprets a one-dimensional group. Combined with recent results, this allows us to prove the trichotomy for strongly minimal relics on the real sorts of algebraically closed valued fields. Finally, we make progress on the imaginary sorts, reducing the trichotomy for \textit{all} ACVF relics (in all sorts) to a conjectural technical condition that we prove in characteristic $(0,0)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Benjamin Castle, Assaf Hasson, Jinhe Ye. 2024-05-03. Zilber's Trichotomy in Hausdorff Geometric Structures. https://arxiv.org/abs/2405.02209

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