Search arXivSearch

arXiv · math/0204135

Using nets in Dedekind, monotone, or Scott incomplete ordered fields and definability issues

Abstract

Given a Dedekind incomplete ordered field, a pair of convergent nets of gaps which are respectively increasing or decreasing to the same point is used to obtain a further equivalent criterion for Dedekind completeness of ordered fields: Every continuous one-to-one function defined on a closed bounded interval maps interior of that interval to the interior of the image. Next, it is shown that over all closed bounded intervals in any monotone incomplete ordered field, there are continuous not uniformly continuous unbounded functions whose ranges are not closed, and continuous 1-1 functions which map every interior point to an interior point (of the image) but are not open. These are achieved using appropriate nets cofinal in gaps or coinitial in their complements. In our third main theorem, an ordered field is constructed which has parametrically definable regular gaps but no $\emptyset$-definable divergent Cauchy functions (while we show that, in either of the two cases where parameters are or are not allowed, any definable divergent Cauchy function gives rise to a definable regular gap). Our proof for the mentioned independence result uses existence of infinite primes in the subring of the ordered field of generalized power series with rational exponents and real coefficients consisting of series with no infinitesimal terms, as recently established by D. Pitteloud.

Explore related subjects

Keep this discovery

BibTeXRIS

Mojtaba Moniri, Jafar S. Eivazloo. 2002-04-10. Using nets in Dedekind, monotone, or Scott incomplete ordered fields and definability issues. https://arxiv.org/abs/math/0204135

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.

math.GN

A continuous $3$-distributive frame that is not $\omega$-distributive

We give a negative answer to the question, posed by Ern\'e, whether every $3$-distributive lattice is $\omega$-distributive. More precisely, we exhibit a continuous frame that is $\kappa$-distributive for every integer $\kappa\geq 2$, but is not a wide coframe. The frame is the open-set lattice of a compact, locally compact, countably based $T_0$ topological meet-semilattice, obtained from Lawson's construction in the logarithmic form described by Goubault-Larrecq. The failure of $\omega$-distributivity is witnessed by an explicit matrix with countably many nonempty finite rows: all row joins are the same nonzero element, whereas every choice of one entry from each row has meet zero. The same space answers negatively Ern\'e's accompanying question whether every $4$-web space is a wide web space. All properties of the construction needed for these conclusions are proved directly.

math.GN

An overlooked weakening of perfect normality: Perfect regularity in spaces and locales

We introduce the notion of perfect regularity as an appropriate weakening of perfect normality, both for spaces and locales. Various characterizations are given, using Dedekind-MacNeille completions, injective hulls, and sublocales. We place the new class of perfectly regular frames among various well-studied classes of frames. We also introduce the construction of perfect regularization of a completely regular frame, compare it to Isbell's well-known booleanization construction, and argue that it is at least as important as the latter.

math.GN