SearcharxivSearch

arXiv · 1903.00706

Strong homotopy of digitally continuous functions

Abstract

We introduce a new type of homotopy relation for digitally continuous functions which we call ``strong homotopy.'' Both digital homotopy and strong homotopy are natural digitizations of classical topological homotopy: the difference between them is analogous to the difference between digital 4-adjacency and 8-adjacency in the plane. We explore basic properties of strong homotopy, and give some equivalent characterizations. In particular we show that strong homotopy is related to ``punctuated homotopy,'' in which the function changes by only one point in each homotopy time step. We also show that strongly homotopic maps always have the same induced homomorphisms in the digital homology theory. This is not generally true for digitally homotopic maps, though we do show that it is true for any homotopic selfmaps on the digital cycle $C_n$ with $n\ge 4$. We also define and consider strong homotopy equivalence of digital images. Using some computer assistance, we produce a catalog of all small digital images up to strong homotopy equivalence. We also briefly consider pointed strong homotopy equivalence, and give an example of a pointed contractible image which is not pointed strongly contractible.

Explore related subjects

Keep this discovery

BibTeXRIS

P. Christopher Staecker. 2019-03-02. Strong homotopy of digitally continuous functions. https://arxiv.org/abs/1903.00706

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