Approach of the value of a rent when non-central moments of the capitalization factor are known: an R application with interest rates following normal and beta distributions Ratio Mathematica Volume 37, 2019, pp. 61-68 61 On cyclic multigroup family Johnson Aderemi Awolola* Abstract In this paper, the concept of cyclic muligroup is studied from the preliminary knowledge of cyclic group which is a well-known concept in crisp environment. By using cyclic multigroups, we then delineate a cyclic multigroup family and investigate its structural properties. It is observed that the union of class of cyclic multigroups generated by 𝓐 is a cyclic multigroup. However, the union is an identity cyclic multigroup. In particular, we obtain a series of class of cyclic multigroups generated by 𝓐. Keywords: Multiset, Multigroup, Cyclic multigroup, Cyclic multigroup family. 2010 AMS subject classification: 08𝐴72, 03𝐸72, 94𝐷05.† * Department of Mathematics/Statisics and Computer Science, College of Science (University of Agriculure, Makurdi, Nigeria), remsonjay@yahoo.com, awolola.johnson@uam.edu.ng. † Received on August 23rd, 2019. Accepted on December 25th, 2019. Published on December 31th, 2019. doi: 10.23755/rm.v37i0.476. ISSN: 1592-7415. eISSN: 2282-8214. Β©Johnson Aderemi Awolola. This paper is published under the CC-BY licence agreement. mailto:remsonjay@yahoo.com J. A. Awolola 62 1 Introduction In set theory, repetition of objects are not allowed in a collection. This perspective rendered set almost irrelevant because many real life problems admit repetition. To remedy the inadequacy in the idea of sets, the concept of multisets was introduced in [6] as a generalization of sets by relaxing the restriction of distinctness on the nature of the objects forming a set. Multiset is very promising in mathematics, computer science, website design, etc. See [4, 5] for details. Generalization of algebraic structures is playing a prominent role in the sphere of mathematics. One of such generalization of algebraic structures is the notion of multigroups. Multigroups are actually a generalization of groups and have come into the centre of interest. In [1], the multigroup proposed is analogous to fuzzy group [2] in that the underlying structure is a multiset. Although multigroup concept was earlier used in [9, 12] as an extension of group theory, however the recent definition of multigroup in [1] is adopted in this paper because it shows a strong analogy in the behaviour of group and makes it possible to extend some of the major notions and results of groups to that of multigroups. Some of the related works can be found in [3], [7], [8], [10], [11] etc. The aim of this paper is to promote research and the development of multiset knowledge by studying cyclic multigroup family based on the sufficient condition for a multiset to be a cyclic multigroup. 2 Preliminaries In this section, we give the preliminary definitions and results that will be required in this paper from [1, 8]. Definition 2.1 Let ℧ be a non-empty set. A multiset 𝐴 drawn from ℧ is characterized by a count function 𝐢𝐴 defined as 𝐢𝐴 : ℧ ⟢ 𝓓 , where π’Ÿ represents the set of non-negative integers. For each π‘₯ ∈ ℧, 𝐢𝐴(π‘₯) is the characteristics value of π‘₯ in 𝐴 and indicates the number of occurrences of the element π‘₯ in 𝐴. An expedient notation of 𝐴 drawn from ℧ = {π‘₯1, π‘₯2 , … , π‘₯𝑛 } is [π‘₯1, π‘₯2 , … , π‘₯𝑛 ]𝐢𝐴(π‘₯1), 𝐢𝐴(π‘₯2) ,…, 𝐢𝐴(π‘₯𝑛) such that 𝐢𝐴(π‘₯𝑖 ) is the number of times π‘₯𝑖 occurs in 𝐴, (𝑖 = 1, 2, … , 𝑛). The class of all multisets over ℧ is denoted by 𝑀𝑆(℧). On cyclic multigroup family 63 Definition 2.2 Let 𝐴, 𝐡 ∈ ℧. Then 𝐴 is a submultiset of 𝐡 written as 𝐴 βŠ† 𝐡 or 𝐡 βŠ‡ 𝐴 if 𝐢𝐴(π‘₯) ≀ 𝐢𝐡 (π‘₯), βˆ€ π‘₯ ∈ ℧. Also, if 𝐴 βŠ† 𝐡 and 𝐴 β‰  𝐡, then 𝐴 is called a proper submultiset of 𝐡 and denoted as 𝐴 βŠ‚ 𝐡. Definition 2.3 Let 𝐴, 𝐡 ∈ 𝑀𝑆(℧). Then the union and intersection denoted by 𝐴 ⋃ 𝐡 and 𝐴 β‹‚ 𝐡 are respectively defined as follows: 𝐢𝐴 ⋃ 𝐡 (π‘₯) = 𝐢𝐴(π‘₯) ⋁ 𝐢𝐡 (π‘₯) = π‘šπ‘Žπ‘₯{𝐢𝐴(π‘₯), 𝐢𝐡 (π‘₯)} and 𝐢𝐴 β‹‚ 𝐡 (π‘₯) = 𝐢𝐴(π‘₯) β‹€ 𝐢𝐡 (π‘₯) = π‘šπ‘–π‘›{𝐢𝐴(π‘₯), 𝐢𝐡 (π‘₯)}, βˆ€ π‘₯ ∈ ℧. Definition 2.4 Let {𝐴𝑖 }π‘–βˆˆΞ› be an arbitrary family of multisets over ℧. Then for each 𝑖 ∈ Ξ›, β‹ƒπ‘–βˆˆΞ›π΄π‘– = β‹π‘–βˆˆΞ›πΆπ΄π‘– (π‘₯) and β‹‚π‘–βˆˆΞ›π΄π‘– = β‹€π‘–βˆˆΞ›πΆπ΄π‘– (π‘₯). Definition 2.5 The direct product of multisets 𝐴 and 𝐡 is defined as 𝐴 Γ— 𝐡 = {[π‘₯, 𝑦]𝐢𝐴×𝐡 [(π‘₯, 𝑦)] ∣ 𝐢𝐴×𝐡 [(π‘₯, 𝑦)] = 𝐢𝐴(π‘₯)𝐢𝐴(𝑦)}. Definition 2.6 Let ℧ be a non-empty set. The sets of the form 𝐴𝑛 = {π‘₯ ∈ ℧ ∣ 𝐢𝐴(π‘₯) β‰₯ 𝑛, 𝑛 ∈ β„€ +} are called the 𝑛 – level sets of 𝐴. Definition 2.7 Let ℧ and πœ‰ be two non-empty sets and 𝑓 ∢ ℧ ⟢ πœ‰ be a mapping. Then the image 𝑓(𝐴) of a multiset 𝐴 ∈ 𝑀𝑆(℧) is defined as 𝐢𝑓(𝐴)(𝑦) = { ⋁ 𝐢𝐴(π‘₯), 𝑓 βˆ’1(𝑦) β‰  βˆ…π‘“(π‘₯)=𝑦 0, 𝑓 βˆ’1(𝑦) = βˆ… Definition 2.8 Let 𝒳 be a group. By a multigroup over 𝒳 we mean a count function 𝐢𝐴 ∢ 𝒳 ⟢ π’Ÿ such that 𝐢𝐴(π‘₯𝑦) β‰₯ 𝐢𝐴(π‘₯) β‹€ 𝐢𝐴(𝑦), βˆ€ π‘₯, 𝑦 ∈ 𝒳 and 𝐢𝐴(π‘₯ βˆ’1) β‰₯ 𝐢𝐴(π‘₯), βˆ€ π‘₯ ∈ 𝒳. Moreover, an abelian multigroup over 𝒳 is defined as a multigroup satisfying the condition 𝐢𝐴(π‘₯𝑦) β‰₯ 𝐢𝐴(𝑦π‘₯), βˆ€ π‘₯, 𝑦 ∈ 𝒳. Let 𝑒 be the identity element of 𝒳. It can be easily verified that if 𝐴 is a multigroup over a group 𝒳, then 𝐢𝐴(𝑒) β‰₯ 𝐢𝐴(π‘₯) and 𝐢𝐴(π‘₯ βˆ’1) β‰₯ 𝐢𝐴(π‘₯), βˆ€ π‘₯ ∈ 𝒳. We denote the class of all multigroups over 𝒳 by 𝑀𝐺(𝒳). Proposition 2.1 Let 𝐴 ∈ 𝑀𝑆(℧). Then 𝐴 ∈ 𝑀𝐺(𝒳) if and only if 𝐢𝐴(π‘₯𝑦 βˆ’1) β‰₯ 𝐢𝐴(π‘₯) β‹€ 𝐢𝐴(𝑦), βˆ€ π‘₯, 𝑦 ∈ 𝒳. J. A. Awolola 64 Proposition 2.2 Let 𝐴 ∈ 𝑀𝐺(𝒳). Then 𝐴𝑛 , 𝑛 ∈ β„€ + are subgroups of 𝒳. Proposition 2.3 Let 𝒳, 𝒴 be groups and 𝑓 ∢ 𝒳 ⟢ 𝒴 be a homomorphism. If 𝐴 ∈ 𝑀𝐺(𝒳), then 𝑓(𝐴) ∈ 𝑀𝐺(𝒴). 3 Cyclic Multigroup Family Definition 3.1 Let 𝒳 = βŒ©π‘ŽβŒͺ be a cyclic group. If π’œ = {[π‘Žπ‘›]πΆπ’œ (π‘Žπ‘›) ∣ 𝑛 ∈ β„€} is a multigroup, then π’œ is called a cyclic multigroup generated by [π‘Ž]πΆπ’œ (π‘Ž) and denoted by 〈[π‘Ž]πΆπ’œ (π‘Ž)βŒͺ. Proposition 3.1 If π’œ is a cyclic multigroup and π‘š ∈ β„€+, then π’œπ‘š = {([π‘Žπ‘›]πΆπ’œ (π‘Žπ‘›)) π‘š ∣ 𝑛 ∈ β„€} is also a cyclic multigroup. Proof. Let us show that π’œπ‘š satisfies the two conditions in Definition 2.8. We can consider only its count function because the π‘š βˆ’ π‘‘β„Ž power of π’œ effects just only the count function of π’œπ‘š. Since π’œ is a multigroup and πΆπ’œ (π‘Ž) ∈ π’Ÿ, we have (πΆπ’œ (π‘Ž 𝑛1 π‘Žπ‘›2 ))π‘š β‰₯ (πΆπ’œ (π‘Ž 𝑛1 ) β‹€ πΆπ’œ (π‘Ž 𝑛2 )) π‘š = (πΆπ’œ (π‘Ž 𝑛1 ) )π‘š β‹€ (πΆπ’œ (π‘Ž 𝑛2 ) )π‘š and consequently, (πΆπ’œ (π‘Ž βˆ’π‘›)) π‘š β‰₯ (πΆπ’œ (π‘Ž 𝑛)) π‘š . This completes the proof of the proposition. Example 3.1 Let 𝒳 = βŒ©π‘ŽβŒͺ be a cyclic group of order 12 such that πΆπ’œ (π‘Ž 0) = 𝑑0, πΆπ’œ (π‘Ž 4) = πΆπ’œ (π‘Ž 8) = 𝑑1, πΆπ’œ (π‘Ž 2) = πΆπ’œ (π‘Ž 6) = πΆπ’œ (π‘Ž 10) = 𝑑2, πΆπ’œ (π‘₯) = 𝑑3 for other elements π‘₯ ∈ 𝒳, where 𝑑𝑖 ∈ π’Ÿ, 0 ≀ 𝑖 ≀ 3 with 𝑑1 > 𝑑1 > 𝑑2 > 𝑑3. It is clear that π’œ is a multigroup over 𝒳. Thus, π’œ = {[π‘Žπ‘›]πΆπ’œ (π‘Žπ‘›) ∣ 𝑛 ∈ β„€} is a cyclic multigroup generated by [π‘Ž]πΆπ’œ (π‘Ž). Definition 3.2 Let 𝑒 be the identity element of the group 𝒳. We define the identity cyclic multigroup β„° by β„° = {[𝑒]πΆπ’œ (𝑒) ∣ πΆπ’œ (𝑒) β‰₯ πΆπ’œ (π‘Ž 𝑛), 𝑛 ∈ β„€}. Proposition 3.2 If π‘š ≀ 𝑛, then the multigroup π’œπ‘› is a submultigroup of π’œπ‘š. Proof. Clearly π’œπ‘› and π’œπ‘š are multigroups by Definition 2.8. For every π‘Ž ∈ π’Ÿ, π‘Žπ‘š ≀ π‘Žπ‘› implies π’œπ‘š βŠ† π’œπ‘› (since πΆπ’œπ‘š (π‘Ž) ≀ πΆπ’œπ‘› (π‘Ž) βˆ€ π‘Ž ∈ 𝒳). On cyclic multigroup family 65 Proposition 3.3 If π’œπ‘– and π’œπ‘— are cyclic multigroups, and 𝑖 < 𝑗, then π’œπ‘– ⋃ π’œπ‘— is also a cyclic multigroup for any 𝑖, 𝑗 ∈ β„€+. Proof. It is sufficient to consider only count functions. Without loss of generality, let 𝑖 ≀ 𝑗. Since π’œπ‘– βŠ† π’œπ‘— , we have πΆπ’œπ‘– ⋃ π’œπ‘— (π‘Ž π‘›π‘Žπ‘š) = πΆπ’œπ‘– (π‘Ž π‘›π‘Žπ‘š ) ⋁ πΆπ’œπ‘— (π‘Ž π‘›π‘Žπ‘š) = πΆπ’œπ‘— (π‘Ž π‘›π‘Žπ‘š) β‰₯ πΆπ’œπ‘— (π‘Ž 𝑛) β‹€ πΆπ’œπ‘— (π‘Ž π‘š) = πΆπ’œπ‘– ⋃ π’œπ‘— (π‘Ž 𝑛) β‹€ πΆπ’œπ‘– ⋃ π’œπ‘— (π‘Ž π‘š) and πΆπ’œπ‘– β‹ƒπ’œπ‘— (π‘Ž βˆ’π‘›) = πΆπ’œπ‘– (π‘Ž βˆ’π‘›) ⋁ πΆπ’œπ‘— (π‘Ž βˆ’π‘›) = πΆπ’œπ‘– (π‘Ž 𝑛) ⋁ πΆπ’œπ‘— (π‘Ž 𝑛) = πΆπ’œπ‘– ⋃ π’œπ‘— (π‘Ž 𝑛) Hence, π’œπ‘– ⋃ π’œπ‘— is a cyclic multigroup. Proposition 3.4 If π’œπ‘– and π’œπ‘— are cyclic multigroups, then π’œπ‘– β‹‚ π’œπ‘— is also a cyclic multigroup. Proof. Similar to Proposition 3.3. Remark 3.1 Since a cyclic group is an abelian group, it is obvious by Definition 2.8 that the cyclic multigroups π’œπ‘š, π’œπ‘– ⋃ π’œπ‘— and π’œπ‘– β‹‚ π’œπ‘— are also abelian multigroups. Definition 3.3 Let π’œ be a cyclic multigroup, then the following class of cyclic multigroups {π’œ, π’œ2, π’œ3, … , π’œπ‘š, … , β„°} is called the cyclic multigroup family generated by π’œ and denoted by βŒ©π’œβŒͺ. Proposition 3.5 Let βŒ©π’œβŒͺ = {π’œ, π’œ2, π’œ3, … , π’œπ‘š, … , β„°}. Then ⋃ π’œπ‘› = π’œβˆžπ‘›=1 and β‹‚ π’œπ‘›βˆžπ‘›=1 = β„°. Proof. The proof is immediate from Propositions 3.3 and 3.4. Proposition 3.6 Let π’œ be a cyclic multigroup. Then π’œ βŠ† π’œ2 βŠ† π’œ3 βŠ† β‹― βŠ† π’œπ‘› βŠ† β‹― βŠ† β„°. Proof. It is known that πΆπ’œ (π‘Ž) ∈ π’Ÿ. Hence, πΆπ’œ (π‘Ž) ≀ (πΆπ’œ2 (π‘Ž)) 2 , πΆπ’œ (π‘Ž 2) ≀ (πΆπ’œ2 (π‘Ž 2)) 2 , … , πΆπ’œ (π‘Ž 𝑛) ≀ (πΆπ’œ2 (π‘Ž 𝑛)) 2 . J. A. Awolola 66 By Definition 2.2, we have π’œ βŠ† π’œ2 . By generalizing it for any 𝑖, 𝑗 ∈ β„€+ with 𝑖 ≀ 𝑗, we then obtain (πΆπ’œπ‘– (π‘Ž)) 𝑖 ≀ (πΆπ’œπ‘— (π‘Ž)) 𝑗 , (πΆπ’œπ‘– (π‘Ž 2)) 𝑖 ≀ (πΆπ’œπ‘— (π‘Ž 2)) 𝑗 , … , (πΆπ’œπ‘– (π‘Ž 𝑛)) 𝑖 ≀ (πΆπ’œπ‘— (π‘Ž 𝑛 )) 𝑗 . So π’œπ‘– βŠ† π’œπ‘— for any 𝑖, 𝑗 ∈ β„€+ with 𝑖 ≀ 𝑗, which means that π’œ βŠ† π’œ2 βŠ† π’œ3 βŠ† β‹― βŠ† π’œπ‘› βŠ† β‹― . Finally, we have β„° = β‹‚ π’œπ‘›βˆžπ‘›=1 , which is immediate from Proposition 3.5 since Lim π‘›βŸΆβˆž πΆπ’œ (π‘Ž 𝑛) = { 𝑑0, 𝑖𝑓 π‘Ž = 𝑒, 0, 𝑖𝑓 π‘Ž β‰  𝑒. This completes the proof for the required relations. Corollary 3.1 Let βŒ©π’œβŒͺ = {π’œ, π’œ2, π’œ3, … , π’œπ‘š, … , β„°}. Then π’œ < π’œ2 < π’œ3 < β‹― < π’œπ‘š < β‹― < β„°. Proof. The proof is similar to Proposition 3.6. Proposition 3.7 Let πœ‘ be a group homomorphism of a cyclic multigroup π’œ. Then the image of π’œ under πœ‘ is a cyclic multigroup. Proof. It is well known that in the theory of classical cyclic groups, the image of any cyclic group is a cyclic group and the homomorphic image of a multigroup is a multigroup (from Proposition 2.3). From these two results and Definition 2.8, it is clearly seen that the image of π’œ under πœ‘ is a cyclic multigroup. Proposition 3.8 Let 𝒳𝑛 be the 𝑛 βˆ’ level set of the cyclic group 𝒳. If 𝑖, 𝑗 ∈ β„€ + such that 𝑖 < 𝑗, then π’œπ‘› 𝑖 is a subgroup of π’œπ‘› 𝑗 . Proof. It is obvious that sets 𝒳𝑛 and 𝒳𝑛 π‘š are cyclic subgroups of 𝒳𝑛 in crisp sense. Since 𝑖 < 𝑗, then π’œπ‘› 𝑗 (π‘Ž) β‰₯ π’œπ‘› 𝑖 (π‘Ž) β‰₯ 𝑛, βˆ€ π‘Ž ∈ 𝒳𝑛 𝑗 . Thus, 𝒳𝑛 𝑖 βŠ† 𝒳𝑛 𝑗 . Therefore, 𝒳𝑛 𝑖 is a subgroup of 𝒳𝑛 𝑗 . Remark 3.2 From Propositions 3.6 and 3.8, we have that a normal series of 𝒳 is a finite sequence 𝒳𝑛 π‘š, 𝒳𝑛 π‘šβˆ’1, … , 𝒳𝑛 of normal level subgroups of 𝒳 such that 𝒳𝑛 π‘š > 𝒳𝑛 π‘šβˆ’1 > β‹― > 𝒳𝑛 since 𝒳 is a cyclic group. On cyclic multigroup family 67 Proposition 3.9 Let {π’œπ‘š, π’œπ‘šβˆ’1, … , π’œ} be a finite cyclic multigroup family. Then π’œπ‘š Γ— π’œπ‘šβˆ’1 Γ— … Γ— π’œ = π’œπ‘š. Proof. It is easily verified using the definition of product of multigroups and Proposition 3.6. 4 Conclusion The paper introduced the concept of cyclic multigroup family and investigated its related structure properties. For future studies, one can extend this idea to other non-classical algebraic structures such as soft group, rough group, neutrosophic group and smooth group. References [1] S. K. Nazmul, P. Majumdar and S. K. Samanta. On Multisets and Multigroups. Ann. of Fuzzy Math. and Inform., 6, 643-656, 2013. [2] A. Rosenfeld. Fuzzy Groups J. Maths. Analy. Appl., 35, 512-517, 1971. [3] J. A. Awolola and A. M. Ibrahim. Some Results on Multigroups. Quasigroups and Related Systems, 24, 169-177, 2016. [4] A. Syropoulos. Mathematics of Multisets. Springer-Verlag Berlin Heidelberg, 347-358, 2001. [5] D. Singh, A. M. Ibrahim, T. Yohanna and J. N. Singh. An Overview of the Application of Multisets. Novisad Journal of Mathematics, 33, 73-92, 2007. [6] D. E. Knuth. The Art of Computer Programming, Vol. 2: Semi numerical Algorithms, Addison-Wesley, 1981. [7] J. A. Awolola and P. A. Ejegwa. On Some Algebraic Properties of Order of an Element of a Multigroup. Quasigroups and Related Systems, 25, 21-26, 2017. [8] P. A. Ejegwa and A. M. Ibrahim. Direct product of Multigroups and its Generalization. Int. J. Math. Combin., 4, 1-18, 2017. [9] M. Dresher and O. Ore. Theory of Multigroups. American Journal of Mathematics, 60, 705-733, 1938. J. A. Awolola 68 [10] P. A. Ejegwa and A. M. Ibrahim. Some Homomorphic Properties of Multigroups. Buletinul Academiei de Stiinte a Republicii Moldova, 81, 67-76, 2017. [11] A. M. Ibrahim and P. A. Ejegwa. Multigroup Action on Multiset. Ann. Fuzzy Math. Inform., 14(5), 515-526, 2017. [12] B. M. Schein. Multigroup. Journal of Algebra, 111, 114-132, 1987.