SearcharxivSearch

arXiv · 2209.10972

Sharply o-minimal structures and sharp cellular decomposition

Abstract

Sharply o-minimal structures (denoted \so-minimal) are a strict subclass of the o-minimal structures, aimed at capturing some finer features of structures arising from algebraic geometry and Hodge theory. Sharp o-minimality associates to each definable set a pair of integers known as \emph{format} and \emph{degree}, similar to the ambient dimension and degree in the algebraic case; gives bounds on the growth of these quantities under the logical operations; and allows one to control the geometric complexity of a set in terms of its format and degree. These axioms have significant implications on arithmetic properties of definable sets -- for example, \so-minimality was recently used by the authors to settle Wilkie's conjecture on rational points in $\mathbb{R}_{{\exp}}$-definable sets. In this paper we develop some basic theory of sharply o-minimal structures. We introduce the notions of reduction and equivalence on the class of \so-minimal structures. We give three variants of the definition of \so-minimality, of increasing strength, and show that they all agree up to reduction. We also consider the problem of ``sharp cell decomposition'', i.e. cell decomposition with good control on the number of the cells and their formats and degrees. We show that every \so-minimal structure can be reduced to one admitting sharp cell decomposition, and use this to prove bounds on the Betti numbers of definable sets in terms of format and degree.

Explore related subjects

Keep this discovery

BibTeXRIS

Gal Binyamini, Dmitri Novikov, Benny Zak. 2022-09-22. Sharply o-minimal structures and sharp cellular decomposition. https://arxiv.org/abs/2209.10972

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