Digital topological groups
Abstract.
In this article, we develop the basic theory of digital topological groups. The basic definitions directly lead to two separate categories, based on the details of the continuity required of the group multiplication. We define - and -digital topological groups, and investigate their properties and algebraic structure. The category is very restrictive, and we give a complete classification of -digital topological groups. We also give many examples of -digital topological groups. We define digital topological group homomorphisms, and describe the digital counterpart of the first isomorphism theorem.
Key words and phrases:
digital image; normal product adjacency; -digital topological group; digital simple closed curve; regular graph; vertex-transitive graph; Cayley graph; digital topological group homomorphism; digital open map; digital H-space2020 Mathematics Subject Classification:
Primary 22A30; Secondary 22A10; 68U03; 05C101. Introduction
The topological theory of digital images focuses on topological properties of finite subsets of the -dimensional integer lattice, attempting to build a digital theory which resembles classical topology of .
A graph-theoretical approach to digital topology was introduced by A. Rosenfeld in the 1960s. Interesting works on digital surfaces and digital manifolds as a special kind of combinatorial manifolds have been produced in the 1980s and in 1990s by many authors.
A classical topological group is both a topological space and a group in which the topological structure is compatible with the group structure; that is, the product and inverse are topologically continuous. A topological group is both a special case of an H-space and a general case of a Lie group in pure mathematics.
A theory of H-spaces has been developed in the digital setting by O. Ege and I. Karaca [9] and the first author in [11, 12]. The additional algebraic structure of groups allows the present paper to prove more specific results. This paper is organized as follows: In Section 2, we review and describe fundamental properties of digital images with some adjacency relations, digital continuous functions, and some terminology from graph theory. We define -digital topological groups for some and digital simple closed curves. In Section 3, we investigate properties of digital topological groups, and construct many classes of examples. In Section 4, we develop digital topological group homomorphisms as morphisms of the category of digital topological groups. We also describe the digital counterpart of the first isomorphism theorem from group theory. In Section 5, we describe a complete classification of -digital topological groups.
2. Preliminaries
A digital image consists of a finite set of points in with some adjacency relation which is both antireflexive and symmetric. Typically the adjacency relation is based on some notion of adjacency of points in . This style of digital topology has its origins in the work of Rosenfeld and others, see [15] for an early work.
When there is no canonical “standard adjacency” to use in which corresponds naturally to the standard topology of . In the case of , for example, at least two different adjacency relations are natural: we can view as a rectangular lattice connected by the coordinate grid, so that each point is adjacent to 4 neighbors; or we can additionally allow diagonal adjacencies so that each point is adjacent to 8 neighbors.
In , there are different standard adjacency relations, denoted for , defined as follows: Two distinct points and in are -adjacent [5] if
-
•
there are at most distinct indices such that ; and
-
•
for all other indices , if , then .
We will make use of the notation when is adjacent to by the adjacency relation in , and when is adjacent or equal to . The particular adjacency relation will usually be clear from context, and in this case we will omit the subscript.
Let and be nonnegative integers with . A digital interval [2] is a finite set of the form
with the -adjacency relation in .
A digital image is said to be -connected [15] if for every pair of points of , there exists a subset
-
•
;
-
•
; and
-
•
for for .
Such a set is called a path (or -path) from to . Given some , the set of all points of having a path to is the connected component of . A digital image is digitally connected if and only if it consists of a single component.
A function between digital images is called a -continuous function [3] when for any , if , then . Equivalently, is continuous if is a -connected subset of for each -connected subset of . When the adjacencies are clear, we simply say that is continuous. Any composition of digitally continuous functions is digitally continuous.
A -continuous function of digital images
is called a -isomorphism if is a bijection set-theoretically, and its inverse is -continuous. In this case, and are said to be -isomorphic; see [2] and [4]. We often make use of the following fact: if is an isomorphism, then if and only if .
Any digital image can naturally be viewed as a finite simple graph with vertex set and an edge connecting if and only if . Conversely, any graph may be considered as a digital image with a standard adjacency:
Theorem 2.1 ([13], Proposition 2.5).
Let be a finite simple graph of vertices. Then there is some such that may be embedded as a digital image with -adjacency.
(Above, by “embedded” we mean that , considered as an abstract graph, is isomorphic as a graph to the digital image with -adjacency.)
We will, whenever convenient, describe a digital image in graph-theoretic terms. Specifically, our definitions above of paths, connectedness, and components correspond exactly to the same concepts in graph theory. We will also make use of the degree from graph theory: for , the degree of is the number of with . If all points of have the same degree , we say is -regular. If all pairs of points of are adjacent, then is a complete graph.
Given two digital images and , we can consider the Cartesian product as a digital image, but there are several natural choices for the adjacency relations to be used in the Cartesian product, analogous to the various -adjacencies. The most natural product adjacencies are the normal product adjacencies, which were defined by Boxer as follows:
Definition 2.2.
([6]) Let be an indexed family of digital images. Then for some , the normal product adjacency is the adjacency relation on defined by: and are adjacent if and only if their coordinates are adjacent in at most positions, and equal in all other positions.
In this paper, our products generally have the form for some digital image . On such a Cartesian product, the two natural adjacencies to choose from are and . When unambiguous, we will abbreviate as simply for . Clearly, if two points and in are -adjacent, then they are also -adjacent. As we will see, the topological structure of the Cartesian product depends strongly on the choice between and ; see [13, 17] for a discussion of -homotopy relations.
3. Digital topological groups
3.1. Definitions and basic examples
A classical topological group is both a topological space and a group whose binary operation and inverse are topologically continuous. The following is the digital counterparts of classical topological groups as the topological structure of the Cartesian product depending strongly on the choice between and .
Definition 3.1.
Let be a digital image such that is a group with multiplication and inverse . For some , we say is an -digital topological group when is -continuous and is -continuous. If is an -digital topological group for some , we say is a digital topological group.
For a digital topological group with product and inverse we typically will write the product of elements and as , and the inverse of an element as .
Clearly any -digital topological group is also an -digital topological group. In classical topology, the continuity condition is analogous to requiring that be continuous as a function of 2 variables, while the condition is analogous to requiring that is continuous in each variable separately. In classical topology the definition of topological group requires full continuity, while a structure with continuity in each variable separately is called a semitopological group [10, page 27].
Classically, the assumption of full continuity is generally more interesting, but we will see in our setting that the more interesting examples of digital topological groups are but not . The full continuity assumption is too strong to allow for any nontrivial examples, as we show in Section 5.
The simplest nontrivial example of an -digital topological group is a simple closed curve.
Definition 3.2.
A digital simple closed curve is a set of distinct elements for with some adjacency such that if and only if , with subscripts read modulo .
When viewed as a graph, all points of a digital simple closed curve have degree 2; that is, it is a connected -regular graph.
For example, the set forms a digital simple closed curve in . It is not a digital simple closed curve in because there are some extra diagonal adjacencies. Specifically the point is -adjacent to its two -neighbors and , but is also adjacent to and .
Now we show that a simple closed curve is an -digital topological group, but not an -digital topological group.
Example 3.3.
Let be a digital simple closed curve with adjacency , and define operations:
where all subscripts are read modulo .
We will show that these operations make into an -digital topological group. The group axioms are clearly satisfied by these operations, so we need only check that is -continuous, and is -continuous.
For , take two -adjacent points . Then
as desired.
For , we need to choose any two pairs of points in which are -adjacent, and show that they map by into -adjacent points of . Points which are -adjacent are equal in one coordinate, and adjacent in the other. So without loss of generality we will consider the pair . Then we have:
as desired. We have shown that is an -digital topological group.
In contrast, these operations do not make into an -digital topological group when . To see this, note that and are -adjacent, but their products and are not adjacent.
3.2. Properties of digital topological groups
In this subsection, we will investigate some interesting properties of digital topological groups. Most of the results in this section are inspired by corresponding statements in the classical theory.
Theorem 3.4.
Let be a digital topological group. Then, for each , the maps given by and , respectively, are -isomorphisms.
Proof.
Since the argument for is similar, we will prove the statement for . Assume that is an -digital topological group for some .
First we show that is continuous for each . Let be defined by for each . Note that . Since is -continuous for both and , and is -continuous, this means that will be -continuous as desired.
By the same reason, is continuous. But is the inverse of , and so is continuous with continuous inverse as desired. ∎
We can use the above to demonstrate that, in Definition 3.1, continuity of the inverse follows automatically from continuity of the product. (This is not generally true in the classical theory, in which it is possible to have a topological space with continuous group product but discontinuous inverse.)
Lemma 3.5.
Let be a digital image such that is a group with multiplication and inverse . For some , assume that is -continuous for some . Then is an -topological group.
Proof.
It suffices to show that the inverse is continuous: let , and we will show that .
Note that in Theorem 3.4, no reference was made to continuity of . Thus we may use Theorem 3.4 even though we have not assumed continuity of the inverse.
Since is an isomorphism by Theorem 3.4, we may apply to to obtain , where is the identity element. Then we apply and obtain as desired. ∎
We also have a partial converse to Theorem 3.4: if and are isomorphisms for every , then is an -digital topological group.
Theorem 3.6.
Let be a digital image such that is a group with multiplication and inverse . Assume that for each , the functions are digital isomorphisms. Then is an -digital topological group.
Proof.
By Lemma 3.5, we need only show that is -continuous. We must choose two pairs of -adjacent points in . Without loss of generality choose pairs , and we will show that . Since , we will have , and applying the isomorphism gives as desired. ∎
An easy corollary will weaken the assumption above:
Corollary 3.7.
Let be a digital image such that is a group with multiplication and inverse . Assume that for each , the functions are digitally continuous. Then is an -digital topological group.
Proof.
By Theorem 3.6, we need only show that and are isomorphisms for every in . Clearly and are inverse functions. Since we have assumed that both are continuous, must be an isomorphism. Similarly is an isomorphism as desired. ∎
Since is an isomorphism which carries the identity element to the element , the structure of near must be isomorphic to the structure of near any other element .
A graph is vertex-transitive if and only if, for all , there is a graph automorphism with ; see [18, page 14], [8, page 69], and [1, page 15].
Theorem 3.8.
Let be a digital topological group. Then is vertex-transitive.
Proof.
Given a digital topological group and elements , by Theorem 3.4 the map
is a graph automorphism carrying to as required. ∎
Any vertex-transitive graph is automatically regular (all vertices have the same degree), so we have:
Corollary 3.9.
Let be a digital topological group. Then is regular.
The results above are analogous to the classical statement that a topological group is a homogeneous space [14, page 39].
We may also ask wether a digital topological group must be edge-transitive, that is, there is a graph automorphism carrying any given edge onto any other given edge; see [1, page 19] for a classical simple graph. This is not necessarily true for a digital topological group, as we will show later in Example 3.12.
The fact that a digital topological group must be regular is a significant restriction on the possible structure of a digital topological group. For example, among finite subsets of , the only possible connected digital topological group is a digital simple closed curve.
Theorem 3.10.
Let be a connected digital topological group. Then is a digital simple closed curve, or a set of 2 or fewer points.
Proof.
By Theorem 3.8, must be a -regular graph for some . Since we are using -adjacency, the degree is at most 4. We will consider each possible value for , and conclude that the only allowable situation is when is a simple closed curve, or a set of 2 or fewer points.
If then is a single point. If , then is a set of two adjacent points. For , any connected -regular graph is a simple cycle, which in our terminology is a simple closed curve. For , the only -regular subset of is all of , and since is finite it cannot be -regular.
It remains to show that the case is also impossible. To obtain a contradiction, assume that is a finite 3-regular graph. Since is finite we may compose with a translation to assume without loss of generality that , and that there are no points with .
Since but no point of has negative first coordinate, we have and thus since is degree 3, the neighbors of must be exactly . In particular, we have . Inductively applying the same reasoning to , we see that in fact for every , and so is infinite which is a contradiction. ∎
3.3. Examples of digital topological groups
In this subsection, we present various example constructions of digital topological groups.
Given any abstract group , there are two trivial ways to realize as an -digital topological group. First as a discrete digital image: we may embed as a set having no adjacent points. Then the required continuity conditions for the product and inverse are satisfied automatically, because there are no adjacencies in the domain.
Second we can form an indiscrete digital image by embedding as a complete graph (by Theorem 2.1 this is possible for large enough). In this case the required continuity conditions are satisfied automatically because all points of the codomain are adjacent.
Generally we will be interested in examples other than these trivial cases of discrete and indiscrete digital images.
First we show that a direct product of digital topological groups is a digital topological group:
Theorem 3.11.
For some , let and be -digital topological groups. Then is an -digital topological group.
Proof.
Let and be the multiplication operations for and , respectively, and let and be the inverses for and , respectively. Then we define the product and inverse
and
by
and
These operations clearly obey the group axioms, so we need only demonstrate the appropriate continuities, which unfortunately are notationally cumbersome. We will write
for the adjacency relation being used in .
By Lemma 3.5, we need only demonstrate that is -continuous. Assume that and , elements of , are -adjacent, and we must show that and are -adjacent. We will handle the and cases separately.
For , we may assume without loss of generality that and . Further we can assume without loss of generality that and . Then when comparing with , we see that the first coordinates are equal. In the second coordinate we have and , and thus since multiplication by is an isomorphism. Thus and are -adjacent as desired.
For , we must additionally consider the case where and are -adjacent in each of the 2 coordinates. In this case we will have , , , and . By -continuity of and we have and , and so and are -adjacent (or equal) as desired. ∎
The product result above can be used to construct examples of -digital topological groups other than simple closed curves. For example if is a simple closed curve of length 4 and is a simple closed curve of length 8, then is a digital topological group isomorphic to the direct product . This digital topological group is analogous to the classical torus regarded as a topological group.
This torus serves as an example digital topological group which is not edge-transitive. Recall that a graph is edge-transitive when, given any two edges, there is a graph automorphism carrying the first to the second.
Example 3.12.
Let be the digital topological group which is a product of two digital simple closed curves of different lengths .
Viewing as a graph resembling the torus , it has some edges belonging to meridians of length , and some belonging to meridians of length . Because , no automorphism can carry one of these edges to the other.
A large class of examples of -digital topological groups is the set of Cayley graphs of groups. We will review the basic definitions as follows.
Given a finitely generated group , a group presentation for is an expression , where is a generating set for , and is a set of relations among the elements of . For convenience we will assume that the generating set is “symmetrized”, so that implies .
Given such a group presentation, we form the Cayley graph [1, page 28] in which the vertex set is , and each element is connected by an edge to every other element of the form for each . The structure of the Cayley graph is determined by both the group and the set : the same group may give different nonisomorphic Cayley graphs depending on the choice of generating set.
Theorem 3.13.
Let be a Cayley graph for some group presentation . Then is an -digital topological group which is isomorphic as a group to .
Proof.
The vertices of are elements of , so there is a natural multiplication and inverse which satisfy the group axioms. Using these operations, is isomorphic to as a group. To show that is an -digital topological group, by Lemma 3.5 we must show that is continuous using in the domain.
Let and be -adjacent, and we will show that in . Without loss of generality, we may assume that and . Since is a Cayley graph, means that for some . So we must show that .
By the construction of the Cayley graph we have since . Then applying the isomorphisms and gives as desired. ∎
As a specific example, it is easy to construct the dihedral group on 8 elements as an -digital topological group in modeled on the unit cube. This is notably an example of a non-abelian digital topological group with a nontrivial (neither discrete nor indiscrete) graph structure.
Example 3.14.
Let be the unit cube . Our definition of the operations is inspired by the Cayley graph of the presentation . We identify points of with elements of according to Figure 1, and define operations
and
A typical Cayley graph will not be an -digital topological group. The assumption below will typically be satisfied by any Cayley graph, as long as there is some element of order greater than 2.
Theorem 3.15.
Let be a Cayley graph for some group presentation having some generator such that and . Then is not an -digital topological group.
Proof.
Since we will have , and so and are -adjacent. But and are not equal or adjacent because and was assumed. Thus is not an -continuous function. ∎
It is natural to consider the converse question to Theorem 3.13: if is an -digital topological group, then is a Cayley graph for some group isomorphic to ? The answer is no, as the following example demonstrates:
Example 3.16.
Let be the unit square of four points:
and define operations
and
with subscripts read modulo , so that is isomorphic as a group to the cyclic group of order 4.
The operation above makes into a digital topological group, where the continuity of and is automatic because is a complete graph. But is not the Cayley graph for , which would be a simple cycle graph of 4 points.
3.4. Connected components of a digital topological group
A basic result from the classical theory of topological groups is that the component of the identity element of a topological group is a normal subgroup; see [14, page 39]. The same is true in the digital setting; see Theorem 3.20 below.
Definition 3.17.
Let be a digital topological group with identity element . Define to be the connected component containing the identity element , which we call the identity component.
More generally, for some , let be the component containing .
Lemma 3.18.
Let be a digital topological group. For , we have and .
Proof.
Since the statement for is similar, we will prove the statement for . Note that
Thus maps into , and since the continuous image of a digital connected subset is connected, we must have
To see that these sets are equal, note that maps into , and so by the same reasons as above we have
Applying gives , which combines with the above to give
as required.∎
Since is a digital isomorphism, the above gives:
Corollary 3.19.
Let be a digital topological group. For , the sets and are digitally isomorphic.
The above means that any digital topological group naturally decomposes as a disjoint union of connected components, each isomorphic to . Specifically, any component is digitally isomorphic to by the isomorphism .
Theorem 3.20.
Let be a digital topological group. Then is a normal subgroup of .
Proof.
To show that is a subgroup, take , and we will show that . Since and are in the same component, we can construct a path from to in . Applying the isomorphism to this path gives a path from to , which means that as desired.
To show that is normal, take and , and we must show that . Since , by Lemma 3.18 we have , and thus as desired. ∎
Because is a connected subgroup and the whole group consists of disjoint copies of , our task of classifying digital topological groups will focus on connected groups.
Let be the set of all (connected) components of a digital topological group . Suggested by Lemma 3.18, there is a natural group structure on the set of components of as follows.
Theorem 3.21.
Let be a digital topological group. Then is a group, with operations given by and , where .
Proof.
By the group properties of , these operations on will satisfy the group axioms. It suffices only to show that these operations are well-defined.
To show that the inverse is well defined, take in with , and we will show that . Since , there is a path from to in . Since the inverse map
is continuous, we may apply to this path to obtain a path from to , which shows that and are in the same component, and thus that as desired.
Now we show that the product is well-defined. To do this, take with and , and we must show that . That is, we must show that: when and are in the same component, and when and are in the same component, then and are in the same component.
Since and are in the same component, there is a path
from to in . Similarly there is a path
from to in . By perhaps repeating elements several times to lengthen the paths, we may assume that so that these paths have the same length. We will also assume that points are repeated in these paths in the following way:
-
•
for even we assume that , and
-
•
or odd we assume that .
Now we may multiply these paths pointwise to obtain:
and it suffices to show that this sequence of points forms a path from to . We must demonstrate that
for each . Because of the structure of repeated values in even and odd positions, we see that and are -adjacent for any . Thus their products and are adjacent as desired. ∎
Theorem 3.22.
Let be a digital topological group with identity element . Then there is a group isomorphism .
Proof.
For , let be the representative of in the quotient. Let
be given by
We will show that is an isomorphism.
First we show that is well-defined. Let , and we must show that , that is, and are in the same component. The fact that means that for some . Since and , we have by Lemma 3.18. Thus , and so and are in the same component as desired.
Clearly is a group homomorphism because
and
Finally we show that is a bijection. The kernel of is any with , that is to say if and only if , which holds only when is trivial in . Thus has trivial kernel. Finally is surjective because for any element , we have
as required. ∎
Note that Theorem 3.22 asserts that there is a short exact sequence of groups
(3) |
that is not necessarily split. If the sequence (3) happens to be split, then is a semidirect product of and ; that is,
In particular, it is not always true that is algebraically the direct product , as the following example shows:
Example 3.23.
We must show that the product operation used in Example 3.14 is continuous with respect to the adjacencies in the figure.
An arbitrary point of has the form , where and . To show that the product is continuous, we choose two pairs of -adjacent points. Without loss of generality, we take the pairs and where and , where exponents of are always read modulo 4, and exponents of are always read modulo 2. We must show that the products and are adjacent in .
When , we have
as desired. Recall that in we have , which means that and more generally that . Thus when , we have
as desired.
Thus is an -digital topological group. Observe that is isomorphic as a group to , while is isomorphic to the group , and so is not the direct product of and . Rather, it is the semidirect product , where the factor acts by inversion.
This example also demonstrates that digital topological groups which are isomorphic as groups may not be isomorphic as digital images. The present example and Example 3.14 are algebraically the same group, but realized as two different digital images.
4. Digital topological group homomorphisms
In this section, we consider morphisms between digital topological groups, and the first isomorphism theorem for digital topological groups. We define a morphism between digital topological groups as follows.
Definition 4.1.
Let and be digital topological groups. A map is called a digital topological group homomorphism if it is both a -continuous function and a group homomorphism.
Definition 4.2.
A digital topological group homomorphism is called a digital topological group isomorphism if it is a digital isomorphism; that is, there exists a digital topological group homomorphism such that
and
In this case, is said to be digital topological group isomorphic to .
Let be a subgroup, group-theoretically, of a digital topological group . We define an adjacency relation on as follows.
Definition 4.3.
Let be a subgroup of a digital topological group . We define an adjacency relation on by the restriction of to . Using this restricted adajcency relation, becomes a digital topological group, which we call a digital topological subgroup of .
Note that a digital topological subgroup of is not necessarily digital connected even if is -connected.
Let be a normal digital topological subgroup of a digital topological group . We define an adjacency relation on as follows.
Definition 4.4.
Let be a digital topological group and a normal digital topological subgroup, and let be the canonical surjection. We define an adjacency relation on by declaring whenever there are and with in .
Proposition 4.5.
Let be an -digital topological group, with an -digital topological subgroup for some . Then the quotient group is an -digital topological group with adjacency relation as in Definition 4.4.
Proof.
Let and be the digital multiplication and the digital inverse, respectively, as in Definition 3.1. Define
and
by
and
respectively, for all . It can be seen that the following diagrams
are commutative. Moreover, if
in for some , and
in , then we have
and
Therefore, and are -continuous and -continuous functions, respectively, for some , as required. ∎
We note that, when is a digital topological group embedded in and is a normal subgroup, the quotient group may not nicely take the form of a digital image in with adjacency.
For example, let be the simple closed curve of 16 points in Figure 3. We will label the points of as with with subscripts read modulo , so that is isomorphic as a group to . Let , indicated by the circled points in Figure 3. Choosing as coset representatives, the digital image is not naturally situated as a digital image in with -adjacency. (Though by Theorem 2.1, it will be isomorphic to some digital image in with -adjacency. In fact it is a simple closed curve of 4 points.)
For sets in some digital image, we will say that and are adjacent if there exists points and with . In this case we write .
Definition 4.6.
We call a -continuous function a digital open map when: if with , then .
Thus an open map is one for which preserves adjacencies in the same way that a continuous map does. The definition of digital open map is related to continuity of the preimage viewed as a multivalued map see [7, Theorems 2.4 and 2.7]. We use the term open map because it is required for Proposition 4.7, which in the classical theory requires that the map be open.
The following is the digital version of the first isomorphism theorem from group (or module) theory.
Theorem 4.7.
Let be a digital topological group homomorphism with kernel . If is a digital open map, then there exists a unique digital topological group isomorphism
such that
for all , where
is the -continuous function given by .
Proof.
From the first isomorphism theorem from group theory, we see that there exists a unique isomorphism of groups
such that the following diagram
is commutative in the category of groups and group homomorphisms in the sense that
for all , where is a digital topological subgroup of . We need only show that is a digital isomorphism.
To show is continuous, take in . Then there are some and with . Since is continuous, we will have . Thus we have
and so is continuous.
Now to show is continuous, take in , and we will show that
in . Since , we must show that
Since is a digital open map and , we have , and thus there is some and so that
in as required. ∎
As the following example shows, not all continuous homomorphisms of digital topological groups are open maps, and the conclusion of Theorem 4.7 may fail when the map is not open.
Example 4.8.
The digital image is a simple cycle of 4 points, while is a set of 4 never-adjacent points. Interpreting points of as complex numbers, the complex multiplication makes into a group isomorphic to . It is easy to verify that this multiplication makes both and into -digital topological groups.
Let be the identity map. Then clearly is a continuous homomorphism, but it does not satisfy the open map condition. For example we have , but and have no -adjacent points.
In this case the conclusion of Proposition 4.7 will fail: the kernel of is trivial, so we have , while . But is not a digital isomorphism.
The following theorem shows that a group homomorphism (not assumed to be continuous) of digital topological groups is automatically continuous provided that it is continuous near the identity element. This is analogous to the classical fact that a homomorphism of topological groups will be continuous if it is assumed to be continuous in a neighborhood of the identity element.
Theorem 4.9.
Let and be digital topological groups with identity elements and , respectively, and let be a group homomorphism with the property that: if , then . Then is continuous and thus is a digital topological group homomorphism.
Proof.
Take , and we must show that in . Since , we can apply the isomorphism to obtain . Then by our assumption on we have . Then applying the isomorphism gives as desired. ∎
We note that we can construct the category whose object and morphism classes consist of digital topological groups and digital topological group homomorphisms, respectively.
5. Classification of -digital topological groups
The -continuity required for an -digital topological group is very restrictive, and we can prove a complete classification of these groups. Recall that a cluster graph [16] is a graph which is a disjoint union of complete graphs.
In this section we show that a digital image is an -digital topological group if and only if it is a regular cluster graph. The result is based on the following lemma:
Lemma 5.1.
If is a connected -digital topological group, then every element of is adjacent or equal to the identity element .
Proof.
Let , and we will show that is adjacent or equal to . To obtain a contradiction, assume that is not adjacent or equal to , and let be a minimal path in from to with . Minimality of the path implies that is not equal or adjacent to .
Since is adjacent to in , and the multiplication is -continuous, we see that is adjacent or equal to . Applying the isomorphism shows that is adjacent or equal to , which is a contradiction. ∎
The result above can be improved:
Theorem 5.2.
If is a connected -digital topological group, then is a complete graph.
Proof.
Let , and we must show that is adjacent or equal to . Lemma 5.1 above shows that and must be adjacent to . Thus is -adjacent to , so multiplication shows that is adjacent to as desired. ∎
By Corollary 3.19, any digital topological group is a disjoint union of components, each isomorphic to . Thus we obtain:
Corollary 5.3.
If is an -digital topological group, then is a regular cluster graph.
We also have a converse to the above: any set which is a regular cluster graph can be given the structure of an -digital topological group.
Theorem 5.4.
Let be a regular cluster graph. Then there are operations and which make into an -digital topological group.
Proof.
Assume that consists of disjoint components, each a complete graph on vertices. We will construct coordinates for points of which label each point with a pair , and show that, with respect to these coordinates, can be given the group structure of .
Choose some arbitrary point of and label it as . Each of the other points in the component of will be labeled as for . Let be the components of , labeled so that . For each , let be some graph isomorphism, with being the identity map. Then for any , we label the points of as
Note that since is a cluster graph, two points and in are adjacent in if and only if they are in the same component, which is to say
Now we define the operations and so that becomes an -digital topological group with group structure isomorphic to . We define:
Clearly these operations make into a group. By Lemma 3.5 we need only show that is -continuous. Take to be -adjacent to . This means that and . Then their products will be and which are adjacent in because the second coordinates are equal. Thus is -continuous as desired. ∎
References
- [1] J. A. Bondy and U. S. R. Murty, Graph theory, Graduate Texts in Mathematics, 244. Springer, New York, 2008.
- [2] L. Boxer, Digitally continuous functions, Pattern Recognition Letters 15 (1994), 833-839.
- [3] L. Boxer, A classical construction for the digital fundamental group, J. Math. Imaging Vis. 10 (1999), 51-62.
- [4] L. Boxer, Properties of digital homotopy, J. Math. Imaging Vis. 22 (2005), 19-26.
- [5] L. Boxer, Homotopy properties of sphere-like digital images, J. Math. Imaging Vis. 24 (2006), 167-175.
- [6] L. Boxer, Generalized normal product adjacency in digital topology, Appl. Gen. Topol., 18(2) (2017), 401-427.
- [7] L. Boxer and P. C. Staecker, Connectivity preserving multivalued functions in digital topology, Journal of Mathematical Imaging and Vision 55 (2016), 370–377.
- [8] G. Chartrand and P. Zhang, Introduction to Graph Theory, McGraw-Hill Science, New York, 2005
- [9] O. Ege and I. Karaca, Digital H-spaces, 3rd International Symposium on Computing in Science and Engineering, ISCSE 2013, 133-138.
- [10] T. Husain, Introduction to topological groups, W. B. Saunders Co., Philadelphia, Pa.-London 1966.
- [11] D.-W. Lee, Near-rings on digital Hopf groups, Appl. Algebra Engrg. Comm. Comput. 29(3) (2018), 261-282.
- [12] D.-W. Lee, Digital H-spaces and actions in the pointed digital homotopy category, Appl. Algebra Engrg. Comm. Comput. 31(2) (2020), 149-169.
- [13] G. Lupton, J. Oprea, N. Scoville, The Digital Hopf Construction, arxiv 2002.03027, 2020.
- [14] D. Montgomery and L. Zippin, Topological Transformation Groups, Interscience Tracts in Pure and Applied Mathematics, Track 1, Interscience Publ. Inc. New York, 1955.
- [15] A. Rosenfeld, Continuous functions on digital pictures, Pattern Recognition Letters 4 (1986), 177-184.
- [16] R. Shamir, R. Sharan, and D. Tsur, Cluster graph modification problems, Discrete Appl. Math. 144 (2004), no. 1-2, 173–182.
- [17] P. C. Staecker, Digital homotopy relations and digital homology theories, Appl. Gen. Topol. 22 (2021), no. 2, 223-250.
- [18] D. B. West, Introduction to Graph Theory, Prentice Hall, Inc., Upper Saddle River, NJ, 1996.