SearcharxivSearch

arXiv · 1708.06407

The minimizing vector theorem in symmetrized max-plus algebra

Abstract

Assuming ZF and its consistency, we study some topological and geometrical properties of the symmetrized max-plus algebra in the absence of the axiom of choice in order to discuss the minimizing vector theorem for finite products of copies of the symmetrized max-plus algebra. Several relevant statements that follow from the axiom of countable choice restricted to sequences of subsets of the real line are shown. Among them, it is proved that if all simultaneously complete and connected subspaces of the plane are closed, then the real line is sequential. A brief discussion about semidenrites is included. Older known proofs in ZFC of several basic facts relevant to proximinal and Chebyshev sets in metric spaces are replaced by new proofs in ZF. It is proved that a nonempty subset C of the symmetrized max-plus algebra is Chebyshev in this algebra if and only if C is simultaneously closed and connected. An application of it to a version of the minimizing vector theorem for finite products of the symmetrized max-plus algebra is shown. Open problems concerning some statements independent of ZF and other statements relevant to Chebyshev sets are posed.

Explore related subjects

Keep this discovery

BibTeXRIS

Cenap Özel, Artur Piękosz, Eliza Wajch, Hanifa Zekraoui. 2017-08-21. The minimizing vector theorem in symmetrized max-plus algebra. https://arxiv.org/abs/1708.06407

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