Next Article in Journal
Statistically Convergent Sequences in Intuitionistic Fuzzy Metric Spaces
Next Article in Special Issue
Macdonald Formula, Ricci Curvature, and Concentration Locus for Classical Compact Lie Groups
Previous Article in Journal
Control of String Vibrations by Displacement of One End with the Other End Fixed, Given the Deflection Form at an Intermediate Moment of Time
Previous Article in Special Issue
Products of K-Analytic Sets in Locally Compact Groups and Kuczma–Ger Classes
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Homomorphic Encoders of Profinite Abelian Groups II

by
María V. Ferrer
and
Salvador Hernández
*,†
Departament de Matemàtiques, Campus de Riu Sec, Universitat Jaume I, 12071 Castelló, Spain
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Axioms 2022, 11(4), 158; https://doi.org/10.3390/axioms11040158
Submission received: 15 February 2022 / Revised: 22 March 2022 / Accepted: 23 March 2022 / Published: 29 March 2022
(This article belongs to the Special Issue Topological Groups and Dynamics)

Abstract

:
Let { G i : i N } be a family of finite Abelian groups. We say that a subgroup G i N G i is order controllable if for every i N , there is n i N such that for each c G , there exists c 1 G satisfying c 1 | [ 1 , i ] = c | [ 1 , i ] , s u p p ( c 1 ) [ 1 , n i ] , and order ( c 1 ) divides order ( c | [ 1 , n i ] ) . In this paper, we investigate the structure of order-controllable group codes. It is proved that if G is an order controllable, shift invariant, group code over a finite abelian group H, then G possesses a finite canonical generating set. Furthermore, our construction also yields that G is algebraically conjugate to a full group shift.
MSC:
2010 Mathematics Subject Classification; Primary 20K25; Secondary 22C05; 20K45; 54H11; 68P30; 37B10

1. Introduction

