Next Article in Journal
Adaptive Continuous-Variable Quantum Key Distribution with Discrete Modulation Regulative in Free Space
Previous Article in Journal
Chaos of the Six-Dimensional Non-Autonomous System for the Circular Mesh Antenna
 
 
Correction published on 8 May 2023, see Mathematics 2023, 11(9), 2207.
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Groups of Isometries of Metric Spaces over Vector Groups

1
School of Mathematics, Statistics and Computer Science, University of KwaZulu Natal, Pietermaritzburg 3209, South Africa
2
College of Mathematical Sciences, Bohai University, Jinzhou 121013, China
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(23), 4453; https://doi.org/10.3390/math10234453
Submission received: 2 November 2022 / Revised: 23 November 2022 / Accepted: 24 November 2022 / Published: 25 November 2022 / Corrected: 8 May 2023

Abstract

:
In this paper, we consider the groups of isometries of metric spaces arising from finitely generated additive abelian groups. Let A be a finitely generated additive abelian group. Let R = { 1 , ϱ } where ϱ is a reflection at the origin and T = { t a : A A , t a ( x ) = x + a , a A } . We show that (1) for any finitely generated additive abelian group A and finite generating set S with 0 S and S = S , the maximum subgroup of Isom X ( A , S ) is R T ; (2) D R T if and only if D T or D = R T where T = { h 2 : h T } ; (3) for the vector groups over integers with finite generating set S = { u Z n : | u | = 1 } , Isom X ( Z n , S ) = O n ( Z ) Z n . The paper also includes a few intermediate technical results.
MSC:
05C12; 51F99

1. Cayley Graphs as Metric Spaces

The metric dimensions of the three classical geometric spaces and of Riemann surfaces were determined in [1]. This was followed up by the work in [2,3] where metric dimensions of metric manifolds were determined. Our work of the present paper is on the groups of isometries of metric spaces of vector groups over the integers.
As in [4] (p. 34), let G be a group and S G be a generating set of G such that 1 S and S 1 = S . Define the Cayley graph  X = X ( G , S ) through the specification of its sets of vertices and edges
V ( X ) = G , E ( X ) = { g h : g , h G , g h 1 S } .
The condition S 1 = S implies that the resulting graph is undirected, and the condition 1 S implies that the graph has no loops. The condition that S is a generating set of G is to ensure that X is connected. The connectivity is imposed for the simple reason that our interest is in the metric properties of metric spaces. A graph X is a metric space X with its intrinsic path metric.
Let X and Y be metric spaces with distance functions ρ X and ρ Y , respectively. If a bijective mapping f : X Y preserces distances then it is called an isometry. Namely, if for any x , y X ,
ρ Y f ( x ) , f ( y ) = ρ X ( x , y )
then the bijective mapping f is called an isometry. For basic concepts and results not explicitly defined or presented in this note, the reader is referred to [1,5]. The group of isometries of a metric space is the set of all isometries of the space, with the composition of functions as group operation.
Let X be a metric space with distance function ρ . Determining the group of isometries of metric space ( X , ρ ) is an interesting problem [6]. Let x = ( x 1 , x 2 , , x n ) , y = ( y 1 , y 2 , , y n ) R n . The distance function d p is defined by
d p ( x , y ) = i = 1 n | x i y i | p 1 p .
If p = , then the distance function d is defined by
d ( x , y ) = max | x 1 y 1 | , | x 2 y 2 | , , | x n y n | .
Hence ( R n , d 2 ) is the well-known Euclidean metric space. As in [7], let p 2 be a real number, p 1 or p = . Then, the group of isometries of metric space ( R n , d p ) is O n ( Z ) R n , where O n ( Z ) denote the orthogonal group in dimension n over Z .
An automorphism of a graph X = ( V , E ) is a permutation mapping f of the vertex set V, such that u v E ( G ) if and only if f ( u ) f ( v ) E ( G ) . The set of automorphisms of a graph forms a group under the composition of functions. This group is called the automorphism group of the graph X. The aim of this note is to study the group of isometries of metric spaces of vector groups over the integers.
A finitely generated additive abelian group over the integers is abbreviated as a vector group over Z . In this note, among other results, the following two theorems are obtained.
Let A be a finitely generated additive abelian group and suppose that ϱ : A A satisfies ϱ ( x ) = x . Let R = { 1 , ϱ } and T = { t a : A A , t a ( x ) = x + a , a A } . Then, R T is the maximum subgroup of Isom X ( A , S ) (Theorem 3).
D R T if and only if D T or D = R T where T = { h 2 : h T } (Theorem 4).
If S = { u Z n : | u | = 1 } , then Isom X ( Z n , S ) = O n ( Z ) Z n (Theorem 6).

2. Abelian Groups

