This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
1. Introduction
A lattice is an advanced abstract structure that has been studied in abstract algebra during last few decades. Birkhoff introduced the concept of lattice theory in 1940 [1]. Lattice is generalization of Boolean and fuzzy algebras. Latter on Gratzer and Schmidt worked together and showed their interest in the development of lattice theory [2]. In 1955, Helgason introduced the concept of multiplier in Banach Algebra [3]. The idea of multiplier in lattice was given by Larsen [4] in 1971, and Cornish extended this concept of multiplier in distributive lattice [5].
In 1981, the idea of ADLs was initiated by Swamy and Rao [6]. An almost distributive lattice satisfies all the properties of distributive lattice except commutativity of
Now, we have generalized certain properties of
2. Preliminaries
Definition 1.
(see [6]). An algebra
(i)
(ii)
(iii)
(iv)
(v)
(vi)
(vii)
(viii)
Lemma 1.
(see [6]). Let
(i)
(ii)
(iii)
(iv)
(v)
(vi)
(vii)
Definition 2.
(see [6]). For any
Lemma 2.
(see [6]). Let
(i)
(ii)
(iii)
(iv)
Definition 3.
(see [6]). Let
Lemma 3.
(see [6]). Let
(i)
(ii)
(iii)
Definition 4.
(see [6]). Let
If
Lemma 4.
(see [6]). For any
(i)
(ii)
(iii)
Definition 5.
(see [7]). Let
Definition 6.
(see [7]). Let
Definition 7.
(see [7]). Let
Definition 8.
(see [7]). Let
3.
Definition 9.
Let
Example 1.
Let
Proof.
Let
Let
Lemma 5.
Let
(i)
(ii)
Proof.
(i) Since
(ii) Let
Definition 10.
Let
Definition 11.
Let
Lemma 6.
Let
Proof.
Let
Definition 12.
Let
Proposition 1.
Let
Proof.
Let
Lemma 7.
Let
Proof.
Let
By using equation (3), we have
Theorem 1.
Let
Proof.
Suppose
Since
Proposition 2.
Let
Proof.
Let
Proposition 3.
Let
Proof.
Let
Let
Proposition 4.
Let
Proof.
Let
Then, we have to show that
Let
Theorem 2.
Let
Proof.
Let
Theorem 3.
Let
Proof.
Let
4. Conclusion
In this paper, we have generalized the idea of multiplier to
Authors’ Contributions
Ying Wang analyzed the results, drafted the final version of the paper, and arranged funding for this paper. Abdul Rauf Khan and Zafar Ullah proved the results. Zahid Karim and Abid Mahmoob approved the results and supervised this work. Mamoona Karim wrote the first version of the paper.
Acknowledgments
This work was supported by the National Key R & D Program of China (no. 2018YFB1005104), the Guangzhou Academician and Expert Workstation (no. 20200115-9), and Key Disciplines of Guizhou Province-Computer Science and Technology (no. ZDXK [2018]007). This work is supported by the Innovation Projects of Universities in Guangdong Province (No. 2020KTSCX215).
[1] B. Garrett, Lattice Theory, 1940.
[2] G. George, Lattice Theory: Foundation, 2011.
[3] S. Helgason, "Multipliers of banach algebras," The Annals of Mathematics, vol. 64 no. 2, pp. 240-254, DOI: 10.2307/1969971, 1956.
[4] R. Larsen, An Introduction to the Theory of Multipliers, 2012.
[5] W. H. Cornish, "The multiplier extension of a distributive lattice," Journal of Algebra, vol. 32 no. 2, pp. 339-355, DOI: 10.1016/0021-8693(74)90143-4, 1974.
[6] U. M. Swamy, G. C. Rao, "Almost distributive lattices," Journal of the Australian Mathematical Society, vol. 31 no. 1, pp. 77-91, DOI: 10.1017/s1446788700018498, 1981.
[7] K. H. Kim, "A note on multipliers in almost distributive lattices," The Korean Journal of Mathematics, vol. 27 no. 2, pp. 425-435, DOI: 10.11568/kjm.2019.27.2.425, 2019.
[8] D. C. Mayer, "Construction and classification of p -ring class fields modulo p -admissible conductors," Open Journal of Mathematical Sciences, vol. 5 no. 1, pp. 162-171, DOI: 10.30538/oms2021.0153, 2021.
[9] D. A. Romano, "Prime and irreducible filters in strong quasi-ordered residuated systems," Open Journal of Mathematical Scineces, vol. 5 no. 1, pp. 172-181, DOI: 10.30538/oms2021.0154, 2021.
[10] D. A. Romano, "Strong quasi-ordered residuated system," Open Journal of Mathematical Sciences, vol. 5 no. 1, pp. 73-79, DOI: 10.30538/oms2021.0146, 2021.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
Copyright © 2021 Ying Wang et al. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. https://creativecommons.org/licenses/by/4.0/
Abstract
In this paper, we initiate the concept of
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
Details

1 Software Engineering Institute of Guangzhou, Guangzhou, China; Institute of Computing Science and Technology, Guangzhou University, Guangzhou, China
2 Department of Mathematics, Division of Science and Technology, University of Education, Lahore, Pakistan
3 Department of Mathematics, Khwaja Fareed University of Engineering and Information Technology, Rahim Yar Khan 64200, Pakistan