Search arXivSearch

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

Explore connections, maps & timelines

BibTeXRIS

Gal Binyamini, Dmitri Novikov, Benny Zak. 2026-02-24. 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

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO