Further Results on Derivations of Ranked Bigroupoids

Abstract

Further properties on (𝑋,∗,&)-self-(co)derivations of ranked bigroupoids are investigated, and conditions for an (𝑋,∗,&)-self-(co)derivation to be regular are provided. The notion of ranked ∗-subsystems is introduced, and related properties are investigated.

1. Introduction

Several authors [1–4] have studied derivations in rings and near rings. Jun and Xin [5] applied the notion of derivation in ring and near-ring theory to 𝐵𝐶𝐼-algebras, and as a result they introduced a new concept, called a (regular) derivation, in 𝐵𝐶𝐼-algebras. Zhan and Liu [6] studied 𝑓-derivations in 𝐵𝐶𝐼-algebras. Alshehri [7] applied the notion of derivations to incline algebras. Alshehri et al. [8] introduced the notion of ranked bigroupoids and discussed (𝑋,∗,&)-self-(co)derivations. In this paper, we investigate further properties on (𝑋,∗,&)-self-(co)derivations and provide conditions for an (𝑋,∗,&)-self-(co)derivation to be regular. We introduce the notion of ranked ∗-subsystems and investigate related properties.

2. Preliminaries

In a nonempty set 𝑋 with a constant 0 and a binary operation ∗, we consider the following axioms: (a1)((𝑥∗𝑦)∗(𝑥∗𝑧))∗(𝑧∗𝑦)=0,(a2)(𝑥∗(𝑥∗𝑦))∗𝑦=0,(a3)𝑥∗𝑥=0,(a4)𝑥∗𝑦=0and𝑦∗𝑥=0imply𝑥=𝑦, (b1)𝑥∗0=𝑥, (b2)(𝑥∗𝑦)∗𝑧=(𝑥∗𝑧)∗𝑦,(b3)((𝑥∗𝑧)∗(𝑦∗𝑧))∗(𝑥∗𝑦)=0, (b4)𝑥∗(𝑥∗(𝑥∗𝑦))=𝑥∗𝑦.

If 𝑋 satisfies axioms (a1), (a2), (a3), and (a4), then we say that (𝑋,∗,0) is a 𝐵𝐶𝐼-algebra. Note that a 𝐵𝐶𝐼-algebra (𝑋,∗,0) satisfies conditions (b1), (b2), (b3), and (b4) (see [9]).

In a 𝑝-semisimple 𝐵𝐶𝐼-algebra 𝑋, the following hold: (b5)(𝑥∗𝑧)∗(𝑦∗𝑧)=𝑥∗𝑦, (b6)0∗(0∗𝑥)=𝑥.

3. Derivations on Ranked Bigroupoids

A ranked bigroupoid (see [8]) is an algebraic system (𝑋,∗,•) where 𝑋 is a non-empty set and “∗” and “•” are binary operations defined on 𝑋. We may consider the first binary operation ∗ as the major operation and the second binary operation • as the minor operation.

Given a ranked bigroupoid (𝑋,∗,&), a map 𝑑∶𝑋→𝑋 is called an (𝑋,∗,&)-self-derivation (see [8]) if for all 𝑥,𝑦∈𝑋, 𝑑𝑥∗𝑦=𝑑(𝑥)∗𝑦&𝑥∗𝑑𝑦. (3.1) In the same setting, a map 𝑑∶𝑋→𝑋 is called an (𝑋,∗,&)-self-coderivation (see [8]) if for all 𝑥,𝑦∈𝑋, 𝑑𝑥∗𝑦=𝑥∗𝑑𝑦&𝑑(𝑥)∗𝑦. (3.2) Note that if (𝑋,∗) is a commutative groupoid, then (𝑋,∗,&)-self-derivations are (𝑋,∗,&)-self-coderivations. A map 𝑑∶𝑋→𝑋 is called an 𝑎𝑏𝑒𝑙𝑖𝑎𝑛-(𝑋,∗,&)-self-derivation (see [8]) if it is both an (𝑋,∗,&)-self-derivation and an (𝑋,∗,&)-self-coderivation.