Let X be a metric space with distance function ρ , and let Isom X denote the group of isometries of X. If X is also a graph, then denote by Aut X the group of automorphisms of X.
Let X be a metric space and x X . Let r be a positive real number. The sphere centered at x X with radius r is denoted S ( x , r ) = { y X : ρ ( x , y ) = r } .
Theorem 1.
Let X be a graph. Then, Isom X = Aut X .
Proof. 
For any f Isom X and x , y X , we have
ρ ( x , y ) = ρ ( f ( x ) , f ( y ) ) .
Hence, if ρ ( x , y ) = 1 then ρ ( f ( x ) , f ( y ) ) = 1 and if ρ ( x , y ) > 1 then ρ ( f ( x ) , f ( y ) ) > 1 . Hence, x y E ( X ) if and only if f ( x ) f ( y ) E ( X ) . Therefore, f Aut X .
For any g Aut X , we have g 1 Aut X . Let x , y X . Suppose that a = ρ ( x , y ) and b = ρ ( g ( x ) , g ( y ) ) . Let x 0 = x and x a = y . Then, the shortest path exists [ x 0 , x 1 , x 2 , , x a 1 , x a ] of length a connecting x 0 and x a . Since g Aut X , for any i { 0 , 1 , , a 1 } , x i x i + 1 E ( X ) if and only if g ( x i ) g ( x i + 1 ) E ( X ) . Hence, there is a path [ g ( x 0 ) , g ( x 2 ) , g ( x 3 ) , , g ( x a 1 ) , g ( x a ) ] of length a connecting g ( x 0 ) and g ( x a ) . Then, ρ ( g ( x ) , g ( y ) ) a . Hence, b a . Let y 0 = g ( x ) and y b = g ( y ) . Since ρ ( g ( x ) , g ( y ) ) = b , the shortest path exists [ y 0 , y 1 , y 2 , , y b 1 , y b ] of length b connecting y 0 and y b . Since g 1 Aut X , for any i { 0 , 1 , , b 1 } , y i y i + 1 E ( X ) if and only if g 1 ( y i ) g 1 ( y i + 1 ) E ( X ) . Hence, there is a path [ g 1 ( y 0 ) , g 1 ( y 1 ) , g 1 ( y 2 ) , , g 1 ( y b 1 ) , g 1 ( y b ) ] of length b connecting g 1 ( y 0 ) and g 1 ( y b ) . Then, ρ ( x , y ) b . Hence, a b . In summary, ρ ( x , y ) = ρ ( g ( x ) , g ( y ) ) and g Isom X . Therefore, we have that the set of Isom X is equal to the set of Aut X .
Since the group operation in Isom X is composition and the same is true for the group operation in Aut X , Isom X = Aut X . □
Lemma 1.
Let X be a metric space with distance function ρ and f : X X be a bijective mapping. Then, f is an isometry of X if and only if for any x X and any real number r 0 , f ( S ( x , r ) ) = S ( f ( x ) , r ) .
Proof. 
Suppose that f is an isometry of X. Then, for any x X , r 0 and y S ( x , r ) , we have ρ ( x , y ) = r = ρ ( f ( x ) , f ( y ) ) . Hence, f ( y ) S ( f ( x ) , r ) . Then, f ( S ( x , r ) ) S ( f ( x ) , r ) . Let u S ( f ( x ) , r ) with r 0 . By the definition of a sphere, ρ ( u , f ( x ) ) = r . Let v = f 1 ( u ) . Since f is an isometry of X, f 1 is also an isometry of X. Hence, ρ f 1 ( u ) , f 1 f ( x ) = r = ρ ( v , x ) . Hence, v S ( x , r ) . Since f is a mapping, u = f ( v ) f ( S ( x , r ) ) . Hence, we have S ( f ( x ) , r ) f ( S ( x , r ) ) . Therefore, f ( S ( x , r ) ) = S ( f ( x ) , r ) .
Suppose that for any x X and every real number r 0 , f ( S ( x , r ) ) = S ( f ( x ) , r ) . Let y X . Then, y S ( x , ρ ( x , y ) ) . Since f is a mapping, f ( y ) f ( S ( x , ρ ( x , y ) ) ) . Since f ( S ( x , r ) ) = S ( f ( x ) , r ) , f ( y ) S ( f ( x ) , ρ ( x , y ) ) . Therefore, ρ ( f ( x ) , f ( y ) ) = ρ ( x , y ) . □
Corollary 1.
Let A be A finitely generated additive abelian group and S be a finite generating set of A with 0 S and S = S . Let X = X ( A , S ) and ϱ : X X be a bijective mapping with ϱ ( x ) = x . Then, ϱ is an isometry of X = X ( A , S ) that fixes 0.
Proof. 
Let r be a nonnegative real number. By the definition of ϱ , we have ϱ 2 = 1 , that is, ϱ ( ϱ ( x ) ) = x . Let y S ( ϱ ( x ) , r ) . Since ϱ ( x ) = x , S ( ϱ ( x ) , r ) = S ( x , r ) . Hence, y S ( ϱ ( x ) , r ) if and only if y S ( x , r ) . Suppose that b = ρ ( x , y ) . Let x 0 = x and x r = y . Since ρ ( x , y ) = r , the shortest path exists [ x 0 , x 1 , x 2 , , x r 1 , x r ] of length r connecting x 0 and x r . Since S = S , for any i { 0 , 1 , , r 1 } , x i + 1 + x i S if and only if x i + 1 x i S . Then, a path exists [ x 0 , x 1 , x 2 , , x r 1 , x r ] of length r connecting x 0 and x r . Then, ρ ( x , y ) r . Hence, b r . Let y 0 = x and y b = y . Since b = ρ ( x , y ) , the shortest path exists [ y 0 , y 1 , y 2 , , y b 1 , y b ] of length b connecting y 0 and y b . Since S = S , for any i { 0 , 1 , , b 1 } , y i + 1 + y i S if and only if y i + 1 y i S . Then, a path exists [ y 0 , y 1 , y 2 , , y b 1 , y b ] of length b connecting y 0 and y b . Since y = y b , ρ ( x , y ) b . Hence, r b . In summary, b = r . Since ρ ( x , y ) = b = r = ρ ( x , y ) , y S ( x , r ) if and only if y S ( x , r ) . Therefore, ϱ ( y ) S ( x , r ) . Since ϱ is a mapping, ϱ ( y ) S ( x , r ) if and only if y = ϱ ( ϱ ( y ) ) ϱ ( S ( x , r ) ) . Therefore, ϱ ( S ( x , r ) ) = S ( ϱ ( x ) , r ) . By Lemma 1, ϱ is an isometry of X. Since 0 = 0 , we have ϱ ( 0 ) = 0 . □
If for every x A , ϱ ( x ) = x , then ϱ is called a reflection at 0. It is clear that ϱ 2 = 1 . Denote R = { 1 , ϱ } .
Lemma 2.
Let A be a finitely generated additive abelian group and S be a finite generating set of A with 0 S and S = S . Then, R = { 1 , ϱ } Isom X ( A , S ) .
Proof. 
By Corollary 1, ϱ Isom X ( A , S ) . Since ϱ 2 = 1 , { 1 , ϱ } Isom X ( A , S ) . □
Let a A be fixed. Define t a : A A by t a ( x ) = x + a . The mapping t a is called the translation by a. By this definition, t 0 = 1 . Denote T = { t a : a A } .
Corollary 2.
Let A be a finitely generated additive abelian group and S be a finite generating set of A with 0 S and S = S . Then, T Isom X ( A , S ) .
Proof. 
Let r be a nonnegative real number and y S ( t a ( x ) , r ) . Since t a ( x ) = x + a , S ( t a ( x ) , r ) = S ( x + a , r ) . Hence, y S ( t a ( x ) , r ) if and only if y S ( x + a , r ) . Suppose that b = ρ ( x , y a ) . Let x 0 = x + a and x r = y . Since y S ( x + a , r ) , we have ρ ( x + a , y ) = r . Hence, the shortest path exists [ x 0 , x 1 , x 2 , , x r 1 , x r ] of length r connecting x 0 and x r . Since ( x i + 1 a ) ( x i a ) = x i + 1 x i S , ( x i a ) ( x i + 1 a ) E ( X ) if and only if x i x i + 1 E ( X ) . Then, a path exists [ x 0 a , x 1 a , x 2 a , , x r 1 a , x r a ] of length r connecting x 0 a and x r a . Since x = x 0 a and y = x r , ρ ( x , y a ) r . Hence, b r . Let y 0 = x and y b = y a . Since b = ρ ( x , y a ) , the shortest path exists [ y 0 , y 1 , y 2 , , y b 1 , y b ] of length b connecting y 0 and y b . Since ( x i + 1 + a ) ( x i + a ) = x i + 1 x i S , ( x i + a ) ( x i + 1 + a ) E ( X ) if and only if x i x i + 1 E ( X ) . Then, a path exists [ y 0 + a , y 1 + a , y 2 + a , , y b 1 + a , y b + a ] of length b connecting y 0 + a and y b + a . Then, ρ ( x + a , y ) b . Hence, r b . Therefore, r = b . Hence, y S ( x + a , r ) if and only if y a S ( x , r ) . Since t a is a mapping, y a S ( x , r ) if and only if y = t a ( y a ) t a ( S ( x , r ) ) . Therefore, t a ( S ( x , r ) ) = S ( t a ( x ) , r ) . By Lemma 1, t a Isom X ( A , S ) . □
Lemma 3.
Let A be a finitely generated additive abelian group and S be a finite generating set of A with 0 S and S = S . Then, T Isom X ( A , S ) .
Proof. 
Since the composition of two translations is a translation, the set of all translations is closed under composition. Hence, by Corollary 2, T Isom X ( A , S ) . □
Theorem 2.
Let A be a finitely generated additive abelian group and S be a finite generating set of A with 0 S and S = S . Let T denote the group of all translations of X ( A , S ) and let R = { 1 , ϱ } where ϱ is the reflection at 0. Then, R T Isom X ( A , S ) .
Proof. 
By Lemma 2 and Lemma 3, we have both R and T are subgroups of Isom X ( A , S ) . Let h R T . Then, a A , f R exist and g T such that h = f g and g = t a . If f = 1 , then h = f g = g = g f T R . If f 1 , then f = ϱ . Since g 1 = t a and f = ϱ , ϱ g = ϱ t a and g 1 ϱ = t a ϱ . For every x X ,
ϱ g ( x ) = ϱ t a ( x ) = ϱ ( x + a ) = x a = t a ( x ) = t a ϱ ( x ) = g 1 ϱ ( x ) .
Hence, ϱ g = g 1 ϱ . Since g 1 T , h = f g = g 1 f T R . Hence, R T T R . Similarly, we may showed that T R R T . Hence, we have T R = R T . Therefore, R T Isom X ( A , S ) . □
Lemma 4.
Let A be a finitely generated additive abelian group and f : A A be a bijective mapping with f ( 0 ) = 0 . If for any finite generating set S of A with 0 S and S = S , f Isom X ( A , S ) , then f R .
Proof. 
Let f : A A be a bijective mapping with f ( 0 ) = 0 . Suppose that f 1 and f ϱ . Suppsoe first that there exists x A such that f ( x ) x and f ( x ) x . Let y = 0 . Then, f ( y ) f ( x ) = f ( x ) y x and f ( y ) f ( x ) = f ( x ) x y .
Suppose, therefore, that for any x A , f ( x ) = x or f ( x ) = x . Since f 1 , there y A exists with y 0 such that f ( y ) = y . Since f ϱ , x A exists with x 0 such that f ( x ) = x . Hence, f ( y ) f ( x ) = y x y x and f ( y ) f ( x ) = y x x y . Therefore, x , y A exist such that f ( y ) f ( x ) x + y 0 and f ( y ) f ( x ) y + x 0 .
Since A is a group and f : A A is a mapping, f ( y ) f ( x ) x + y and f ( y ) f ( x ) y + x A . Since A is finitely generated, there is a finite generating set W of A with 0 W and W = W . Hence, a generating set S exists such that S = W \ { f ( y ) f ( x ) , f ( x ) f ( y ) } { y x , x y , f ( y ) f ( x ) x + y , f ( x ) f ( y ) y + x } . Hence, a generating set S exists such that y x S and f ( y ) f ( x ) S . Therefore, ρ ( x , y ) ρ ( f ( x ) , f ( y ) ) and hence f Isom X with f ( 0 ) = 0 . □
Theorem 3.
Let A be a finitely generated additive abelian group and ϱ be the reflection at 0. Suppose that R = { 1 , ϱ } , T = { t a : t a ( x ) = x + a , a A } and G R T . If for any finite generating set S of A with 0 S and S = S , G Isom X ( A , S ) , then G = R T .
Proof. 
Let G be a group with G R T and G R T . Then, g G R T exists. Let h be defined by h ( x ) = g ( x ) g ( 0 ) . Then, h is a mapping with h ( 0 ) = 0 . Since 1 T , we have h R . By Lemma 4, a finite generating set S of A exists with 0 S and S = S such that h Isom X ( A , S ) . Since g ( x ) = h ( x ) + g ( 0 ) , g Isom X ( A , S ) . Therefore, G ¬ Isom X ( A , S ) . □
Theorem 4.
Let A be a finitely generated additive abelian group and ϱ be the reflection at 0. Suppose that R = { 1 , ϱ } , T = { t a : t a ( x ) = x + a , a A } and G R T . D R T if and only if D T or D = R T where T = { h 2 : h T } .
Proof. 
If A = 1 , then T = 1 = R and the conclusion of the theorem is true. Suppose that | A | 2 . Since T is an abelian group, T T . Let D R T , ϱ be the reflection at 0 and t a be the translation by a. Then, R R and T T exists such that D = R T . Hence, for any f R , g T f R and g T , we have f g f g ( f g ) 1 = f g f g g 1 f 1 R T . If R = 1 , then D = T T .
Suppose, therefore, that R = { 1 , ϱ } . If f = ϱ , then f g ϱ g g 1 f 1 D . Suppose that g = t a T and g = t b T , a , b A . If f = 1 , then for any x X ,
f g ϱ g g 1 f 1 ( x ) = g ϱ g g 1 ( x ) = g ϱ g ( x a ) = g ϱ ( x a + b ) = g ( x + a b ) = x + 2 a b = t 2 a b ϱ ( x ) .
Hence, t 2 a b ϱ D . If f = ϱ , then for any x X ,
f g ϱ g g 1 f 1 ( x ) = f g ϱ g g 1 ( x ) = f g ϱ g ( x a ) = f g ϱ ( x a + b ) = f g ( x + a b ) = f ( x + 2 a b ) = x 2 a + b = t 2 a + b ϱ ( x ) .
Hence, t 2 a + b ϱ D . Since ϱ D , we have t 2 a + b D and t 2 a b D . Since t 2 a + b , t 2 a b T , we have t 2 a + b , t 2 a b D T . At the beginning of the proof we have concluded D = R T . By our assumption, R = { 1 , ϱ } . Hence, D = R T = { 1 , ϱ } T = T ϱ T . Therefore, D T = ( T ϱ T ) T = ( T T ) ( ϱ T T ) . Suppose that there is f ϱ T T . Then, f ϱ T and f T . Hence, a , b A exist ( a , b are fixed elements) such that f = t a and f = ϱ t b . Hence, for arbitrary x X , x + a = ( x + b ) . That is, 2 x = ( a + b ) , a contradiction to the assumption that | A | 2 . Hence, ϱ T T = . Since T T , D T = ( T T ) = T T = T . Hence, t 2 a b , t 2 a + b T . Since t b , t b T , we have t 2 a , t 2 a T . Hence, for any h T , h 2 T .
If D T , then for any f R , g T and g D , we have ( f g ) g ( f g ) 1 = f g g g 1 f 1 . Since A is abelian, T is abelian. Hence, f g g g 1 f 1 = f g f 1 . Suppose that g = t a . If f = 1 , then f g f 1 = g . If f = ϱ , then
f g f 1 ( x ) = f g ( x ) = f ( x + a ) = x a = ( g ) 1 ( x ) .
Since g , ( g ) 1 D , we have D R T .
Suppose, conversely, that for T = { h 2 : h T } , D = R T . Then, for any f , f R , g T and g T , we have ( f g ) f g ( f g ) 1 = f g f g g 1 f 1 . Suppose that f = 1 . Then, f g f g g 1 f 1 = f g g g 1 f 1 . Since T is abelian, f g g g 1 f 1 = f g f 1 . Suppose that g = t a . If f = 1 , then f g f 1 = g . If f = f , then
f g f 1 ( x ) = f g ( x ) = f ( x + a ) = x a = ( g ) 1 ( x ) .
Since both g , ( g ) 1 D , we have D = R T R T . Suppose that f = ϱ , g = t a T and g = t b T , a , b A .
If f = 1 , then
f g f g g 1 f 1 ( x ) = g f g g 1 ( x ) = g f g ( x a ) = g f ( x a + b ) = g ( x + a b ) = x + 2 a b = ϱ t 2 a + b ( x ) .
If f = ϱ , then
f g f g g 1 f 1 ( x ) = f g f g g 1 ( x ) = f g f g ( x a ) = f g f ( x a + b ) = f g ( x + a b ) = f ( x + 2 a b ) = x 2 a + b = ϱ t 2 a b ( x ) .
Since T = { h 2 : h T } , t 2 a T . Since t b T , we have t 2 a b , t 2 a + b T . Hence, ϱ t 2 a + b , ϱ t 2 a b R T = D . Therefore, D R T . □

