Abstract
Let be a family of finite Abelian groups. We say that a subgroup is order controllable if for every , there is such that for each , there exists satisfying , , and order divides order . 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.
Keywords:
profinite abelian group; controllable group; order controllable group; group code; generating set; homomorphic encoder 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 , 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
where each is a group and the composition law is the component-wise group operation. The subgroup
is called the finite subcode of G. It may happen that all elements of G have finite support, which means that G coincides with .
If all code symbols are drawn from a common group H, then 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 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 (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 . Therefore, if denotes the backward shift operator
we have that . For simplicity’s sake, we denote the forward shift operator by , that is . A group shift G over a finite abelian group H is irreducible or transitive if there is such that the partial forward orbit is dense in G for all . Given two group codes G and , if there is a homeomorphism (resp. topological group isomorphism) so that then we say that G and 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 is dense in G; here denotes the subgroup of 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 such that for each , there exists such that and (we assume that is the least integer satisfying this property). Remark that this property implies the existence of such that , and .
- (3)
- G is order controllable if there is a positive integer such that for each , there exists such that , , and order divides order (we assume that is the least natural number satisfying this property). Again, this implies the existence of such that , , and order divides order . 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, denotes the subgroup of 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 is weakly controllable, then there is a finite generating subset , where , , and each is selected with the maximal possible height in with , , such that the following assertions hold true:
- There is a canonically defined σ-invariant, onto, group homomorphism
- ((G is weakly rectangular and)) Φ is a noncatastrophic, isomorphic encoder for G if there is a finite block such that the setis linearly independent.
Proof.
Using that G and are weakly controllable, we can proceed as in Theorem 3.2 in [2] in order to define a subset such that forms a basis of and for each , there is a nonnegative integer and an element such that , where each has the maximal possible height in and . Now define
by
and, for each , , set and define
by
Now, we can define
by
where for all .
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 is contained in for all , it follows that the map is continuous when its domain (and its range) is equipped with the product topology. Therefore, there is a canonical extension of to a continuous group homomorphism
Now, repeating the same arguments as in Theorem 3.2 in [2], it follows that
which implies that is a continuous group homomorphism because is dense in Furthermore, using the -invariance of G, we can extend canonically to continuous onto group homomorphism
by
for every . Now, if we identify with the subgroup , remark that restricted to is equal to . Therefore, we have defined a map
Again, because is dense in it follows that we can extend to a continuous group homomorphism
Now, taking into account that for all , we proceed as in Theorem 3.2 in [2] in order to lift to a continuous group homomorphism
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 and are both (linearly) independent.
Furthermore, since all elements () have finite support, it follows that the set 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 , first notice that is continuous, being that the inverse map is a continuous one-to-one group homomorphism. Now, reasoning by contradiction, suppose there is such that is an infinite sequence, let us say, without loss of generality, an infinite sequence on the right side. Then, we have that the sequence converges to 0 in G. However, since is infinite on the right side, it follows that the sequence does not converge to 0 in . This contradiction completes the proof. □
Definition 3.
In the sequel, a set (resp. ) that satisfies the properties established in Theorem 2 is called topological generating set of G (resp. ).
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 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 such that if belong to G and they coincide on an N-block , then there is such that and . 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 with the first index (resp. last index) is denoted by (resp. ). The length of is defined as .
Proposition 1.
Let G be a weakly controllable, group shift of finite type over a finite abelian p-group H. If , 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 in this case. By Theorem 2, there is a topological generating subset such that forms a basis of and there is a canonically defined -invariant, onto, group homomorphism
Furthermore, we select each element with minimal support in and such that .
By Theorem 2 (2), it suffices to verify that there is a finite block such that the set is linearly independent. Indeed, let N be a natural number such that for all and satisfying the condition of being a group shift of finite type for G. That is, if belong to G and they coincide on any N-block , then there is such that and .
Reasoning by contradiction, let us suppose that there is a linear combination
Since the set is linearly independent, there must be an element (for some and ) such that
As a consequence, there exist such that
We select u such that is minimal among the elements satisfying this property. Set
We have that
Since G is of finite type for N-blocks, there exists such that
We have that and . Therefore, we have found an element with . Therefore, we can replace by and . This is a contradiction with our previous selection of the (ordered) set , which completes the proof. □
Lemma 1.
Let G be an order-controllable group shift over a finite abelian p-group H. Then and are order-controllable group shifts for all r with . As a consequence, it holds that for all r with .
Proof.
It is obvious that is order controllable. Regarding the group , take an arbitrary element . By the order controllability of G, there is and such that , and order divides order . Then , , and order divides order .
Finally, it is clear that . Next, we check the reverse implication.
Let such that . Then, there are two integers such that . Assume that without loss of generality. By order controllability, there is such that , and order divides order . Hence, if , we have , and order divides order . Therefore, with .
If , by order controllability, there is such that , and order divides order . Set . We have that and , which yields .
If , set . By order controllability, there is such that , and order divides order . Hence, if , we have , and order divides order . Set . We have that and , which again yields . This completes the proof. □
Let G be a group shift over a finite abelian p-group H and let denote the quotient group defined by the map . We define the subgroup
Lemma 2.
Let G be an order-controllable group shift over a finite abelian p-group H and let be a topological generating set of , where , , . If then there exist and such that .
Proof.
Since is a topological generating set of , we have
Furthermore, since the group shift is of the finite type and by Lemma 1, we can apply Proposition 1 to the group shift , in order to obtain that the sum in the equality above only involves non-null terms for a finite subset of indices . Therefore,
Set
Then,
where and It now suffices to take . □
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 of , where such that forms a basis of and for each there is an element such that . Furthermore G is algebraically conjugate to the full group shift generated by
The case was already done in Proposition 1. Now, suppose that the proof was accomplished if and let us verify it for . We proceed as follows:
First, take the closed, shift invariant, subgroup . We have that and by the induction hypothesis, there is topological generating set of , where such that forms a basis of , and for each , there is an element such that .
Since , there is such that , . Furthermore, we may assume that there is a finite block such that the set is linearly independent. As a consequence, using similar arguments as in Theorem 3.2 in [2], it follows that the set also is linearly independent. Therefore there is a canonically defined -invariant onto group homomorphism
Now, we complete the set with a finite set such that is a basis of . Remark that we must have for all , since forms a basis of . Furthermore, arguing as in Proposition 1, we may assume that there is a finite block such that the set
is an independent subset of .
Now, consider the quotient group homomorphism
and remark that is a group shift over . Making use of this quotient map, we select a basis
satisfying the following properties:
- is a basis of .
- The setis independent.
- Each has the minimal possible support in . That iswhere, if , then .
It is straightforward to verify that and, as a consequence, it follows that the group 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 defines a continuous group homomorphism
By Theorem 2, in order to proof that is one-to-one, it will suffice to find some block such that
forms an independent subset of .
Since this property holds separately for on the block and on the block , it suffices to verify that if we denote by Y the group shift generated by and by U the group shift generated by then there is an block such that
This implies that is an independent subset.
Indeed, take . Then, reasoning by contradiction, assume we have a sum
Remark that we may assume that this sum is finite without loss of generality since G is order controllable. Then
this yields
Since , this implies that
This means that for every index . Thus we have
Now, we select an element such that is minimal among the elements satisfying this property. Suppose, without loss of generality, that for simplicity’s sake. Solving for in the equality above, we have
Set
and set
Remark that , that is and
Therefore,
Since G is a group shift of the finite type, there is such that
From the way is defined, we have that satisfies that
and
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 family of finite Abelian groups, the subgroup is called order controllable if for every there is such that for each , there exists satisfying that , , and order divides order ). 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
- 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]
- Ferrer, M.V.; Hernández, S. Homomorphic encoders of profinite abelian groups. arXiv 2021, arXiv:2103.13135. [Google Scholar]
- 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] [Scilit]
- 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] [Scilit]
- 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] [Scilit]
- 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]
- Fagnani, F.; Zampieri, S. Dynamical Systems and Convolutional Codes Over Finite Abelian groups. IEEE Trans. Inf. Theory 1996, 42, 1892–1912. [Google Scholar] [CrossRef]
- Kitchens, B. Expansive dynamics on zero-dimensional groups. Ergod. Theory Dyn. Syst. 1987, 7, 249–261. [Google Scholar] [CrossRef] [Scilit]
- Kitchens, B.P.; Schmidt, K. Automorphisms of compact groups. Ergod. Theory Dyn. Syst. 1989, 9, 691–735. [Google Scholar] [CrossRef] [Scilit]
- Schmidt, K. Automorphisms of compact abelian groups and affine varieties. Proc. Lond. Math. Soc. 1990, 61, 480–496. [Google Scholar] [CrossRef] [Scilit]
- Forney, G.D. Convolutional codes I: Algebraic structure. IEEE Trans. Inf. Theory 1970, 16, 1491–1513. [Google Scholar] [CrossRef] [Scilit]
- Loeliger, H.-A.; Mittelholzer, T. Convolutional codes over groups. IEEE Trans. Inf. Theory 1996, 42, 1660–1686. [Google Scholar] [CrossRef]
- 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]
- 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] [Scilit]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).