1. Introduction
Let
(
resp.) be the set of integers (
resp. natural numbers) and
be the
n times Cartesian products of
. Moreover, we denote the set of even natural numbers with
. A paper [
1] initially raised the following query involving a fixed point set and a homotopy fixed point set from the viewpoint of typical fixed point theory.
How do the fixed points of a continuous self-map of an ordinary topological space depend on the given self-map?
It can also be of interest in digital topology-based fixed point theory. Therefore, a paper [
2] partially studied this issue in a Rosenfeld’s digital topological setting, the so-called “digital fixed point property” and “digital homotopy fixed point property”.
Specifically, how do the fixed points of a digitally continuous self-map of a digital image depend on the given self-map?
Indeed, this approach can be so natural and meaningful. Unfortunately, since the paper [
2] contains many errors, a paper [
3] corrected many things and improved them. In a similar way as the above, given a digital image
, a paper [
4] studied the set of cardinalities of fixed point sets of all
k-continuous self-maps of
, denoted by
, and explored some features of it and the set of cardinalities of fixed point sets of all continuous self-maps
g of
which are
k-homotopic to a given continuous self-map
f of
. Then the authors of [
4] used the term, the so-called “fixed point spectrum” and “homotopy fixed point spectrum”. Indeed, we may follow the term “spectrum” because such a name can be taken by an author. However, for a given digital image
, since each of the above quantities need not be 2-connected, the present paper will take another term to exactly characterize the “set of the cardinalities of fixed point sets of
k-continuous self-maps of it”, i.e., the so-called “an alignment of fixed point sets” exactly defining the above set in mathematical sense and further, we denote it with
as referred to in [
4] (see Definition 4). A paper [
5] explored some alignments of fixed point sets which are 2-connected because an existence of a 2-connected alignment of fixed point sets depends on the situation. At the moment, given a digital image
, we need to examine if an alignment of fixed point sets of
is connected up to 2-connectedness, which can play an important role in digital topology and many areas in applied sciences [
6,
7].
In this paper, we investigate various properties of
in the category
, where
is the category consisting of the set of digital images and the set of digitally continuous maps (see
Section 2 for details). In
, a recent paper [
5] confirmed that a digital
k-isomorphism preserves a
k-homotopy. Based on this approach, after considering a digital wedge
whose digital
k-fundamental group is an infinite cyclic group or a trivial group, a recent paper [
5] partially examined if
is 2-connected and perfect (see Definition 5), where the term “perfect” means that for a digital image
,
, e.g.,
. Motivated by the approach, in the Rosenfeld’s digital topological setting for fixed point theory, regarding
of
, we may raise the following queries.
- (Q1)
Given a digital image , does always have ?
Indeed, this issue was partially studied in [
4].
- (Q2)
Given a digital image , under what condition can we have that is perfect?
- (Q3)
Given a digital image , how can we explore perfectness of ?
- (Q4)
For a digital wedge , assume . If , then is 2-connected?
- (Q5)
For a digital wedge , assume . If , then how can we characterize ?
- (Q6)
Is perfect?
- (Q7)
Under what condition is perfect?
After developing many new tools, we will address all these queries.
The remainder of the paper is organized as follows:
Section 2 investigates various concepts related to digital topological spaces and deals with some properties of them.
Section 3 explores various properties related to 2-connectedness of an alignment of fixed point sets. In particular, we intensively explore some conditions of which
is 2-connected, which addresses the main issues of the present paper. Indeed, we can recognize a certain special role of
that makes
perfect.
Section 4 intensively investigates some properties of
that are involved in the 2-connectedness or the perfectness of it.
Section 5 concludes the paper with some remarks and a further work. In this paper, we will often use the symbol “
” to introduce a new term. In addition, we will denote the cardinality of a set
X with
. This paper corrects and improves some results stated by Boxer et al. in [
4] (see Remark 3) and corrects several incorrect citations in [
4] related to a digital wedge (see
Section 2) and a generalization of digital
k-connectivity and a normal adjacency for a digital product.
2. Preliminaries
The papers [
8,
9] called a set
with digital
k-connectivity (or a
k-adjacency) a
digital image denoted by
,
. Thanks to these
k-adjacency relations for digital images in
, it turns out that a digital image
is a digital space [
6,
10]. Motivated by this approach, a paper [
11] initially developed the generalized version of the adjacency relations of
for high-dimensional digital images
, the so-called
k-(or
-)adjacency relations of
(see below). Indeed, this approach was initially taken in [
11], which can play an important role in studying many structures in digital topology such as digital products with normal adjacencies [
11] and their applications. To study digital images
,
, we now recall the following [
11] (see also [
12,
13]):
For a natural number
t,
, distinct points
are
-adjacent
According to the statement of (1), the
-adjacency relations of
, were initially formulated [
11] (see also [
12,
13]) as follows:
For instance,
For
with
, the set
with 2-adjacency is called a digital interval [
14].
Let us now recall some terminology and notions [
8,
9,
11,
15] which will be used in this paper.
A digital image
is said to be
k-disconnected [
15] if there are non-empty sets
such that
,
and further, there are no points
and
which are
k-adjacent. Using this approach, a digital image
is said to be
k-connected (or
k-path connected) if it is not
k-disconnected.
A
k-connected digital image
in
whose cardinality is greater than 1, the so-called
k-path with
elements in
X is assumed to be the finite sequence
such that
and
are
k-adjacent if
[
14]. Then we call the number
l the lenth of this
k-path.
We say that a simple
k-path is the finite set
such that
and
are
k-adjacent if and only if
[
6]. In case
and
, we denote the length of the simple
k-path with
.
A simple closed
k-curve (or simple
k-cycle) with
l elements in
, denoted by
[
11,
14],
, means the finite set
such that
and
are
k-adjacent if and only if
. Owing to this notion, it is obvious that the number of
l should be even. In particular, in the present paper we will use the notation
to abbreviate
. At the moment, we need to remind that in some papers
is used for a notation of a closed
k-curve with
l elements in
. However, in this paper since we will not deal with such curves, we may use the notation
for only a simple closed
k-curve with
l elements in
.
To fix the incorrect citation of [
4] related to the notion of digital wedge, we now recall the concept with originality.
The notion of digital wedge (or one point union of two digital images) was initially proposed in [
11,
16]. To be precise, two given digital images
and
, a
digital wedge [
11,
16], denoted by
, is defined as the union of the digital images
and
, where
- (1)
is a singleton, say .
- (2)
and
are not
k-adjacent, where the two subsets
A and
B of
are said to be
k-adjacent [
14] if
and there are at least two points
and
such that
a is
k-adjacent to
b.
- (3)
is k-isomorphic to and is k-isomorphic to (see Definition 1).
In digital topology, we are strongly required to follow this digital wedge
. If we do not follow this approach, we will have some big difficulties in proceeding with further works in digital topology. Meanwhile, in the case
and
such that
, the compatible
k-adjacency of
was also established in [
16].
Motivated by the strong graph adjacency of a product of two typical graphs [
17], its digital version was initially developed in [
11]. Indeed, this notion plays an important role in calculating digital
k-fundamental group of digital products [
12,
18,
19,
20,
21,
22].
For a digital image
, we may consider it with two kinds of aspects: First, a graph theoretic approach with the above
k-adjacency relation of (2), e.g., digital
k-graphs [
8,
9,
23,
24], can be considered. Second, based on a discrete topological subspace induced by the
n-dimensional usual topological space, further consider it with one of the above
k-adjacency relation of (2). Indeed, they are eventually equivalent to each other. For a
k-connected digital image
, the paper [
11] already established a certain metric on
. To be precise, a metric function, say
, on a
k-connected digital image
was established, as follows:
It obviously follows from (3) that this metric
is different from the typical Euclidean metric on
. Thus, for a certain
, we defined [
11,
15]
which is called a digital
k-neighborhood of
with radius
. Indeed, the notion of (4) is another representation of the typical one established in [
11]. The paper [
10] defined a digital space. At the moment, we should remind that a digital space need not be a topological space, e.g., a digital image
) with digital
k-connectivity in terms of the Rosenfeld’s model [
8,
9]. For instance, to wit that a digital image
is a digital space, consider two distinct points
. Then we say that
p is
k-adjacent to
q if
Using this approach, we see that a digital image
on
is one of the digital spaces. Indeed, there are countably many digital spaces in
[
25] including Khalimsky [
26] and Marcus-Wyse topological spaces [
27], Alexandroff space [
28], and so on.
The notion of digital continuity of a map
was initially defined by Rosenfeld [
9] by saying that
f maps every
-connected subset of
into a
-connected subset of
. Motivated by this approach, using the set in (4), we can represent the digital continuity of a map between digital images using a digital
k-neighborhood (see Proposition 1 below).
Proposition 1. [23,29] Let and be digital images in and , respectively. A function is (digitally) -continuous if and only if for every . In Proposition 1, in the case
and
, the map
f is called a ‘
k-continuous’ map to abbreviate the
-continuity of Proposition 1. Due to this approach, we can have big advantages of calculating the digital fundamental groups of digital images
using the unique digital lifting theorem [
11], the digital homotopy lifting theorem [
29], a radius 2-
-isomorphism and its applications [
29], the multiplicative properties of a digital fundamental group [
12,
21,
22], a Cartesian product of the covering spaces [
22], and so on.
To make the present paper self-contained, we need to recall the category
DTC consisting of the following two pieces of data [
11] (see also [
23]), called the digital topological category.
The set of , where , as objects of DTC, denoted by ;
For every ordered pair of objects , the set of all -continuous maps between them as morphisms of DTC, denoted by .
In
DTC, in the case of
, we will particularly use the notation
DTC(k) [
20].
To classify digital images
[
23,
24]), we prefer the term a
-isomorphism (or
k-isomorphism) as in [
23] to a
-homeomorphism (or
k-homeomorphism) as in [
30].
Definition 1. [23] (see also a -homeomorphism in [30]) Consider two digital images and in and , respectively. Then a map is called a -isomorphism if h is a -continuous bijection and further, is -continuous. Then we use the notation . In the case , we use the notation to abbreviate . Based on the pointed digital homotopy in [
26,
31,
32] (see also [
30]), the following notion of
k-homotopy relative to a subset
is often used in studying
k-homotopic properties of digital images
in
. For a digital image
and
, we often call
a digital image pair.
Definition 2. [11,30,33] Let and be a digital image pair and a digital image in and , respectively. Let be -continuous functions. Suppose there exist and a function such that for all and ;
for all , the induced function given by for all is -continuous.
for all , the induced function given by
for all is -continuous;
Then we say that H is a -homotopy between f and g [30]. Furthermore, for all , assume that the induced map on A is a constant which follows the prescribed function from A to Y [11] (see also [33]). To be precise, for all and for all .
Then we call H a -homotopy relative to A between f and g, and we say that f and g are -homotopic relative to A in Y, in symbols [33]. In Definition 2, if
, then we say that
F is a pointed
-homotopy at
[
30]. When
f and
g are pointed
-homotopic in
Y, we use the notation
. In the case
and
,
f and
g are said to be pointed
k-homotopic in
Y and we use the notation
to abbreviate
. If, for some
,
is
k-homotopic to the constant map in the space
X relative to
, then we say that
is
pointed k-contractible [
30]. Indeed, motivated by this approach, the notion of strong
k-deformation retract was developed in [
18,
33].
Based on this
k-homotopy, the notion of digital homotopy equivalence initially introduced in [
34] (see also [
24]), as follows:
Definition 3. [34] (see also [24]) For two digital images and in , if there are k-continuous maps and such that the composite is k-homotopic to and the composite is k-homotopic to , then the map is called a k-homotopy equivalence and is denoted by . Moreover, we say that is k-homotopy equivalent to . In the case that the identity map is k-homotopy equivalent to a certain constant map , we say that is k-contractible. In Definition 3, in the case of , we call that is the same k-homotopy type with . In view of Definitions 2 and 3, it is easy to see that the pointed k-contractibility implies the k-contractibility, but the converse does not hold.
For a given digital image
, by using several notions such as digital
k-homotopy class [
26,
31,
32], Khalimsky operation of two
k-homotopy classes [
31], trivial extension [
30], the paper [
30] defined the digital
k-fundamental group, denoted by
. Indeed, in digital topology there are several kinds of digital fundamental groups [
19]. Also, we have the following: If
X is pointed
k-contractible, then
is a trivial group [
30]. Hereafter, we shall assume that each digital image
is
k-connected.
Using the unique digital lifting theorem [
11] and the homotopy lifting theorem [
29] in digital covering theory [
11,
12,
16,
18,
19,
20,
21,
22,
33,
35], for a non-
k-contractible space
, we obtain the following:
Theorem 1. [11] (1) For a non-k-contractible , is an infinite cyclic group. Indeed, is trivial if and only if . (2) For two non-k-contractible digital images , is a free group with two generators with infinite orders.
This result will be essential in characterizing an alignment of fixed point sets in
Section 3 and
Section 4. By Theorem 1,
has the trivial group,
[
11,
29,
30] and further,
also has the trivial group, i.e.,
is trivial if
, and
is also trivial.
Remark 1. [9,15,35] Only a singleton digital image has the FPP. 3. Digital Topological Properties of Up to 2-Connectedness and Perfectness of
As mentioned above, for , in this paper we need to assume in nature. The study of digital topological properties of digital wedges , and in general plays an important role in computational or digital topology. This section counts on a certain role of that is involved in the perfectness of (see Definition 5) with some hypothesis. Indeed, the study of , , and , and so on still remains open. Up to now, it turns out that digital fundamental groups of , and are strongly related to the digital topological features of alignments of fixed point sets of them.
Definition 4. [4] Given a digital image , As mentioned in
Section 1, this paper calls this
of Definition 4 an “alignment of fixed points sets of
”. Indeed, this notion can be used to recognize the cardinalities of fixed point sets of all
k-continuous self-maps
of
. It is obvious that
(see Remark 1) because each identity map of a given digital image
is a
k-continuous map, we obtain
. Namely, for a digital image
with
, we see
.
In relation to the study of , we need to define the following:
Definition 5. Given a digital image , if , then we say that is perfect.
In particular, given a digital image in the case that is not perfect, we need a certain method of establishing including to make perfect. Therefore, we intensively explore n alignment of fixed point sets of several digital wedges.
A recent paper [
5] studied
. Thus, the study of
,
,
still remains open. Indeed, the study of these cases strongly plays an important role in computational or digital topology (see Theorems 2, 3, 4, and 5) because
is a minimal simple closed
k-curve in
. Indeed, since
is
k-contractible [
11,
30], its usage is very wide in digital and computational topology.
Furthermore, unlike the existence of
in
, it is well known that there is no simple closed digital curve with six elements in
(
resp. ) in the setting of Marcus-Wyse (
resp. Khalimsky) topology [
5,
27]. Thus, in this section, we firstly study some properties of the perfectness of
,
, and so on. Next, in
Section 4 will investigate some properties of
,
, and so on. Moreover, it also develops a certain method of making
and
perfect depending on the number
l.
Hereafter, as usual, we say that a digital topological invariant is a property of a digital image which is invariant under a digital k-isomorphism. In other words, a property of a digital image is digital topological property if whenever a digital image possesses that property, then every digital image k-isomorphic to also has that property.
Proposition 2. [4,5] An alignment of fixed point sets of is a digital topological invariant. This section explores some conditions supporting the perfectness of an alignment of fixed point sets. For
, it is easy to see that
[
4]. Since only a singleton set has the fixed point property in
(see Remark 1) [
9,
35], any digital image
with
in
DTC has the property
which is a little bit different feature compared to other digital space in applied topological space (see [
5] for details). Indeed, it is clear that
[
4]. The following lemma characterizes a certain relationship between contractibility and perfectness of
.
Lemma 1. (1) is k-contractible if and only if is perfect.
(2) is not k-contractible if and only if is not perfect.
Proof. The k-contractibility of depends on the number l.
- (1)
In the case that
is
k-contractible, we obviously obtain
(see Theorem 1(1)). Hence
. Conversely, since
[
4], by the hypothesis, we obtain that
, which implies the
k-contractibility of
.
- (2)
In the case , is not k-contractible (see Theorem 1). Since , we clearly obtain . By using a method similar to the proof of (1), the converse is proved.
□
In view of Theorem 1 and Lemma 1, it appears that
is perfect if and only if
and further,
is not perfect if and only if
. When the paper [
4] proved the non-perfectness of the fixed point sets of the 3-dimensional digital cube
, the author of [
4] used the 6-contractibility of it. However, we need to point out that the proof is already done in [
35]. Regarding Lemma 1, we also need to remind that not every
k-contractible digital image
has a perfect
[
4]. However, in the case of
, Lemma 1 always holds. Namely, it turns out that the
k-contractibility of
implies the perfectness of
and the converse also holds. This section, hereafter, mainly investigates some digital topological properties of
and perfectness of it depending on the number
l, where
. One important thing to note is that we need to remind that the triviality of the digital
k-fundamental group of
depends on the number
l (see Theorem 1). Specifically,
is
k-contractible [
11], and if
, then
is not
k-contractible [
11] (see also Theorem 1). Based on this observation, we obtain the following:
Lemma 2. [5] is perfect if and only if . Based on this approach, we now examine if is perfect depending on the number l.
Theorem 2. For a digital wedge , assume . Then has two components up to 2-connectivity such that and . Specifically, is not perfect if and only if .
Proof. Let us consider any k-continuous self-map f of . Indeed, though there are many kinds of k-continuous self-maps f of it, regarding , it is sufficient to consider only the following k-continuous maps f such that
- (a)
; or
- (b)
; or
- (c)
and
(see
Figure 1(1–4)); or
- (d)
f does not support any fixed point of it, i.e., there is no point such that ,
where means the restriction function f to the given set A. Regarding our consideration with (a)–(d) above, we may take another cases similar to the cases of (a)–(d) only exhausting . Now, we can confirm that the case (a) or (b) is related to the identity map , or . Thus, they obviously produce the element , where is equal to . Next, the case (c) covers all k-continuous self-maps of whose images by the maps f are simple k-paths on . Finally, the case (d) supports the property .
Let us now investigate the set of cardinalities of fixed point sets of the maps relagted to the cases (a)–(d) above.
First, from (a) above, we obtain
Second, based on (b) above, we have
Third, owing to (c) and (d) above, we obtain
After comparing the four numbers
,
l,
, and
from (5)–(7), with the hypothesis of “
”, we conclude that
which deduces that there is at least an element
which do not belong to
if
.
Specifically, it appears that there is at least an element
such that
Indeed, depending on the number
l, the volume of the part
is determined. To be specific, according to equality of (8), with the hypothesis of
, let us precisely examine
(see
Figure 1(4)).
- (Case 1)
If
, then we see that the number 11 does not belong to
. To be specific, we obtain
- (Case 2)
If
, then owing to (8), it appears that the elements
do not belong to
. Namely,
- (Case 3)
If
, then we observe that the numbers 13, 14, and 15 do not belong to
, i.e.,
- (Case 4)
If
, then owing to (8), we obtain that the elements 14, 15, 16, and 17 do not belong to
, i.e.,
- (Case 5)
If
, then we see that the numbers 15, 16, 17, 18, and 19 do not belong to
, i.e.,
- (Case 6)
If
, then it appears that the elements
, and 21 do not belong to
, i.e.,
Now, we strongly count on the set
which is one component up to 2-connectedness, which deduces that
has only two components up to 2-connectedness if
.
For instance, though there are countably many cases as a generalization of the above six cases, just see each of the six cases above according to the formula of (8). Furthermore, the volume of the set of (9) depends on the number l of (see the six cases above). In view of the equality of (8), in the case , we confirmed that at least the element does not belong to , which implies that is not 2-connected. Hence it is not perfect since has two components up to 2-connectedness. Eventually, if , it turns out that is not perfect.
In addition, one important thing to note is that the number is equal to which is quite different feature compared to the feature of the case . □
In the following
Figure 1, the dotted arrows indicate 8-continuous mappings. Moreover, all points are on
formulating certain
depending on the element
l of
.
Indeed, the above two cases such as (Case 4) and (Case 6) in the proof of Theorem 2 will be used in further studying , , and so on (see Theorem 4). In view of Theorem 2, we obtain the following:
Remark 2. As a generalization of , for , we can have a certain formula similar to that of (8) depending on the numbers and . The current formula of (8) only for the case . In the case that the number 4 of is changed into another, the formula of (8) is also changed depending on the number l of (compare (8) with (18) of Section 4). Thanks to the formula in (8), the following is obtained, which will be used in Theorem 4.
Example 1. (1) does not have the following elements (2) does not contain the following elements In view of Example 1, we see that (cf. see (1) of Example 1) and (cf. see (2) of Example 1) have the same features with respect to 2-connectedness. Indeed, the number plays an important role in studying some properties of the perfectness of . Using a method similar to the method suggested in Example 1, we may further consider many cases.
Remark 3. Lemma 4.8 of [4] is incorrectly stated, as follows: To make the paper self-contained, we now write it as follows: Let X be connected with . Then if and only if there are distinct points with ," where and Indeed, for convenience of the reader, we need to understand this situation with a digital image , i.e., we need to represent this situation with and . To explain this lemma more precisely, let us consider the digital image as an example, where (see Figure 2(1)). Then we clearly see that is equal to . To adapt this digital image into Lemma 4.8 of [4], we can assume two distinct points p and . Then we see that and further, we obviously obtain (see the process given through Figure 1(a–d)) so that is perfect, which satisfies Lemma 4.8 of [4]. However, we now point out that the condition for the assertion need not be “if and only if” with the following counterexample.
Consider the digital image (see Figure 2(2)). As described in Figure 2(2) via (a)–(c), we can see that is also perfect, i.e., . Despite this situation, we see that there are not any distinct points in satisfying the condition , where and . Indeed, for any distinct points in , it is easy to see that . As another counterexample, we may consider the case and so on.
In view of the previously-obtained results, since , , and so on play important roles in digital topology, let us now intensively explore an alignment of fixed point sets of them, e.g., , , and so forth.
By Theorem 2, for
, it turns out that
is not 2-connected. Hereafter, let us now examine if
is perfect, according to the number
l. Specifically, after joining another
onto
to establish the new digital wedge
(see
Figure 1(6,7)), we confirm the perfectness of
if
, as follows:
Theorem 3. If , then is perfect.
Proof. Let us consider any k-continuous self-map f of . Indeed, though there are many kinds of k-continuous self-maps f of it, regarding , it is sufficient to consider only the maps f such that
- (a)
; or
- (b)
; or
- (c)
; or
- (d)
; or
- (e)
and ; or
- (f)
f does not support any fixed point of it, i.e., there is no such that .
Let us investigate the set of cardinalities of fixed point sets of k-continuous maps associated with the cases of (a)–(f) above.
First, from (a) above, we obtain
Second, from (b) above, we have
Third, from (c) above, we have
Fourth, from (d) above, we have
Fifth, from (e)–(f), we obtain
After checking the sets from (10)–(14), we can obtain according to the numbers , as follows:
According to these three cases, with the hypothesis of , let us precisely investigate .
- (Case 1)
If , then we see that .
- (Case 2)
If
, then we obtain that
(see
Figure 1(5)).
- (Case 3)
If
, then we observe that
(see
Figure 1(6)).
Hence, it turns out that is perfect if . □
In view of Theorem 3, it turns out that if , then is perfect.
After checking (10)–(14) in the proof of Theorem 3, for , let us precisely examine if is perfect, as follows:
Theorem 4. If , then
- (1)
is not 2-connected.
- (2)
has two components up to 2-connectedness.
Proof. For , after checking the sets from (10)–(14) in the proof of Theorem 3, we obtain the following:
- (Case 1)
If
, then we see that
- (Case 2)
If
, then we see that
- (Case 3)
If
, then we observe that
- (Case 4)
If , then it is obvious that is not 2-connected.
In view of this calculation, if , then
- (1)
is not perfect, and the proof is completed.
- (2)
Since the set is 2-connected, it appears that has only two components.
□
As proved in Theorem 2, in the case , it turns out that is not perfect. Then, after joining a certain onto (see Theorem 4) to produce a new digital wedge, we have a natural question, as follows: For ,
Is perfect?
Regarding this query, motivated by Theorem 2 (see the Cases (1)–(6) in the proof of Theorem 2), we have the following: Owing to the cases, (Case 1)–(Case 6), we get some advantages of finding some more features of , , and so on.
In view of Theorem 4, for
, though
is not perfect, after joining one
onto
to produce
, using a method similar to Theorem 4, we obtain the following (see
Figure 1(8)):
Corollary 1. If , then is perfect.
Proof. Motivated by the consideration of (a)–(f) suggested in the proof of Theorem 3, we can consider the following several cases. Though there are many kinds of k-continuous self-maps f of it, regarding , it is sufficient to consider only the maps f such that
- (a)
; or
- (b)
; or
- (c)
; or
- (d)
; or
- (e)
; or
- (f)
; or
- (g)
and ; or
- (h)
f does not support any fixed point of it, i.e., there is no such that .
Then, using a method similar to the formulas in (10)–(14), we obtain that if , then the proof is completed. □
Corollary 2. If , while is not 2-connected, is perfect.
Specifically, Corollary 2 implies that if , while is not 2-connected, if , then is perfect.
Proof. Using the methods of the proofs of Theorem 3 and Corollary 1, the proof is completed. □
4. Non-Perfectness of and Perfectness of
As mentioned in
Section 1 and
Section 3, owing to the certain significant importance of
from the viewpoint of digital topology, this section mainly focuses on investigating some digital topological properties of
,
, and so forth. Regarding this study, as proposed in
Section 1 with (Q6) and (Q7), we examine if
is perfect. Moreover, we find some condition that makes
perfect. Indeed, while
is not 2-connected, we find a certain condition that
is perfect. This section, hereafter, mainly investigates some topological properties of
and perfectness of it depending on the number
l. One important consideration is that we need to remind that if
, then the
k-fundamental group of
is a free group with two generators of which each of them has an infinite order.
Theorem 5. (1) If , then is not perfect.
(2) If , then has two components.
(3) If , then .
Proof. Let us consider any k-continuous self-map f of . Indeed, though there are many kind of k-continuous maps f, regarding , it is sufficient to consider only the maps f such that
- (a)
; or
- (b)
; or
- (c)
and ; or
- (d)
f does not support any fixed point of it, i.e., there is no point such that ,
where means the restriction function f to the given set A.
First, from (a) above, since
has the cardinality
, we obtain
Second, from (b) above, we have
Third, from (c)–(d) above, we obtain
After comparing the four numbers
,
l,
, and
from (15)–(17), we conclude that
Owing to the property (18), for any
, it is obvious that the element
Specifically, for any
of
, we always obtain the property
Moreover, for the number , since there is no element between and l in , let us now check the difference between the two numbers and l of (18). Specifically, if , then has two components such as and the singleton .
To be specific, with the hypothesis of
, according to equality of (18), let us precisely examine
(see
Figure 3(1–4)).
- (Case 1)
If , then we see that .
- (Case 2)
If , then it appears that .
- (Case 3)
If , then we observe that .
- (Case 4)
If , then we find that .
- (Case 5)
If , then we see that .
At the moment, we need to observe that the set
has one component up to 2-connectedness.
In view of the equality of (Case 1)–(Case 5) above, it appears that at least the element does not belong to , which implies that is not 2-connected so that it is not perfect either, since has two components up to 2-connectedness. □
Theorem 6. If , then has three components up to 2-connectedness.
Proof. If
, then owing to the difference
between
l and
from (18), we have the property that there is at least an element
since in
the component containing the element
in
and the component containing the element
are disjoint up to 2-connectedness. Hence we concluded that
has three components. Owing to (18), the volume of the part including the element
which does not included in
depends on the number
l of
.
To be specific,
if , then we see that the numbers do not belong to .
If , then we see that the numbers do not belong to .
If , then we see that the numbers do not belong to .
□
If , while is not perfect, we obtain the following:
Theorem 7. If , then is perfect.
Proof. Let us consider any
k-continuous self-map
f of
(see
Figure 3(5)). Indeed, though there are many kinds of
k-continuous maps
f, regarding
, it is sufficient to consider only the maps
f such that
- (a)
;
- (b)
;
- (c)
;
- (d)
:
- (e)
;
- (f)
;
- (g)
,
, and
(in particular, see
Figure 3(5)); and
- (h)
f does not support any fixed point of it, i.e., there is no point such that ,
where means the restriction function f to the given set A.
As already mentioned above, though there are indeed so many cases such as the cases (a)–(h) above for calculating , it is sufficient to consider the above cases from (a)–(h) exhausting .
Using a method similar to the proofs of Theorems 5 and 6, the proof is completed. □
Remark 4. Using a method similar to the proof of Theorems 5, 6, and 7, if , then is not perfect.
Example 2. In view of Theorem 7, while is perfect, let us show that is not perfect. According to the property (a) of the proof of Theorem 7, we obtain . Owing to (b), we have . By (c), we have . By (d), we have . Owing to (e), we have . By (f), we have . Finally, by (g) and (h), we have . In view of this situation, we obtain .
The more generalized cases of Corollaries 1 and 2, and Theorems 5–7 will be dealt in a consecutive paper shortly.