SearcharxivSearch

arXiv · 2008.09969

Strictly Monotone Numerosity on Tame Sets via the Steiner Polynomial

Abstract

This paper uses inspiration from Integral Geometry to connect Tame Geometry with Nonstandard Analysis. We omit binomial coefficients from the Steiner polynomial to define the \textit{intrinsic volume polynomial} $\Phi$, a valuation defined on bounded definable sets in an o-minimal structure. We prove that using this normalization gives a strictly monotone valuation on point sets when the codomain $\mathbb{R}[t]$ is interpreted with ordering by end behavior. This leads to an algebraic version of Hadwiger's Theorem: $\Phi$ is the unique conormal continuous, similarity-equivariant homomorphism of ordered rings from $\mathcal{C}(\mathbb{R}^\infty) \to \mathbb{R}[t]$ (up to scaling). Noting that strict monotonicity is mirrored in numerosity theory (a branch of nonstandard analysis), we prove existence for a numerosity that exceptionally approximates the intrinsic volume polynomial. This suggests a connection between disparate fields, allowing each to complement the other.

Explore related subjects

Keep this discovery

BibTeXRIS

Joseph T. Previdi. 2020-08-23. Strictly Monotone Numerosity on Tame Sets via the Steiner Polynomial. https://arxiv.org/abs/2008.09969

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