Next Article in Journal
Is Fluctuating Asymmetry a Sufficient Indicator of Stress Level in Two Lizard Species (Zootoca vivipara and Lacerta agilis) from Alpine Habitats?
Previous Article in Journal
Passive Grouping Enhances Proto-Arithmetic Calculation for Leftward Correct Responses
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On J-Diagrams for the One Groups of Finite Chain Rings

Department of Mathematics, College of Sciences, King Saud University, Riyadh 11451, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(3), 720; https://doi.org/10.3390/sym15030720
Submission received: 3 February 2023 / Revised: 9 March 2023 / Accepted: 10 March 2023 / Published: 14 March 2023

Abstract

:
Let R be a finite commutative chain ring with invariants p , n , r , k , m . The purpose of this article is to study j-diagrams for the one group H = 1 + J ( R ) of R , where J ( R ) = ( π ) is Jacobson radical of R . In particular, we prove the existence and uniqueness of j-diagrams for such one group. These j-diagrams help us to solve several problems related to chain rings such as the structure of their unit groups and a group of all symmetries of { π k } , where k k . The invariants p , n , r , k , m and the Eisenstein polynomial by which R is constructed over its Galois subring determine fully the j-diagram for H .

1. Introduction

Suppose that P m = { 1 , 3 , , m } , the function j : P m P m is said to be admissible if s < j ( s ) and if j ( s ) = j ( i ) , then s = i . Admissible functions have been used as a significant tool to determine the structure of abelian p-groups which have certain types of j-diagram series [1,2,3]. Moreover, j-diagrams are used in classifying chain rings and in determining their groups of automorphisms [4]. Motivated by the important role of j-diagrams in group and ring theory, this article is aimed to investigate the existence and uniqueness of such j-diagrams. We focus our attention on j-diagrams for finite abelian p-groups, and particularly groups of units of finite commutative chain rings. Chain rings are associative rings that have a lattice of ideals that creates a unique chain. A finite ring R can easily be shown to be a chain ring if and only if its (Jacobson) radical J ( R ) = J is principal and R ¯ = R / J is a field of order p r ,  p is prime. Every finite chain ring has five positive integers p , n , r , k , m named the invariants. These rings occur in several applications, for details see [1,5,6,7,8,9,10,11,12]. For instance, they have widely appeared in coding theory [13,14,15,16,17]. However, the class of Galois rings is a distinguished class of finite chain rings, and every Galois ring is represented as:
G R ( p n , r ) = Z p n [ x ] / ( f ( x ) ) ,
where f ( x ) is a monic irreducible polynomial of degree r .
Finite chain rings are constructed in at least two different ways. Suppose that R is a finite chain ring that has the invariants p , n , r , k , m . First, R can be viewed as an Eisenstein extension of G R ( p n , r )
R = G R ( p n , r ) [ x ] / ( g ( x ) , x m ) ,
where g ( x ) is an Eisenstein polynomial over G R ( p n , r ) , i.e.,
g ( x ) = x k p i = 0 k 1 s i x i ,
where s 0 is a unit of G R ( p n , r ) . Another way to construct R involves Q p , the field of p-adic numbers. Every chain ring R is a quotient ring of the integers ring of a certain finite extension of Q p , for more details see [6] and the references therein. The symmetry of invariants of various chain rings injects more choice and flexibility into the theory of ring construction.
The group of units (multiplicative group) U ( R ) of R is defined by U ( R ) = R \ J , i.e., the set of all non-nilpotent elements of R . From Ayoub (1972) [2], U ( R ) U H , where U ( R / J ) * is cyclic of order p r 1 and H = 1 + J which is a p-group. Thus, the structure problem of U ( R ) is reduced to that of H . After Ayoub, we call H the one group. If p 1 does not divide k , the structure of H is given by Ayoub [2] based on the results in [3]. However, the case when ( p 1 ) k , the full structure of H is given by Alabiad and Alkhamees [1]. In this paper, we aim to study the existence and uniqueness of j-diagrams for the one group H of R .
In Section 2, we introduce the concept of j-diagrams, some notations and examples. In Section 3, we study the existence and uniqueness of complete and incomplete j-diagrams for the series H = H 1 > H 2 > H 3 > > H m = 1 of the one group H , for any finite commutative chain ring R with invariants p , n , r , k , m , where H s = 1 + J s . Moreover, among other results, we find an explanation of j-diagrams from a ring-theoretic point of view, see Theorem 5.

