Abstract
This paper explores a certain relationship between the almost fixed point property (AFPP for short) of a compact and n-dimensional Euclidean space and that of its digitized space. Based on several types of digitizations, we prove that the AFPP of a compact and n-dimensional Euclidean cube is preserved by each of the , the and the Khalimsky digitizations, .
Keywords:
digital space; U- and L-digitization; fixed point property; almost fixed point property; Khalimsky topology; digital topology MSC:
55N35; 55M10; 68R10; 68U05
1. Introduction
In order to study the fixed point property (FPP for brevity) and the almost (or approximate) fixed point property (AFPP for short) for Euclidean topological spaces and digital spaces, we need to recall some terminology from digital topology and fixed point theory. Hereafter, let , and represent the sets of natural numbers, points in the Euclidean n-dimensional space with integer coordinates and real numbers, respectively. In addition, for distinct integers , we often use the notation called a digital interval []. We say that a digital image (see Equation (2)) is k-connected if, for any two points , there is a finite sequence such that and and, furthermore, and are k-adjacent (see Equations (1) and (2) in Section 2) if []. We say that a non-empty and k-connected digital image has the FPP [] if every k-continuous map has a point such that (see Section 2 for more details). In addition, we say that a non-empty digital image has the AFPP [] if every k-continuous map has a point such that or is k-adjacent to x []. In general, a non-empty object Y of a category has the FPP if every morphism has a point such that . It is obvious that the AFPP is weaker than the FPP [].
Recently, many works relating to the FPP and the AFPP for digital spaces have been proceeded [,,,,,,,,,]. Furthermore, given a Euclidean subspace X, several types of digitizations of X were also developed [,,]. These approaches indeed play important roles in applied topology and computer science, e.g., image processing, image analysis and so on. Hereafter, a compact and n-dimensional Euclidean space means a certain bounded and closed (or compact) n-dimensional Euclidean topological space ,. Then, we naturally wonder if there is a certain relationship between the AFPP of the above and the AFPP of a space obtained by its digitization (or a digitized space for short). Furthermore, based on the study of the AFPP of a finite digital picture, e.g., with 8-adjacency [], we may ask if the n-dimensional digital cube on has the AFPP. Regarding this issue, we need to recall the notion of a digital space. For a nonempty binary symmetric relation set , we recall that X is π-connected [] if for any two elements x and y of X there is a finite sequence of elements in X such that , and for . We say that a digital space is a nonempty, -connected, symmetric relation set, denoted by []. It is well known that a digital space [] includes a digital image with digital k-connectivity (i.e., Rosenfeld model) [,], a Khalimsky (K-, for brevity) topological space with Khalimsky adjacency [], a Marcus-Wyse (M-, for short) topological space with Marcus-Wyse adjacency [], and so forth [,,] (see Section 2 in details).
Based on the several kinds of digitizations of a Euclidean space in [,,], the present paper explores a certain relationship between the AFPP for Euclidean topological subspaces in and that for their U-, L-, K-, or M-digitized spaces in from the viewpoint of digital topology, where U-, L-, K- and M- means the upper limit, the lower limit, Khalimsky and Marcus-Wyse topology, respectively.
In fixed point theory for digital spaces, we also assume that every digital space is -connected and non-empty.
The rest of the paper is organized as follows: Section 2 provides basic notions from digital topology. Section 3 investigates some properties of digitizations in a K-, an M-, a U-, or an L-topological approach. Section 4 develops a link between the AFPP from the viewpoint of and the AFPP from the viewpoint of , , or , where , , and are a Euclidean topological, a digital topological, a Khalimsky topological and a Marcus-Wyse topological category, respectively (for more details, see Section 2).
2. Several Kinds of Digital Topological Categories, DTC, KTC and MTC
To study the FPP or the AFPP for digital spaces from the viewpoint of digital topology, we first need to recall the k-adjacency relations of n-dimensional integer grids (see Equation (2)), a digital k-neighborhood, digital continuity, and so forth [,,]. To study n-dimensional digital images, , as a generalization of the k-adjacency relations of , we will take the following approach [] (see also []).
For a natural number m, , distinct points
are -adjacent if at most m of their coordinates differ by ±1, and all others coincide.
According to the operator of Equation (1), the -adjacency relations of , are obtained [] (see also []) as follows:
A. Rosenfeld [] called a set with a k-adjacency a digital image, denoted by . Indeed, to study digital images on in the graph-theoretical approach [,], using the k-adjacency relations of of Equation (2), we say that a digital k-neighborhood of p in is the set []
In addition, for a k-adjacency relation of , a simple k-path with elements on is assumed to be a finite sequence (or k-path) such that and are k-adjacent if and only if . If and , then the length of the simple k-path, denoted by , is the number l. A simple closed k-curve with l elements on , denoted by [], is a simple k-path on , where and are k-adjacent if and only if .
For a digital image , for , we put []
As a generalization of of Equation (3), for a digital image let us recall a digital k-neighborhood []. Namely, the digital k-neighborhood of with radius is defined in X to be the following subset of X []
where is the length of a shortest simple k-path from to x and .
Given a digital image on and for two points , if there is no k-path connecting between these points, then we define . In addition, we may represent the notion of “k-connected” as follows: a digital image on is k-connected if, for any distinct points . there is a k-path connecting these two points.
Definition 1.
We say that a k-connected digital image on is bounded if for some point , there is an that is equal to the set X, where .
In general, we say that a digital image on is bounded if there is a finite set such that , where .
The author in [] established the notion of digital continuity of a map by saying that f maps every -connected subset of into a -connected subset of (see Theorem 2.4 of []). Motivated by this approach, the digital continuity of maps between digital images was represented in terms of the neighborhood of Equation (3), as follows:
Proposition 1
([]). Let and be digital images in and , respectively. A function is -continuous if and only if for every , .
In Proposition 1, in case , the map f is called a -continuous map. Using digitally continuous maps, we establish the category of digital images, denoted by DTC, consisting of the following two data [] (see also []):
- The set of objects , denoted by ;
- For every ordered pair of objects and , the set of all -continuous maps as morphisms.
In DTC, in case , we will particularly use the notation DTC(k).
The authors in [] initiated the study of the FPP and the AFPP for digital pictures (see Proposition 2). Based on the approach, many works explored the properties for several types of digital spaces, such as Khalimsky, Marcus-Wyse topological spaces, and digital metric spaces associated with some typical fixed point theorems.
Proposition 2
([]). Consider a bounded digital plane (or finite digital picture) , i.e., .
Then, it does not have the FPP. However, has the AFPP.
Motivated by Proposition 2, we obtain the following:
Theorem 1.
For , the n-dimensional digital cube with k-adjacency on has the AFPP if and only if .
Proof.
Consider with a certain k-adjacency of (see Equation (2)), i.e., a digital image . Motivated by Proposition 2, it is obvious that any k-adjacency of does not have the FPP. With the given hypothesis, in case has the AFPP, for any k-continuous self-map of , there is a point such that or is k-adjacent to x. For any k-connectivity of , since any k-continuity of f implies -continuity of f (see Equations (1) and (2)), we may take the -connectivity of X for supporting the given AFPP of .
Conversely, if , then we first prove that does not have the AFPP. For instance, in , consider the digital image instead of . Let us consider a self-map of . To be precise, assume as the composite of the following two 4-continuous maps and (see Figure 1(1)).
Figure 1.
The non-AFPP of the digital 2-cube with 4-adjacency, . (1) Configuration of the map ; (2) Explanation of the map .
Then, we obtain (see Figure 1(2)). Let us further consider the map such that
Owing to the 4-continuous maps and , the composite is also a 4-continuous map. Although this map f is a 4-continuous self-map of , it is not a map for supporting the AFPP of .
As a generalization of the non-AFPP of , using a method similar to the Equations (5) and (6), we obtain that a digital image does not have the AFPP either. For instance, on , consider . Using the notion of 18-continuity of any self-map of (see Proposition 1), we prove that the digital image does not have the AFPP. To be precise, consider a self-map g of in the following way: For ,
According to this map g, we obtain
Let us now consider the self-map h of Z such that
Then, we obtain
Let us now further consider the self-map r of W such that
Then, it is obvious that each of the maps h and r is a 6-continuous map and the map g is an 18-continuous map (see Equations (7)–(9)). Hence, the composite is an 18-continuous map. However, this composite does not have the AFPP of (see the map r of Equation (9)).
Finally, in case of , according to the notion of -continuity of any self-map of (see Proposition 1), it is obvious that the digital image has the AFPP. Indeed, to obtain a contradiction, suppose the digital image does not have the AFPP. Then, any self-map of is not a -continuous map (see the point . □
Let us now briefly recall some basic facts and terminology involving the K-topology. The Khalimsky line topology on , denoted by , is induced by the set as a subbase []. Furthermore, the product topology on induced by is called the Khalimsky product topology on (or Khalimsky n-dimensional space), which is denoted by . Based on this approach, for a point p in , its smallest open neighborhood is obtained [].
Hereafter, for a subset , we will denote by a subspace induced by , and it is called a K-topological space. For a point x in , we often call the smallest open neighborhood of x in .
For , we say that distinct points x and y in X are K-adjacent in if or []. According to this K-adjacency, it is obvious that a K-topological space is a digital space.
A simple closed K-curve with l elements on , denoted by , is defined as a finite sequence in [], where and are K-adjacent if and only if .
Using the set of K-topological spaces and that of K-continuous maps for every ordered pair objects of K-topological spaces, we obtain the category of K-topological spaces, denoted by KTC [].
Let us now recall basic concepts on M-topology. The M-topology on , denoted by , is induced by the set in Equation (10) below as a base [], where, for each point ,
Owing to Equation (10), the set is the smallest open neighborhood of the point p in , denoted by . Hereafter, for a subset , we will denote by a subspace induced by , and it is called an M-topological space. For a point x in , we denote by the smallest open neighborhood of x in . For , we say that distinct points x and y in X are M-adjacent in if [], where is the smallest open set containing the point p in . According to this M-adjacency, it turns out that an M-topological space is a digital space [].
A simple closed M-curve with l elements on , denoted by , is defined as a finite sequence in [], where and are M-adjacent if and only if .
Using the set of M-topological spaces and that of M-continuous maps for every ordered pair of objects of M-topological spaces, we obtain the category of M-topological spaces, denoted by MTC [].
Remark 1.
It is obvious that [], [] and [] do not have the AFPP in the categories , and , respectively. For instance, for , consider a self-map of such that . Whereas f is a K-continuous map, there is no point such that or is K-adjacent to x []. By using a method similar to this approach for , it is obvious that and do not have the AFPP in DTC and MTC, respectively (see also []).
3. Some Properties of a K-, an M-, a U- or an L-Digitization
Regarding several types of digitizations of into a certain digital space, first of all we need to examine if given a digitization preserves the typical connectedness of X into the digital connectedness of the corresponding digitized space associated with a digital space structure. Indeed, the authors in [] intensively studied this property. To combine this approach with the study of a preservation of the AFPP of a compact Euclidean topological space into that of its digitized space, we need to study a K-, an M-, a U- or an L-digitization [,,]. Hence, this section recalls four types of local rules being used to formulate special kinds of neighborhoods of a given point .
Definition 2
([]). In , for each point , we define the set , which is called the local K-neighborhood of p associated with , where and
It is obvious [] that the set is a partition of .
Remark 2.
In view of Definition 2, for each point , can be substantially used to digitize onto the K-topological space by using the following map []: For each
Using of Definition 2 and the method given in Remark 2, let us recall the K-digitization of a non-empty space .
Definition 3
([]). For a nonempty space , we define a K-digitization of X, denoted by , to be the space with K-topology
Let us now recall the M-digitization. For a point , the authors in [,] used an M-localized neighborhood of the given point p, denoted by , associated with .
Definition 4
([,]). In , for a point , we define the following neighborhood of p:
which is called an M-localized neighborhood of p associated with .
It is obvious [] that the set is a partition of .
Remark 3.
In view of Definition 4, for each point , can be substantially used to digitized onto the M-topological space via the following map. For each
Using of Definition 4 and the method given in Remark 3, we can define an M-digitization of a non-empty space , as follows.
Definition 5
([,]). For a nonempty 2-dimensional Euclidean topological space in , we define an M-digitization of X, denoted by , to be the set in with M-topology
Remark 4.
In view of Definition 5, for each point , can be substantially used to digitize the spaces in into M-topological spaces in .
Using Definitions 3 and 5 and Remarks 1, 2 and 3, for , we obtain the following:
Proposition 3.
For and , there are K- and M-digitizations
defined by
In Proposition 3, means the power set of the set T.
Let us now recall the so-called U-digitization of . The upper limit topology (U-topology, for brevity) on , denoted by , is induced by the set as a base []. Based on the U-topology on , we obtain the product topology on , denoted by , induced by . Based on , we use a U-local rule [] that is used to digitize into , where is a discrete topological space.
Definition 6
([]). Under , for a point , we define , and we call the U-localized neighborhood of p associated with .
Using the U-local rule of Definition 6, we define the following:
Definition 7
([]). Let be the map defined by , where and the k-adjacency is taken according to the situation. Then, we say that is a -digitization operator.
Using the method similar to the establishment of and the above U-local rule, let us now consider the L-local rule associated with L-topology and its product topology, where the lower limit topology (L-topology, for brevity) on , denoted by , is induced by the set as a base [].
Definition 8
([]). Under , for a point , we define . We call the L-localized neighborhood of p associated with .
It is obvious [] that the set is a partition of .
Using the L-local rule of Definition 8, we define the following:
Definition 9
([]). Let be the map defined by , where and the k-adjacency determined according to the situation. Then, we say that is an -digitization operator.
For a non-empty set , let us now recall a - and an -digitization, as follows.
Definition 10
([]). Let X be a subspace in (resp. ). The U- (resp. L-) digitization of X, denoted by (resp. ), is defined as follows:
with a k-adjacency of of (2) depending on the situation.
Using Definition 10, for , we obtain the following:
Proposition 4.
Given a k-adjacency of and , there are - and -digitizations
defined by
In Proposition 4, means the power set of of the set .
4. Explorations of the Preservation of the AFPP of a Compact Plane into theAFPP of a K-, an M-, a U(k)-, or an L(k)-Digitized Space
The author in [,] proved the FPP of the smallest open neighborhood of [] and the non-FPP of a compact M-topological plane in []. Thus, we may now pose the following queries about the AFPP of compact M-topological plane X and the preservation of the AFPP of a compact n-dimensional Euclidean space (or cube) into that of each of K-, M-, U- and L-digitization, as follows:
- Question 1
- Let X be the set . How about the FPP or the AFPP of the K-topological space ?
- Question 2
- Let Y be the set . What about the AFPP of the M-topological space ?
- Question 3
- How about the preservation of the AFPP of a compact n-dimensional Euclidean cube into the AFPP of its -, or -digitized space?
To address these queries, we first compare the FPP among a compact n-dimensional Euclidean space, a compact and n-dimensional K-topological space and a compact M-topological plane as follows:
Lemma 1.
The smallest open neighborhood of has the FPP.
Proof.
As the smallest open set of , we may consider (see Equation (10)), where or a singleton , where , .
- Case 1
- Consider , where . Then, assume any M-continuous self-map f of . If p is mapped by f onto a point , then the map should be a constant map with according to the M-continuity of f, which implies that has the FPP with a fixed point q associated with the map f. In addition, in case , the assertion is trivial.
- Case 2
- Assume that is a singleton. Then, it is obvious that has the FPP.
□
In MTC, we say that an M-homeomorphic invariant is a property of an M-topological space which is invariable under M-homeomorphism [].
Proposition 5
([]). Each of the FPP and the AFPP from the viewpoint of MTC is an M-homeomorphic invariant.
Indeed, in Lemma 1, the shape of is a diamond. Then, we may pose a query about the FPP of another shape of a diamond, as follows:
Corollary 1.
Consider an M-topological space which is M-homeomorphic to , where . Then, has the FPP.
Proof.
According to Proposition 5, since the FPP in MTC is an M-topological invariant property [], we may prove that has the FPP. For any M-continuous self-map f of , we prove that there is always a point such that . To be precise, consider any M-continuous self-map f of . In case , is a fixed point of f. In case , i.e., we may assume . Then, according to the M-continuity of f, f should have the fixed point , which implies that there is a point satisfying . Thus, is proved to have the FPP. □
The notion of an M-retract is used to study both the FPP and the AFPP of M-topological spaces []. Thus, let us recall it.
Definition 11
([]). In MTC, we say that an M-continuous map is an M-retraction if
- (1)
- is a subspace of and
- (2)
- for all .
Then, we say that is an M-retract of .
The author in [] proved that a compact M-topological plane does not have the FPP. Hence, as a more generalized version, we need to study the following:
Lemma 2
([]). For let be an M-retract of . If has the AFPP, then also has the AFPP.
Using this property, unlike the shape of a diamond in Lemma 1 and Corollary 1, as a generalization of the non-FPP of a compact M-topological plane [], we now prove the non-AFPP of a compact M-topological plane, as follows:
Theorem 2.
A compact M-topological plane does not have the AFPP.
Proof.
Consider a compact M-topological plane containing the set . Then, we first prove that is an M-retract of . Furthermore, we second permutate as an M-continuous self-map of . After combining these two processes, we obtain an M-continuous self-map of which does not support the AFPP of .
For instance, let us consider the compact M-topological plane . Then, further consider two self-maps (see Figure 2a(1)), (see Figure 2a(2)) of X such that
Figure 2.
The non-AFPP of an compact M-topological plane.
Furthermore, is defined as follows:
Since the two maps and are M-continuous self-maps of X (see Equations (11) and (12)), the composite is also an M-continuous self-map of X. However, owing to this composite , does not have the AFPP.
In general, let us consider a compact M-topological plane (see Figure 2b) or (see Figure 2c). Without loss of generality, we may assume (see Figure 2b) or (see Figure 2c) because the other cases are obviously similar to these cases. Then, consider the following two M-continuous self-maps (see Figure 2b(1)), (see Figure 2b(2)) of such that
Furthermore, is defined as follows:
Then, the maps and are M-continuous maps (see Equations (13) and (14)) so that the composite is also an M-continuous map. However, there is no point in X supporting the AFPP of .
Similarly, let us consider another case such as (see Figure 2c). Then, consider the following two M-continuous self-maps of such that
Furthermore, is defined as follows:
Then, the maps and are M-continuous maps (see Equations (15) and (16)) so that the composite is also an M-continuous map. However, there is no point in X supporting the AFPP of . □
Based on Propositions 2 and 3, 4 and Theorem 1, we have the following:
Theorem 3.
Let X be a compact and two-dimensional Euclidean topological plane, i.e., , . Then, we obtain the following:
- (1)
- The functor does not preserve the AFPP,
- (2)
- The functor preserves the AFPP if ,
- (3)
- The functor preserves the AFPP if
Let X be a compact and n-dimensional Euclidean topological cube, i.e., . Then, we obtain the following:
- (4)
- The functor preserves the AFPP if ,
- (5)
- The functor preserves the AFPP if .
Proof.
Based on Theorem 1 and Propositions 3 and 4, we consider the following digitizations:
- (1)
- For , since is also M-connected [] and furthermore that is a compact M-topological plane, by Theorem 2, we obtain that does not have the AFPP, which completes the proof.
- (2)
- Using Propositions 2 and 4, the proof is completed.
- (3)
- Using the method similar to the proof (2), we complete the proof.
- (4)
- For , it is obvious that is k-connected, . Hence, by Theorem 1, the digital image has the AFPP. Hence, preserves the AFPP if .
Indeed, in case , does not have the AFPP. For instance, consider the compact Euclidean topological plane . Since has the FPP [], it obviously has the AFPP. Apparently, according to Theorem 1, the 4-connected digital image does not have the AFPP because is equal to . By Remark 1, does not have the AFPP.
- (5)
- It is obvious that is k-connected, . Hence, by Theorem 1, the digital image has the AFPP.
Indeed, in case , by using a method similar to the case of (2) above, we prove that does not have the AFPP. □
Regarding Questions 1 and 3, the author in [] proved the FPP of in . Moreover, the authors in [] proved that the functor preserves the connectedness of into its K-digitized space . Based on this situation, we can conclude that preserves the FPP and furthermore the AFPP. As a general case of this case, we have the following conjecture.
The author in [] proved that a smallest open set of has the FPP, and the authors in [] proved that has the FPP, and, using these results, we obtain the following:
Remark 5.
Let X be the compact and n-dimensional Euclidean space . Then, has the AFPP because it has the FPP.
5. Conclusions
We have studied the AFPP of an n-dimensional digital cube and also investigated the preservation of the AFPP via each of K-, - and -digitizations if . In addition, based on the non-FPP of a compact M-topological plane, we also explored the non-preservation of the AFPP via an M-digitization. Furthermore, based on the FPP of , we also proved the preservation of the FPP of via a K-digitization. This approach can facilitate the study of applied sciences such as object classifications, image processing, pattern recognition, artificial intelligence, and so on.
Funding
The author was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (2019R1I1A3A03059103). In addition, this research was supported by the Research Base Construction Fund Support Program funded by Jeonbuk National University in 2019.
Conflicts of Interest
The author declares no conflict of interest.
References
- Kong, T.Y.; Rosenfeld, A. Topological Algorithms for the Digital Image Processing; Elsevier Science: Amsterdam, The Netherlands, 1996. [Google Scholar]
- Rosenfeld, A. Continuous functions on digital pictures. Pattern Recognit. Lett. 1986, 4, 177–184. [Google Scholar] [CrossRef]
- Han, S.-E. Fixed point theorems for digital images. Honam Math. J. 2015, 37, 595–608. [Google Scholar] [CrossRef]
- Han, S.-E. Banach fixed point theorem from the viewpoint of digital topology. J. Nonlinear Sci. Appl. 2016, 9, 895–905. [Google Scholar] [CrossRef]
- Han, S.-E. Contractibility and Fixed point property: The case of Khalimsky topological spaces. Fixed Point Theory Appl. 2016, 1, 75. [Google Scholar] [CrossRef][Green Version]
- Han, S.-E. A digitization method of subspaces of the Euclidean nD space associated with the Khalimsky adjacency structure. Comput. Appl. Math. 2017, 36, 127–144. [Google Scholar] [CrossRef]
- Han, S.-E. Almost fixed point property for digital spaces associated with Marcus-Wyse topological spaces. J. Nonlinear Sci. Appl. 2017, 10, 34–47. [Google Scholar] [CrossRef][Green Version]
- Han, S.-E. Fixed point property for digital spaces. J. Nonlinear Sci. Appl. 2017, 10, 2510–2523. [Google Scholar] [CrossRef]
- Han, S.-E. The fixed point property of an M-retract and its applications. Topol. Appl. 2017, 230, 139–153. [Google Scholar] [CrossRef]
- Han, S.-E. The fixed point property of the smallest open neighborhood of the n-dimensional Khalimsky topological space. Filomat 2017, 31, 6165–6173. [Google Scholar] [CrossRef]
- Herman, G.T. Oriented surfaces in digital spaces. CVGIP Graph. Model. Image Process. 1993, 55, 381–396. [Google Scholar] [CrossRef]
- Han, S.-E.; Chun, W.-J. Classification of spaces in terms of both a dizitization and a Marcus Wyse topological structure. Honam Math. J. 2011, 33, 575–589. [Google Scholar] [CrossRef]
- Kang, J.M.; Han, S.-E.; Min, K.C. Digitizations associated with several types of digital topological approaches. Comput. Appl. Math. 2017, 36, 571–597. [Google Scholar] [CrossRef]
- Rosenfeld, A. Digital topology. Am. Math. Mon. 1979, 86, 76–87. [Google Scholar] [CrossRef]
- Khalimsky, E.D. Applications of Connected Ordered Topological Spaces in Topology. 1970. Available online: https://www.semanticscholar.org/paper/Applications-of-connected-ordered-topological-in-Khalimsky/153064579a3f6ced9f6e716d7882750e1268ed93 (accessed on 12 August 2019).
- Wyse, F.; Marcus, D. Solution to problem 5712. Am. Math. Mon. 1970, 77, 1119. [Google Scholar]
- Han, S.-E. Non-product property of the digital fundamental group. Inf. Sci. 2005, 171, 73–91. [Google Scholar] [CrossRef]
- Han, S.-E. Estimation of the complexity of a digital image form the viewpoint of fixed point theory. Appl. Math. Comput. 2019, 347, 236–248. [Google Scholar]
- Khalimsky, E.; Kopperman, R.; Meyer, P.R. Computer graphics and connected topologies on finite ordered sets. Topol. Appl. 1990, 36, 1–17. [Google Scholar] [CrossRef]
- Han, S.-E.; Sostak, A. A compression of digital images derived from a Khalimsky topological structure. Comput. Appl. Math. 2013, 32, 521–536. [Google Scholar] [CrossRef]
- Munkres, J.R. Topology; Prentice Hall, Inc.: Upper Saddle River, NJ, USA, 2000. [Google Scholar]
- Kang, J.M.; Han, S.-E.; Lee, S. The fixed point property of non-retractable topological spaces. Mathematics 2019, 7, 879. [Google Scholar] [CrossRef]
© 2019 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).