SearcharxivSearch

arXiv · 2308.06523

Homotopic subsets of continuous functions and their applications

Abstract

In this paper, we introduce the notion of bi-homotopy between subsets of continuous functions. A map $\phi$ from $A$ to $B$ is called an $h$-map if, for each two homotopic maps $f, g\in A$, their image (i.e., $\phi(f), \phi(g)$) are homotopic in $B$. We call an $h$-map $\phi$ from $A$ to $B$ a bi-homotopy if it satisfies two conditions. First, for any $f, g \in A$, $\phi(f)$ is homotopic to $\phi(g)$ in $B$ implies $f$ is homotopic to $g$ in $A$. Next, for each $g \in B$, there exists an $f \in A$ such that $\phi(f)$ is homotopic to $g$ in $B$. We establish the concept of homotopy equivalence between subsets $A$ and $B$ (denoted as $A \simeq B$) as the existence of two bi-homotopies $\phi$ from $A$ to $B$ and $\psi$ from $B$ to $A$, satisfying $\phi\psi(h)$ is homotopic to $h$ for every $h \in B$, and $\psi\phi(h)$ is homotopic to $h$ for every $h \in A$. We then apply this definition to characterize homotopic subsets of continuous functions and introduce novel categories of subsets of $C(X, Y)$, notably the category $\mathcal{P}(C(X, Y))$, where $X, Y$ are two topological spaces. In this category, objects represent subsets of $C(X, Y)$, morphisms denote bi-homotopies between any two objects, and a composition law governs the combination of morphisms. Furthermore, we extend this framework to define homotopic groups (resp., rings) of continuous functions when $Y$ is a topological group (resp., topological ring). Leveraging topological properties of $X$ and $Y$, we investigate the group (resp., ring) properties of $C(X, Y)$. We discuss potential applications and implications of the introduced bi-homotopy concept in the study of continuous functions and their subsets.

Explore related subjects

Keep this discovery

BibTeXRIS

Ali Taherifar. 2023-08-12. Homotopic subsets of continuous functions and their applications. https://arxiv.org/abs/2308.06523

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