SearcharxivSearch

arXiv · 2212.03774

Very ampleness in strongly minimal sets

Abstract

Inspired by very ampleness of Zariski Geometries, we introduce and study the notion of a very ample family of plane curves in any strongly minimal set, and the corresponding notion of a very ample strongly minimal set (characterized by the definability of such a family). We show various basic properties; for example, any strongly minimal set internal to an expansion of an algebraically closed field is very ample, and any very ample strongly minimal set non-orthogonal to a strongly minimal set $Y$ is internal to $Y$. We then apply these results with Zilber's restricted trichotomy to characterize using very ampleness those structures $\mathcal M=(M,\dots)$ interpreted in an algebraically closed field which recover all constructible subsets of powers of $M$. Next we show that very ample strongly minimal sets admit very ample families of plane curves of all dimensions, and use this to characterize very ampleness in terms of definable pseudoplanes. Finally, we show that divisible strongly minimal groups are very ample, and deduce -- answering an old question of G. Martin -- that in a pure algebraically closed field, $K$ there are no reducts between $(K,+,\cdot)$ and $(K, \cdot)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Benjamin Castle, Assaf Hasson. 2022-12-07. Very ampleness in strongly minimal sets. https://doi.org/10.2140/mt.2024.3.213

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