3. Vector Groups

In this section, we consider the vector groups over Z with finite generating set S = { u Z n : | u | = 1 } , that is, the set of all unit vectors.
The following Lemma is straightforward from the definition of X ( Z n , S ) .
Lemma 5.
Let p = ( p 1 , p 2 , , p n ) , q = ( q 1 , q 2 , , q n ) X ( Z n , S ) . Then, ρ ( p , q ) = i = 1 n | q i p i | .
Let P, Q be nonempty subsets of X with finite or countably infinite cardinality. Thus, we may write P = { v 1 , v 2 , , v n , } . If for every x , y Q , x y implies ρ ( v i , x ) ρ ( v i , y ) for at least one index i; then, P is said to resolveQ and is called a resolving set or briefly a resolver for Q.
Lemma 6.
Let P , Q X and f , g Isom X . Suppose that P resolves Q, f ( P ) = P = g ( P ) and f ( Q ) = Q = g ( Q ) . If f | P = g | P , then f | Q = g | Q .
Proof. 
Suppose that there exists x Q such that f ( x ) g ( x ) . Since P resolves Q, there exists v P such that ρ ( f ( v ) , f ( x ) ) ρ ( f ( v ) , g ( x ) ) . Since f | P = g | P , ρ ( f ( v ) , f ( x ) ) ρ ( g ( v ) , g ( x ) ) . Since f , g Isom X , ρ ( v , x ) = ρ ( f ( v ) , f ( x ) ) ρ ( g ( v ) , g ( x ) ) = ρ ( v , x ) . This is a contradiction. Therefore, f | Q = g | Q . □
Lemma 7.
Let X = X ( Z n , S ) and r be a positive integer. Then, S ( 0 , r ) resolves S ( 0 , r + 1 ) .
Proof. 
Let r be a positive integer, p = ( p 1 , p 2 , , p n ) and q = ( q 1 , q 2 , , q n ) be two different points in S ( 0 , r + 1 ) . Then, | p 1 | + | p 2 | + + | p n | = | q 1 | + | q 2 | + + | q n | . Suppose that i { 1 , 2 , , n } exists such that | p i | < | q i | . Let
x = p 1 , p 2 , , p i 1 , p i ( | p i | 1 ) | p i | , p i + 1 , p i + 2 , , p n .
Then, x S ( 0 , r ) . Since | p i | < | q i | and p i ( | p i | 1 ) | p i | < | p i | , ρ ( x , p ) = 1 < ρ ( x , q ) . Suppose, therefore, that for any i { 1 , 2 , , n } , | p i | = | q i | . Then, i { 1 , 2 , , n } exists such that p i = q i 0 . Let j { 1 , 2 , , n } with j i and
x = p 1 , p 2 , , p j 1 , p j ( | p j | 1 ) | p j | , p j + 1 , p j + 2 , , p n .
Then, x S ( 0 , r ) . Since p j ( | p j | 1 ) | p j | p j = 1 and | p i q i | > 1 , ρ ( x , p ) = 1 < ρ ( x , q ) . Therefore, S ( 0 , r ) resolves S ( 0 , r + 1 ) . □
Theorem 5.
Let X = X ( Z n , S ) and f Isom X ( Z n , S ) . Then, f is a linear mapping.
Proof. 
Consider the standard orthonormal basis e 1 , e 2 , , e n . For i = 1 , 2 , , n , let s i = e i and s n + i = e i . By the definition of S, we have S = { s 1 , s 2 , , s 2 n } . Since f Isom X ( Z n , S ) , f ( S ) = S . Let x = ( x 1 , x 2 , , x n ) Z n . Then, x = x 1 s 1 + x 2 s 2 + + x n s n . Hence, f ( x ) = f ( x 1 s 1 + x 2 s 2 + + x n s n ) .
Let g ( x ) = x 1 f ( s 1 ) + x 2 f ( s 2 ) + + x n f ( s n ) . Since f ( S ) = S , for x , y Z n , we have ρ ( g ( x ) , g ( y ) ) = | x 1 y 1 | + | x 2 y 2 | + + | x n y n | = ρ ( x , y ) . Hence, g Isom X ( Z n , S ) . Let u , v Z n and l , m Z . Then,
g ( l u + m v ) = g ( l u 1 + m v 1 , l u 2 + m v 2 , , l u n + m v n ) = ( l u 1 + m v 1 ) f ( s 1 ) + ( l u 2 + m v 2 ) f ( s 2 ) + + ( l u n + m v n ) f ( s n ) = l ( u 1 f ( s 1 ) + + u n f ( s n ) ) + m ( v 1 f ( s 1 ) + + v n f ( s n ) ) = l g ( u ) + m g ( v ) .
Hence g is a linear mapping.
We now show that f ( s i ) = f ( s i ) . Suppose that f ( s i ) f ( s i ) . Then, j , k { 1 , 2 , , 2 n } exist with j k n , j k and j k + n such that s j = f ( s i ) and s k = f ( s i ) . Since s j s k , we have ( s j + s k ) S ( 0 , 2 ) and ( f ( s i ) + f ( s i ) ) S ( 0 , 2 ) . Hence, ρ ( f ( s i ) + f ( s i ) , f ( s i ) ) = | f ( s i ) | = | s k | = 1 and ρ ( f ( s i ) + f ( s i ) , f ( s i ) ) = | f ( s i ) | = | s j | = 1 . Since f Isom X ( Z n , S ) , we have f 1 ( f ( s i ) + f ( s i ) ) S ( 0 , 2 ) , ρ ( f 1 ( f ( s i ) + f ( s i ) ) , s i ) = 1 and ρ ( f 1 ( f ( s i ) + f ( s i ) ) , s i ) = 1 . Let x = f 1 ( f ( s i ) + f ( s i ) ) . Then, we have x S ( 0 , 2 ) , ρ ( x , s i ) = 1 and ρ ( x , s i ) = 1 . We show that there is no such x. Since x S ( 0 , 2 ) and ρ ( x , s i ) = 1 , l { 1 , 2 , , 2 n } exists with l i such that x = s i + s l or x = 2 s i . Hence, ρ ( x , s i ) > 1 . This contradicts ρ ( x , s i ) = 1 . Hence, there is no such x. Therefore, we have f ( s i ) = f ( s i ) .
We now show that f = g . If r = 1 , then S ( 0 , r ) = S ( 0 , 1 ) = S . Hence, for any x S , i { 1 , 2 , , n } exists such that x = s i or x = s i . Since f ( s i ) = f ( s i ) , we have f ( x ) = f ( s i ) = 1 f ( s i ) = g ( x ) or f ( x ) = f ( s i ) = f ( s i ) = g ( x ) .
Suppose that r 1 and any x S ( 0 , r ) , f ( x ) = g ( x ) . By Lemma 7, S ( 0 , r ) resolves S ( 0 , r + 1 ) . Since f , g Isom X ( Z n , S ) , f ( S ( 0 , r ) ) = g ( S ( 0 , r ) ) = S ( 0 , r ) and f ( S ( 0 , r + 1 ) ) = g ( S ( 0 , r + 1 ) ) = S ( 0 , r + 1 ) . By Lemma 6, for any y S ( 0 , r + 1 ) , f ( y ) = g ( y ) . Hence, f = g and f is a linear mapping. □
As in [8] (p. 39), the orthogonal group in dimension n over Z is denoted O n ( Z ) .
Lemma 8.
M O n ( Z ) if and only if each column and row of M has exactly one non-zero entry, that is 1 or 1 .
Proof. 
For any M O n ( Z ) , we have M M T = I = M T M . Let R be a row of M and C be a column of M. Since every entry of the main diagonal of I is 1, we have R R T = 1 and C T C = 1 . Since entries of R and C are integers, R has exactly one non-zero element, which is 1 or 1 . The same is true for C.
Suppose that every row and every column has exactly one non-zero entry that is 1 or 1 . Then, for each row R and each column C, R R T = 1 = C T C . If R is a row of M and R R , then R R T = 0 = R R T . The same is true for the columns of M. Hence, M M T = I = M T M . □
We now determine the group of isometries of metric space X ( Z n , S ) . We first consider the isometries that fixes 0.
Lemma 9.
Let M be an n × n matrix over R . Then, M O n ( Z ) if and only if f = M x is an isometry of X ( Z n , S ) that fixes 0.
Proof. 
Let M = ( m i j ) n × n . Suppose that f ( x ) = M x is an isometry of X ( Z n , S ) that fixes 0. Consider the standard orthonormal basis e 1 , e 2 , , e n . Let s i = e i and s n + i = e i , i { 1 , 2 , , n } . By the definition of S, we have S = { s 1 , s 2 , , s 2 n } . Then, for any s i S , f ( s i ) S . Hence M s i S . Therefore, for any j { 1 , 2 , , n } , we have | m 1 j | + | m 2 j | + + | m n j | = 1 . Hence, each column of M has exactly one non-zero entry that is equal to 1 or 1 .
We now show that each row of M has exactly one non-zero entry that is 1 or 1 . Since f is a mapping, f ( Z n ) Z n . Suppose that i , j { 1 , 2 , , n } exist such that m i j Z . Then, f ( e j ) = M e j Z . Hence, if f is a mapping and f ( x ) = M x , then every entry of M is an integer. Since f is an isometry of X ( Z n , S ) , f ( S ) = S . Suppose that i , j { 1 , 2 , , n } exist such that m i j { 1 , 0 , 1 } . Then, the absolute value of the i-th entry of M e j is at least 2. By Lemma 5, ρ ( 0 , f ( e j ) ) = ρ ( 0 , M e j ) is equal to the sum of the absolute values of the entries of M e j . Hence, ρ ( 0 , f ( e j ) ) 2 . This contradicts f ( S ) = S . Hence, for every i , j { 1 , 2 , , n } , m i j { 1 , 0 , 1 } . Suppose that M has a zero row. Then M is singular. This contradicts the assumption that f is bijective. Suppose that a row of M exists with at least two nonzero entries. Let m i j and m i k be nonzero. Then, | m i j | = | m i k | = 1 . If m i j = m i k , then M s j = M s k . This contradicts the assumption that f is a bijective mapping. If m i j = m i k , then M s j = M s n + k . This contradicts the assumption that f is a bijective mapping. Therefore, each row of M has exactly one non-zero element that is 1 or 1 . By Lemma 8, M O n ( Z ) .
Suppose, conversely, that M O n ( Z ) . Let
x = ( x 1 , x 2 , , x n ) , y = ( y 1 , y 2 , , y n ) Z n .
By Lemma 5, ρ ( x , y ) = i = 1 n | x i y i | . By Lemma 5,
ρ ( M x , M y ) = i = 1 n j = 1 n m i j x j j = 1 n m i j y j = i = 1 n j = 1 n ( m i j x j m i j y j ) = i = 1 n j = 1 n m i j ( x j y j ) .
Let i , k { 1 , 2 , , n } be fixed. Suppose that m i k 0 . By Lemma 8, each row of M has exactly one non-zero entry which is 1 or 1. Hence,
j = 1 n m i j ( x j y j ) = x k y k .
and hence
i = 1 n j = 1 n m i j ( x j y j ) = k = 1 n x k y k = ρ ( x , y ) .
Hence, f ( x ) = M x defines an isometry f. □
Since the group { f : f = M x , M O n ( Z ) } isomorphic O n ( Z ) , we denote O n ( Z ) = { f : f = M x , M O n ( Z ) } . Since the group of all translations of X ( Z n , S ) is isomorphic to Z n , we may write Z n = { f : f = x + a , a Z n } .
Theorem 6.
Isom X ( Z n , S ) = O n ( Z ) Z n .
Proof. 
By Theorem 5 and Lemma 9, the group of isometries of X ( Z n , S ) that fixes 0 is O n ( Z ) . Hence, O n ( Z ) Isom X ( Z n , S ) . By Lemma 3, all translations of X ( Z n , S ) form a subgroup of Isom X ( Z n , S ) . That is, Z n Isom X ( Z n , S ) . Let f O n ( Z ) and g Z n . Then, by Lemma 9, M O n ( Z ) exists such that f ( x ) = M x . We also have, a Z n such that g ( x ) = x + a . Let h ( x ) = x + M a . Then, h Z n . Hence, h f ( x ) = h ( M x ) = M x + M a = M ( x + a ) = f ( x + a ) = f g ( x ) . Hence, Z n O n ( Z ) O n ( Z ) Z n . Let p ( x ) = x + M 1 a . Then, p Z n . Hence, f p ( x ) = f ( x + M 1 a ) = M ( x + M 1 a ) = M x + a = g ( M x ) = g f ( x ) . Hence, O n ( Z ) Z n Z n O n ( Z ) . Therefore, O n ( Z ) Z n = Z n O n ( Z ) and O n ( Z ) Z n Isom X ( Z n , S ) .
Let g Isom X ( Z n , S ) . Let t ( x ) = g ( x ) g ( 0 ) . Then, t is an isometry of X ( Z n , S ) with t ( 0 ) = 0 . By Theorem 5 and Lemma 9, t O n ( Z ) . Since g ( x ) = t ( x ) + g ( 0 ) , g O n ( Z ) Z n . Therefore, Isom X ( Z n , S ) = O n ( Z ) Z n . □
Let S = { u Z 2 : | u | = 1 } = { ( 0 , 1 ) , ( 0 , 1 ) , ( 1 , 0 ) , ( 1 , 0 ) } . Then, the group of isometries of metric spaces arising from Gaussian integers Isom X ( Z 2 , S ) is O 2 ( Z ) Z 2 , where
O 2 ( Z ) = 1 0 0 1 , 1 0 0 1 , 0 1 1 0 , 0 1 1 0 ,
1 0 0 1 , 1 0 0 1 , 0 1 1 0 , 0 1 1 0 .