This article focuses on the research about (topological) groups that can be embedded into a product of finite groups, started in [1,2,3] (for a nice elementary example, consider the Rubik’s cube group; every rotation provides a transformation on angles and edges and therefore, the Rubik’s cube group can be embedded in a direct product (see http://sporadic.stanford.edu/bump/match/rubik.html, accessed on 1 March 2022)). In particular, we deal here with the algebraic structure of abelian group codes.
In coding theory, a code refers to a set of sequences (the codewords), with good error-correcting properties, used to transmit information over nosy channels. In communication technology, most codes are linear (that is, vector spaces on a finite field) and there are two main classes of codes: block codes, in which the codewords are finite sequences all of the same length, and convolutional codes, in which the codewords can be infinite sequences. However, some very powerful codes that were first thought to be nonlinear can be described as additive subgroups of A n , where A is a cyclic abelian group (see [4,5]). This fact motivated the study of a more general class of codes. According to Forney and Trott [5,6], a group code G is a subgroup of a product
X = i I G i ,
where each G i is a group and the composition law is the component-wise group operation. The subgroup
G f : = G i Z G i
is called the finite subcode of G. It may happen that all elements of G have finite support, which means that G coincides with G f .
If all code symbols are drawn from a common group H, then G H I and G will be called a group code over H defined on I.
A key point in the study of group codes is the finding of appropriate encoders.
Definition 1.
Given a group code G, a homomorphic encoder is a continuous homomorphism Φ :   i I H i G that sends a full direct product of (topological) groups onto G. Of special relevance are the so-called noncatastrophic encoders, that is, homomorphic continuous encoders α that are one to one and such that Φ ( i I H i ) = G f (see [5,6,7] for some references).
From here on, we deal with a group shift (or group code) G over a finite abelian group H. That is, G is a closed, shift-invariant subgroup of the full shift group X = H Z . Therefore, if σ :   X X denotes the backward shift operator
σ [ x ] ( i ) : = x ( i + 1 ) , x X , i Z ,
we have that σ ( G ) = G . For simplicity’s sake, we denote the forward shift operator by ρ , that is ρ [ x ] ( i ) : = x ( i 1 ) , x X , i Z . A group shift G over a finite abelian group H is irreducible or transitive if there is x G such that the partial forward orbit { σ n ( x ) : n n 0 } is dense in G for all n 0 Z . Given two group codes G and G ¯ , if there is a homeomorphism (resp. topological group isomorphism) Φ : G G ¯ so that σ Φ = Φ σ then we say that G and G ¯ are topologically conjugate (resp. algebraically and topologically conjugate) (see [8,9,10]).
In [11], Forney proved that every (linear) convolutional code is conjugate to a full shift via a linear conjugacy. Subsequently, it was proved by several authors (see [5,8,12,13]) that every irreducible group shift is conjugate to a full shift. In fact, one might expect that the conjugacy was also a group homomorphism (algebraic conjugacy). However, for group shifts, this turns out to be false in general (cf. [8,12]). In this sense, Fagnani [14] obtained the necessary and sufficient conditions for a group shift to be algebraically conjugate to the full shift over a finite group. His approach is based on Pontryagin duality, which lets one reduce the question to its discrete dual group that turns out to be a finitely generated module of Laurent polynomials.
We next collect some definitions and basic facts introduced in [2].
Definition 2.
Let G be a group shift over a finite abelian group H. We have the following notions:
(1)
G is weakly controllable if G H ( Z ) is dense in G; here H ( Z ) denotes the subgroup of H Z consisting of the elements with finite support.
(2)
G is controllable (equivalently, irreducible or transitive— it is easily verified that every controllable group code G is irreducible—see [8]) if there is a positive integer n c such that for each g G , there exists g 1 G such that g 1 | ( , 0 ] = g | ( , 0 ] and g 1 | ] n c , + ) = 0 (we assume that n c is the least integer satisfying this property). Remark that this property implies the existence of g 2 : = g g 1 G such that g = g 1 + g 2 , s u p p ( g 1 ) ( , n c ] and s u p p ( g 2 ) [ 1 , + [ .
(3)
G is order controllable if there is a positive integer n o such that for each g G , there exists g 1 G such that g 1 | ( , 0 ] = g | ( , 0 ] , s u p p ( g 1 ) ( , n o ] , and order ( g 1 | [ 1 , n 0 ] ) divides order ( g | [ 1 , n 0 ] ) (we assume that n o is the least natural number satisfying this property). Again, this implies the existence of g 2 G such that g = g 1 + g 2 , s u p p ( g 2 ) [ 1 , + [ , and order ( g 2 ) divides order ( g ) . Here, the order of g is taken in the usual sense, as an element of the group G.
We now state our main result.
Theorem 1.
Let G be an order controllable group shift over a finite abelian group H. Then there is a noncatastrophic isomorphic encoder for G. As a consequence, G is algebraically and topologically conjugate to a full group shift.

2. Group Shifts

In this section, we apply the result accomplished in Theorem 3.2 in [2] in order to prove that the order-controllable group shifts over a finite abelian group possess canonical generating sets. Furthermore, our construction also yields that they are algebraically conjugate to a full group shift.
In the sequel, H ( Z ) denotes the subgroup of H Z consisting of all elements with finite support.
Theorem 2.
Let G be a weakly controllable, group shift over a finite abelian p-group H. If G [ p ] is weakly controllable, then there is a finite generating subset B 0 : = { x j : 1 j m } G f [ 0 , ) ] [ p ] , where x j = p h j y j , y j G f , and each x j is selected with the maximal possible height h j in G f with h j h j + 1 , 1 j < m , such that the following assertions hold true:
  • There is a canonically defined σ-invariant, onto, group homomorphism
    Φ :   1 j m Z ( p h j + 1 ) Z G .
  • ((G is weakly rectangular and)) Φ is a noncatastrophic, isomorphic encoder for G if there is a finite block [ 0 , N ] N such that the set
    { σ n [ x j ] | [ 0 , N ] 0 : n Z , 1 j m }
    is linearly independent.
Proof. 
( 1 ) Using that G and G [ p ] are weakly controllable, we can proceed as in Theorem 3.2 in [2] in order to define a subset B 0 : = { x 1 , , x m } G f [ p ] [ 0 , ) such that π [ 0 ] ( B 0 ) forms a basis of π [ 0 ] ( G [ 0 , ) [ p ] ) and for each x j B 0 , there is a nonnegative integer h j and an element y j G f such that x j = p h j y j , where each x j has the maximal possible height h j in G f and h 1 h 2 h m . Now define
φ 0 :   Z ( p ) m G [ p ]
by
φ 0 [ ( λ 1 , , λ m ) ] = λ 1 x 1 + + λ m x m
and, for each n Z , n > 0 , set B n : = ρ n ( B 0 ) G f [ p ] [ n , ) and define
φ n :   Z ( p ) m G [ p ]
by
φ n [ ( λ 1 , , λ m ) ] = λ 1 ρ n ( x 1 ) + + λ m ρ n ( x m ) .
Now, we can define
n φ n :   n 0 ( Z ( p ) m ) n G f [ p ] [ 0 , )
by
n φ n [ n 0 ( λ 1 n , λ 2 n , , λ m n ) ] : = n 0 φ n [ ( λ 1 n , λ 2 n , , λ m n ) ] ,
where ( Z ( p ) m ) n = Z ( p ) m for all n 0 .
Remark that all the maps set above are well-defined group homomorphisms since each of these maps involves finite sums in its definition. Furthermore, since the range of φ n is contained in G f [ p ] [ n , ) for all n 0 , it follows that the map n φ n is continuous when its domain (and its range) is equipped with the product topology. Therefore, there is a canonical extension of n φ n to a continuous group homomorphism
Φ 0 : n 0 ( Z ( p ) m ) n G [ p ] [ 0 , ) .
Now, repeating the same arguments as in Theorem 3.2 in [2], it follows that
G f [ p ] [ 0 , ) Φ 0 ( n 0 ( Z ( p ) m ) n ) ,
which implies that Φ 0 is a continuous group homomorphism because G f [ p ] [ 0 , ) is dense in G [ p ] [ 0 , ) . Furthermore, using the σ -invariance of G, we can extend Φ 0 canonically to continuous onto group homomorphism
Φ N : n N ( Z ( p ) m ) n G [ p ] [ N , )
by
Φ N [ n N ( λ 1 n , λ 2 n , , λ m n ) ] : = σ N [ Φ 0 [ ρ N [ n N ( λ 1 n , λ 2 n , , λ m n ) ] ] ] ,
for every N > 0 . Now, if we identify n N ( Z ( p ) m ) n with the subgroup ( n Z ( Z ( p ) m ) n ) [ N , + ) , remark that Φ ( N + 1 ) restricted to n N ( Z ( p ) m ) n is equal to Φ N . Therefore, we have defined a map
Φ :   N > 0 n N ( Z ( p ) m ) n G [ p ] .
Again, because N > 0 n N ( Z ( p ) m ) n is dense in ( Z ( p ) m ) Z , it follows that we can extend Φ to a continuous group homomorphism
Φ : ( Z ( p ) m ) Z G [ p ] .
Now, taking into account that lim n ± σ n ( y j ) = 0 for all 1 j m , we proceed as in Theorem 3.2 in [2] in order to lift Φ to a continuous group homomorphism
Φ :   1 j m Z ( p h j + 1 ) Z G .
This completes the proof of (1).
(2) First, we remark that repeating the proof accomplished in Theorem 3.2 in [2], it follows that the sets { σ n [ x j ] : n Z , 1 j m } and { σ n [ y j ] : n Z , 1 j m } are both (linearly) independent.
Furthermore, since all elements x j ( 1 j m ) have finite support, it follows that the set { σ n [ x j ] | [ 0 , N ] 0 : n Z , 1 j m } is finite. Thus, using the σ -invariance of G, we proceed as in Theorem 3.2 in [2] to obtain that Φ is one to one.
In order to prove that Φ is noncatastrophic, that is Φ [ ( 1 j m Z ( p h j + 1 ) ( Z ) ] G f , first notice that Φ 1 is continuous, being that the inverse map is a continuous one-to-one group homomorphism. Now, reasoning by contradiction, suppose there is w G f such that ( λ n ) = Φ 1 ( w ) is an infinite sequence, let us say, without loss of generality, an infinite sequence on the right side. Then, we have that the sequence ( σ n ( w ) ) n > 0 converges to 0 in G. However, since ( λ n ) is infinite on the right side, it follows that the sequence ( Φ 1 ( σ n ( w ) ) ) n > 0 = ( σ n [ ( λ n ) ] ) n > 0 does not converge to 0 in ( 1 j m Z ( p ( h j + 1 ) ) ) Z . This contradiction completes the proof. □
Definition 3.
In the sequel, a set { y 1 , , y m } (resp. { x 1 , , x m } ) that satisfies the properties established in Theorem 2 is called topological generating set of G (resp. G [ p ] ).
Next, we are going to use the preceding results in order to characterize the existence of noncatastrophic, isomorphic encoders. As a consequence, we also characterize when a group shift is algebraically conjugate to a full group shift. First we need the following notions.
Definition 4.
A group shift G X = H Z is a shift of finite type (equivalently, is an observable group code) if it is defined by forbidding the appearance a finite list of (finite) blocks. As a consequence, there is N N such that if x 1 , x 2 belong to G and they coincide on an N-block [ k , , k + N ] , then there is x G such that x | ( , k + N ] = x 1 | ( , k + N ] and x | [ k , ) = x 2 | [ k , ) . It is known that if G is an irreducible group shift over a finite group H, then G is also a group shift of finite type (see Prop. 4 in [8]). Moreover, since every order controllable group shift G is irreducible, it follows that order controllable group shifts are of a finite type.
Given an element x G f with supp ( x ) = { i Z : x ( i ) 0 } , the first index (resp. last index) i supp ( x ) is denoted by i f ( x ) (resp. i l ( x ) ). The length of supp ( x ) is defined as | supp ( x ) | : = i l ( x ) i f ( x ) + 1 .
Proposition 1.
Let G be a weakly controllable, group shift of finite type over a finite abelian p-group H. If e x p ( H ) = p , then there is a noncatastrophic isomorphic encoder for G. As a consequence, G is algebraically and topologically conjugate to a full group shift.
Proof. 
First, remark that G = G [ p ] in this case. By Theorem 2, there is a topological generating subset B 0 : = { x j : 1 j m } G f [ 0 , ] [ p ] = G f [ 0 , ] such that π [ 0 ] ( B 0 ) forms a basis of π [ 0 ] ( G [ 0 , ) ) and there is a canonically defined σ -invariant, onto, group homomorphism
Φ :   ( Z ( p ) m ) Z G .
Furthermore, we select each element x j with minimal support in G f [ 0 , ) and such that | supp ( x 1 ) | | supp ( x m ) | .
By Theorem 2 (2), it suffices to verify that there is a finite block [ 0 , N ] N such that the set { σ n [ x j ] | [ 0 , N ] 0 : n Z , 1 j m } is linearly independent. Indeed, let N be a natural number such that supp ( x j ) [ 0 , N ] for all 1 j m and satisfying the condition of being a group shift of finite type for G. That is, if ω 1 , ω 2 belong to G and they coincide on any N-block [ k , , k + N ] , then there is w G such that w | ( , k + N ] = w 1 | ( , k + N ] and w | [ k , ) = w 2 | [ k , ) .
Reasoning by contradiction, let us suppose that there is a linear combination
λ n j σ n ( x j ) | [ 0 , N ] = 0 .
Since the set { σ n [ x j ] : n Z , 1 j m } is linearly independent, there must be an element u = σ n 1 [ x j 1 ] (for some n 1 and j 1 ) such that
supp ( u ) ( , 0 ) .
As a consequence, there exist { α n j } Z ( p ) such that
u | [ 0 , N ] = ( n n 1 , j j 1 ) α n j σ n ( x j ) | [ 0 , N ] .
We select u such that i f ( u ) is minimal among the elements satisfying this property. Set
v : = ( n n 1 , j j 1 ) α n j σ n ( x j ) .
We have that
( u v ) | [ 0 , N ] = 0 .
Since G is of finite type for N-blocks, there exists w G such that
w | ( , N ] = ( u v ) | ( , N ] and w | [ 0 , ) = 0 .
We have that i f ( u ) i f ( w ) and i l ( w ) < i l ( u ) . Therefore, we have found an element w G f with | supp ( w ) | < | supp ( u ) | . Therefore, we can replace x j 1 by x ˜ j 1 : = σ n 1 ( w ) and | supp ( x ˜ j 1 ) | < | supp ( x j 1 ) | . This is a contradiction with our previous selection of the (ordered) set { x j : 1 j m } , which completes the proof. □
Lemma 1.
Let G be an order-controllable group shift over a finite abelian p-group H. Then G [ p ] and p r G are order-controllable group shifts for all r with p r < e x p ( H ) . As a consequence, it holds that ( p r G ) f = p r G f for all r with p r < e x p ( H ) .
Proof. 
It is obvious that G [ p ] is order controllable. Regarding the group p r G , take an arbitrary element x = p r y p r G . By the order controllability of G, there is z G and n 0 N such that y | ( , 0 ] = z | ( , 0 ] , supp ( z ) ( , n 0 ] and order ( z | [ 1 , n 0 ] ) divides order ( y | [ 1 , n 0 ] ) . Then p r z p r G , x | ( , 0 ] = p r z | ( , 0 ] , supp ( p r z ) ( , n 0 ] and order ( p r z | [ 1 , n 0 ] ) divides order ( x | [ 1 , n 0 ] ) .
Finally, it is clear that p r G f ( p r G ) f . Next, we check the reverse implication.
Let y G such that x = p r y ( p r G ) f . Then, there are two integers m , M such that x G [ m , M ] . Assume that M 0 without loss of generality. By order controllability, there is z G such that σ M ( y ) | ( , 0 ] = z | ( , 0 ] , supp ( z ) ( , n 0 ] and order ( z | [ 1 , n 0 ] ) divides order ( σ M ( y ) | [ 1 , n 0 ] ) . Hence, if v = σ M ( z ) , we have y | ( , M ] = v | ( , M ] , supp ( v ) ( , M + n 0 ] and order ( v | [ M + 1 , M + n 0 ] ) divides order ( y | [ M + 1 , M + n 0 ] ) . Therefore, x = p r v with v G ( , M + n o ] .
If m n o > 0 , by order controllability, there is u G such that v | ( , 0 ] = u | ( , 0 ] , supp ( u ) ( , n 0 ] ( , m 1 ] and order ( u | [ 1 , n 0 ] ) divides order ( v | [ 1 , n 0 ] ) . Set w = v u . We have that w G [ 1 , M + n o ] and x = p r w , which yields x p r G f .
If m n o 0 , set N = m n o 1 . By order controllability, there is u 1 G such that σ N ( v ) | ( , 0 ] = u 1 | ( , 0 ] , supp ( u 1 ) ( , n 0 ] and order ( u 1 | [ 1 , n 0 ] ) divides order ( σ N ( v ) | [ 1 , n 0 ] ) . Hence, if u 2 = σ N ( u 1 ) , we have v | ( , N ] = u 2 | ( , N ] , supp ( u 2 ) ( , N + n 0 ] ( , m 1 ] and order ( u 2 | [ N + 1 , N + n 0 ] ) divides order ( v | [ N + 1 , N + n 0 ] ) . Set w = v u 2 . We have that w G [ N + 1 , M + n o ] and x = p r w , which again yields x p r G f . This completes the proof. □
Let G be a group shift over a finite abelian p-group H and let G / p G denote the quotient group defined by the map π :   G G / p G . We define the subgroup
( G / p G ) f : = { π ( u ) : u G and u ( n ) p H for all but finitely many n Z . }
Lemma 2.
Let G be an order-controllable group shift over a finite abelian p-group H and let { x 1 , , x m } ( p G f ) [ 0 , ) be a topological generating set of p G , where x i = p y i , y i G f , 1 i m . If u G f then there exist v G f [ p ] and w { σ n ( y j ) : n Z , 1 j m } such that u = v + w .
Proof. 
Since { x 1 , , x m } is a topological generating set of p G , we have
p u = n Z i = 1 m λ i n σ n ( x i ) = n Z i = 1 m λ i n p σ n ( y i ) = p n Z i = 1 m λ i n σ n ( y i ) .
Furthermore, since the group shift p G is of the finite type and ( p G ) f = p ( G f ) by Lemma 1, we can apply Proposition 1 to the group shift p G , in order to obtain that the sum in the equality above only involves non-null terms for a finite subset of indices F Z . Therefore,
p u = p n F i = 1 m λ i n σ n ( y i ) .
Set
w : = n F i = 1 m λ i n σ n ( y i ) G f .
Then,
u = w + ( u w ) ,
where w { σ n ( y j ) : n Z , 1 j m } and p ( u w ) = 0 . It now suffices to take v : = u w . □
Theorem 3.
Let G be an order-controllable group shift (therefore, of a finite type) over a finite abelian p-group H. Then, there is a noncatastrophic isomorphic encoder for G. As a consequence, G is algebraically and topologically conjugate to a full group shift.
Proof. 
Using induction on the exponent of G, we prove that there is topological generating set B 0 of G [ p ] , where B 0 : = { x 1 , , x m } ( p G f [ p ] ) [ 0 , ) such that π [ 0 ] ( B 0 ) forms a basis of π [ 0 ] ( ( p G [ p ] ) [ 0 , ) ) and for each x j B 0 there is an element y j G f such that x j = p h j y j . Furthermore G is algebraically conjugate to the full group shift generated by Z ( p h 1 ) × Z ( p h m ) .
The case e x p ( G ) = p was already done in Proposition 1. Now, suppose that the proof was accomplished if e x p ( G ) = p h and let us verify it for e x p ( G ) = p h + 1 . We proceed as follows:
First, take the closed, shift invariant, subgroup p G . We have that e x p ( p G ) = p h and by the induction hypothesis, there is topological generating set B 0 of p G [ p ] , where B 0 : = { x 1 , , x m } ( p G f [ p ] ) [ 0 , ) such that π [ 0 ] ( B 0 ) forms a basis of π [ 0 ] ( ( p G [ p ] ) [ 0 , ) ) , and for each x j B 0 , there is an element y j p G f such that x j = p h j y j .
Since y j p G f , there is z j G f such that y j = p z j , 1 j m . Furthermore, we may assume that there is a finite block [ 0 , N 1 ] N such that the set { σ n [ y j ] | [ 0 , N 1 ] 0 : n Z , 1 j m } is linearly independent. As a consequence, using similar arguments as in Theorem 3.2 in [2], it follows that the set { σ n [ z j ] | [ 0 , N 1 ] 0 : n Z , 1 j m } also is linearly independent. Therefore there is a canonically defined σ -invariant onto group homomorphism
Φ :   1 j m Z ( p h j ) Z p G .
Now, we complete the set B 0 : = { x 1 , , x m } ( p G ) [ p ] f [ 0 , ) with a finite set B 1 : = { u 1 , , u k } G [ p ] f [ 0 , ) such that π [ 0 ] ( B 0 B 1 ) is a basis of π [ 0 ] ( G [ p ] ) . Remark that we must have h ( u i ) = 0 for all 1 i k , since π [ 0 ] ( B 0 ) forms a basis of π [ 0 ] ( ( p G [ p ] ) . Furthermore, arguing as in Proposition 1, we may assume that there is a finite block [ 0 , N 2 ] N such that the set
E : = { σ n [ u i ] | [ 0 , N 2 ] : σ n [ u i ] | [ 0 , N 2 ] 0 : n Z , 1 i k }
is an independent subset of G [ p ] | [ 0 , N 2 ] .
Now, consider the quotient group homomorphism
q :   G G / p G
and remark that G / p G is a group shift over ( H / p H ) Z . Making use of this quotient map, we select a basis
V 1 : = { v 1 , , v k } G f [ p ] [ 0 , + )
satisfying the following properties:
  • V 1 | [ 0 , N 2 ] { σ n [ u i ] | [ 0 , N 2 ] : σ n [ v i ] | [ 0 , N 2 ] 0 : n Z , 1 i k } .
  • π [ 0 ] ( B 0 V 1 ) is a basis of π [ 0 ] ( G [ p ] ) .
  • The set
    { σ n [ v i ] | [ 0 , N 2 ] : σ n [ v i ] | [ 0 , N 2 ] 0 : n Z , 1 i k }
    is independent.
  • Each q ( v i ) has the minimal possible support in ( G / p G ) f . That is
    | supp ( q ( v 1 ) ) | | supp ( q ( v k ) ) |
    where, if supp ( q ( v i ) ) = { , l 1 , , l p i } , then | supp ( q ( v i ) ) | : = l p i l 1 + 1 .
It is straightforward to verify that q ( G f ) ( G / p G ) f and, as a consequence, it follows that the group G / p G is controllable and its controllability index is less than or equal to the controllability index of G. As in Theorem 2, the topological generating set { v 1 , , v k } { z 1 , , z m } defines a continuous group homomorphism
Φ : Z ( p ) k × 1 j m ( Z p h m + 1 Z G
By Theorem 2, in order to proof that Φ is one-to-one, it will suffice to find some block [ 0 , N ] Z such that
S : = { σ s [ v i ] | [ 0 , N ] 0 : s Z , 1 i k } { σ n [ z j ] | [ 0 , N 1 ] 0 : n Z , 1 j m } | [ 0 , N ]
forms an independent subset of G | [ 0 , N ] .
Since this property holds separately for { z 1 , , z m } on the block [ 0 , N 1 ] and { v 1 , , v k } on the block [ 0 , N 2 ] , it suffices to verify that if we denote by Y the group shift generated by { z 1 , , z m } and by U the group shift generated by { v 1 , , v k } , then there is an block [ 0 , N ] Z such that
( Y U ) | [ 0 , N ] = { 0 } .
This implies that S | [ 0 , N ] is an independent subset.
Indeed, take N max ( 2 N 1 , 2 N 2 ) . Then, reasoning by contradiction, assume we have a sum
( α i n σ n ( v i ) + β j s σ s ( z j ) ) | [ 0 , N ] = { 0 } .
Remark that we may assume that this sum is finite without loss of generality since G is order controllable. Then
p ( α i n σ n ( v i ) + β j s σ s ( z j ) ) | [ 0 , N ] = ( p α i n σ n ( v i ) + p β j s σ s ( z j ) ) | [ 0 , N ] = { 0 }
this yields
p β j s σ s ( z j ) | [ 0 , N ] = β j s σ s ( y j ) | [ 0 , N ] = { 0 } .
Since N N 1 , this implies that
β j s σ s ( y j ) = { 0 } .
This means that β j s = p γ j s for every index j s . Thus we have
( α i n σ n ( v i ) + p γ j s σ s ( z j ) ) | [ 0 , N ] = { 0 } .
Now, we select an element σ n ( v i ) such that i f ( q ( σ n ( u i ) ) ) is minimal among the elements satisfying this property. Suppose, without loss of generality, that σ n ( v i ) = σ n 1 v 1 for simplicity’s sake. Solving for σ n 1 v 1 in the equality above, we have
σ n 1 v 1 | [ 0 , N ] = ( n n 1 , i 1 α i n σ n ( v i ) + p γ j s σ s ( z j ) ) | [ 0 , N ] = { 0 } .
Set
w : = n n 1 , i 1 α i n σ n ( v i )
and set
w 1 : = σ n 1 v 1 w .
Remark that p w 1 = 0 , that is w 1 G [ p ] and
w 1 | [ 0 , N ] = p γ j s σ s ( y j ) | [ 0 , N ] p H .
Therefore,
supp ( q ( w 1 ) ) [ 0 , N ] = .
Since G is a group shift of the finite type, there is w 2 G such that
w 2 | ( , N ] = w 1 | ( , N ] and w 2 | [ 0 , + ) = p γ j s σ s ( y j ) | [ 0 , + ) .
From the way w 2 is defined, we have that σ n 1 ( w 2 ) G f [ p ] [ 0 , + ) satisfies that
σ n 1 ( w 2 ) | [ 0 , N 2 ] { σ n [ v i ] | [ 0 , N 2 ] : σ n [ v i ] | [ 0 , N 2 ] 0 : n Z , 1 i k }
and
| supp ( q ( w 2 ) ) | | supp ( q ( σ n 1 ( v 1 ) ) ) | .
This is a contradiction and completes the proof. □
We can now prove Theorem 1.
Proof of Theorem 1. 
Since every finite abelian group is the direct sum of all its nontrivial p-subgroups, the proof follows from Theorem 3, in a similar manner as Theorem A in [2] follows from Theorem 3.2 in [2]. □
QUESTION: Under what conditions is it possible to extend Theorem 1 to non-abelian groups?

3. Conclusions

In this paper, we investigated the structure of order-controllable group codes. In particular, we have dealt with the important question of when a group shift admits a finite canonical generating set and, as a consequence, is topologically and algebraically isomorphic to a full shift. In order to tackle this problem, we introduced the notion of order-controllable group code (given a { G i : i N } family of finite Abelian groups, the subgroup G i N G i is called order controllable if for every i N there is n i N such that for each c G , there exists c 1 G satisfying that c 1 | [ 1 , i ] = c | [ 1 , i ] , s u p p ( c 1 ) [ 1 , n i ] , and order ( c 1 ) divides order ( c | [ 1 , n i ] ) ). Our main result establishes a significant step toward the understanding of when a group code is topologically and algebraically isomorphic to a full group shift. In fact, we obtained a mild algebraic necessary condition for a group shift to admit a finite canonical generating set and, as a consequence, to be topologically conjugate to a full group shift.

Author Contributions

Conceptualization and methodology, S.H.; investigation M.V.F. All authors have read and agreed to the published version of the manuscript.

Funding

Research partially supported by the Spanish Ministerio de Economía y Competitividad, grant: MTM/PID2019-106529GB-I00 (AEI/FEDER, EU) and by the Universitat Jaume I, grant UJI-B2019-06.

Data Availability Statement

Not applicable.

Acknowledgments

We thank the referees for their careful reading of this paper and helpful comments.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ferrer, M.V.; Hernández, S. Subdirect products of finite abelian groups. In Descriptive Topology and Functional Analysis II. TFA 2018; Springer Proceedings in Mathematics and Statistics; Ferrando, J., Ed.; Springer: Berlin/Heidelberg, Germany, 2019; Volume 286, pp. 89–101. [Google Scholar]
  2. Ferrer, M.V.; Hernández, S. Homomorphic encoders of profinite abelian groups. arXiv 2021, arXiv:2103.13135. [Google Scholar]
  3. Ferrer, M.V.; Hernández, S.; Shakhmatov, D. Subgroups of direct products closely approximated by direct sums. Forum Math. 2017, 29, 1125–1144. [Google Scholar] [CrossRef]
  4. Calderbank, A.R.; Roger Hammons, A., Jr.; Vijay Kumar, P.; Sloane Patrick Solé, N.J.A. A linear construction for certain Kerdock and Preparata codes. Bull. AMS 1993, 29, 218–222. [Google Scholar] [CrossRef] [Green Version]
  5. Forney, G.D., Jr.; Trott, M.D. The dynamics of group codes: State spaces, trellis diagrams and canonical encoders. IEEE Trans. Inf. Theory 1993, 39, 1491–1513. [Google Scholar] [CrossRef]
  6. Forney, G.D., Jr.; Trott, M.D. The Dynamics of Group Codes: Dual Abelian Group Codes and Systems. IEEE Trans. Inf. Theory 2004, 50, 2935–2965. [Google Scholar] [CrossRef]
  7. Fagnani, F.; Zampieri, S. Dynamical Systems and Convolutional Codes Over Finite Abelian groups. IEEE Trans. Inf. Theory 1996, 42, 1892–1912. [Google Scholar] [CrossRef]
  8. Kitchens, B. Expansive dynamics on zero-dimensional groups. Ergod. Theory Dyn. Syst. 1987, 7, 249–261. [Google Scholar] [CrossRef] [Green Version]
  9. Kitchens, B.P.; Schmidt, K. Automorphisms of compact groups. Ergod. Theory Dyn. Syst. 1989, 9, 691–735. [Google Scholar] [CrossRef] [Green Version]
  10. Schmidt, K. Automorphisms of compact abelian groups and affine varieties. Proc. Lond. Math. Soc. 1990, 61, 480–496. [Google Scholar] [CrossRef]
  11. Forney, G.D. Convolutional codes I: Algebraic structure. IEEE Trans. Inf. Theory 1970, 16, 1491–1513. [Google Scholar] [CrossRef]
  12. Loeliger, H.-A.; Mittelholzer, T. Convolutional codes over groups. IEEE Trans. Inf. Theory 1996, 42, 1660–1686. [Google Scholar] [CrossRef]
  13. Miles, G.; Thomas, R.K. The breakdown of automorphisms of compact topological groups. In Studies in Probability and Ergodic Theory; Academic Press: Cambridge, MA, USA, 1978; Volume 2, pp. 207–218. [Google Scholar]
  14. Fagnani, F. Some results on the classification of expansive automorphisms of compact abelian groups. Ergod. Theory Dynam. Syst. 1996, 16, 45–50. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Ferrer, M.V.; Hernández, S. Homomorphic Encoders of Profinite Abelian Groups II. Axioms 2022, 11, 158. https://doi.org/10.3390/axioms11040158

AMA Style

Ferrer MV, Hernández S. Homomorphic Encoders of Profinite Abelian Groups II. Axioms. 2022; 11(4):158. https://doi.org/10.3390/axioms11040158

Chicago/Turabian Style

Ferrer, María V., and Salvador Hernández. 2022. "Homomorphic Encoders of Profinite Abelian Groups II" Axioms 11, no. 4: 158. https://doi.org/10.3390/axioms11040158

APA Style

Ferrer, M. V., & Hernández, S. (2022). Homomorphic Encoders of Profinite Abelian Groups II. Axioms, 11(4), 158. https://doi.org/10.3390/axioms11040158

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