International Journal of Mathematics Trends and Technology Volume 66 Issue 11, 52-59, November 2020
ISSN: 2231 – 5373 /doi:10.14445/22315373/IJMTT-V66I11P503 © 2020 Seventh Sense Research Group®
Complete Ideal and n-Ideal of BN-algebras
Sri Gemawati#1, Elsi Fitria#2, Abdul Hadi#3, Musraini M.#4
#
Department of Mathematics, Faculty of Mathematics and Natural Sciences, University of Riau
Bina Widya Campus, Pekanbaru 28293, Indonesia
Abstract. In this paper, the notion of complete ideal and n-ideal of BN-algebra are introduced and some of
related properties are investigated. Also, we discuss the concept of complete ideal and n-ideal of BN-
homomorphism and some of their properties are obtained. In addition, we gave some propositions that
explained some relationships between these ideals types.
Keyword. BN-algebra, ideal, complete ideal, n-ideal, subalgebra
I. INTRODUCTION
J. Neggers and H. S. Kim [10] introduce a new algebraic structure is called a B-algebra. Furthermore, C. B.
Kim and H. S. Kim introduce BG-algebra [6], which is the generalization of B-algebra. Some of types algebras,
such that BM-algebra [7] and BN-algebra [8] are two specializations of B-algebra. The concept of
homomorphism is also studied in abstract algebra. A map 𝜓 ∶ A → B is called a BN-homomorphism if 𝜓(𝑥 ∗
𝑦) = 𝜓(𝑥) ∗ 𝜓(𝑦) for all 𝑥, 𝑦 ∈ 𝐴, where A and B are two BN-algebras. The kernel of 𝜓 denoted by ker 𝜓 is
defined to be the set {𝑥 ∈ 𝐴 ∶ 𝜓(𝑥) = 0𝐵 }. A BN-homomorphism 𝜓 is called a BN-monomorphism, BN-
epimorphism, or BN-isomorphism if one-one, onto, or a bijection, respectively. Kim [8] also discuss the
concept of coxeter algebra. A coxeter algebra is a non-empty set X with a constant 0 and a binary operation “ ∗
” satisfying the following axioms: (B1) 𝑥 ∗ 𝑥 = 0, (B2) 𝑥 ∗ 0 = 𝑥, and (𝑥 ∗ 𝑦) ∗ 𝑧 = 𝑥 ∗ (𝑦 ∗ 𝑧) for all
𝑥, 𝑦, 𝑧 ∈ 𝑋.
Fitria et al. [3] discuss the concept of prime ideal of B-algebra. The results define an ideal and a prime ideal
of B-algebra and some of their properties are investigated. A non-empty subset I of B-algebra X is called an
ideal of X if it satisfies 0 ∈ 𝑋 and if 𝑦 ∈ 𝐼, 𝑥 ∗ 𝑦 ∈ 𝐼 implies 𝑥 ∈ 𝐼 for any 𝑥, 𝑦 ∈ 𝑋. Moreover, I is called a
prime ideal of X if it satisfies 𝐴 ∩ 𝐵 ⊆ 𝐼, then 𝐴 ⊆ 𝐼 or 𝐵 ⊆ 𝐼 for any A and B are two ideals of X. The concept
of ideal also discussed in BN-algebra by Dymek and Walendziak [2]. They obtain the definition of ideal in BN-
algebra is equivalent to B-algebra, but some of their properties are different. Also, the properties of kernel are
obtained, such that the kernel 𝜓 is an ideal in X. In addition, Dymek and Walendziak investigate the kernel 𝜓 of
BN-algebra to BM-algebra, such that obtained kernel 𝜓 be a normal ideal of BN-algebra.
The concepts of ideals of B-algebras are discussed by Abdullah [1], those are a complete ideal (briefly c-
ideal) and an n-ideal in B-algebras. The results define a c-ideal and an n-ideal in B-algebra, and some of related
properties are investigated. They obtain every normal of B-algebra is both c-ideal and n-ideal. Using the same
ideas as previous studies [1] and [2], the concepts of c-ideal and n-ideal in B-algebras to BN-algebra will be
applied.
The objective of this paper is to construct the concept of complete ideal and n-ideal of BN-algebras, and then
investigate complete ideal and n-ideal of normal ideal and BN-homomorphism. Finally, we study relationship
between these ideals types.
II. PRELIMINARIES
In this section, we recall the notion of B-algebra, BM-algebra, and BN-algebra and review some properties
which we will need in the next section. Some definitions and theories related to c-ideal and n-ideal of BN-
algebra that have been discussed by several authors [1, 2, 3, 6, 7, 8, 10] will also be presented.
Definition 2.1. [10] A B-algebra is a non-empty set X with a constant 0 and a binary operation “ ∗ ” satisfying
the following axioms:
(B1) 𝑥 ∗ 𝑥 = 0,
(B2) 𝑥 ∗ 0 = 𝑥,
(B3) (𝑥 ∗ 𝑦) ∗ 𝑧 = 𝑥 ∗ (𝑧 ∗ (0 ∗ 𝑦)),
for all 𝑥, 𝑦, 𝑧 ∈ 𝑋.
A non-empty subset S of B-algebra (X ; ∗, 0) is called a subalgebra of X if 𝑥 ∗ 𝑦 ∈ 𝑆, for all 𝑥, 𝑦 ∈ 𝑆.
Definition 2.2. [8] An algebra (X ; ∗, 0) is said to be 0-commutative if x ∗ (0 ∗ y) = y ∗ (0 ∗ x) for any x, y ∈ X.
Example 1. Let 𝐴 = {0, 1, 2} be a set with Cayley’s table as seen in Table 1.
This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Sri Gemawati et al. / IJMTT, 66(10), 52-59, 2020
Table 1: Cayley’s table for (A; ∗, 0)
* 0 1 2
0 0 2 1
1 1 0 2
2 2 1 0
From Table 1 we get the value of main diagonal is 0, such that A satisfies x ∗ x = 0 for all 𝑥 ∈ 𝐴 (B1 axiom).
In the second column, we see that for all 𝑥 ∈ 𝐴, x ∗ 0 = x (B2 axiom) and it also satisfies (x ∗ y) ∗ z = x ∗ (z ∗ (0
∗ y)), for all 𝑥, 𝑦, 𝑧 ∈ 𝐴. Hence, (A; ∗, 0) be a B-algebra. It easy to check that (A; ∗, 0) satisfies x ∗ (0 ∗ y) = y ∗
(0 ∗ x), for all 𝑥, 𝑦, 𝑧 ∈ 𝐴. Hence, A be a 0-commutative B-algebra.
Definition 2.3. [3] A non-empty subset I of B-algebra (X; ∗, 0) is called an ideal of X if it satisfies
(i). 0 ∈ 𝐼,
(ii). 𝑥 ∗ 𝑦 ∈ 𝐼 and 𝑦 ∈ 𝐼 imply 𝑥 ∈ 𝐼 for any 𝑥, 𝑦 ∈ 𝑋.
Definition 2.4. [1] A non-empty subset I of B-algebra (X; ∗, 0) is said to be complete ideal (briefly c-ideal) of X
if it satisfies
(i). 0 ∈ 𝐼,
(ii). 𝑥 ∗ 𝑦 ∈ 𝐼 for all 𝑦 ∈ 𝐼 such that 𝑦 ≠ 0 implies 𝑥 ∈ 𝐼.
Definition 2.5. [1] A non-empty subset I of B-algebra (X; ∗, 0) is said to be n-ideal of X if it satisfies
(i). 0 ∈ 𝐼,
(ii). 𝑥 ∗ 𝑦 ∈ 𝐼 and 𝑦 ∈ 𝐼 implies there exist 𝑛 ∈ 𝑍 + , 𝑥 𝑛 ≠ 0 such that 𝑥 𝑛 ∈ 𝐼, where 𝑥 𝑛 =
((𝑥 ∗ 𝑥) ∗ 𝑥) ∗ 𝑥 ∗ … ∗ 𝑥.
Definition 2.6. [6] A BG-algebra is a non-empty set X with a constant 0 and a binary operation “ ∗ ” satisfying
the following axioms:
(B1) 𝑥 ∗ 𝑥 = 0,
(B2) 𝑥 ∗ 0 = 𝑥,
(BG) (𝑥 ∗ 𝑦) ∗ (0 ∗ 𝑦) = 𝑥,
for all 𝑥, 𝑦 ∈ 𝑋.
Example 2. Let 𝑋 = {0, 1, 2, 3} be a set with Cayley’s table as seen in Table 2.
Table 2: Cayley’s table for (X ; ∗, 0)
* 0 1 2 3
0 0 1 2 3
1 1 0 3 2
2 2 3 0 1
3 3 2 1 0
Then, it can be shown that (X; ∗, 0) is a BG-algebra.
Definition 2.7. [7] A BM-algebra is a non-empty set X with a constant 0 and a binary operation “∗” satisfying
the following axioms:
(A1) 𝑥 ∗ 0 = 𝑥,
(A2) (𝑧 ∗ 𝑥) ∗ (𝑧 ∗ 𝑦) = 𝑦 ∗ 𝑥 for all 𝑥, 𝑦, 𝑧 ∈ 𝑋.
Example 3. Let 𝑋 = {0, 1, 2} be a set with Cayley’s table as seen in Table 3.
53
Sri Gemawati et al. / IJMTT, 66(10), 52-59, 2020
Table 3: Cayley’s table for (𝑋; ∗, 0)
* 0 1 2
0 0 2 1
1 1 0 2
2 2 1 0
From the Table 3, we have the values in the second column satisfying 𝑥 ∗ 0 = 𝑥 for all 𝑥, 𝑦 ∈ 𝑋 (A1 axiom)
and they also satisfying (𝑧 ∗ 𝑥) ∗ (𝑧 ∗ 𝑦) = 𝑦 ∗ 𝑥 for all 𝑥, 𝑦, 𝑧 ∈ 𝑋 (A2 axiom). Hence, (𝑋; ∗, 0) is a BM-
algebra.
Theorem 2.8. [7] Every BM-algebra is a B-algebra.
Proof. Theorem 2.8 has been proved in [7].
The converse of Theorem 2.8 does not hold in general.
Proposition 2.9. [7] If (A; ∗, 0) be a BM-algebra, then
(i). 𝑥 ∗ (𝑥 ∗ 𝑦) = 𝑦,
(ii). If 𝑥 ∗ 𝑦 = 0, then 𝑥 = 𝑦,
for all 𝑥, 𝑦 ∈ 𝐴.
Proof. Proposition 2.9 has been proved in [7].
Definition 2.10. [8] A BN-algebra is a non-empty set X with a constant 0 and a binary operation “ ∗ ” satisfying
the following axioms:
(BN1) 𝑥 ∗ 𝑥 = 0,
(BN2) 𝑥 ∗ 0 = 𝑥,
(BN3) (𝑥 ∗ 𝑦) ∗ 𝑧 = (0 ∗ 𝑧) ∗ (𝑦 ∗ 𝑥),
for all 𝑥, 𝑦, 𝑧 ∈ 𝑋,
Example 4. Let 𝑋 = {0, 1, 2, 3} be a set with Cayley’s table as seen in Table 4.
Table 4: Cayley’s table for (𝑋; ∗, 0)
* 0 1 2 3
0 0 1 2 3
1 1 0 1 1
2 2 1 0 1
3 3 1 1 0
Then, it can be shown that (X ; ∗, 0) is a BN-algebra.
Theorem 2.11. [8] If (X ; ∗, 0) is a BN-algebra, then X be a 0-commutative.
Proof. Theorem 2.11 has been proved in [8].
The converse of Theorem 2.11 does not hold in general.
Definition 2.12. [2] Let (A; ∗, 0) be a BN-algebra. We define a binary relation ≤ on A by 𝑥 ≤ 𝑦 if and only if
𝑥 ∗ 𝑦 = 0.
It is easy to see that, for any 𝑥 ∈ 𝐴, if 𝑥 ≤ 0, then 𝑥 = 0.
Proposition 2.13. [8] If (A; ∗, 0) be a BN-algebra, then
(i). 0 ∗ (0 ∗ 𝑥) = 𝑥,
54
Sri Gemawati et al. / IJMTT, 66(10), 52-59, 2020
(ii). 0 ∗ (𝑥 ∗ 𝑦) = 𝑦 ∗ 𝑥,
(iii). 𝑦 ∗ 𝑥 = (0 ∗ 𝑥) ∗ (0 ∗ 𝑦),
(iv). If 𝑥 ∗ 𝑦 = 0, then 𝑦 ∗ 𝑥 = 0,
(v). If 0 ∗ 𝑥 = 0 ∗ 𝑦, then 𝑥 = 𝑦,
for all 𝑥, 𝑦 ∈ 𝐴.
Proof. Proposition 2.13 has been proved in [8].
Definition 2.14. [2] A non-empty subset S of BN-algebra (X; ∗, 0) is called a subalgebra of X if it satisfies
𝑥 ∗ 𝑦 ∈ 𝑆 for all 𝑥, 𝑦 ∈ 𝑆. A non-empty subset N of X is called a normal if it satisfies (𝑥 ∗ 𝑎) ∗ (𝑦 ∗ 𝑏) ∈ 𝑁, for
any 𝑥 ∗ 𝑦, 𝑎 ∗ 𝑏 ∈ 𝑁.
Let (𝑋; ∗, 0) and (𝑌; ∗, 0) be two BN-algebras. A map 𝜓: 𝑋 → 𝑌 is called a BN-homomorphism if
𝜓(𝑎 ∗ 𝑏) = 𝜓(𝑎) ∗ 𝜓(𝑏) for any 𝑎, 𝑏 ∈ 𝑋. The kernel of 𝜓 denoted by ker 𝜓 is defined to be 𝑘𝑒𝑟 𝜓 = {𝑥 ∈
𝑋: 𝜓(𝑥) = 0𝑌 }. A BN-homomorphism 𝜓 is called a BN-monomorphism, BN-epimorphism, or BN-isomorphism
if one-one, onto, or a bijection function, respectively.
Proposition 2.15. [2] Let A be a BN-algebra and let 𝑆 ⊆ 𝐴. Then S is a normal subalgebra of 𝐴 if and only if 𝑆
is a normal ideal.
Proof. Proposition 2.15 has been proved in [2].
III. COMPLETE IDEAL OF BN-ALGEBRAS
In this section, we get definition of complete ideal briefly c-ideal in BN-algebra and its properties are
obtained. The concept can be extended to the BN-homomorphism. Then, we have some of the related properties.
Definition 3.1. A non-empty subset I of BN-algebra (X; ∗, 0) is said to be complete ideal (briefly c-ideal) of X if
it satisfies
(i). 0 ∈ 𝐼,
(ii). 𝑥 ∗ 𝑦 ∈ 𝐼 for all 𝑦 ∈ 𝐼 such that 𝑦 ≠ 0 implies 𝑥 ∈ 𝐼 for any 𝑥, 𝑦 ∈ 𝑋.
Example 5. Let ℝ be the set of real numbers and let (ℝ; ∗, 0) be the algebra with the operation ∗ defined by
𝑥 if 𝑦 = 0,
𝑥∗𝑦 ={ 𝑦 if 𝑥 = 0,
0 otherwise.
Then, ℝ is a BN-algebra. Moreover, {0} and ℝ be a c-ideal of (ℝ; ∗, 0).
Example 6. Let 𝐴 = {0, 1, 2, 3} be a set with Cayley’s table as seen in Table 5.
Table 5: Cayley’s table for (𝐴; ∗, 0)
* 0 1 2 3
0 0 1 2 3
1 1 0 3 0
2 2 3 0 2
3 3 0 2 0
Then, it can be shown that (𝐴; ∗, 0) is a BN-algebra. We can be prove that {0} and A are ideals of (𝐴; ∗, 0),
and {0}, {0, 1, 3}, and A are c-ideals of (𝐴; ∗, 0).
Proposition 3.2. Let (𝐴; ∗, 0) be a BN-algebra and 𝐼 ⊆ 𝐴. If 𝐼 be an ideal then 𝐼 be a c-ideal of 𝐴.
Proof. Let 𝐼 be an ideal of 𝐴. Let 𝑥 ∗ 𝑦 ∈ 𝐼 for all 𝑦 ∈ 𝐼 and 𝑦 ≠ 0, then
(i) For 𝐼 = {0}, it obviously that 𝐼 is a c-ideal of 𝐴.
55
Sri Gemawati et al. / IJMTT, 66(10), 52-59, 2020
(ii) For 𝐼 ≠ {0} there exist 𝑦 ∈ 𝐼 such that 𝑦 ≠ 0 and 𝑥 ∗ 𝑦 ∈ 𝐼. Since I is an ideal, then 𝑥 ∈ 𝐼. Thus, I is a
c-ideal of A.
Corollary 3.3. Every a normal ideal of BN-algebra is a normal c-ideal.
Proof. Let (𝐴; ∗, 0) be a BN-algebra and let 𝐼 be an ideal of 𝐴. By Proposition 3.2 we obtain I is a c-ideal of A.
Since I is a normal, then I is a normal c-ideal of A.
Proposition 3.4. Let (𝐴; ∗, 0) be a BN-algebra and let 𝐼 be a c-ideal of 𝐴. If 𝑥 ≤ 𝑦, for all 𝑦 ∈ 𝐼 and 𝑦 ≠ 0,
then 𝑥 ∈ 𝐼.
Proof. Let 𝑥 ≤ 𝑦 for all 𝑦 ∈ 𝐼 and 𝑦 ≠ 0, then from Definition 2.12 we have 𝑥 ∗ 𝑦 = 0 ∈ 𝐼, such that 𝑥 ∈ 𝐼.
Example 7. Let 𝐴 = {0, 1, 2, 3} be a set with Cayley’s table as seen in Table 6.
Table 6: Cayley’s table for (𝐴; ∗, 0)
* 0 1 2 3
0 0 1 2 3
1 1 0 1 1
2 2 1 0 1
3 3 1 1 0
Then, (A; *, 0) is a BN-algebra and {0}, {0,2}, {0,3}, {0,2,3}, {0,1,2,3} are all of c-ideals of A. Moreover,
I = {0, 2, 3} be a c-ideal of A, but it is not a subalgebra of A, since 2, 3 ∈ 𝐼, 2 ∗ 3 = 1 ∉ 𝐼 and 𝑆 = {0,1} be a
subalgebra of A, but it is not a subalgebra of A, since 2 ∗ 1 = 1 ∈ 𝑆 and 1 ∈ 𝑆, but 2 ∉ 𝑆.
Example 8. From BN-algebra in Example 3, we have {0} and A = {0, 1, 2, 3} are c-ideals of A and it can be
shown that A is a normal of A, and {0} is also a normal of A, however it does not hold in general.
As an illustration the following example is given.
Example 9. Let 𝐴 = {0, 1, 2, 3} be a set with Cayley’s table as seen in Table 7.
Table 7: Cayley’s table for (𝐴; ∗, 0)
* 0 1 2 3
0 0 1 2 3
1 1 0 3 0
2 2 3 0 2
3 3 0 2 0
It can be shown that (A ; *, 0) be a BN-algebra. Then, {0} and A are c-ideals of A. A is a normal, but {0} is
not a normal, since 2 ∗ 2 = 0 ∈ 𝐼 and 1 ∗ 3 = 0 ∈ 𝐼, however (2 ∗ 1) ∗ (2 ∗ 3) = 3 ∗ 2 = 2 ∉ 𝐼.
Theorem 3.5. Let A be a BN-algebra and 𝑆 ⊆ 𝐴. S is a normal subalgebra if and only if it is a normal c-ideal.
Proof. Let S be a normal subalgebra of A, it is clearly that 0 ∈ 𝑆. If 𝑥 ∗ 𝑦 ∈ 𝑆 and for all 𝑦 ∈ 𝑆, 𝑦 ≠ 0, then
0 ∗ 𝑦 ∈ 𝑆. Since S be a normal obtained (𝑥 ∗ 0) ∗ (𝑦 ∗ 𝑦) ∈ 𝑆 and from BN1 and BN2 axioms, we get (𝑥 ∗ 0) ∗
(𝑦 ∗ 𝑦) = 𝑥 ∈ 𝑆. Therefore, S is a c-ideal of A and since S be a normal, it clearly that S is a normal c-ideal of A.
Conversely, let 𝑥, 𝑦 ∈ 𝑆, since S be a normal, then (𝑥 ∗ 𝑦) ∗ (𝑥 ∗ 0) ∈ 𝑆. From BN2 axiom we get 0 ∈ 𝑆 and
𝑥 ∗ 𝑦 ∈ 𝑆. Thus, it shows that S is a normal subalgebra of A.
Lemma 3.6. Let I be a normal c-ideal of BN-algebra A and 𝑥, 𝑦 ∈ 𝐴, then
(i) 𝑥 ∈ 𝐼 ⇒ 0 ∗ 𝑥 ∈ 𝐼,
(ii) 𝑥 ∗ 𝑦 ∈ 𝐼 ⇒ 𝑦 ∗ 𝑥 ∈ 𝐼.
56
Sri Gemawati et al. / IJMTT, 66(10), 52-59, 2020
Proof.
(i). Let 𝑥 ∈ 𝐼, then 𝑥 = 𝑥 ∗ 0 ∈ 𝐼. Since I be a normal, then (0 ∗ 𝑥) ∗ (0 ∗ 0) ∈ 𝐼. From BN1 and BN2
axioms we get (0 ∗ 𝑥) ∗ (0 ∗ 0) = 0 ∗ 𝑥 ∈ 𝐼.
(ii). Let 𝑥 ∗ 𝑦 ∈ 𝐼 and by (i) obtained 0 ∗ (𝑥 ∗ 𝑦) ∈ 𝐼 . From Proposition 2.13 (ii), we obtain 0 ∗
(𝑥 ∗ 𝑦) = 𝑦 ∗ 𝑥, such that 𝑦 ∗ 𝑥 ∈ 𝐼.
Remark 3.7.
1. The intersection of two c-ideals of BN-algebra is a c-ideal of BN-algebra.
2. The union of ascending sequence of c-ideal is a c-ideal of BN-algebra.
Let (𝐴; ∗ ,0) be a BN-algebra. If a self-map 𝑓 be a homomorphism of 𝐴, then 𝑓(0) = 𝑓(0 ∗ 0) =
𝑓(0) ∗ 𝑓(0) = 0 and ker 𝑓 = {𝑥 ∈ 𝐴: 𝑓(𝑥) = 0}.
Theorem 3.8. If 𝑓: 𝐴 → 𝐴 be a homomorphism of 𝐴 to itself, then ker 𝑓 is a c-ideal of 𝐴.
Proof. Let 𝑓 be a homomorphism of 𝐴 to itself, then it is clearly that 0 ∈ ker 𝑓. If 𝑥 ∗ 𝑦 ∈ ker 𝑓 and for all 𝑦 ∈
ker 𝑓, 𝑦 ≠ 0 then
0 = 𝑓(𝑥 ∗ 𝑦)
= 𝑓(𝑥) ∗ 𝑓(𝑦)
= 𝑓(𝑥) ∗ 0
0 = 𝑓(𝑥),
such that 𝑥 ∈ ker 𝑓. Thus, we get ker 𝑓 is a c-ideal of 𝐴.
Remark 3.9. The kernel of a homomorphism is not always a normal c-ideal. Let (𝐴; ∗, 0) be a BN-algebra
given in Example 6. Clearly, c-𝑖𝑑𝐴 : 𝐴 → 𝐴 is a homomorphism and the c-ideal ker (c-𝑖𝑑𝐴 ) is not normal of 𝐴.
Theorem 3.10. Let (𝐴; ∗, 0𝐴 ) be a BN-algebra and let (𝐵; ∗, 0𝐵 ) be a BM-algebra. Let 𝑓: 𝐴 → 𝐵 be a
homomorphism from 𝐴 into 𝐵, then ker 𝑓 is a normal c-ideal of 𝐴.
Proof. Let 𝑓 be a homomorphism from 𝐴 into 𝐵. From Theorem 3.8 it follows that ker 𝑓 is a c-ideal of 𝐴. Let
𝑥, 𝑦, 𝑎, 𝑏 ∈ 𝐴 and 𝑥 ∗ 𝑦, 𝑎 ∗ 𝑏 ∈ ker 𝑓, then 0𝐵 = 𝑓(𝑥 ∗ 𝑦) = 𝑓(𝑥) ∗ 𝑓(𝑦). By Proposition 2.9 (ii) it follows that
𝑓(𝑥) = 𝑓(𝑦) and 𝑓(𝑎) = 𝑓(𝑏), such that
𝑓[(𝑥 ∗ 𝑎) ∗ (𝑦 ∗ 𝑏)] = 𝑓(𝑥 ∗ 𝑎) ∗ 𝑓(𝑦 ∗ 𝑏)
= [𝑓(𝑥) ∗ 𝑓(𝑎)] ∗ [𝑓(𝑦) ∗ 𝑓(𝑏)]
= [𝑓(𝑥) ∗ 𝑓(𝑎)] ∗ [𝑓(𝑥) ∗ 𝑓(𝑎)]
= 0𝐵 .
Then, we get (𝑥 ∗ 𝑎) ∗ (𝑦 ∗ 𝑏) ∈ ker 𝑓. Hence, it shows that ker 𝑓 is a normal c-ideal of 𝐴.
Theorem 3.11. Let (𝐴; ∗, 0𝐴 ) be a BM-algebra and let (𝐵; ∗, 0𝐵 ) be a BN-algebra. If 𝑓: 𝐴 → 𝐵 be a
homomorphism of 𝐴 to 𝐵, then ker 𝑓 is a c-ideal of 𝐴.
Proof. Let 𝑓 be a homomorphism of 𝐴 to 𝐵, then it is clearly that 0𝐴 ∈ ker 𝑓. If 𝑥 ∗ 𝑦 ∈ ker 𝑓 and for all 𝑦 ∈
ker 𝑓, 𝑦 ≠ 0𝐴 then
0𝐵 = 𝑓(𝑥 ∗ 𝑦)
= 𝑓(𝑥) ∗ 𝑓(𝑦)
= 𝑓(𝑥) ∗ 0𝐵
0𝐵 = 𝑓(𝑥),
such that 𝑥 ∈ ker 𝑓. Thus, we get ker 𝑓 is a c-ideal of 𝐴.
IV. n-IDEAL OF BN-ALGEBRA
In this section, we get definition of n-ideal in BN-algebra and its properties are obtained. Then, we have
some of the related properties.
Definition 4.1. A non-empty subset I of BN-algebra (A; ∗, 0) is said to be n-ideal of A if it satisfies
(i). 0 ∈ 𝐼, and
(ii). 𝑥 ∗ 𝑦 ∈ 𝐼 and 𝑦 ∈ 𝐼, there exist 𝑛 ∈ 𝑍 + , 𝑥 𝑛 ≠ 0 such that 𝑥 𝑛 ∈ 𝐼, where 𝑥 𝑛 = ((𝑥 ∗ 𝑥) ∗ 𝑥) ∗ 𝑥 ∗ … ∗
𝑥.
57
Sri Gemawati et al. / IJMTT, 66(10), 52-59, 2020
Example 10. Let (𝐴; ∗, 0) be a BN-algebra given in Example 6, then 𝐼 = {0, 1, 3} is an n-ideal of 𝐴, since 0 ∈ 𝐼
and 1 ∗ 3 = 0 ∈ 𝐼, 3 ∈ 𝐼, there exist 3 ∈ 𝑍 + such that 13 = (1 ∗ 1) ∗ 1 = 0 ∗ 1 = 1 ∈ 𝐼. It follows that
{0}, {0,1,3}, and {0,1,2,3} are n-ideals of 𝐴.
Proposition 4.2. Let (𝐴; ∗, 0) be a BN-algebra and 𝐼 ⊆ 𝐴. If 𝐼 be an ideal then 𝐼 be an n-ideal of 𝐴.
Proof. Let 𝑥 ∗ 𝑦 ∈ 𝐼 and 𝑦 ∈ 𝐼. Since 𝐼 is an ideal of 𝐴, then 𝑥 ∈ 𝐼. This shows that 𝐼 is an n-ideal where 𝑛 = 1.
This complete the proof.
The converse of Proposition 4.2 is not true in general.
Corollary 4.3. Every a normal ideal of BN-algebra is a normal n-ideal.
Proof. Let (𝐴; ∗, 0) be a BN-algebra and let 𝐼 be an ideal of 𝐴. By Proposition 4.2 we obtain I is an n-ideal of A.
Since I is a normal, then I is a normal n-ideal of A.
Proposition 4.4. Every normal subalgebra 𝑆 of BN-algebra 𝐴 is a normal n-ideal.
Proof. It is directly from Proposition 2.15 and Corollary 4.3.
Theorem 4.5. Let (𝐴; ∗, 0) be a BN-algebra. If 𝑓: 𝐴 → 𝐴 be a homomorphism of 𝐴 to itself, then ker 𝑓 is a n-
ideal of 𝐴.
Proof. Let 𝑓 be a homomorphism of 𝐴 to itself, then it is clearly that 0 ∈ ker 𝑓. If 𝑥 ∗ 𝑦 ∈ ker 𝑓 and 𝑦 ∈ ker 𝑓,
then
0 = 𝑓(𝑥 ∗ 𝑦)
= 𝑓(𝑥) ∗ 𝑓(𝑦)
= 𝑓(𝑥) ∗ 0
0 = 𝑓(𝑥).
Thus, there exist 1 ∈ 𝑍 + such that 𝑥 1 = 𝑥 ∈ ker 𝑓. Thus, ker 𝑓 is an n-ideal of 𝐴.
Theorem 4.6. Let (𝐴; ∗, 0𝐴 ) be a BN-algebra and let (𝐵; ∗, 0𝐵 ) be a BM-algebra. Let 𝑓: 𝐴 → 𝐵 be a
homomorphism from 𝐴 into 𝐵, then ker 𝑓 is a normal n-ideal of 𝐴.
Proof. Let 𝑓 be a homomorphism from 𝐴 into 𝐵. Since every BM-algebra is a BN-algebra, from Theorem 4.5 it
follows that ker 𝑓 is an n-ideal of 𝐴. Let 𝑥, 𝑦, 𝑎, 𝑏 ∈ 𝐴 and 𝑥 ∗ 𝑦, 𝑎 ∗ 𝑏 ∈ ker 𝑓, then 0𝐵 = 𝑓(𝑥 ∗ 𝑦) = 𝑓(𝑥) ∗
𝑓(𝑦). By Proposition 2.9 (ii) it follows that 𝑓(𝑥) = 𝑓(𝑦) and 𝑓(𝑎) = 𝑓(𝑏), such that
𝑓[(𝑥 ∗ 𝑎) ∗ (𝑦 ∗ 𝑏)] = 𝑓(𝑥 ∗ 𝑎) ∗ 𝑓(𝑦 ∗ 𝑏)
= [𝑓(𝑥) ∗ 𝑓(𝑎)] ∗ [𝑓(𝑦) ∗ 𝑓(𝑏)]
= [𝑓(𝑥) ∗ 𝑓(𝑎)] ∗ [𝑓(𝑥) ∗ 𝑓(𝑎)]
= 0𝐵 .
Then, we get (𝑥 ∗ 𝑎) ∗ (𝑦 ∗ 𝑏) ∈ ker 𝑓. Hence, it shows that ker 𝑓 is a normal n-ideal of 𝐴.
Definition 4.7. A non-empty subset I of BN-algebra (A; ∗, 0) is said to be complete n-ideal briefly c-n-ideal of
A, if it satisfies
(i). 0 ∈ 𝐼, and
(ii). 𝑥 ∗ 𝑦 ∈ 𝐼 for all 𝑦 ≠ 0 ∈ 𝐼 ⇒ 𝑥 𝑛 ≠ 0 ∈ 𝐼 for some 𝑛 ∈ 𝑍 + .
Proposition 4.8. Every c-ideal of BN-algebra 𝐴 is a c-n-ideal of 𝐴.
Proof. Let I be a c-ideal, then 0 ∈ 𝐼. Let 𝑥 ∗ 𝑦 ∈ 𝐼 for all 𝑦 ≠ 0 ∈ 𝐼, since I is a c-ideal, then 𝑥 ∈ 𝐼. It follows
that A is a complete n-ideal of A.
V. CONCLUSION
In this paper, the notions of c-ideal and n-ideal of BN-algebra are defined and some of their properties are
obtained. Furthermore, we define a c-n-ideal in BN-algebra and we have every c-ideal of BN-algebra is a c-n-
ideal.
58
Sri Gemawati et al. / IJMTT, 66(10), 52-59, 2020
REFERENCES
[1] H. K. Abdullah, Complete Ideal and n-Ideal of B-algebra, Applied Mathematical Sciences, 11(2017), 1705 – 1713.
[2] G. Dymek and A. Walendziak, (Fuzzy) Ideals of BN-Algebras, Scientific World Journal, (2015), 1-9.
[3] E. Fitria, S. Gemawati, and Kartini, Prime Ideals in B-Algebras, International Journal of Algebra, 11(2017), 301-309.
[4] Y. Huang, Irreducible Ideals in BCI-algebras, Demonstratio Mathematica, 37(2004), 3–8.
[5] K. Iseki and S. Tanaka, Ideal Theory of BCK-algebras, Mathematica Japonica, 21(1976), 351–366.
[6] C. B. Kim and H. S. Kim, On BG-algebras, Demonstratio Mathematica, 41(2003), 497-505.
[7] C. B. Kim and H. S. Kim, On BM-algebras, Scientiae Mathematicae Japonicae Online, 2006, 215–221.
[8] C. B. Kim, On BN-algebras, Kyungpook Math, 53 (2013), 175-184.
[9] H. S. Kim, Y. H. Kim, dan J. Neggers, Coxeter Algebras and Pre-Coxeter Algebras in Smarandache Setting, Honam
Mathematical Journal, 26(2004), 471–481.
[10] J. Neggers and H. S. Kim, On B-algebras, Mate. Vesnik, 54 (2002), 21-29.
[11] A. Walendziak, BM-algebras and Related Topics, Mathematica Slovaca, 64(2014), 1075–1082.
[12] A. Walendziak, On 𝐵𝐹-algebras, Mathematica Slovaca, 57(2007), 119–128.
59