Abstract
This paper gives a thorough characterization of chain rings with index of nilpotency 5 and residue field where p represents a prime number, contributing valuable insights to the field of algebraic structures. It carefully identifies and categorizes the family of chain rings with these specifications, thereby enhancing the understanding of their properties and applications. In addition, the work offers a detailed enumeration of all chain rings containing elements. The significance of finite chain rings is emphasized, particularly in their suitability for coding theory, which confirms their relevance in contemporary mathematical and engineering contexts.
MSC:
16L30; 94B05; 16P20; 94B60
1. Introduction
Finite chain rings are an important category of rings within abstract algebra, possessing distinctive characteristics that attract substantial interest from mathematicians. By definition, a finite chain ring is a finite ring in which every ideal is included in a unique maximal principal ideal, resulting in a chain-like arrangement of ideals [1,2,3]. This stands in stark contrast to more general rings, which can have multiple maximal ideals leading to a more intricate structure of ideals. Basic examples of finite chain rings arise from Galois rings, first identified by Krull [4], particularly those of the form , where p is a prime number. The exploration of finite chain rings is significantly linked to module theory, as finitely generated modules over these rings display well-defined behaviors that can help clarify the structure of the rings themselves [5,6]. Recently, it has been discovered that chain rings can serve as alphabets for linear codes, due to the applicability of two classical theorems by MacWilliams—the Extension Theorem and the MacWilliams Identities—to these rings, similar to their application in finite fields. For more on the topic, see [7,8,9,10,11,12,13].
Every finite commutative chain ring R can be represented as a quotient of a polynomial ring over its prime subring , specifically
where u is a generator of the maximal ideal J and I is an appropriate ideal formed by a combination of and , with both and greater than 1. This connection allows for the use of techniques from algebraic geometry and number theory, enhancing the study of these rings. The classification of finite chain rings primarily involves analyzing the structure of the ideal I, leading to the conclusion that such rings can typically be expressed as a direct sum of the form
for some positive integer k. For some integer m, the residue field takes the form . The order of R is given by , where l is the length of R when viewed as an R-module. Since R is finite, there exists a positive integer t such that and ; this t is known as the index of nilpotency of J and satisfies . The additive order of 1 is for some n, referred to as the characteristic of R. In summary, the parameters p, n, m, k, and l associated with R are termed the invariants of R [14]. This paper aims to identify and classify all chain rings that have fixed invariants p, n, m, k, and , specifically those of order . When , it is well-established that there is only one chain ring, up to isomorphism, with p elements: the Galois field . For chain rings of order , the options are and . If p is odd, the local rings with include , , , and where is a primitive element of For , local rings with elements include , and see [1]. Recently, the chain rings of order have been comprehensively detailed in several studies, see, for example, [10], where linear codes over such rings have garnered attention; while those with and have been studied in an earlier study by Corbas and Williams [15]. The current paper has two primary objectives: firstly, to construct chain rings with and of length 5 (with a nilpotency index of 5) and, secondly, to classify and enumerate these rings under isomorphism, ensuring that they share the same invariants. In the discussion, all chain rings with are thoroughly listed and enumerated in Example 5.
The organization of the rest of this study is as follows: Section 2 reviews fundamental aspects of finite chain rings. Following that, Section 3 presents our findings regarding all chain rings with elements, subdivided by the values of Notably, we provide detailed information on those rings containing elements, supplemented with illustrative examples of our main results.
2. Preliminaries
In this section, we outline some fundamental concepts and notations that will be utilized throughout the manuscript. Let J denote the maximal ideal of R, a finite local chain ring with identity. For the results presented in this section, we refer to the literature [1,14,16,17,18,19,20].
A finite ring R is classified as a chain ring if the ideal lattice of R constitutes a chain. This condition is equivalent to R being local and having a primary maximal ideal J, or to the condition that the nilpotency index t of J equals l, where represents the length of the sequence
In this context, we observe that , and the quotient provides the residue field , which is isomorphic to a finite field . Furthermore, there exists an integer k such that , meaning that , where p is a prime number. The characteristic of the ring R takes the form , for some positive integer n. Additionally, we can identify an integer e satisfying such that . Notably, such rings can generally be expressed as a direct sum of the form
leading to the equation
where is a unit in R and . This relationship shows that u is a root of the Eisenstein polynomial given by
The parameters p, n, m, l, and k are termed the invariants of R. Generally, we have
According to [1], this is recognized as an Eisenstein extension of R over . The unit group of the ring R is described in [16] and takes the form
where represents a primitive element from , and . Based on Equation (5), we can express as
with and .
An element is defined as basic irreducible if is irreducible in . Suppose is a basic irreducible polynomial, and let . In this scenario, there exists a unit in and a monic polynomial f in such that (see [18]). If , we then have and
where is a root of a basic irreducible polynomial of degree m. This extension of is a Galois extension. This category of rings is uniquely characterized by the parameters p, n, and m, and the group of automorphisms is cyclic of order m, generated by the Frobenius map [1].
The notations introduced in this section will remain applicable throughout the entirety of the manuscript.
3. Chain Rings of Length 5
In this section, let R be a local ring characterized by parameters , and k. We will demonstrate all possible structures of R and their enumeration by varying the values of n and k.
For clarity, we define as a primitive element of , leading to the sets:
To establish a relationship among the parameters t, n, and k, which is essential for proving the main results of this section, the following results are pivotal.
Proposition 1.
Let R be a finite local ring. Then, if and only if R is a chain ring with parameters , and .
Proof.
Since and , the chain forms a composition series. Thus, we have for . In particular, must equal 1, given that . This implies that J is principal, indicating that R is a chain ring with . The converse is straightforward. □
We will show that the form and algebraic structure of R are completely determined by the parameters , and k. Subsequently, we will establish a crucial relationship among the parameters n, l, and k of a chain ring, which will guide us in the construction of such rings.
Lemma 1.
Let R be a chain ring with parameters and k. Then,
Proof.
Assume is the annihilator of . Given that and for each i, we have . This leads us to conclude that , hence . Conversely, since there are k generators of R over , any element a from can be expressed as
where . Thus, there are such generators over . Therefore, l cannot exceed , which implies that , yielding the result . □
It is pertinent to note the relationship among the invariants of R, expressed as
where . We will investigate all feasible values for n. In particular, for , the equation has no valid solutions for k and e, indicating that no chain ring exists in this case. Consequently, this paper will be structured into subsections that focus on the values , and 5.
3.1. Chain Rings of Characteristic p
This subsection assumes and thus, by Lemma 1, we have Moreover, the prime subring of R is a field of the form The order of R is and this forces the construction of R to be
For general value of R can be expanded as
It was found that this class of chain rings might be utilized to create new sequences with the best Hamming correlation properties, which is why it has been widely used in coding theory. These sequences are particularly valuable in applications such as spread spectrum communication, where they help mitigate interference and ensure reliable multiple access for users sharing the same frequency bandwidth. By creating sequences with optimal correlation properties, systems can enhance performance in environments with noise and other disturbances; for more details, see [10].
Theorem 1.
Every chain ring of order and characteristic p is uniquely isomorphic to
Proof.
The order of R explains that and as such, if As we have Hence, R is an isomorphic image of with As we have seen earlier, Therefore,
□
Example 1.
Observe that Theorem 1 states that R is uniquely determined by the invariants and Which means any two rings R and T have, for example, and as their fixed invariants; then, they are isomorphic,
If we denote , the number of non-isomorphic classes of chain rings of 5-length with invariants , then, by Theorem 1, we obtain
3.2. Chain Rings of Characteristic
Throughout, let R be a chain ring that has the characteristic implying The primary subring of R takes the type of The order of R and the implications of Lemma 1 indicate that Consequently, the J under discussion has two scenarios depending on the position of p in the series
First, observe that if then R does not form a chain since J is not principal, If then we reach a conclusion that which leads to , which is not possible because Therefore, we encounter two cases separately: (denoted as ) and (denoted as ). Hence, we will analyze these cases in two theorems. The first theorem addresses the case where while the second theorem examines the case where However, in either case, we have
The ring R can be constructed in the form Our goal is to determine the precise structure of I in order to better understand the overall structure of which relies heavily on the interactions between u and p given that Furthermore, we aim to calculate the number of chain rings that possess invariants
Theorem 2.
Every chain ring of order and characteristic with is uniquely isomorphic to
Proof.
We note first that The order of R clarifies that k must be Building on that, we have and then multiplying gives and hence, , so that Thus, we obtain
As and thus we suppose where x and y are in It is evident that because else which leads to and contradicts By Equation (5), where and This gives and thus
where The other relation between p and u is that since Note that here, Therefore, R attains the construction of
Without difficulties, one can check that the ring R in Equation (17) has the right properties. To characterize such rings, we consider two cases. Case a. If we may have because is p-group and the gcd of p and 3 is As a result, we may replace h in Equation (16) by as the existence of is guaranteed by the order of Hence, the equation will be reduced to that of
Let R and T be two rings with fixed invariants and let be their associated relations, respectively. Moreover, assume is an isomorphism, and is its restriction to Observe, where and So, we have
Hence, Since and we may assume that By comparing sides, we obtain the relation
This relation classifies our considered rings. The latter equation can be interpreted as which means that As we obtain when the order of is relatively prime with that is In such cases, the quotient group is equal to the trivial group, i.e., and hence, we obtain This means that exists in the orbit of under the action of Aut on However, since and Aut is a cyclic group, the number of orbits N is
Then, the orbit of is o Thus, whenever, there is one and only class of such rings. This class is represented by
If thus the order of the quotient group is which means it is a cyclic group of order However, for every element of we obtain a new class of chain rings associated with this element. In conclusion, there are 3 classes of such rings when In summary, for Case a, the total number of chain rings with such properties is
Case b. If We observe that and thus, there is an element of such that With this in mind, the relation in Equation (16) after replacing u by becomes
where and To classify these rings, let R and T be two chain rings with such properties, and assume they have and , respectively. Suppose and is the isomorphism. There are and such that Note that
where is the reduction of on As above, we may take Let where then by comparison, we obtain
Thus, Let Aut act on and thus, we have
where is the number of elements of fixed by and noting that In conclusion, when there are of such rings. □
Remark 1.
It is worthy noting that when then if we take φ to be a correspondence that sends where So,
is indeed the desired isomorphism.
Example 2.
Let us assume that then, by Equation (21), there are 3 classes of chain rings with invariants These ring are listed as
Theorem 3.
Every chain ring of order and is uniquely isomorphic to
Proof.
By the order of we must then obtain Furthermore, where Furthermore, the order of R shows that which implies that
Moreover, we have
As for existence, one can check easily that the latter ring is, in fact, a chain ring of order of the type under consideration. In order to enumerate these rings up to isomorphism, let R and T be chain rings with the same invariants and with and respectively. If we set as the isomorphism between R and T with where and Thus, similar to the above discussion, we obtain
We first fix The latter relation can be read as The order of this quotient group determines the number of classes of chain rings with these properties. In fact, if then, by a similar approach to that of proof of Theorem 2, there are where
Since for we obtain and then
While if thus, there are of such classes, where N is
Finally, if hence and thus, it follows that there is a unique non-isomorphic class of these rings. To summarize, we have N of these rings in total, where
□
Example 3.
Suppose Thus, if we want to enumerate all chain rings having by Equation (27), we obtain
In the following, we show, by a different approach, the exact number of non-isomorphic classes of rings having a structure as in Theorem 3 when
Definition 1.
Let p be a fixed prime and let c be any positive integer. If we define to be the order of p in the group of units of the ring of integers modulo If we set It is known that the order of is where ϕ denotes the Euler ϕ-function. Therefore, divides
Theorem 4.
Let and Then, there are exactly
as many isomorphism classes of chain rings with invariants .
Proof.
Let denote the group of nonzero elements of For we define if there exists and such that
has a solution in for some Thus, it is sufficient to show that the number of equivalence classes is given by Formula (28) above. As is well known, is cyclic of order Let be a generator for It is straightforward to observe that an element in has a 4th root if and only if it is in the subgroup G generated by , where This leads to the conclusion that if and only if for some
To simplify the notation, we can replace with the additive group of integers modulo . Thus, based on the previous notations, the equivalence relation can be rewritten as if and only if for some . Let denote the equivalence class of and let Then, we have
Let and Then,
The union in the equation above can be seen to be a disjoint union. Since has elements, we conclude that has elements. For , we have if and only if Thus, if we let denote those with then forms a union of equivalence classes, each having elements. Conversely, contains elements, so it is clear that is a union of equivalence classes. As e varies over the divisors of f, so does and vice versa. Consequently, Equation (28) provides the total number of classes as required. □
Remark 2.
It is well known that
So,
The equality holds if and only if for all c, which occurs precisely when
Remark 3.
Every finite chain ring with has an associated formula of the form To show this, let R be any finite chain ring. In the notation of 1.5, we have where where with and being a unit in We can express where Then, lies in the subgroup of the group of units of Since J is an additive p-group, H forms a multiplicative p-group. Thus, if which means that is relatively prime to the order of guaranteeing that has a kth root in H; let us denote this root by Let then Hence, the polynomial must have a root in indicating that R has such a relation between u and p.
Remark 4.
We have from Theorems 3 and 4,
3.3. Chain Rings of Characteristic
For any chain ring with its prime ring is of the form As and then we must have Hence,
In this case, we have no choice but and thus Multiplying explains It follows that
As then for some x and y in It is clear that because otherwise would be in If one can complete the squares and then put Hence, where and Furthermore, we have as Note that else
Theorem 5.
Every chain ring of order and characteristic is uniquely isomorphic to
Proof.
First, we assume Using the above discussion, we conclude that
Therefore,
One can check, as customary, that this quotient is in fact a ring of the right type. Now, we classify these rings up to isomorphism with invariants Since then and therefore the relation in (35) will be
By the latter equation, our rings are classified by the image of under the reduction This means if then replacing u by gives
While if then we obtain
These rings are different, and we only have if Now, let then the relation between the generators is where and Since because then we may write the relation by where If then we have 1 ring that is
We assume
A similar argument of Theorem 2 might be applied here and it gives,
In summary, there are 2 rings when and for there are of such rings. □
Example 4.
Suppose then if we obtain by Equation (37). Thus, there are 3 rings with invariants namely
3.4. Chain Rings of Characteristic
We investigate the case when So, and hence, the prime subring. Since, R and have the same order, thus
These rings are uniquely determined up to isomorphism with their invariants Moreover,
Overall, every chain ring of order and characteristic is uniquely isomorphic to This means that there is only one class of these rings. The construction of this ring is
where is a basic irreducible polynomial over the ring of integers modulo The element is a root of This extension is a Galois extension.
In the next example, we list all chain rings when
Example 5.
Let then we present all chain rings with invariants as
Note that * means that there is more than one type of such ring according to certain conditions. Furthermore, their number is
This completes the classification of all chain rings of length 5 and of order Hence, all chain rings of order and length 5 are classified in Table 1.
Table 1.
Numbers of chain rings of length 5 and of order .
4. Conclusions
In conclusion, the study of local rings characterized by the parameters , and k is vital to advancing coding theory. This article focused specifically on local rings of length 5, wherein, we systematically identified and classified these structures up to isomorphism, emphasizing their invariants. Notably, we organized the chain rings into a comprehensive table (Table 1) based on their parameters, thereby enhancing our understanding of their properties. Furthermore, we compiled a detailed list of all chain rings for the case where contributing valuable insights to this intriguing area of research. It is important to emphasize that as the number k increases, the classification and structural difficulty of the associated rings also increase significantly. When the index of nilpotency exceeds we believe that our existing tools may not suffice for classifying such rings, which indicates a need for the development of new techniques.
Author Contributions
Conceptualization, A.A.A. and S.A.; methodology, A.A.A. and S.A.; formal analysis, A.A.A., S.A. and N.A.A.; investigation, A.A.A. and S.A.; writing—original draft, S.A. and N.A.A.; writing-review and editing, S.A., A.A.A. and N.A.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 (RSPD2024R871), King Saud University, Riyadh, Saudi Arabia.
Data Availability Statement
No new data were created or analyzed in this study.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Alabiad, S.; Alkhamees, Y. On classification of finite commutative chain rings. AIMS Math. 2021, 7, 1742–1757. [Google Scholar] [CrossRef]
- Whelan, E.A. A note of finite local rings. Rocky Mt. J. Math. 1992, 22, 757–759. [Google Scholar] [CrossRef]
- Kuzmina, A.S.; Maltsev, Y.N. Finite rings with regular nilpotent graphs. Sib. Èlektron. Mat. Izv. 2015, 12, 810–817. [Google Scholar]
- Krull, W. Algebraische Theorie der Ringe II. Math. Ann. 1924, 91, 1–46. [Google Scholar] [CrossRef]
- Norton, G.; Salagean, A. On the structure of linear cyclic codes over finite chain rings. Appl. Algebra Eng. Commun. Comput. 2000, 10, 489–506. [Google Scholar] [CrossRef]
- Alabiad, S.; Alhomaidhi, A.A.; Alsarori, N.A. On linear codes over finite singleton local rings. Mathematics 2024, 12, 1099. [Google Scholar] [CrossRef]
- Alabiad, S.; Alhomaidhi, A.A.; Alsarori, N.A. MacWilliams identities and generator matrices for linear codes over . Axioms 2024, 13, 552. [Google Scholar] [CrossRef]
- Dougherty, S.T.; Saltürk, E.; Szabo, S. On codes over Frobenius rings: Generating characters, MacWilliams identities and generator matrices. Appl. Algebra Eng. Commun. Comput. 2019, 30, 193–206. [Google Scholar] [CrossRef]
- Honold, T. Characterization of finite Frobenius rings. Arch. Math. 2001, 76, 406–415. [Google Scholar] [CrossRef]
- Alabiad, S.; Alhomaidhi, A.A.; Alsarori, N.A. On linear codes over local rings of order p4. Mathematics 2024, 12, 3069. [Google Scholar] [CrossRef]
- Gassner, N.; Greferath, M.; Rosenthal, J.; Weger, V. Bounds for Coding Theory over Rings. Entropy 2022, 24, 1473. [Google Scholar] [CrossRef] [PubMed]
- Alfarano, G.N.; Gruica, A.; Lieb, J.; Rosenthal, J. Convolutional codes over finite chain rings, MDP codes and their characterization. Adv. Math. Commun. 2023, 17, 1–22. [Google Scholar]
- Wood, J.A. Duality for modules over finite rings and applications to coding theory. Am. J. Math. 1999, 121, 555–575. [Google Scholar] [CrossRef]
- Raghavendran, R. Finite associative rings. Compos. Math. 1969, 21, 195–229. [Google Scholar]
- Corbas, B.; Williams, G. Rings of order p5 Part II. Local Rings J. Algebra 2000, 231, 691–704. [Google Scholar] [CrossRef]
- Ayoub, C. On the group of units of certain rings. J. Number Theory 1972, 4, 383–403. [Google Scholar] [CrossRef]
- Wilson, R. Representations of finite rings. Pacific J. Math. 1974, 53, 643–649. [Google Scholar] [CrossRef]
- McDonald, B.R. Finite Rings with Identity; Marcel Dekker: New York, NY, USA, 1974. [Google Scholar]
- Zariski, O.; Samuel, P. Commutative Algebra; Springer: New York, NY, USA, 1960; Volume II. [Google Scholar]
- Matsumura, H. Commutative Ring Theory; Cambridge University Press: Cambridge, UK, 1986. [Google Scholar]
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. |
© 2024 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/).