2. Preliminaries

Unless otherwise mentioned, all considered groups are multiplicative abelian groups, p denotes a fixed prime. See [2,3,18] for the details of this section.
Definition 1. 
If P m = { 1 , 2 , , m } , j : P m P m is called an admissible function if j satisfies the following conditions:
( i ) s < j ( s ) , s m ; ( i i ) I f j ( i ) = j ( s ) m , then i = s .
The following example is direct.
Example 1. 
Let j : P m P m be an admissible function and let 1 m m . Define
(i) j 1 : P m P m , given by j 1 ( i ) = j ( m m + i ) ( m m ) ;
(ii) j 2 : P m P m , given by:
j 2 ( i ) = j ( i ) , if j ( i ) < m , m , if j ( i ) m .
Then, j 1 and j 2 are admissible functions.
Definition 2.  
Let p be a fixed prime and A an abelian p-group. Then, the series
A = A 1 > A 2 > > A m = 1 ,
is called a complete j diagram for A of length m with respect to p if j : P m P m is admissible and
(i) 
If j ( s ) = m , A s p = 1 .
(ii) 
If j ( s ) m , η s : A s / A s + 1 A j ( s ) / A j ( s ) + 1 , given by:
η s ( x A s + 1 ) = x p A j ( s ) + 1 ,
defines an isomorphism.
In case when η s , for some s P m , is only homomorphism, the series is called incomplete j diagram at i = s .
Example 2. 
Let A = < a > , where o ( a ) = p m 1 . Then,
A = < a > = A 1 > A 2 = < a p > > A m = 1 ,
is a j diagram of length m if j defined by:
j ( i ) = i + 1 , if 1 i < m , m , if i = m .
Example 3. 
Let A be an elementary abelian p group and let
A = A 1 > A 2 > A m = 1 ,
be a chain of subgroups of A. Then if j ( i ) = m , 1 i m , the chain (6) is a j diagram of length m since A i p = 1 , 1 i m . Thus, clearly a group need not have a unique j-diagram.

Notations and Terminologies

1.
ν ( s ) is the smallest positive integer such that j ν ( s ) ( s ) = m .
2.
o ( x ) means the multiplicative order of x .
3.
R ( j ) denotes the range of j .
4.
β is always associated with Eisenstine polynomial g ( x ) , i.e., π k = p β h .
5.
If a A i \ A i + 1 , we denote w t ( a ) = i .
6.
r a n k ( A ) is the smallest number of generators of A .
7.
d i m ( A ) is the dimension of A as a vector space over Z p .

3. The J-Diagrams for One Group H

In what follows, R is a finite commutative chain ring with invariants p , n , r , k , m . We focus on the following series of H = 1 + J ( J = J ( R ) ),
H = H 1 > H 2 > H 3 > > H m = 1 ,
where H s = 1 + J s .
Definition 3. 
We call R a complete (incomplete) chain ring if H has complete (incomplete at s * ) j diagram, where s * = k p 1 .
Lemma 1. 
If x is a unit in R . Then, x = y mod H i if and only if x = y mod J i .
Proof. 
This is true because
y x J i x 1 y 1 J i x 1 y H i .
The following lemma is easy to prove.
Lemma 2. 
Let 1 s m .
(1) 
The map γ s : H s / H s + 1 J s / J s + 1 defined by:
γ s ( 1 + x ) H s + 1 = x + J s + 1
is an isomorphism.
(2) 
Let δ s : J s / J s + 1 J s + k / J s + k + 1 defined by:
δ s ( x + J s + 1 ) = p x + J s + k + 1 .
Then, δ s is an isomorphism.
Remark 1. 
Note that J s / J s + 1 is an elementary p-group.
Theorem 1. 
Let R be complete, and let j ( i ) m for some i .
(i) 
If k + i < p i , then j ( i ) = k + i .
(ii) 
If k + i = p i and j ( i + 1 ) < m , then j ( i ) = k + i .
(iii) 
If p i < k + i , then j ( i ) = p i .
Proof. 
Consider 1 + x H i \ H i + 1 . Then, ( 1 + x ) p H j ( i ) \ H j ( i ) + 1 . Moreover, ( 1 + x ) p = 1 + p y + x p with w t ( y ) = w t ( x ) = i . Suppose k + i < p i , then k + i = w t ( p y ) < p i . As w t ( x p ) = min { m , p i } > k + i , we get ( 1 + x ) p H k + i \ H k + i + 1 . Hence, j ( i ) = k + i and this ends (i). For (ii), assume that k + i = p i and j ( i ) < m . Then, k + ( i + 1 ) < p ( i + 1 ) . Now 1 + p y + x p H k + i . So j ( i ) k + i . However, k + i + 1 < p ( i + 1 ) . If j ( i + 1 ) < m , then j ( i + 1 ) = k + i + 1 > j ( i ) gives j ( i ) = k + i . Similarly, one can prove (iii). □
Lemma 3. 
Let R be complete.
(i) 
Let e be the smallest positive integer such that j ( e ) = m . Then either k + e = p e or k + e m ,   p e m .
(ii) 
Any homomorphic image of R is complete.
Proof. (i)
As j ( e ) = m , by definition H e p = 1 . For any x J ,   ( 1 + x ) p = 1 + p y + x p for some y R with w t ( y ) = w t ( x ) . Consider any 0 x J e , then 1 = ( 1 + x ) p = 1 + p y + x p ,   p y + x p = 0 . If p y = 0 , then x p = 0 , k + e m , p e m . Suppose that p y 0 . Then, p y = x p gives k + w t ( x ) = p w t ( x ) . (ii) Let I be a non-zero ideal of R ,   I = J s for some 1 s m . For T = R / I ,   J ( T ) = J / J s ,   H i ( T ) = 1 + J i ( T ) and H i ( T ) / H i + 1 ( T ) H i / H i + 1 for 1 i s . Thus, whenever i < s and j ( i ) < s ,
H i ( T ) / H i + 1 ( T ) H j ( i ) ( T ) / H j ( i ) + 1 ( T ) .
For some i < s suppose that j ( i ) s . Then, H j ( i ) H s . However, either H i p = 1 or H i / H i + 1 H j ( i ) / H j ( i ) + 1 under the mapping ( 1 + x ) H i + 1 ( 1 + x ) p H j ( i ) + 1 . Hence, H i p 1 + J s . This shows that H i P ( T ) = 1 , and thus T is complete with the admissible function j defined on P s as follows: j ( i ) = j ( i ) if j ( i ) < s , otherwise j ( i ) = s .
Lemma 4. 
Let R be complete, and let ( p 1 ) k , i.e., k + s = p s < m . If j ( s ) > k + s , then the followings hold
(i) 
m = k + s + 1 .
(ii) 
R ¯ = p .
(iii) 
There exists a unit v R such that p x 0 = x 0 p v and 1 + v J , where w t ( x 0 ) = s .
Conversely, if there exists x 0 J with w t ( x 0 ) = s ,   k + s = p s < m , and if R satisfies (i), (ii) and (iii), then there exists an admissible function j on P m for which R is complete.
Proof. 
Now k + s + 1 < p ( s + 1 ) . If k + s + 1 < m , by Theorem 1, j ( s + 1 ) = k + s + 1 . As j ( s ) < j ( s + 1 ) , we get j ( s ) = k + s . This is a contradiction. Hence, m = k + s + 1 and j ( s ) = m . For any x R , the binomial expansion gives ( 1 + x ) p = 1 + p x + x p + p z for some z R with w t ( z ) min { m , 2 w t ( x ) } . Consider any unit u R . As p x 0 2 = 0 , then,
( 1 + u x 0 ) p = 1 + p u x 0 + u p x 0 p = 1 .
So, p u x 0 + u p x 0 p = 0 , and in particular p x 0 + x 0 p = 0 . It follows that p ( u u p ) x 0 = 0 , and hence u u p J . This proves R ¯ = p . The hypothesis gives that p x 0 = x 0 p v for some unit v R . Then, p x 0 + x 0 p = 0 gives that 1 + v J .
For the converse, define j such that j ( i ) = p i for i < s , and j ( i ) = m for i s . Then for any unit u R ,   ( 1 + u x 0 ) p = 1 + p u x 0 + u p x 0 p . As u u p J , 1 + u J ,
p u x 0 + u p x 0 p = p ( u u p ) x 0 + u p x 0 p ( 1 + u ) = 0 .
Hence, ( 1 + u x 0 ) p = 1 . By using this, and the argument in [2], it can be easily verified that j is an admissible function and that R is complete. □
Theorem 2. 
Let R be a finite commutative chain ring with invariants p , n , r , k , m ,   π k = p β h , and for some s P m ,   k + s = p s < m . Then there exists an admissible function j on P m such that j ( s ) > k + s , and R is complete if and only if R satisfies the following conditions:
(i) 
m = k + s + 1 .
(ii) 
R ¯ = p .
(iii) 
β = 1 in R ¯ .
Proof. 
Let R be complete and j ( s ) > k + s . Let x 0 J such that w t ( x 0 ) = s . By Lemma 4, (i) and (ii) hold, and there exists a unit u R such that p x 0 = x 0 p u and 1 + u J . Now x 0 = π s w for some unit w . Then,
p π s w = π p s w p u = π k + s w p u = p π s w p u y .
It follows that w w p u y J m k s = J . In R ¯ ,   u ¯ = 1 , by (ii), w ¯ p 1 = 1 , so y ¯ = 1 , i.e., β = 1 . Conversely, let R satisfy (i), (ii) and (iii). By (iii), y 1 H = H p 1 . Hence, y 1 = w p 1 for some w H . Consider x = π s w , u = 1 . Then, p x = x p u and 1 + u = 0 J . By Lemma 4, the desired j exists. □
Theorem 3. 
Let R be a finite commutative chain ring with invariants p , n , r , k , m , and for some s P m ,   k + s = p s < m . Then there exists an admissible function j on P m such that j ( s ) = k + s and R is complete if and only if β R ¯ p 1 .
Proof. 
Suppose that R is complete and j ( s ) = k + s . For any 0 y J , ( 1 + y ) p = 1 + p y + y p + p z for some z R with w t ( z ) min { m , 2 w t ( y ) } . Fix an x H s \ H s + 1 . As ( 1 + x ) p H k + s \ H k + s + 1 , then we get w t ( p x + x p ) = k + s . Moreover, p x = x p u for some unit u R . So x p ( u + 1 ) J k + s \ J k + s + 1 , and thus 1 + u is a unit. For any c R , as ( 1 + c x ) p H k + s \ H k + s + 1 ,   p c x + c p x p = x p ( c u + c p ) has weight k + s , so u + c p 1 is a unit. Thus, in R ¯ ,   u R ¯ p 1 . Now, x = π s w for some unit w . Then, x p u = π k + s w p u , and p x = π k + s w y 1 , so w p 1 ( y u ) 1 J m k s . Thus, y u ¯ R ¯ p 1 . As u ¯ R ¯ p 1 , we get y ¯ R ¯ p 1 . Consequently, β R ¯ p 1 . Conversely, let β R ¯ p 1 . Consider u = y 1 , then for any unit c R ,     c p 1 + u is a unit. It follows that for x = π s ,     p x = x p u ,     p c x + c p x p = x p ( c u + c p ) has weight k + s ,   ( 1 + c x ) p H k + s \ H k + s + 1 , and thus
H s / H s + 1 H s + k / H s + k + 1 .
For i < s ,   p i < k + i , define j ( i ) = p i , and for i s , define j ( i ) = min { m , k + i } . By using ([2], Propositions 1 and 2), it follows that j is the desired admissible function. □
Theorem 4. 
Let R be a finite commutative chain ring with invariants p , n , r , k , m . If R is complete, then there exists only one admissible function j on P m .
Proof. 
Suppose that k = m . Then, c h a r R = p ,     ( x + y ) p = x p + y p . Using this it follows that any finite chain ring R of characteristic p is complete and the underlying admissible function j on P m is such that j ( i ) = p i , whenever p i < m , and j ( i ) = m otherwise. Suppose k < m , and j , j are two different admissible functions on P m such that R is complete with respect to j as well as j . It follows from the proof of Theorem 1 that if for some i < m ,     k + i p i and min { k + i , p i } < m , then j ( i ) = min { k + i . p i } = j ( i ) . If for some i < m and min { k + i . p i } m , then j ( i ) = m = j ( i ) . So, there exists an s < m such that k + s = p s < m and j ( s ) j ( s ) . It follows from Lemma 4 that R ¯ = p , and we can take j ( s ) = s + k ,     j ( s ) = s + k + 1 = m . Let J 1 and J 2 be the restriction of j and j , respectively, to L s = { i : s i m } . Set X = { i : s i s + k } . By applying (Theorem 1 (4) [3]), we get two sets of cyclic p subgroups { U i : 1 i m } ,     { U i : 1 i m } of H corresponding to j and j , respectively. By Proposition 6, H s = i X U i , so r a n k ( H s ) = k . Furthermore, H s = i Y U i gives r a n k ( H s ) = k + 1 . This is a contradiction, and thus proves the result. □
Remark 2. 
By a similar discussion, the above results hold if we assume that R is incomplete.
Remark 3. 
Consider a finite commutative chain ring R with p , n , r , k , m . Let π k = p β h be an Eisenstein polynomial of R . By looking at the invariants p , k and the element β , one knows whether a given R is complete or incomplete using Theorems 2 and 3. In any case, the form of the underlying admissible function j on P m is well defined by:
j ( i ) = min { p i , m } , if i s * , min { i + k , m } , if i > s * ,
where k = ( p 1 ) s * + q , where 0 q < p 1 .
Example 4. 
Let R be a chain ring with invariants 2 , 3 , 5 , 1 , 3 and suppose that j ( 1 ) = 2 , j ( 2 ) = 3 and j ( 3 ) = 3 . Then, R is clearly a complete j-diagram with unique admissible function j. This means if there is another admissible function j’ such that R is also a complete j’-diagram, then j = j . For the converse, note that if j 1 ( 1 ) = j 1 ( 2 ) = j 1 ( 3 ) = 3 which is an admissible function but R is not j 1 diagram. This means the existence of an admissible function j on P m is not enough to say R is j-diagram (either complete or not), see Definition 2. Thus, in general, the converse is not true.
Proposition 1. 
Let R be a finite commutative chain ring with p , n , r , k , m . If ( p 1 ) k or m k + s * , then R is complete.
Proof. 
Note that for x U ( R ) ,
( 1 + π s * x ) p = 1 + p π s * u + π s * p x p , if m > k + s * , 1 , if m k + s * ,
where u U ( R ) . Thus, if m k + s * , then clearly the series (7) is a complete j-diagram, and hence R is complete. Now, assume that m > k + s * . If ( p 1 ) k , q 0 , and hence s * p < k + s * . It follows from Equation (11) that
( 1 + π s * x ) p = 1 + π s * p x 1 mod H s * p + 1 ,
for some x 1 U ( R ) . Furthermore, when s > s * ,     η s = γ s + k 1 · δ s · γ s , where γ s and δ s are defined in Lemma 2 Thus, η s is an isomorphism. In case of s s * , consider the map
β s : J s / J s + 1 J s p / J s p + 1 x + J s + 1 x p + J s p + 1
One can prove easily that β s is well-defined, and moreover, is a monomorphism. For epimorphism, note that since R ¯ is a finite field, then R ¯ p = R ¯ , a basic field. That is, if y J s p \ J s p + 1 , then y = π s p y 0 mod J s p + 1 where y 1 R ¯ * . Then, there is y 2 such that y 1 = y 2 p and then β ( x s y 2 ) = y mod N p s + 1 . Therefore, β s is an isomorphism and η s = γ s p 1 · β s · γ s , which means η s is an isomorphism. □
Corollary 1. 
Any finite commutative chain ring R with characteristic p is complete.
Proof. 
Since n = 1 , then k = m which means that m < k + s * , and by Proposition 1, R is complete. □
Remark 4. 
By Proposition 1, when q 0   ( ( p 1 ) k ) the j-diagram for H is independent of the Eisenstein polynomial π k = p β h . However, this is not true when q = 0 , i.e., k + s * = p s * . Let x U ( R ) , by Equation (11),
( 1 + π s * x ) p = 1 + p π s * x + π s * p x p mod H j ( s * ) + 1 = 1 + π s * + k ( ( β h ) 1 x + x p ) mod H j ( s * ) + 1 .
Thus, ( 1 + π s * x ) p = 1 mod H j ( s * ) + 1 if and only if ( β h ) 1 x + x p = 0 mod J , i.e., x p 1 + β = 0 in R ¯ * .
Proposition 2. 
If m > k + s * , then η s * is an isomorphism if and only if β R ¯ * p 1 .
Proof. 
If η s * is an isomorphism, then ker η s * = { H s * + 1 } , which means that ( 1 + π s * a ) p 1 mod H j ( s * ) + 1 , for any a R ¯ * . Hence, x p 1 + β has no zeros in R ¯ * and thus β R ¯ * p 1 . The converse is direct by Theorem 3. □
The following theorem gives a characterization of incomplete chain rings.
Theorem 5. 
Suppose that R has invaraints p , n , r , k , m with m > k + s * . Therefore, the subsequent hypotheses are equivalent:
(i) 
R is incomplete.
(ii) 
There is α R such that α p 1 + p = 0 .
(iii) 
p 1 divides k and there exists α R ¯ * such that β = α ( p 1 ) .
Proof. 
Let (i) be satisfied, thus ker η s * 1 because η s * is surjective. In this case, there is 1 + α π s * in ker η s * with
( 1 + α π s * ) p = 1 + α p π s * p β α π s * + k ξ = 1
mod H s * p + 1 , where ξ H . However, the above equation holds when p s * = s * + k and α p + β α = 0 mod π . Now, assume that ( p 1 ) k , then ker η s * ker f , where f is a homomorphism; f : R ¯ R ¯ and f ( α ) = α p + β α . Moreover, ker f = 1 if and only if x p + β x has only zero solution. Thus, ( β 1 h 1 π ) s * is a root of x p 1 + p in R , where β 1 = α 1 and h 1 p 1 = h . The remaining hypotheses follow immediately by Proposition 2 and Theorem 3. □
Corollary 2. 
If R is an incomplete chain ring, then ker η s * is of rank p .
Proof. 
Since any element in ker η s 1 is of the form 1 + α π s * , where α is a zero of the polynomial x p + β x . Thus, the order of ker η s * is exactly p since there are p distinct zeros of x p + β x in R ¯ .
Lemma 5. 
Let R be a finite commutative chain ring with invaraints p , n , r , k , m .
(a) 
If n > 2 or n = 2 and t > s * . Then, m > k + s * .
(b) 
If n 2 ,   t s * . Then, m k + s * .
Proof. 
Part (b) is obvious; note that if n = 1 , then m = k = t . For part (a),
m = ( n 1 ) k + t = ( n 1 ) ( ( p 1 ) s * + q ) + t = ( n 1 ) ( p s * s * + q ) + t = ( n 1 ) ( p s * + q ) ) ( n 1 ) s * + t = ( n 1 ) ( k + s * ) + t ( n 1 ) s * = ( k + s * ) + ( n 2 ) k + t ( n 1 ) s * = ( k + s * ) + ( n 2 ) k + + ( n 2 n + 1 ) s * = ( k + s * ) + ( n 2 ) k + t s * .
However, s * < k and n > 2 , then ( n 2 ) k s * > 0 , thus, m > k + s * .
Proposition 3. 
If s > k + s * , then s R ( j ) . Furthermore,
c 0 = P m \ R ( j ) = m m p , if m < k + s * , k , otherwise ,
where x means the greatest integer that is less than or equal to x .
Proof. 
Let s = k + s * + e , for some e > 0 , then clearly s = j ( s * + e ) , which means s R ( j ) . If m k + s * , then it is clear that P m \ R ( j ) = { s P m : p s , 1 s k + s * } . Thus,
c 0 = k + s * k + s * p = ( p 1 ) s * + q + s * p = p s * + q p = k + s * s * = k .
For the case m < k + s * ,     P m \ R ( j ) = { s P m : p s , s < m } , and thus,
c 0 = m m p .
Proposition 4. 
Assume the admissible function j satisfies: if j ( s ) p , then s R ( j ) for all s . Then, H s p i = H j i ( s ) , in particular, H p i = H j i ( 1 ) .
Proof. 
The proof is conducted by induction on i . First, let i = 1 , and note that H s p H j ( s ) . If y H j ( s ) , then y = u j ( s ) y 1 , where u j ( s ) U j ( s ) and y 1 H j ( s ) + 1 . Moreover, u j ( s ) = u s p for some u s U s , and y 1 = u j ( s ) + 1 y 2 , where u j ( s ) + 1 U j ( s ) + 1 and y 1 H j ( s ) + 2 . Since
j ( j ( s ) + 2 ) j ( j ( s ) + 1 ) j ( 1 ) = p ,
it follows that j ( s ) + 2 , j ( s ) + 1 are elements of R ( j ) . This means u j ( s ) + 1 = u s 1 p . As we proceed, we get y = y 0 p , and thus H j ( s ) H s p . Therefore, H j ( s ) = H s p . If i > 1 , observe that H s p i = ( H s p i 1 ) p , and hence the conclusion is drawn from the induction step. □
Next, we give an important result; that is useful in capturing the structure of the subgroups H s of H via the following j-subdiagram:
H s > H s + 1 > > H m = 1 .
Which in turn helps us to investigate the group of automorphisms of R , for more details see Remark 4.2.10 in [4].
The following result for finite abelian groups can be easily proved.
Lemma 6. 
Let G be a finite direct product of cyclic groups, each of order p e for some e 1 . Let U be a subgroup of G which is a direct product of cyclic groups B i , each of order p e , and for which r a n k ( U ) = r a n k ( G ) . Then, G = A 1 A 2 A s such that each A i is a cyclic group and B i = U A i . Moreover, for any s 1 ,   G p e e c = { g G : g p s U } , where c = min { e e , s } .
Theorem 6. 
Let A = A 1 > A 2 > > A m = 1 be a complete j diagram for an abelian p-group A, 0 s < m and L m s = { i : m s i m } . Let j = j L m s and X s = { i L m s : i R ( j ) } . Then,
(a) 
A m s = i X s U i .
(b) 
X s = B C satisfying the following conditions:
(i) 
B R ( j ) = ϕ ,
(ii) 
There exists a subset D of P m \ R ( j ) disjoint form B and a one to one mapping j 1 : D C such that for any i D , j 1 ( i ) = j e i ( i ) for some e i 1 . Suppose P = ( P m \ R ( j ) ) \ ( D B ) ,   E = i P U i and F = i ( B D ) U i .
(iii) 
A = E F ,   A m s = ( i B U i ) ( i D U i p e i ) F and r a n k ( A m s ) = r a n k ( F ) .
(iv) 
Let c 0 and P 1 = { i P : ν ( i ) c } . Then,
G = { x A : x p c A m s } = ( i P 1 U i ) ( i B U i ) ( i D U i p e i min { e i , c } ) .
Proof. (a)
Put K i = A m + i s 1 ,     1 i s + 1 . Then, A m s = K 1 > K 2 > > K s + 1 = 1 is a complete j * diagram, where j * : P s + 1 P s + 1 is given by j * ( i ) = j ( m s 1 i ) ( m s 1 ) . Note that K i = K i + 1 × U m s 1 + 1 . By [Theorem 1 [3]],
A m s = i R ( j * ) U m s 1 + i = i X s U i .
(b) Write X k = B C with B P m \ R ( j ) and C R ( j ) . It is clear that m C . Suppose that all U i have the same rank. For each i C , there exists a positive integer e i , and a unique i such that i = j e i ( i ) . Thus, U i = U j e i ( i ) = U i p e i U i . It follows that from the definition of j ,   D = { i : i C } is disjoint from B and there exists a bijection j 1 : D C , such that j 1 ( i ) = j e i ( i ) . This proves (ii). Hence,
A m s = i B U i i D p e i U i F .
This proves (iii). Finally, consider c 0 and G = { x A : x p c A m s } . Observe that any x A is in G if and only if each of its components in the decomposition A = E F is in G . For any x E ,     x p c A m s implies x p c = 1 . For any i P ,     U i p c = 1 , whenever ν ( i ) c . So E G = × i P 1 U i . Consider any i D . Now, U i G = { x U i : x p c U i p e i } . As the order of U i is p ν ( i ) and the order of U i p e i is p ν ( i ) e i , then by Lemma 6,
U i G = U i p e i min { e i , c } .
Thus,
G = ( i P 1 U i ) ( i B U i ) ( i D U i p e i min { e i , c } ) .

4. Conclusions

In this article, we have investigated j-diagrams for one group of finite commutative chain rings. Under certain conditions concerning the invariants p , n , r , k , m and Eisenstein polynomials, we proved the existence and uniqueness of such j-diagrams. These j-diagrams have been found helpful tools in investigating finite chain rings.

Author Contributions

Conceptualization, S.A. and Y.A.; Methodology, S.A. and Y.A.; Formal analysis, S.A.; Investigation, S.A.; Writing–original draft, S.A.; Writing–review and editing, S.A. and Y.A.; Supervision, Y.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by the Researchers Supporting Project number (RSPD2023R545), King Saud University, Riyadh, Saudi Arabia.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors would like to acknowledge the Researchers Supporting Project number (RSPD2023R545), King Saud University, Riyadh, Saudi Arabia.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Alabiad, S.; Alkhamees, Y. Recapturing the structure of group of units of any finite commutative chain rings. Symmetry 2021, 13, 307. [Google Scholar] [CrossRef]
  2. Ayoub, C. On the group of units for certain rings. J. Number Theory 1972, 4, 383–403. [Google Scholar] [CrossRef] [Green Version]
  3. Ayoub, C. On diagrams for abelian groups. J. Number Theory 1970, 2, 442–458. [Google Scholar] [CrossRef] [Green Version]
  4. Alabiad, S.; Alkhamees, Y. On automorphism groups of finite chain rings. Symmetry 2021, 13, 681. [Google Scholar] [CrossRef]
  5. Hou, X. Finite commutative chain rings. Finite Fields Appl. 2001, 7, 382–396. [Google Scholar] [CrossRef] [Green Version]
  6. Clark, W.; Liang, J. Enumeration of finite commutative chain rings. J. Algebra 1973, 27, 445–453. [Google Scholar] [CrossRef] [Green Version]
  7. Clark, W.; Drake, D. Finite chain rings. Abh. Math. Sem. Uni. Hambg. 1973, 29, 147–153. [Google Scholar] [CrossRef]
  8. Clark, W. A coefficient ring for finite non-commutative rings. Proc. Amer. Math. Soc. 1972, 33, 25–28. [Google Scholar] [CrossRef] [Green Version]
  9. Hou, X. Bent functions, partial difference sets and quasi-Frobenius local rings. Des. Codes Cryptogr. 2000, 20, 251–268. [Google Scholar] [CrossRef]
  10. Klingenberg, W. Projective und affine Ebenen mit Nachbarelementen. Math. Z. 1960, 60, 384–406. [Google Scholar] [CrossRef]
  11. Ma, S.; Schmidt, B. Relative (pa,pb,pa,pa-b)-relative difference sets: A unified exponent bound and a local ring construction. Finite Fields Appl. 2000, 6, 1–22. [Google Scholar] [CrossRef] [Green Version]
  12. Artman, B.; Dorn, G.; Drake, D.; Törner, G. Hjelmslev’sche Inzidenzgeometrie und verwandte Gebiete—Literaturverzeichnis. J. Geom. 1976, 7, 175–191. [Google Scholar] [CrossRef]
  13. Sălăgean, A. Repeated-root cyclic and negacyclic codes over finite chain rings. Discret. Appl. Math. 2006, 154, 413–419. [Google Scholar] [CrossRef] [Green Version]
  14. Dinh, H.; López-Permouth, S. Cyclic and negacyclic codes over finite chain rings. IEEE Trans. Inform. Theory 2004, 50, 1728–1744. [Google Scholar] [CrossRef]
  15. Dinh, H. Negacyclic codes of length 2s over Galois rings. IEEE Trans. Inform. Theory 2005, 51, 4252–4262. [Google Scholar] [CrossRef]
  16. Lui, X.; Lui, H. LCD codes over finite chain rings. Finite Fields Appl. 2015, 43, 1–19. [Google Scholar]
  17. Greferath, M. Cyclic codes over finite rings. Discret. Math. 1997, 177, 273–277. [Google Scholar] [CrossRef] [Green Version]
  18. Luis, M. Incomplete j-diagrams fail to capture group structure. J. Algebra 1991, 144, 88–93. [Google Scholar] [CrossRef] [Green Version]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Alabiad, S.; Alkhamees, Y. On J-Diagrams for the One Groups of Finite Chain Rings. Symmetry 2023, 15, 720. https://doi.org/10.3390/sym15030720

AMA Style

Alabiad S, Alkhamees Y. On J-Diagrams for the One Groups of Finite Chain Rings. Symmetry. 2023; 15(3):720. https://doi.org/10.3390/sym15030720

Chicago/Turabian Style

Alabiad, Sami, and Yousef Alkhamees. 2023. "On J-Diagrams for the One Groups of Finite Chain Rings" Symmetry 15, no. 3: 720. https://doi.org/10.3390/sym15030720

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