Proposition 3.1. Let (𝑋,∗,&) be a ranked bigroupoid with distinguished element 0 in which the minor operation & is defined by 𝑥&𝑦=𝑦∗(𝑦∗𝑥) for all 𝑥,𝑦∈𝑋.(1)Assume that 𝑋 satisfies axioms (b1), (b2), (b3), (a3), and (a4). If a map 𝑑∶𝑋→𝑋 is an (𝑋,∗,&)-self-derivation, then 𝑑(𝑥)=𝑑(𝑥)&𝑥 for all 𝑥∈𝑋.(2)If 𝑋 satisfies two axioms (b1) and (a3) and a map 𝑑∶𝑋→𝑋 is an (𝑋,∗,&)-self-coderivation, then the following are equivalent: (2.1) 𝑑(0)=0; (2.2) (∀𝑥∈𝑋)(𝑑(𝑥)=𝑥&𝑑(𝑥)).

Proof. (1) Let 𝑥∈𝑋. Using (b1) and (b2), we have 𝑑(𝑥)()=(𝑑(𝑥))&((0(𝑥)&((0=((0∗(0(𝑥=((0∗(𝑥(0.=𝑑𝑥∗0∗0𝑥∗𝑑))=𝑑𝑥∗𝑑))𝑥∗𝑑))((𝑥∗𝑑))∗𝑑))𝑥∗𝑑))((𝑥∗𝑑))∗𝑑)) (3.3) It follows from (b3) that 𝑑(𝑥)∗(𝑑(𝑥)&𝑥)=((𝑥∗𝑑(0))∗((𝑥∗𝑑(𝑥))∗𝑑(0)))∗(𝑑(𝑥)&𝑥)=0. (3.4) Using (b2) and (a3), we have (𝑑(𝑥)&𝑥)∗𝑑(𝑥)=0, and so 𝑑(𝑥)=𝑑(𝑥)&𝑥 for all 𝑥∈𝑋 by (a4).
(2) Let 𝑑 be an (𝑋,∗,&)-self-coderivation. If 𝑑(0)=0, then 𝑑(𝑥)=𝑑(𝑥∗0)=(𝑥∗𝑑(0))&(𝑑(𝑥)∗0)=𝑥&𝑑(𝑥) (3.5) for all 𝑥∈𝑋. Assume that 𝑑(𝑥)=𝑥&𝑑(𝑥) for all 𝑥∈𝑋. Taking 𝑥=0 implies that 𝑑(0)=0&𝑑(0)=0.

Corollary 3.2. Let (𝑋,∗,&) be a ranked bigroupoid in which (𝑋,∗,0) is a 𝐵𝐶𝐼-algebra and the minor operation & is defined by 𝑥&𝑦=𝑦∗(𝑦∗𝑥) for all 𝑥,𝑦∈𝑋.(1)If a map 𝑑∶𝑋→𝑋 is an (𝑋,∗,&)-self-derivation, then 𝑑(𝑥)=𝑑(𝑥)&𝑥 for all 𝑥∈𝑋.(2)If a map 𝑑∶𝑋→𝑋 is an (𝑋,∗,&)-self-coderivation, then the following are equivalent:  (2.1)𝑑(0)=0;  (2.2)(∀𝑥∈𝑋)(𝑑(𝑥)=𝑥&𝑑(𝑥)).

Lemma 3.3. Let (𝑋,∗,&) be a ranked bigroupoid with distinguished element 0 in which three axioms (b2),(a3), and (a4) are valid and the minor operation & is defined by 𝑥&𝑦=𝑦∗(𝑦∗𝑥) for all 𝑥,𝑦∈𝑋.(1)For every 𝑥∈𝑋 with 𝑥&0=𝑥, one has ∀𝑦∈𝑋𝑦∗𝑥=0⇒𝑦=𝑥. (3.6)(2)If an element 𝑎 of 𝑋 satisfies 𝑎&0=𝑎, then 𝑎&𝑥=𝑎 for all 𝑥∈𝑋.

Proof. (1) Let 𝑦∈𝑋 be such that 𝑦∗𝑥=0. Then ()∗()=∗()=()∗()𝑥∗𝑦=𝑥&0∗𝑦=0∗𝑦0∗𝑥𝑦∗𝑥∗𝑦0∗𝑥0∗𝑥0∗𝑥=0, (3.7) and so 𝑦=𝑥 by (a4).
(2) Since (𝑎&𝑥)∗𝑎=0, it follows from (3.6) that 𝑎&𝑥=𝑎 for all 𝑥∈𝑋.

Corollary 3.4. Let (𝑋,∗,&) be a ranked bigroupoid in which (𝑋,∗,0) is a 𝐵𝐶𝐼-algebra and the minor operation & is defined by 𝑥&𝑦=𝑦∗(𝑦∗𝑥) for all 𝑥,𝑦∈𝑋.(1)For every 𝑥∈𝑋 with 𝑥&0=𝑥, one has ∀𝑦∈𝑋𝑦∗𝑥=0⇒𝑦=𝑥. (3.8)(2)If an element 𝑎 of 𝑋 satisfies 𝑎&0=𝑎, then 𝑎&𝑥=𝑎 for all 𝑥∈𝑋.

Proposition 3.5. Let (𝑋,∗,&) be a ranked bigroupoid with distinguished element 0 in which four axioms (b2),(b4), (a3), and (a4) are valid and the minor operation & is defined by 𝑥&𝑦=𝑦∗(𝑦∗𝑥) for all 𝑥,𝑦∈𝑋. If a map 𝑑∶𝑋→𝑋 is an (𝑋,∗,&)-self-coderivation, then 0∗𝑑(𝑥)=𝑑(𝑥) for all 𝑥∈𝑋 with 0∗𝑥=𝑥.

Proof. Let 𝑥∈𝑋 be such that 0∗𝑥=𝑥. Since (0∗𝑑(𝑥))&0=0∗𝑑(𝑥), it follows from Lemma 3.3(2) that 𝑑(𝑥)=𝑑(0∗𝑥)=(0∗𝑑(𝑥))&(𝑑(0)∗𝑥)=0∗𝑑(𝑥).

Corollary 3.6. Let (𝑋,∗,&) be a ranked bigroupoid in which (𝑋,∗,0) is a 𝐵𝐶𝐼-algebra and the minor operation & is defined by 𝑥&𝑦=𝑦∗(𝑦∗𝑥) for all 𝑥,𝑦∈𝑋. If a map 𝑑∶𝑋→𝑋 is an (𝑋,∗,&)-self-coderivation, then 0∗𝑑(𝑥)=𝑑(𝑥) for all 𝑥∈𝑋 with 0∗𝑥=𝑥.

Using Proposition 3.5, we can find an (𝑋,∗,&)-self-derivation which is not an (𝑋,∗,&)-self-coderivation.

Example 3.7. Let (ℤ,−,&) be a ranked bigroupoid where ℤ is the set of all integers with the minus operation “−” and the minor operation “&” defined by 𝑥&𝑦=𝑦−(𝑦−𝑥) for all 𝑥,𝑦∈ℤ. Let 𝑑 be a self map of ℤ given by 𝑑(𝑥)=𝑥−1 for all 𝑥∈ℤ. Then 𝑑 is a (ℤ,−,&)-self-derivation since 𝑑==&=)&=𝑑(𝑥)&𝑦.𝑥−𝑦𝑥−𝑦−1=𝑥−𝑦+1−2𝑥−𝑦−1𝑥−𝑦+1(𝑥−1−𝑦𝑥−𝑦−1−𝑦𝑥−𝑑 (3.9) Note that 0−𝑑(0)=0−(0−1)=1≠−1=0−1=𝑑(0). Hence 𝑑 is not a (ℤ,−,&)-self-coderivation by Proposition 3.5.

Proposition 3.8. Let (𝑋,∗,&) be a ranked bigroupoid with distinguished element 0 and the minor operation & is defined by 𝑥&𝑦=𝑦∗(𝑦∗𝑥) for all 𝑥,𝑦∈𝑋. For an (𝑋,∗,&)-self-derivation 𝑑∶𝑋→𝑋, if (𝑋,∗,0) satisfies axioms (b2),(b5), and (b6), then 𝑑(𝑥)=𝑑(0)∗(0∗𝑥) for all 𝑥∈𝑋. Moreover, if 𝑑(0)=0, then 𝑑 is an identity map.

Proof. Assume that (𝑋,∗,0) satisfies axioms (b2), (b5), and (b6). Then 𝑑(𝑥)()=(𝑑(0)∗(&((=((∗(∗(𝑑(0)∗(=((∗(𝑑(0)∗((((𝑑(0)∗((0)∗(),=𝑑𝑥&00∗𝑥))0∗𝑑0∗𝑥))0∗𝑑0∗𝑥))((0∗𝑑0∗𝑥))0∗𝑥)))0∗𝑑0∗𝑥))((0∗0∗𝑥)))∗𝑑0∗𝑥))=0∗0∗0∗𝑥)))=𝑑0∗𝑥 (3.10) for all 𝑥∈𝑋. Moreover, if 𝑑(0)=0 then 𝑑(𝑥)=𝑑(0)∗(0∗𝑥)=𝑥&0=𝑥 for all 𝑥∈𝑋, and so 𝑑 is an identity map.

Corollary 3.9. Let (𝑋,∗,&) be a ranked bigroupoid in which (𝑋,∗,0) is a 𝐵𝐶𝐼-algebra and the minor operation & is defined by 𝑥&𝑦=𝑦∗(𝑦∗𝑥) for all 𝑥,𝑦∈𝑋. If a map 𝑑∶𝑋→𝑋 is an (𝑋,∗,&)-self-derivation, then(1)𝑑(0)=𝑑(0)&0; (2)if (𝑋,∗,0) is 𝑝-semisimple, then 𝑑(𝑥)=𝑑(0)∗(0∗𝑥) for all 𝑥∈𝑋;(3)if (𝑋,∗,0) is 𝑝-semisimple and 𝑑(0)=0, then 𝑑 is an identity map.

Definition 3.10. Let (𝑋,∗,&) be a ranked bigroupoid with distinguished element 0. A self map 𝑑 of (𝑋,∗,&) is said to be regular if 𝑑(0)=0.

Example 3.11. Consider a ranked bigroupoid (𝑋,∗,&) in which 𝑋={0,𝑎,𝑏,𝑐,𝑑,𝑒} and binary operations “∗” and “&” are defined by ∈),(),(∪)},∈),(),(,∈),(),(),(),(),(),(),(),(,∈),(),(),(),(),(),(),(),(,∈),(),(,∈),(),(&𝑥∗𝑦=0if𝑥,𝑦{(0,𝑎𝑏,𝑑𝑐,𝑒)}{(𝑧,𝑧∣𝑧∈𝑋𝑎if𝑥,𝑦{(𝑎,0𝑑,𝑏𝑒,𝑐)}𝑏if𝑥,𝑦{(𝑏,00,𝑐0,𝑒𝑎,𝑒𝑏,𝑎𝑐,𝑏𝑐,𝑑𝑑,𝑎𝑒,𝑑)}𝑐if𝑥,𝑦{(𝑐,0𝑐,𝑎𝑒,𝑎0,𝑏𝑏,𝑐0,𝑑𝑎,𝑑𝑏,𝑒𝑑,𝑒)}𝑑if𝑥,𝑦{(𝑑,0𝑒,𝑏𝑎,𝑐)}𝑒if𝑥,𝑦{(𝑎,𝑏𝑑,𝑐𝑒,0)}0𝑎𝑏𝑐𝑑𝑒0𝑎000000𝑏0𝑎00𝑎𝑎𝑐𝑏𝑏0𝑏𝑏𝑏𝑑𝑐𝑐𝑐𝑐𝑐𝑐𝑒𝑏𝑑𝑏𝑏𝑑𝑑𝑐𝑒𝑐𝑐𝑒𝑒. (3.11) Define a map 𝑑∶𝑋→𝑋 by 𝑑(𝑥)={},{},{}.0if𝑥∈0,𝑎𝑏if𝑥∈𝑏,𝑑𝑐if𝑥∈𝑐,𝑒 (3.12) Then 𝑑 is an abelian (𝑋,∗,&)-self-derivation which is regular.

Proposition 3.12. Let (𝑋,∗,&) be a ranked bigroupoid with distinguished element 0 in which the minor operation & is defined by 𝑥&𝑦=𝑦∗(𝑦∗𝑥) for all 𝑥,𝑦∈𝑋 and 0∗𝑥=0 for all 𝑥∈𝑋. Then every (𝑋,∗,&)-self-derivation is regular. Moreover, if 𝑋 satisfies the axioms (𝑏1) and (𝑎3) then every (𝑋,∗,&)-self-coderivation is regular.

Proof. Let 𝑑 be an (𝑋,∗,&)-self-derivation. Then 𝑑(0)=𝑑(0∗𝑥)=(𝑑(0)∗𝑥)&(0∗𝑑(𝑥))=(𝑑(0)∗𝑥)&0=0. (3.13) If 𝑑 is an (𝑋,∗,&)-self-coderivation, then 𝑑(0)=𝑑(0∗𝑥)=(0∗𝑑(𝑥))&(𝑑(0)∗𝑥)=0&(𝑑(0)∗𝑥)=0. (3.14) Hence every (𝑋,∗,&)-self-(co)derivation is regular.

Proposition 3.13. Let (𝑋,∗,&) be a ranked bigroupoid with distinguished element 0 in which the minor operation & is defined by 𝑥&𝑦=𝑦∗(𝑦∗𝑥) for all 𝑥,𝑦∈𝑋 and two axioms (a3) and (b1) are satisfied. Let 𝑑 be a self map of 𝑋 and 𝑎∈𝑋 such that 𝑑(𝑥)∗𝑎=0 (resp., 𝑎∗𝑑(𝑥)=0) for all 𝑥∈𝑋. If 𝑑 is an (𝑋,∗,&)-self-derivation (resp., (𝑋,∗,&)-self-coderivation), then it is regular.

Proof. Assume that 𝑑 is an (𝑋,∗,&)-self-derivation. For any 𝑥∈𝑋, we have 0=𝑑(𝑥∗𝑎)∗𝑎=((𝑑(𝑥)∗𝑎)&(𝑥∗𝑑(𝑎)))∗𝑎=(0&(𝑥∗𝑑(𝑎)))∗𝑎=0∗𝑎, (3.15) which implies that 𝑑(0)=𝑑(0∗𝑎)=(𝑑(0)∗𝑎)&(0∗𝑑(𝑎))=0&(0∗𝑑(𝑎))=0. (3.16) Hence 𝑑 is regular. Now, let 𝑑 be an (𝑋,∗,&)-self-coderivation such that 𝑎∗𝑑(𝑥)=0 for all 𝑥∈𝑋. Then 0=𝑎∗𝑑(𝑎∗𝑥)=𝑎∗((𝑎∗𝑑(𝑥))&(𝑑(𝑎)∗𝑥))=𝑎∗(0&(𝑑(𝑎)∗𝑥))=𝑎∗0, (3.17) and so 𝑑(0)=𝑑(𝑎∗0)=(𝑎∗𝑑(0))&(𝑑(𝑎)∗0)=0&(𝑑(𝑎)∗0)=0&𝑑(𝑎)=0. (3.18) Therefore 𝑑 is regular.

Definition 3.14. Let (𝑋,∗,&) be a ranked bigroupoid with distinguished element 0. Let 𝑑 be a self map of (𝑋,∗,&). A subset 𝐴 of 𝑋 is called a ranked ∗-subsystem of 𝑋 if it satisfies the following:(r1)0∈𝐴, (r2)(∀𝑥,𝑦∈𝑋)(𝑥∈𝐴,𝑦∗𝑥∈𝐴⇒𝑦∈𝐴).
Moreover, if a ranked ∗-subsystem 𝐴 of 𝑋 satisfies 𝑑(𝐴)⊆𝐴, then we say that 𝐴 is ranked 𝑑-invariant.

Example 3.15. Consider a ranked bigroupoid (𝑋,∗,&) in which 𝑋={0,𝑎,𝑏,𝑐,𝑑,𝑒} and binary operations “∗”and “&” are defined by ∈),(),(),(),(),(∪)},∈),(),(),(),(),(),(),(,=(),=(),=(),𝑥∗𝑦=0if𝑥,𝑦{(0,𝑎𝑏,𝑐𝑏,𝑑𝑏,𝑒𝑐,𝑑𝑐,𝑒)}{(𝑧,𝑧∣𝑧∈𝑋𝑎if𝑥,𝑦{(𝑎,0𝑐,𝑏𝑑,𝑏𝑒,𝑏𝑑,𝑐𝑒,𝑐𝑒,𝑑𝑑,𝑒)}𝑐if𝑥,𝑦𝑐,0𝑑if𝑥,𝑦𝑑,0𝑒if𝑥,𝑦𝑒,0𝑏otherwise, (3.19) and 𝑥&𝑦=𝑦∗(𝑦∗𝑥) for all 𝑥,𝑦∈𝑋. Define a map d: 𝑋→𝑋 by 𝑑(𝑥)=𝑏if𝑥∈{0,𝑎}0otherwise. (3.20) Then 𝑑 is an abelian (𝑋,∗,&)-self-derivation which is not regular. It is easily check that 𝐴={0,𝑎} is a ranked ∗-subsystem of 𝑋. Since 𝑑(𝐴)={𝑏}⊆𝐴̸, 𝑑 is not ranked 𝑑-invariant.

Example 3.16. In Example 3.11, 𝐴={0,𝑎} is a ranked 𝑑-invariant ∗-subsystem of 𝑋.

Theorem 3.17. Let (𝑋,∗,&) be a ranked bigroupoid with distinguished element 0 in which three axioms (b1),(b2), and (a3) are valid and the minor operation & is defined by 𝑥&𝑦=𝑦∗(𝑦∗𝑥) for all 𝑥,𝑦∈𝑋. For an (𝑋,∗,&)-self-coderivation 𝑑, if 𝑑 is regular then every ranked ∗-subsystem of 𝑋 is ranked 𝑑-invariant.

Proof. Assume that 𝑑 is regular and let 𝐴 be a ranked ∗-subsystem of 𝑋. Then 𝑑(𝑥)=𝑥&𝑑(𝑥) for all 𝑥∈𝑋 by Proposition 3.1(2). Let 𝑦∈𝑑(𝐴). Then 𝑦=𝑑(𝑎) for some 𝑎∈𝐴. Thus 𝑦∗𝑎=𝑑(𝑎)∗𝑎=(𝑎&𝑑(𝑎))∗𝑎=0∈𝐴, and so 𝑦∈𝐴 by (r2). Hence 𝑑(𝐴)⊆𝐴 and 𝐴 is ranked 𝑑-invariant.

Corollary 3.18. Let 𝑑 be an (𝑋,∗,&)-self-coderivation where (𝑋,∗,0) is a 𝐵𝐶𝐼-algebra and the minor operation & is defined by 𝑥&𝑦=𝑦∗(𝑦∗𝑥) for all 𝑥,𝑦∈𝑋. If 𝑑 is regular, then every ideal of 𝑋 is ranked 𝑑-invariant.

Example 3.15 shows that Theorem 3.17 is not true if we drop the regularity of 𝑑.

We consider the converse of Theorem 3.17.

Theorem 3.19. Let 𝑑 be an (𝑋,∗,&)-self-coderivation where (𝑋,∗,&) is a ranked bigroupoid with distinguished element 0 in which the minor operation & is defined by 𝑥&𝑦=𝑦∗(𝑦∗𝑥) for all 𝑥,𝑦∈𝑋 and there does not exist a nonzero element 𝑥 of 𝑋 such that 𝑥∗0=0. If every ranked ∗-subsystem of 𝑋 is ranked 𝑑-invariant, then 𝑑 is regular.

Proof. Assume that every ranked ∗-subsystem of 𝑋 is ranked 𝑑-invariant. Note that 𝐴={0} is a ranked ∗-subsystem of 𝑋. Thus 𝑑(𝐴)=𝑑({0})⊆{0}, and therefore 𝑑(0)=0,thatis,𝑑 is regular.

Corollary 3.20. Let 𝑑 be an (𝑋,∗,&)-self-coderivation where (𝑋,∗,0) is a 𝐵𝐶𝐼-algebra and the minor operation & is defined by 𝑥&𝑦=𝑦∗(𝑦∗𝑥) for all 𝑥,𝑦∈𝑋. Then 𝑑 is regular if and only if every ranked ∗-subsystem of 𝑋 is ranked 𝑑-invariant.

Proposition 3.21. Let (𝑋,∗,&) be a ranked bigroupoid where (𝑋,∗,0) is a 𝐵𝐶𝐼-algebra and the minor operation & is defined by 𝑥&𝑦=𝑦∗(𝑦∗𝑥) for all 𝑥,𝑦∈𝑋. For any 𝛼∈𝑋, let 𝑑_𝛼 be a self map of 𝑋 defined by 𝑑_𝛼(𝑥)=𝑥∗𝛼 for all 𝑥∈𝑋. If 𝑋 satisfies the following conditions:(1)((𝑥∗𝑦)∗𝑧)∗(𝑥∗(𝑦∗𝑧))=0 for all 𝑥,𝑦,𝑧∈𝑋,(2)(∀𝑥,𝑦∈𝑋)(𝑥∗𝑦=0⇒𝑥=𝑦), then 𝑑_𝛼 is an abelian (𝑋,∗,&)-self-derivation.

Proof. If 𝑋 satisfies two given conditions, then the following identity is valid (see [9]): ∀𝑥,𝑦,𝑧∈𝑋𝑥∗𝑦∗𝑧=𝑥∗𝑦∗𝑧. (3.21) It follows from (b1), (a3), and (b2) that 𝑑_𝛼==∗∗=∗∗()=𝑑𝑥∗𝑦𝑥∗𝑦∗𝛼=𝑥∗𝑦∗𝛼∗0𝑥∗𝑦∗𝛼𝑥∗𝑦∗𝛼𝑥∗𝑦∗𝛼𝑥∗𝑦∗𝛼𝑥∗𝑦∗𝛼𝑥∗𝛼∗𝑦_𝛼(𝑥)∗𝑦&𝑥∗𝑑_𝛼𝑦. (3.22) Hence 𝑑_𝛼 is an (𝑋,∗,&)-self-derivation. Similarly, we can verify that 𝑑_𝛼 is an (𝑋,∗,&)-self-coderivation.

Corollary 3.22. Let (𝑋,∗,&) be a ranked bigroupoid where (𝑋,∗,0) is a 𝐵𝐶𝐼-algebra and the minor operation & is defined by 𝑥&𝑦=𝑦∗(𝑦∗𝑥) for all 𝑥,𝑦∈𝑋. For any 𝛼∈𝑋, let 𝑑_𝛼 be a self map of 𝑋 defined by 𝑑_𝛼(𝑥)=𝑥∗𝛼 for all 𝑥∈𝑋. If 𝑋 satisfies (𝑏1) and the following conditions: (1)((𝑥∗𝑦)∗𝑧)∗(𝑥∗(𝑦∗𝑧))=0 for all 𝑥,𝑦,𝑧∈𝑋,(2)(𝑥∗𝑦)∗(𝑥∗𝑧)=𝑧∗𝑦 for all 𝑥,𝑦,𝑧∈𝑋, then 𝑑_𝛼 is an abelian (𝑋,∗,&)-self-derivation.

Proof. If 𝑋 satisfies both (b1) and the second condition, then 𝑋 is a 𝑝-semisimple 𝐵𝐶𝐼-algebra (see [9]). Hence the second condition of Proposition 3.21 is valid. Therefore 𝑑_𝛼 is an abelian (𝑋,∗,&)-self-derivation.

4. Conclusion

Alshehri et al. [8] introduced the notion of ranked bigroupoids and discussed (𝑋,∗,&)-self-(co)derivations.

A nonempty set 𝑋 together with maps ∗∶𝑋×𝑋→𝑋 and &∶𝑋×𝑋→𝑋 is called a ranked bigroupoid. For a ranked bigroupoid (𝑋,∗,&), a map 𝑑∶𝑋→𝑋 is called: (1)an (𝑋,∗,&)-self-derivation if 𝑑𝑥∗𝑦=𝑑(𝑥)∗𝑦&𝑥∗𝑑𝑦 (4.1) for all 𝑥,𝑦∈𝑋;(2)an (𝑋,∗,&)-self-coderivation if 𝑑𝑥∗𝑦=𝑥∗𝑑𝑦&𝑑(𝑥)∗𝑦 (4.2) for all 𝑥,𝑦∈𝑋.

In this paper, we have investigated further properties on (𝑋,∗,&)-self-(co)derivations and have provided conditions for an (𝑋,∗,&)-self-(co)derivation to be regular. We have introduced the notion of ranked ∗-subsystems and have investigated related properties.

In general, there are many kind of derivations (generalized derivations, biderivations, triderivations, etc.) in algebraic structures, for example, (near) rings, prime rings, semiprime rings, Γ-near-rings, incline algebras, Banach algebras, lattices, MV-algebras, and BCK/BCI-algebras.

Based on this paper together with related papers on derivations, we will consider several kind of derivations in ranked bigroupoids.

Acknowledgment

The authors wish to thank the anonymous reviewers for their valuable suggestions.