4. Conclusions

For any finitely generated additive abelian group A and finite generating set S with 0 S and S = S , the maximum subgroup of Isom X ( A , S ) is R T , where R = { 1 , ϱ } and T = { t a : t a ( x ) = x + a , a A } . D R T if and only if D T or D = R T where T = { h 2 : h T } . For the vector groups over integers with finite generating set S = { u Z n : | u | = 1 } , Isom X ( Z n , S ) = O n ( Z ) Z n .

Author Contributions

Conceptualization, S.B. and Y.L.; Methodology, S.B. and Y.L.; Software, S.B. and Y.L.; Validation, S.B. and Y.L.; Investigation, S.B. and Y.L.; Resources, S.B. and Y.L.; Writing—original draft preparation, S.B. and Y.L.; Writing—review and editing, S.B. and Y.L.; Supervision, S.B.; Project administration, S.B. and Y.L.; Funding acquisition, Y.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Ph.D. research startup foundation of Bohai University: 0522bs006 and the research foundation of Bohai University: 0522xn031.

Data Availability Statement

Not applicable.

Acknowledgments

The work of the paper was part of this author’s doctoral dissertation, conducted at the University of Kwazulu-Natal under the supervision of Sheng Bau.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Bau, S.; Beardon, A. The metric dimension of metric spaces. Comput. Methods Funct. Theory 2013, 13, 295–305. [Google Scholar] [CrossRef]
  2. Heydarpour, M.; Maghsoudi, S. The metric dimension of geometric spaces. Topol. Appl. 2014, 178, 230–235. [Google Scholar] [CrossRef]
  3. Heydarpour, M.; Maghsoudi, S. The metric dimension of metric manifolds. Bull. Aust. Math. Soc. 2015, 91, 508–513. [Google Scholar] [CrossRef]
  4. Godsil, C.; Royle, G.F. Algebraic Graph Theory; Springer: New York, NY, USA, 2001. [Google Scholar]
  5. Blumenthal, L.M. Theory and Applications of Distance Geometry; Clarendon Press: Oxford, UK, 1953. [Google Scholar]
  6. Andrica, D.; Wiesler, H. On the isometry groups of a metric space. Semin. Didact. Mat. 1989, 5, 1–4. [Google Scholar]
  7. Andrica, D.; Bulgarean, V. Some Remarks on the Group of Isometries of a Metric Space. In Nonlinear Analysis: Stability, Approximation, and Inequalities; Springer: New York, NY, USA, 2012. [Google Scholar]
  8. Grove, L.C. Classical Groups and Geometric Algebra; Graduate Studies in Mathematics; American Mathematical Society: Providence, RI, USA, 2002; Volume 39. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Bau, S.; Lei, Y. The Groups of Isometries of Metric Spaces over Vector Groups. Mathematics 2022, 10, 4453. https://doi.org/10.3390/math10234453

AMA Style

Bau S, Lei Y. The Groups of Isometries of Metric Spaces over Vector Groups. Mathematics. 2022; 10(23):4453. https://doi.org/10.3390/math10234453

Chicago/Turabian Style

Bau, Sheng, and Yiming Lei. 2022. "The Groups of Isometries of Metric Spaces over Vector Groups" Mathematics 10, no. 23: 4453. https://doi.org/10.3390/math10234453

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop