In order to examine the potential and synergetic aspects of intelligent reflecting surface (IRS) techniques for Internet-of-Things (IoT), we study an IRS-aided Long Range (LoRa) system in this paper. Specifically, to facilitate the acquisition of accurate channel state information (CSI) for effective reflection of LoRa signals, we first propose an optimal training design for the least squares channel estimation with LoRa modulation, and then, by utilizing the acquired CSI, we develop a high-performing passive beamforming scheme based on a signal-to-ratio (SNR) criterion. Numerical results show that the proposed training design considerably outperforms the baseline schemes, and the proposed passive beamforming design results in a significant improvement in performance over that of the conventional LoRa system, thereby demonstrating the feasibility of extending coverage areas of LoRa systems with the aid of IRS.
Citation: Jae-Mo Kang, Dong-Woo Lim. Joint channel training and passive beamforming design for intelligent reflecting surface-aided LoRa systems[J]. AIMS Mathematics, 2024, 9(5): 11423-11431. doi: 10.3934/math.2024560
[1] | Abdul Nadim Khan, Shakir Ali . Involution on prime rings with endomorphisms. AIMS Mathematics, 2020, 5(4): 3274-3283. doi: 10.3934/math.2020210 |
[2] | Feifei Qu, Xin Wei, Juan Chen . Uncertainty principle for vector-valued functions. AIMS Mathematics, 2024, 9(5): 12494-12510. doi: 10.3934/math.2024611 |
[3] | Sabbavarapu Nageswara Rao, Mahammad Khuddush, Ahmed H. Msmali, Ali H. Hakami . Persistence and stability in an SVIR epidemic model with relapse on timescales. AIMS Mathematics, 2025, 10(2): 4173-4204. doi: 10.3934/math.2025194 |
[4] | Nikken Prima Puspita, Indah Emilia Wijayanti . Bi-clean and clean Hopf modules. AIMS Mathematics, 2022, 7(10): 18784-18792. doi: 10.3934/math.20221033 |
[5] | Seok-Zun Song, Ravikumar Bandaru, Young Bae Jun . Prominent interior GE-filters of GE-algebras. AIMS Mathematics, 2021, 6(12): 13432-13447. doi: 10.3934/math.2021778 |
[6] | Sun Shin Ahn, Ravikumar Bandaru, Young Bae Jun . Imploring interior GE-filters in GE-algebras. AIMS Mathematics, 2022, 7(1): 855-868. doi: 10.3934/math.2022051 |
[7] | Chang-Xu Zhang, Fu-Tao Hu, Shu-Cheng Yang . On the (total) Roman domination in Latin square graphs. AIMS Mathematics, 2024, 9(1): 594-606. doi: 10.3934/math.2024031 |
[8] | Xian Min Gui, Hong Yan Xu, Hua Wang . Uniqueness of meromorphic functions sharing small functions in the k-punctured complex plane. AIMS Mathematics, 2020, 5(6): 7438-7457. doi: 10.3934/math.2020476 |
[9] | CaiDan LaMao, Shuibo Huang, Qiaoyu Tian, Canyun Huang . Regularity results of solutions to elliptic equations involving mixed local and nonlocal operators. AIMS Mathematics, 2022, 7(3): 4199-4210. doi: 10.3934/math.2022233 |
[10] | Huimin Wang, Liqun Hu . Sums of the higher divisor function of diagonal homogeneous forms in short intervals. AIMS Mathematics, 2023, 8(10): 22577-22592. doi: 10.3934/math.20231150 |
In order to examine the potential and synergetic aspects of intelligent reflecting surface (IRS) techniques for Internet-of-Things (IoT), we study an IRS-aided Long Range (LoRa) system in this paper. Specifically, to facilitate the acquisition of accurate channel state information (CSI) for effective reflection of LoRa signals, we first propose an optimal training design for the least squares channel estimation with LoRa modulation, and then, by utilizing the acquired CSI, we develop a high-performing passive beamforming scheme based on a signal-to-ratio (SNR) criterion. Numerical results show that the proposed training design considerably outperforms the baseline schemes, and the proposed passive beamforming design results in a significant improvement in performance over that of the conventional LoRa system, thereby demonstrating the feasibility of extending coverage areas of LoRa systems with the aid of IRS.
In the 1950s, Hilbert algebras were introduced by L. Henkin and T. Skolem as a means to investigate non-classical logics, particularly intuitionistic logic. As demonstrated by A. Diego, these algebras belong to the category of locally finite varieties, a fact highlighted in [5]. Over time, a community of scholars developed the theory of Hilbert algebras, as evidenced by works such as [3,4,6]. Within the realm of mathematics, the study of derivations holds a significant place in the theory of algebraic structures. This branch evolved from the principles of Galois theory and the theory of invariants. K. H. Kim et al. extended the concept of derivations to BE-algebras, delving into properties in [10]. C. Jana et al. [7] introduced the notion of left-right (respectively, right-left) derivation, f-derivation, and generalized derivation of KUS-algebras, and their properties are established. In the broader scope of algebraic structures, the process of generalization is of utmost importance. The introduction of GE-algebras, proposed by R. K. Bandaru et al. as an extension of Hilbert algebras, marked a significant step in this direction. This advancement led to the examination of various properties, as explored in [1]. The evolution of GE-algebras was greatly influenced by filter theory. In light of this, R. K. Bandaru et al. introduced the concept of belligerent GE-filters in GE-algebras, closely investigating its attributes as documented in [2]. Rezaei et al. [11] introduced the concept of prominent GE-filters in GE-algebras. Building upon the foundation laid by Y. B. Jun et al., the concepts of ξ-inside GE-derivation and ξ-outside GE-derivation are introduced and their properties are studied. The authors established prerequisites for a self-map on a GE-algebra to qualify as both a ξ-inside and ξ-outside GE-derivation. The conditions for an order-preserving ξ-inside GE-derivation and a ξ-outside GE-derivation were thoroughly explored, as detailed in [8].
In this paper, we introduce the notion of Ω(l,r)-endomorphic (resp., Ω(r,l)-endomorphic) GE-derivation using the binary operation "↰" on a GE-algebra X given by ↰(x,y)=(y∗x)∗x and the GE-endomorphism Ω:X→X and investigate several properties. We study the conditions under which Ω(l,r)-endomorphic GE-derivations or Ω(l,r)-endomorphic GE-derivations to satisfy certain equalities and inequalities. We explore the conditions under which f becomes order preserving when f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X. We observe that the f-kernel of f and the Ω-kernel of f formed by the Ω(r,l)-endomorphic GE-derivation or Ω(l,r)-endomorphic GE-derivation are GE-subalgebras. Also, we observe that the Ω-kernel of f is a GE-filter of X, but the f-kernel of f is not a GE-filter of X. Finally, we explore the condition under which the f-kernel of f formed by the Ω(r,l)-endomorphic GE-derivation or Ω(l,r)-endomorphic GE-derivation becomes a GE-filter.
Definition 2.1 ([1]). A GE-algebra is a non-empty set X with a constant "1" and a binary operation "∗" satisfying the following axioms:
(GE1) u∗u=1,
(GE2) 1∗u=u,
(GE3) u∗(v∗w)=u∗(v∗(u∗w))
for all u,v,w∈X.
In a GE-algebra X, a binary relation "≤" is defined by
(∀u,v∈X)(u≤v⇔u∗v=1). | (2.1) |
Definition 2.2 ([1,2]). A GE-algebra X is said to be
● Transitive if it satisfies:
(∀u,v,w∈X)(u∗v≤(w∗u)∗(w∗v)). | (2.2) |
● Commutative if it satisfies:
(∀u,v∈X)((u∗v)∗v=(v∗u)∗u). | (2.3) |
Proposition 2.3 ([1]). Every GE-algebra X satisfies the following items:
(∀u∈X)(u∗1=1). | (2.4) |
(∀u,v∈X)(u∗(u∗v)=u∗v). | (2.5) |
(∀u,v∈X)(u≤v∗u). | (2.6) |
(∀u,v,w∈X)(u∗(v∗w)≤v∗(u∗w)). | (2.7) |
(∀u∈X)(1≤u⇒u=1). | (2.8) |
(∀u,v∈X)(u≤(v∗u)∗u). | (2.9) |
(∀u,v∈X)(u≤(u∗v)∗v). | (2.10) |
(∀u,v,w∈X)(u≤v∗w⇔v≤u∗w). | (2.11) |
If X is transitive, then
(∀u,v,w∈X)(u≤v⇒w∗u≤w∗v,v∗w≤u∗w). | (2.12) |
(∀u,v,w∈X)(u∗v≤(v∗w)∗(u∗w)). | (2.13) |
(∀u,v,w∈X)(u≤v,v≤w⇒u≤w). | (2.14) |
Definition 2.4 ([1]). A non-empty subset S of X is called a GE-subalgebra of X if it satisfies:
(∀x,y∈X)(x,y∈S⇒x∗y∈S). | (2.15) |
Definition 2.5 ([1]). A subset F of a GE-algebra X is called a GE-filter of X if it satisfies:
1∈F, | (2.16) |
(∀x,y∈X)(x∗y∈F,x∈F⇒y∈F). | (2.17) |
In what follows, given a self-mapping f on a GE-algebra X, the image of x∈X under f is denoted by fx for the convenience, and let X denote a GE-algebra unless otherwise specified.
A self mapping Ω:X→X is called a GE-endomorphism if Ωx∗y=Ωx∗Ωy for all x,y∈X.
It is clear that if Ω is a GE-endomorphism, then Ω1=1.
We define a binary operation "↰" on X as follows:
↰:X×X→X,(x,y)↦(y∗x)∗x. | (3.1) |
Lemma 3.1. The binary operations "↰" on a GE-algebra X satisfies:
(∀u∈X)(x↰1=1=1↰x), | (3.2) |
(∀u∈X)(x↰x=x). | (3.3) |
Proof. Straightforward.
Using the binary operation "↰" and the GE-endomorphism Ω:X→X, we will define endomorphic GE-derivations on X and study its properties.
Definition 3.2. A mapping f:X→X is called an Ω(l,r)-endomorphic GE-derivation on X if there exists a GE-endomorphism Ω:X→X satisfying the following condition:
(∀x,y∈X)(fx∗y=(Ωx∗fy)↰(fx∗Ωy)). | (3.4) |
Definition 3.3. A mapping f:X→X is called an Ω(r,l)-endomorphic GE-derivation on X if there exists a GE-endomorphism Ω:X→X satisfying the following condition:
(∀x,y∈X)(fx∗y=(fx∗Ωy)↰(Ωx∗fy)). | (3.5) |
Remark 3.4. It is clear that if X is a commutative GE-algebra, then the two concepts of Ω(l,r)-endomorphic GE-derivation and Ω(r,l)-endomorphic GE-derivation are consistent.
Example 3.5. (ⅰ) Let X={1,⊺1,⊺2,⊺3,⊺4} be a set with a binary operation "∗" given in the following table:
∗1⊺1⊺2⊺3⊺411⊺1⊺2⊺3⊺4⊺111⊺2⊺4⊺4⊺2111⊺3⊺3⊺31⊺1⊺211⊺411⊺211 |
Then, X is a GE-algebra. Define the self-maps:
f:X→X,x↦{1 if x∈{1,⊺1,⊺3,⊺4},⊺2 if x=⊺2. |
and
Ω:X→X,x↦{1 if x∈{1,⊺1},⊺2 if x=⊺2,⊺3 if x∈{⊺3,⊺4}. |
Then, f is an Ω(l,r)-endomorphic GE-derivation on X.
(ⅱ) Let X={1,⊺1,⊺2,⊺3,⊺4} be a set with a binary operation "∗" given in the following table:
∗1⊺1⊺2⊺3⊺411⊺1⊺2⊺3⊺4⊺111⊺2⊺31⊺21⊺411⊺4⊺31⊺111⊺1⊺411⊺2⊺31 |
Then, X is a GE-algebra. Define the self-maps:
f:X→X,x↦{1 if x∈{1,⊺1,⊺3,⊺4},⊺2 if x=⊺2. |
and
Ω:X→X,x↦{1 if x∈{1,⊺1,⊺4},⊺2 if x=⊺2,⊺3 if x=⊺3. |
Then, f is an Ω(r,l)-endomorphic GE-derivation on X.
(ⅲ) Let X={1,⊺1,⊺2,⊺3,⊺4} be a set with a binary operation "∗" given in the following table:
∗1⊺1⊺2⊺3⊺411⊺1⊺2⊺3⊺4⊺111⊺2⊺3⊺3⊺2111⊺4⊺4⊺31⊺1111⊺41⊺1111 |
Then, X is a GE-algebra. Define the self-maps:
f:X→X,x↦{1 if x∈{1,⊺1},⊺1 if x=⊺2,⊺4 if x∈{⊺3,⊺4}. |
and
Ω:X→X,x↦{1 if x∈{1,⊺1},⊺2 if x=⊺2,⊺4 if x∈{⊺3,⊺4}. |
Then, f is an Ω(l,r)-endomorphic GE-derivation on X. But, it is not an Ω(r,l)-endomorphic GE-derivation on X since
(f⊺1∗Ω⊺2)↰(Ω⊺1∗f⊺2)=((Ω⊺1∗f⊺2)∗(f⊺1∗Ω⊺2))∗(f⊺1∗Ω⊺2)=((1∗⊺1)∗(1∗⊺2))∗(1∗⊺2)=(⊺1∗⊺2)∗⊺2=⊺2∗⊺2=1≠⊺1=f⊺2=f⊺1∗⊺2. |
(ⅳ) Let X={1,⊺1,⊺2,⊺3,⊺4,⊺5} be a set with a binary operation "∗" given in the following table:
∗1⊺1⊺2⊺3⊺4⊺511⊺1⊺2⊺3⊺4⊺5⊺111⊺2⊺5⊺4⊺5⊺21⊺11⊺3⊺3⊺3⊺31⊺1⊺21⊺21⊺41⊺11111⊺51⊺1⊺21⊺21 |
Then, X is a GE-algebra. Define the self-maps:
f:X→X,x↦{1 if x∈{1,⊺3,⊺5},⊺1 if x=⊺1,⊺3 if x∈{⊺2,⊺4}. |
and
Ω:X→X,x↦{1 if x∈{1,⊺3,⊺5},⊺1 if x=⊺1,⊺4 if x∈{⊺2,⊺4}. |
Then, f is an Ω(r,l)-endomorphic GE-derivation on X. But, it is not an Ω(l,r)-endomorphic GE-derivation on X:
f⊺1∗⊺2=f⊺2=⊺3≠⊺5=1∗⊺5=(⊺4∗⊺5)∗⊺5=(⊺1∗⊺4)∗(⊺1∗⊺3))∗(⊺1∗⊺3)=((f⊺1∗Ω⊺2)∗(Ω⊺1∗f⊺2))∗(Ω⊺1∗f⊺2)=(Ω⊺1∗f⊺2)↰(f⊺1∗Ω⊺2). |
Proposition 3.6. If f:X→X is a GE-endomorphism, then it is both an f(r,l)-endomorphic GE-derivation and an f(l,r)-endomorphic GE-derivation X.
Proof. If f:X→X is a GE-endomorphism, then
fx∗y=fx∗fy=(fx∗fy)↰(fx∗fy) |
for all x,y∈X. This completes the proof.
Proposition 3.7. If f:X→X is an Ω(r,l)-endomorphic GE-derivation or an Ω(l,r)-endomorphic GE-derivation on X, then f1=1.
Proof. Assume that f:X→X is an Ω(r,l)-endomorphic GE-derivation on X. Then,
f1=fx∗1=(fx∗Ω1)↰(Ωx∗f1)=(fx∗1)↰(Ωx∗f1)=1↰(Ωx∗f1)=1 |
by (2.4) and Lemma 3.1. If f:X→X is an Ω(l,r)-endomorphic GE-derivation on X, then
f1=fx∗1=(Ωx∗f1)↰(fx∗Ω1)=(Ωx∗f1)↰(fx∗1)=(Ωx∗f1)↰1=1 |
by (2.4) and Lemma 3.1.
Proposition 3.8. If f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X, then f1↰x=1=fx↰1 for all x∈X.
Proof. If f is an Ω(l,r)-endomorphic GE-derivation, then
f1↰x=f(x∗1)∗1=(Ωx∗1∗f1)↰(fx∗1∗Ω1)=(Ω1∗f1)↰(f1∗1)=(1∗f1)↰1=1 |
for all x∈X by (2.4) and Lemma 3.1. Suppose that f is an Ω(r,l)-endomorphic GE-derivation. Then,
f1↰x=f(x∗1)∗1=(fx∗1∗Ω1)↰(Ωx∗1∗f1)=(f1∗Ω1)↰(Ω1∗f1)=(f1∗1)↰(1∗f1)=1↰f1=1 |
for all x∈X by (GE2), (2.4), and Lemma 3.1. Similarly, we can show that 1=fx↰1 for all x∈X.
Lemma 3.9. Every Ω(r,l)-endomorphic GE-derivation f on X satisfies:
(∀x∈X)(fx=Ωx↰fx)). | (3.6) |
Proof. If f is an Ω(r,l)-endomorphic GE-derivation on X, then
fx=f1∗x=(f1∗Ωx)↰(Ω1∗fx)=(1∗Ωx)↰(1∗fx)=Ωx↰fx |
for all x∈X by (GE2) and Proposition 3.7.
The Eq (3.6) is not valid if f is an Ω(l,r)-endomorphic GE-derivation on X. In fact, the Ω(l,r)-endomorphic GE-derivation f in Example 3.5(ⅲ) does not satisfy (3.6) since
f⊺2=⊺1≠1=⊺2∗⊺2=(⊺1∗⊺2)∗⊺2=(f⊺2∗Ω⊺2)∗Ω⊺2=Ω⊺2↰f⊺2. |
Proposition 3.10. If f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X, then
(∀x∈X)(fx=fx↰Ωx). | (3.7) |
Proof. Assume that f is an Ω(l,r)-endomorphic GE-derivation on X. Using (GE2) and Proposition 3.7 induces
fx=f1∗x=(Ω1∗fx)↰(f1∗Ωx)=(1∗fx)↰(1∗Ωx)=fx↰Ωx |
for all x∈X. If f is an Ω(r,l)-endomorphic GE-derivation on X, then
Ωx∗fx(3.6)=Ωx∗(Ωx↰fx)(3.1)=Ωx∗((fx∗Ωx)∗Ωx)(GE3)=Ωx∗((fx∗Ωx)∗(Ωx∗Ωx))(GE1)=Ωx∗((fx∗Ωx)∗1)(2.4)=Ωx∗1(2.4)=1. |
It follows from (GE2) that fx=1∗fx=(Ωx∗fx)∗fx=fx↰Ωx for all x∈X.
Proposition 3.11. If f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation f on X, then the following equation is valid:
(∀x∈X)(fΩx∗fx=1). | (3.8) |
Proof. Let f be an Ω(r,l)-endomorphic GE-derivation on X. Then,
fΩx∗fx(3.6)=fΩx∗(Ωx↰fx)(3.1)=fΩx∗((fx∗Ωx)∗Ωx)(GE3)=fΩx∗((fx∗Ωx)∗(Ωx∗Ωx))(GE1)=fΩx∗((fx∗Ωx)∗1)(2.4)=fΩx∗1(2.4)=f1=1 |
for all x∈X. If f is an Ω(l,r)-endomorphic GE-derivation on X, then
fΩx∗fx(3.7)=fΩx∗(fx↰Ωx)(3.1)=fΩx∗((Ωx∗fx)∗fx)(GE3)=fΩx∗((Ωx∗fx)∗(Ωx∗fx))(GE1)=fΩx∗1(2.4)=f1=1 |
for all x∈X.
Proposition 3.12. If f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X, then the following assertion is valid:
(∀x∈X)(Ωx≤fx). | (3.9) |
Proof. Let f be an Ω(l,r)-endomorphic GE-derivation on X. For every x∈X, we have
Ωx∗fx(3.7)=Ωx∗(fx↰Ωx)(3.1)=Ωx∗((Ωx∗fx)∗fx)(GE3)=Ωx∗((Ωx∗fx)∗(Ωx∗fx))(GE1)=Ωx∗1(2.4)=1, |
and so (3.9) is valid. Assume that f is an Ω(r,l)-endomorphic GE-derivation on X. Then,
Ωx∗fx(3.6)=Ωx∗(Ωx↰fx)(3.1)=Ωx∗((fx∗Ωx)∗Ωx)(GE3)=Ωx∗((fx∗Ωx)∗(Ωx∗Ωx))(GE1)=Ωx∗((fx∗Ωx)∗1)(2.4)=Ωx∗1(2.4)=1 |
for all x,y∈X. Thus, (3.9) is valid.
Proposition 3.13. If f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on a transitive GE-algebra X, then the following assertion is valid:
(∀x,y∈X)(fx∗Ωy≤Ωx∗fy). | (3.10) |
Proof. Suppose that X is a transitive GE-algebra, and let f be an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X. Then, the combination of (2.12) and (3.9) leads to the following assertion:
fx∗Ωy≤Ωx∗Ωy≤Ωx∗fy |
and thus fx∗Ωy≤Ωx∗fy for all x,y∈X by (2.14).
The following example shows that (3.10) is not valid in Proposition 3.13 if the condition "X is transitive" is omitted.
Example 3.14. Let X={1,⊺1,⊺2,⊺3,⊺4} be a set with a binary operation "∗" given in the following table:
∗1⊺1⊺2⊺3⊺411⊺1⊺2⊺3⊺4⊺1111⊺31⊺21⊺111⊺1⊺31⊺4⊺21⊺4⊺411111 |
Then, X is a GE-algebra which is not transitive. Define the self-maps:
f:X→X,x↦{1 if x∈{1,⊺3},⊺1 if x∈{⊺1,⊺4},⊺3 if x=⊺2. |
and
Ω:X→X,x↦{1 if x∈{1,⊺3},⊺1 if x∈{⊺1,⊺4},⊺2 if x=⊺2. |
Then, f is an Ω(l,r)-endomorphic GE-derivation on X. But, f does not satisfy (3.10) since (f⊺1∗Ω⊺2)∗(Ω⊺1∗f⊺2)=(⊺1∗⊺2)∗(⊺1∗⊺3)=1∗⊺3=⊺3≠1, that is, f⊺1∗Ω⊺2≰Ω⊺1∗f⊺2.
Example 3.15. Let X={1,⊺1,⊺2,⊺3,⊺4,⊺5} be a set with a binary operation "∗" given in the following table:
∗1⊺1⊺2⊺3⊺4⊺511⊺1⊺2⊺3⊺4⊺5⊺111⊺511⊺5⊺2111111⊺31⊺411⊺41⊺41⊺31⊺311⊺5111111 |
Then, X is a GE-algebra which is not transitive. Define the self-maps:
f:X→X,x↦{1 if x∈{1,⊺4,⊺5},⊺3 if x∈{⊺1,⊺3},⊺2 if x=⊺2. |
and
Ω:X→X,x↦{1 if x=1,⊺1 if x=⊺1,⊺2 if x=⊺2,⊺3 if x=⊺3,⊺4 if x=⊺4,⊺5 if x=⊺5. |
Then, f is an Ω(r,l)-endomorphic GE-derivation on X. But, f does not satisfy (3.10) since (f⊺1∗Ω⊺2)∗(Ω⊺1∗f⊺2)=(⊺3∗⊺2)∗(⊺1∗⊺2)=1∗⊺5=⊺5≠1, that is, f⊺1∗Ω⊺2≰Ω⊺1∗f⊺2.
Let f and Ω be self-maps on X, and consider the following equality:
(∀x,y∈X)(fx∗y=Ωx∗fy). | (3.11) |
Question 3.16. If f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X, then does Eq (3.11) work?
The answer to Question 3.16 is negative and confirmed in the following examples.
Example 3.17. (ⅰ) In Example 3.14, we can observe that X is a GE-algebra which is not commutative. Also, the Ω(l,r)-endomorphic GE-derivation f does not satisfy (3.11) since f⊺1∗⊺2=f1=1≠⊺3=⊺1∗⊺3=Ω⊺1∗f⊺2.
(ⅱ) In Example 3.15, we can observe that X is a GE-algebra which is not commutative. Also, Ω(r,l)-endomorphic GE-derivation f does not satisfy (3.11) since f⊺1∗⊺2=f⊺5=1≠⊺5=⊺1∗⊺2=Ω⊺1∗f⊺2.
We explore conditions under which the answer to Question 3.16 will be positive.
Theorem 3.18. If X is a commutative GE-algebra, then every Ω(r,l)-endomorphic GE-derivation f on X satisfies Eq (3.11).
Proof. Let f be an Ω(r,l)-endomorphic GE-derivation on a commutative GE-algebra X. Since X is commutative, it is also transitive (see [9]). Hence,
fx∗y(3.5)=(fx∗Ωy)↰(Ωx∗fy)(3.1)=((Ωx∗fy)∗(fx∗Ωy))∗(fx∗Ωy)(2.3)=((fx∗Ωy)∗(Ωx∗fy))∗(Ωx∗fy)(3.10)=1∗(Ωx∗fy)(GE2)=Ωx∗fy |
for all x,y∈X.
Based on Remark 3.4, the following is the corollary of Theorem 3.18.
Corollary 3.19. If X is a commutative GE-algebra, then every Ω(l,r)-endomorphic GE-derivation f on X satisfies equality (3.11).
Question 3.20. If f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X, then are the two self-maps f and Ω consistent?
The answer to Question 3.20 is negative and confirmed in the following example.
Example 3.21. (ⅰ) If we take the Ω(l,r)-endomorphic GE-derivation f in Example 3.5(ⅰ), then f⊺3=1≠⊺3=Ω⊺3.
(ⅱ) If we take the Ω(r,l)-endomorphic GE-derivation f in Example 3.5(ⅱ), then f⊺3=1≠⊺3=Ω⊺3.
Given two self-maps f and Ω on X, consider the following equation:
(∀x,y∈X)(fx∗y=fx∗Ωy). | (3.12) |
If f is an Ω(r,l)-endomorphic GE-derivation or Ω(r,l)-endomorphic GE-derivation on a commutative GE-algebra X, then f may not satisfy (3.12).
Example 3.22. Let X={1,⊺1,⊺2,⊺3,⊺4} be a set with a binary operation "∗" given in the following table:
∗1⊺1⊺2⊺3⊺411⊺1⊺2⊺3⊺4⊺111⊺2⊺3⊺4⊺21⊺11⊺3⊺4⊺31⊺1⊺21⊺4⊺41⊺1⊺2⊺31 |
Then, X is a commutative GE-algebra. Define the self-maps:
f:X→X,x↦{1 if x∈{1,⊺1,⊺2},⊺2 if x=⊺3,⊺4 if x=⊺4. |
and
Ω:X→X,x↦{1 if x=1,⊺1 if x=⊺1,⊺3 if x=⊺2,⊺2 if x=⊺3,⊺4 if x=⊺4. |
Then, f is both an Ω(l,r)-endomorphic GE-derivation and an Ω(r,l)-endomorphic GE-derivation on X. But, f does not satisfy (3.12) since f⊺1∗⊺1=f1=1≠⊺1=1∗⊺1=f⊺1∗Ω⊺1.
The following example shows that there is an Ω(l,r)-endomorphic GE-derivation f or Ω(r,l)-endomorphic GE-derivation f on X that would not normally establish Eq (3.12).
Example 3.23. (ⅰ) The Ω(l,r)-endomorphic GE-derivation f in Example 3.5(ⅰ) does not satisfy the Eq (3.12) since
f⊺1∗⊺3=f⊺4=1≠⊺3=1∗⊺3=f⊺1∗Ω⊺3. |
(ⅱ) The Ω(r,l)-endomorphic GE-derivation f in Example 3.5(ⅱ) does not satisfy the Eq (3.12) since
f⊺1∗⊺3=f⊺3=1≠⊺3=1∗⊺3=f⊺1∗Ω⊺3. |
We investigate the conditions under which two self-maps f and Ω match in X.
Theorem 3.24. If an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation f on X satisfies Eq (3.12), then f matches Ω.
Proof. Assume that f satisfies Eq (3.12). Then,
fx(GE2)=f1∗x(3.12)=f1∗ΩxProposition3.7=1∗Ωx(GE2)=Ωx |
for all x∈X. Hence, f matches Ω.
If an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation f on X satisfies the Eq (3.11), then f may not match Ω.
Example 3.25. Let X={1,⊺1,⊺2,⊺3,⊺4} be a set with a binary operation "∗" given in the following table:
∗1⊺1⊺2⊺3⊺411⊺1⊺2⊺3⊺4⊺1111⊺3⊺3⊺2111⊺4⊺4⊺31⊺1⊺211⊺41⊺1⊺211 |
Then, X is a GE-algebra. Define the self-maps:
f:X→X,x↦{1 if x∈{1,⊺1,⊺3,⊺4},⊺1 if x=⊺2. |
and
Ω:X→X,x↦{1 if x∈{1,⊺3,⊺4},⊺1 if x∈{⊺1,⊺2}. |
Then, f is both an Ω(l,r)-endomorphic GE-derivation and an Ω(r,l)-endomorphic GE-derivation on X satisfying (3.11). But, f does not match with Ω since f⊺1=1≠⊺1=Ω⊺1.
Question 3.26. If f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X, then does the following equation work?
(∀x,y∈X)(Ωx∗fy=fx∗Ωy). | (3.13) |
The answer to Question 3.26 is negative and confirmed in the following examples.
Example 3.27. (ⅰ) The Ω(l,r)-endomorphic GE-derivation f in Example 3.5(ⅰ) does not satisfy Eq (3.13) since
Ω⊺2∗f⊺3=⊺2∗1=1≠⊺3=⊺2∗⊺3=f⊺2∗Ω⊺3. |
(ⅱ) The Ω(r,l)-endomorphic GE-derivation f in Example 3.5(ⅱ) does not satisfy Eq (3.13) since
Ω⊺4∗f⊺3=1∗1=1≠⊺3=1∗⊺3=f⊺4∗Ω⊺3. |
Lemma 3.28. Let f be an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X. If it satisfies (3.13), then Eq (3.12) is valid.
Proof. If f is an Ω(l,r)-endomorphic GE-derivation on X satisfying (3.13), then
fx∗y(3.4)¯¯ (Ωx∗fy)↰(fx∗Ωy)(3.1)=((fx∗Ωy)∗(Ωx∗fy))∗(Ωx∗fy)(3.13)=((fx∗Ωy)∗(fx∗Ωy))∗(fx∗Ωy)(GE1)=1∗(fx∗Ωy)(GE2)=fx∗Ωy |
for all x,y∈X. Let f be an Ω(r,l)-endomorphic GE-derivation on X satisfying (3.13). Then,
fx∗y(3.5)=(fx∗Ωy)↰(Ωx∗fy)(3.1)=((Ωx∗fy)∗(fx∗Ωy))∗(fx∗Ωy)(3.13)=((fx∗Ωy)∗(fx∗Ωy))∗(fx∗Ωy)(GE1)=1∗(fx∗Ωy)(GE2)=fx∗Ωy |
for all x,y∈X.
Corollary 3.29. If f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X, then f matches Ω if and only if Eq (3.13) holds.
Proof. Let f be an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X. Suppose f matches Ω and x,y∈X. Then, fx=Ωx for all x∈X, and hence fx∗Ωy=Ωx∗fy. Conversely, assume that Eq (3.13) holds. Let x∈X. Then, fx=1∗fx=Ω1∗fx=f1∗Ωx=1∗Ωx=Ωx, which is true for all x∈X. Hence, f matches Ω.
Question 3.30. If f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X, then is f order preserving?
The answer to Question 3.30 is negative and confirmed in the following examples.
Example 3.31. (ⅰ) From Example 3.5(ⅲ), the map f is an Ω(l,r)-endomorphic GE-derivation on X. We can observe that ⊺4≤⊺2 and f⊺4∗f⊺2=⊺4∗⊺1=⊺1≠1, i.e., f⊺4≰f⊺2. Hence, f is not order preserving.
(ⅱ) From Example 3.5(ⅱ), the map f is an Ω(r,l)-endomorphic GE-derivation on X. We can observe that ⊺3≤⊺2 and f⊺3∗f⊺2=1∗⊺2=⊺2≠1, that is, f⊺3≰f⊺2. Hence, f is not order preserving.
(ⅲ) Let X={1,⊺1,⊺2,⊺3,⊺4} be a set with a binary operation "∗" given in the following table:
∗1⊺1⊺2⊺3⊺411⊺1⊺2⊺3⊺4⊺1111⊺4⊺4⊺2111⊺3⊺3⊺311111⊺41⊺1111 |
Then, X is a GE-algebra. Define the self-maps:
f:X→X,x↦{1 if x∈{1,⊺1},⊺1 if x=⊺2,⊺3 if x=⊺3,⊺4 if x=⊺4. |
and
Ω:X→X,x↦{1 if x=1,⊺1 if x=⊺1,⊺2 if x=⊺2,⊺3 if x=⊺3,⊺4 if x=⊺4. |
Then, f is an Ω(l,r)-endomorphic GE-derivation on X. We can observe that ⊺1≤⊺2 and f⊺1∗f⊺2=1∗⊺1=⊺1≠1, i.e., f⊺1≰f⊺2. Hence, f is not order preserving.
Now we explore the conditions under which f becomes order preserving when f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X.
Theorem 3.32. Let f be an Ω(r,l)-endomorphic GE-derivation or an Ω(l,r)-endomorphic GE-derivation on X. If X is transitive and f satisfies:
(∀x,y∈X)(fx↰fy≤fx↰y), | (3.14) |
then f is order preserving.
Proof. Let X be a transitive GE-algebra and let x,y∈X be such that x≤y. Then, y↰x=(x∗y)∗y=1∗y=y. Assume that f is an Ω(r,l)-endomorphic GE-derivation on X satisfying (3.14). Then,
fx(2.10)≤(fx∗fy)∗fy=fy↰fx(3.14)≤fy↰x=fy |
Hence, f is order preserving. Similarly, if f is an Ω(l,r)-endomorphic GE-derivation on X satisfying (3.14), then f is order preserving.
Corollary 3.33. Let f be an Ω(r,l)-endomorphic GE-derivation or an Ω(l,r)-endomorphic GE-derivation on X. If X is commutative and f satisfies (3.14), then f is order preserving.
In general, an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation f on X does not satisfy (3.14) as seen in the following example.
Example 3.34. (ⅰ) Let X={1,⊺1,⊺2,⊺3,⊺4,⊺5} be a set with a binary operation "∗" given in the following table:
∗1⊺1⊺2⊺3⊺4⊺511⊺1⊺2⊺3⊺4⊺5⊺111⊺2⊺31⊺3⊺2111⊺51⊺5⊺31⊺1⊺2111⊺41⊺1⊺2111⊺51⊺1⊺2111 |
Then, X is a GE-algebra. Define the self-maps:
f:X→X,x↦{1 if x∈{1,⊺3,⊺4,⊺5},⊺3 if x=⊺1,⊺1 if x=⊺2. |
and
Ω:X→X,x↦{1 if x∈{1,⊺3,⊺4,⊺5},⊺4 if x=⊺1,⊺2 if x=⊺2. |
Then, f is an Ω(l,r)-endomorphic GE-derivation on X. The Ω(l,r)-endomorphic GE-derivation f does not satisfy (3.14), since
((f⊺2∗f⊺1)∗f⊺1)∗f(⊺2∗⊺1)∗⊺1=((⊺1∗⊺3)∗⊺3)∗f1∗⊺1=(⊺3∗⊺3)∗f⊺1=1∗⊺1=⊺1≠1, |
that is, f⊺1↰f⊺2≰f⊺1↰⊺2.
(ⅱ) Let X={1,⊺1,⊺2,⊺3,⊺4,⊺5} be a set with a binary operation "∗" given in the following table:
∗1⊺1⊺2⊺3⊺4⊺511⊺1⊺2⊺3⊺4⊺5⊺111⊺2⊺5⊺4⊺5⊺2111⊺3⊺3⊺3⊺31⊺1⊺21⊺21⊺4111111⊺51⊺1⊺21⊺21 |
Then, X is a GE-algebra. Define the self-maps:
f:X→X,x↦{1 if x∈{1,⊺3,⊺5},⊺1 if x=⊺1,⊺3 if x∈{⊺2,⊺4}. |
and
Ω:X→X,x↦{1 if x∈{1,⊺3,⊺5},⊺1 if x=⊺1,⊺4 if x∈{⊺2,⊺4}. |
Then, f is an Ω(r,l)-endomorphic GE-derivation on X. The Ω(r,l)-endomorphic GE-derivation f does not satisfy (3.14), since
((f⊺2∗f⊺1)∗f⊺1)∗f(⊺2∗⊺1)∗⊺1=((⊺3∗⊺1)∗⊺1)∗f1∗⊺1=(⊺1∗⊺1)∗f⊺1=1∗⊺1=⊺1≠1, |
that is, f⊺1↰f⊺2≰f⊺1↰⊺2.
Let f be an Ω(r,l)-endomorphic GE-derivation or an Ω(l,r)-endomorphic GE-derivation on X. We consider the following set:
Ωf(X):={x∈X∣fx=Ωx}. | (3.15) |
Theorem 3.35. If f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X, then the set Ωf(X) is a GE-subalgebra of X and 1∈Ωf(X).
Proof. Let f be an Ω(l,r)-endomorphic GE-derivation on X. If x,y∈Ωf(X), then fx=Ωx and fy=Ωy. Hence,
fx∗y(3.4)¯¯ (Ωx∗fy)↰(fx∗Ωy)(3.1)=((fx∗Ωy)∗(Ωx∗fy))∗(Ωx∗fy)=((Ωx∗fy)∗(Ωx∗fy))∗(Ωx∗fy)(GE1)=1∗(Ωx∗Ωy)(GE2)=Ωx∗Ωy=Ωx∗y, |
and so x∗y∈Ωf(X). Hence, Ωf(X) is a GE-subalgebra of X. Similarly, if f is an Ω(r,l)-endomorphic GE-derivation on X, then Ωf(X) is a GE-subalgebra of X. It is clear that 1∈Ωf(X).
Proposition 3.36. If f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X, then the set Ωf(X) is closed under the operation "↰".
Proof. Let x,y∈Ωf(X). Then, fx=Ωx and fy=Ωy. Assume that f is an Ω(l,r)-endomorphic GE-derivation on X. Then,
fx↰y=f(y∗x)∗x(3.4)¯¯ (Ωy∗x∗fx)↰(fy∗x∗Ωx)(3.4)¯¯ (Ωy∗x∗fx)↰(((Ωy∗fx)↰(fy∗Ωx))∗Ωx)=(Ωy∗x∗Ωx)↰(((Ωy∗Ωx)↰(Ωy∗Ωx))∗Ωx)(3.3)=(Ωy∗x∗Ωx)↰((Ωy∗Ωx)∗Ωx)=(Ωy∗x∗Ωx)↰(Ωy∗x∗Ωx)(3.3)=Ωy∗x∗Ωx=Ω(y∗x)∗x=Ωx↰y, |
and so x↰y∈Ωf(X). This shows that Ωf(X) is closed under the operation "↰". If f is an Ω(r,l)-endomorphic GE-derivation on X, then
fx↰y=f(y∗x)∗x(3.5)=(fy∗x∗Ωx)↰(Ωy∗x∗fx)(3.5)=(((fy∗Ωx)↰(Ωy∗fx))∗Ωx)↰(Ωy∗x∗fx)=(((Ωy∗Ωx)↰(Ωy∗Ωx))∗Ωx)↰(Ωy∗x∗Ωx)(3.3)=((Ωy∗Ωx)∗Ωx)↰(Ωy∗x∗Ωx)=(Ωy∗x∗Ωx)↰(Ωy∗x∗Ωx)(3.3)=Ωy∗x∗Ωx=Ω(y∗x)∗x=Ωx↰y, |
and so x↰y∈Ωf(X). This shows that Ωf(X) is closed under the operation "↰".
Let f be an Ω(r,l)-endomorphic GE-derivation or an Ω(l,r)-endomorphic GE-derivation on X. We consider the following sets:
kerX(f):={x∈X∣fx=1}, | (3.16) |
kerX(Ω):={x∈X∣Ωx=1} | (3.17) |
which is called the f-kernel of f and the Ω-kernel of f, respectively, in X.
Theorem 3.37. If f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X, then its f-kernel and its Ω-kernel are GE-subalgebras of X and 1∈kerX(f)∩kerX(Ω).
Proof. Let x,y∈kerX(f). Then, fx=1 and fy=1. Assume that f is an Ω(l,r)-endomorphic GE-derivation on X. Then,
fx∗y(3.4)=(Ωx∗fy)↰(fx∗Ωy)=(Ωx∗1)↰(1∗Ωy)(2.4)&(GE2)=1↰Ωy(3.2)=1, |
and so x∗y∈kerX(f). Hence, kerX(f) is a GE-subalgebra of X. If f is an Ω(r,l)-endomorphic GE-derivation on X, then
fx∗y(3.5)=(fx∗Ωy)↰(Ωx∗fy)=(1∗Ωy)↰(Ωx∗1)(2.4)&(GE2)=Ωy↰1(3.2)=1, |
and so x∗y∈kerX(f). Hence, kerX(f) is a GE-subalgebra of X. If x,y∈kerX(Ω), then Ωx=1 and Ωy=1. Since Ω is a GE-endomorphism, it follows that Ωx∗y=Ωx∗Ωy=1∗1=1 and Ω1=1. Thus, x∗y∈kerX(Ω) and 1∈kerX(Ω). Hence, kerX(Ω) is a GE-subalgebra of X. It is clear that 1∈kerX(f) by Proposition 3.7. Therefore, 1∈kerX(f)∩kerX(Ω).
The example below illustrates Theorem 3.37.
Example 3.38. (ⅰ) In Example 3.5(ⅰ), we can observe that kerX(f)={1,⊺1,⊺3,⊺4} and kerX(Ω)={1,⊺1} are GE-subalgebras of X, and 1∈kerX(f)∩kerX(Ω).
(ⅱ) In Example 3.5(ⅱ), we can observe that kerX(f)={1,⊺1,⊺3,⊺4} and kerX(Ω)={1,⊺1,⊺4} are GE-subalgebras of X, and 1∈kerX(f)∩kerX(Ω).
Proposition 3.39. If f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X, then its f-kernel satisfies:
(∀x,y∈X)(x∈kerX(f)⇒y∗x∈kerX(f),x↰y∈kerX(f)). | (3.18) |
Proof. Let x,y∈X be such that x∈kerX(f). Then, fx=1. If f is an Ω(l,r)-endomorphic GE-derivation on X, then
fy∗x(3.4)¯¯ (Ωy∗fx)↰(fy∗Ωx)=(Ωy∗1)↰(fy∗Ωx)(2.4)=1↰(fy∗Ωx)(3.2)= |
and
fx↰y(3.1)=f(y∗x)∗x(3.4)¯¯ (Ωy∗x∗fx)↰(fy∗x∗Ωx)(3.4)¯¯ (Ωy∗x∗fx)↰(((Ωy∗fx)↰(fy∗Ωx))∗Ωx)=(Ωy∗x∗1)↰(((Ωy∗1)↰(fy∗Ωx))∗Ωx)(2.4)=1↰((1↰(fy∗Ωx))∗Ωx)(3.2)= |
If f is an Ω(r,l)-endomorphic GE-derivation on X, then
fy∗x(3.5)=(fy∗Ωx)↰(Ωy∗fx)=(fy∗Ωx)↰(Ωy∗1)(2.4)=(fy∗Ωx)↰1(3.2)= |
and
fx↰y(3.1)=f(y∗x)∗x(3.5)=(fy∗x∗Ωx)↰(Ωy∗x∗fx)=(fy∗x∗Ωx)↰(Ωy∗x∗1)(2.4)=(fy∗x∗Ωx)↰1(3.2)=. |
Hence, y∗x∈kerX(f) and x↰y∈kerX(f).
For any Ω(l,r)-endomorphic GE-derivation or Ω(r,l)-endomorphic GE-derivation f on X, its f-kernel does not satisfy the following assertions:
(∀x,y∈X)(x∈kerX(f)⇒x∗y∈kerX(f)), | (3.19) |
(∀x,y∈X)(x∈kerX(f)⇒y↰x∈kerX(f)). | (3.20) |
In fact, in Example 3.31(ⅲ), we can observe that kerX(f)={1,⊺1}. But, it does not satisfy (3.19) and (3.20) since ⊺1∗⊺3=⊺4∉kerX(f) and
⊺2↰⊺1=(⊺1∗⊺2)∗⊺2=1∗⊺2=⊺2∉kerX(f). |
Also, in Example 3.5(ⅱ), we can observe that kerX(f)={1,⊺1,⊺3,⊺4}. But, it does not satisfy (3.19) and (3.20) since ⊺1∗⊺2=⊺2∉kerX(f) and
⊺2↰⊺3=(⊺3∗⊺2)∗⊺2=1∗⊺2=⊺2∉kerX(f). |
Proposition 3.40. If f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X, then its Ω-kernel satisfies:
(∀x,y∈X)(x∈kerX(Ω)⇒{y∗x∈kerX(Ω)x↰y,y↰x∈kerX(Ω)). | (3.21) |
Proof. Let f be an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X. For every x,y∈X, if x∈kerX(Ω), then Ωx=1. Hence,
Ωy∗x=Ωy∗Ωx=Ωy∗1=1, |
Ωx↰y=Ω(y∗x)∗x=Ωy∗x∗Ωx=(Ωy∗Ωx)∗Ωx=(Ωy∗1)∗1=1 and
Ωy↰x=Ω(x∗y)∗y=Ωx∗y∗Ωy=(Ωx∗Ωy)∗Ωy=(1∗Ωy)∗Ωy=Ωy∗Ωy=1. |
Therefore, y∗x∈kerX(Ω) and x↰y,y↰x∈kerX(Ω).
For any Ω(l,r)-endomorphic GE-derivation or Ω(r,l)-endomorphic GE-derivation f on X, its Ω-kernel does not satisfy the following assertions:
(∀x,y∈X)(x∈kerX(Ω)⇒x∗y∈kerX(Ω)), | (3.22) |
In fact, in Example 3.5(ⅰ), we can observe that kerX(Ω)={1,⊺1}. But, it does not satisfy (3.22) since ⊺1∗⊺2=⊺2∉kerX(Ω). Also, in Example 3.5(ⅱ), we can observe that kerX(Ω)={1,⊺1,⊺4}. But, it does not satisfy (3.22) since
⊺1∗⊺2=⊺2∉kerX(Ω). |
Proposition 3.41. If f is an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation on X, then it satisfies:
(∀x,y∈X)(x≤y,x∈kerX(Ω)⇒y∈kerX(Ω)). | (3.23) |
Proof. Let x,y∈X be such that x≤y and x∈kerX(Ω). Hence, Ωx∗y=1 by Ωx=1, so that Ωx∗Ωy=1. Hence, Ωy=1∗Ωy=Ωx∗Ωy=1. Therefore, y∈kerX(Ω).
Remark 3.42. In an Ω(l,r)-endomorphic GE-derivation or an Ω(r,l)-endomorphic GE-derivation f on X, the following does not apply:
(∀x,y∈X)(x≤y,x∈kerX(f)⇒y∈kerX(f)). | (3.24) |
In fact, in Example 3.31(ⅲ), we can observe that {\rm ker}_{{X}}({f}) = \{{1}, {\intercal_1}\} . But, (3.24) is not valid since {\intercal_1}{*} {\intercal_2} = {1} , i.e., {\intercal_1} \leq {\intercal_2}) and {\intercal_1}\in {\rm ker}_{{X}}({f}) , but {\intercal_2}\notin {\rm ker}_{{X}}({f}). Also, in Example 3.5(ⅱ), we can observe that {\rm ker}_{{X}}({f}) = \{{1}, {\intercal_1}, {\intercal_3}, {\intercal_4}\} . But, (3.24) is not valid since {\intercal_3}{*} {\intercal_2} = {1} , i.e., {\intercal_3} \leq {\intercal_2} and {\intercal_3}\in {\rm ker}_{{X}}({f}) , but {\intercal_2}\notin {\rm ker}_{{X}}({f}).
Proposition 3.43. Let {f} be an {\Omega}_{(l, r)} -endomorphic GE-derivation or an {\Omega}_{(r, l)} -endomorphic GE-derivation on {X} . If {X} is commutative, then it satisfies (3.24).
Proof. Let {x}, {y}\in {X} be such that {x}\leq {y} . Then, {x}{*} {y} = {1} . Assume that {f} is an {\Omega}_{(l, r)} -endomorphic GE-derivation on a commutative GE-algebra {X} . If {x}\in {\rm ker}_{{X}}({f}), then {f}_{{x}} = {1} , and so
\begin{align*} {f}_{{y}}&\stackrel{(GE2)}{ = } {f}_{{1}{*} {y}} = {f}_{({x}{*} {y}){*} {y}} \stackrel{(2.3)}{ = }{f}_{({y}{*} {x}){*} {x}} \\& \overset{(3.4)}{\mathop{\overline{\overline{\ \ }}}}\, ({\Omega}_{{y}{*} {x}}{*} {f}_{{x}}){\Lsh} ({f}_{{y}{*} {x}}{*} {\Omega}_{{x}}) = ({\Omega}_{{y}{*} {x}}{*} {1}){\Lsh} ({f}_{{y}{*} {x}}{*} {\Omega}_{{x}}) \\& \stackrel{(2.4)}{ = } {1}{\Lsh} ({f}_{{y}{*} {x}}{*} {\Omega}_{{x}}) \stackrel{(3.2)}{ = } \end{align*} |
which shows that {y}\in {\rm ker}_{{X}}({f}) . Suppose that {f} is an {\Omega}_{(r, l)} -endomorphic GE-derivation on a commutative GE-algebra {X} . If {x}\in {\rm ker}_{{X}}({f}), then {f}_{{x}} = {1} , and so
\begin{align*} {f}_{{y}}&\stackrel{(GE2)}{ = } {f}_{{1}{*} {y}} = {f}_{({x}{*} {y}){*} {y}} \stackrel{(2.3)}{ = }{f}_{({y}{*} {x}){*} {x}} \\& \overset{(3.4)}{\mathop{\overline{\overline{\ \ }}}}\, ({f}_{{y}{*} {x}}{*} {\Omega}_{{x}}){\Lsh} ({\Omega}_{{y}{*} {x}}{*} {f}_{{x}}) = ({f}_{{y}{*} {x}}{*} {\Omega}_{{x}}){\Lsh} ({\Omega}_{{y}{*} {x}}{*} {1}) \\& \stackrel{(2.4)}{ = } ({f}_{{y}{*} {x}}{*} {\Omega}_{{x}}){\Lsh} {1} \stackrel{(3.2)}{ = } \end{align*} |
which shows that {y}\in {\rm ker}_{{X}}({f}) .
If {X} satisfies (3.24), then {X} may not be commutative. From Example 3.34(ⅰ), we can observe that {\rm ker}_{{X}}({f}) = \{1, {\intercal_3}, {\intercal_4}, {\intercal_5}\} satisfies (3.24). But, {X} is not commutative. Also, from Example 3.34(ⅱ), we can observe that {\rm ker}_{{X}}({f}) = \{1, {\intercal_3}, {\intercal_5}\} satisfies (3.24). But, {X} is not commutative since ({\intercal_1} {*} {\intercal_2}) {*} {\intercal_2} = {\intercal_2}{*} {\intercal_2} = 1\neq {\intercal_1} = 1{*} {\intercal_1} = ({\intercal_2} {*} {\intercal_1}) {*} {\intercal_1} .
Corollary 3.44. If {f} is an {\Omega}_{(l, r)} -endomorphic GE-derivation or an {\Omega}_{(r, l)} -endomorphic GE-derivation on {X} , then its {\Omega} -kernel is a GE-filter of {X} .
Proof. It is clear that {1} \in {\rm ker}_{{X}}({\Omega}) . Let {x}, {y}\in {X} be such that {x}\in {\rm ker}_{{X}}({\Omega}) and {x}{*} {y}\in {\rm ker}_{{X}}({\Omega}) . Then, {\Omega}_{{x}} = {1} and {\Omega}_{{x}{*} {y}} = {1} , and so {1} = {\Omega}_{{x}{*} {y}} = {\Omega}_{{x}}{*} {\Omega}_{{y}} = {1} {*} {\Omega}_{{y}} = {\Omega}_{{y}} , that is, {y}\in {\rm ker}_{{X}}({\Omega}) . Therefore, {\rm ker}_{{X}}({\Omega}) is a GE-filter of {X} .
We know from Remark 3.42 that the {f} -kernel is not a GE-filter of {X} for every {\Omega}_{(l, r)} -endomorphic GE-derivation or {\Omega}_{(r, l)} -endomorphic GE-derivation {f} on {X} . Finally, we find a condition for the {f} -kernel to be a GE-filter of {X} .
Theorem 3.45. Let {f} be an {\Omega}_{(l, r)} -endomorphic GE-derivation or an {\Omega}_{(r, l)} -endomorphic GE-derivation on {X} . If {f} is a GE-endomorphism on {X} , then its {f} -kernel is a GE-filter of {X} .
Proof. Assume that {f} is a GE-endomorphism on {X} . It is clear that {1} \in {\rm ker}_{{X}}({f}) . Let {x}, {y}\in {X} be such that {x}\in {\rm ker}_{{X}}({f}) and {x}{*} {y} \in {\rm ker}_{{X}}({f}) . Then, {f}_{{x}} = {1} and {f}_{{x}{*} {y}} = {1} . Hence, {1} = {f}_{{x}{*} {y}} = {f}_{{x}}{*} {f}_{{y}} = {1} {*} {f}_{{y}} = {f}_{{y}} , and thus {y}\in {\rm ker}_{{X}}({f}) . Therefore, {\rm ker}_{{X}}({f}) is a GE-filter of {X} .
The concept of derivation is commonly used in a variety of contexts, including mathematics, linguistics, physics, and chemistry, as it represents a source or the process of obtaining something from a source. It is a well-known fact that the concept of derivation is mainly addressed in calculus in the field of mathematics. With the aim of addressing the concept of derivation in GE-algebra, one of the logical algebras, we have introduced the notion of {\Omega}_{(l, r)} -endomorphic (resp., {\Omega}_{(r, l)} -endomorphic) GE-derivation using the binary operation " {\Lsh} " on a GE-algebra {X} given by {\Lsh}({x}, {y}) = ({y}{*} {x}){*} {x} and the GE-endomorphism {\Omega} : {X} \rightarrow {X} , and investigated several properties. We have studied the conditions under which {\Omega}_{(l, r)} -endomorphic GE-derivations or {\Omega}_{(l, r)} -endomorphic GE-derivations to satisfy certain equalities and inequalities. We have explored the conditions under which {f} becomes order preserving when {f} is an {\Omega}_{(l, r)} -endomorphic GE-derivation or an {\Omega}_{(r, l)} -endomorphic GE-derivation on {X} . We have observed that the {f} -kernel of {f} and the {\Omega} -kernel of {f} formed by the {\Omega}_{(r, l)} -endomorphic GE-derivation or {\Omega}_{(l, r)} -endomorphic GE-derivation are GE-subalgebras. Also, we have observed that the {\Omega} -kernel of {f} is a GE-filter of {X} , but the {f} -kernel of {f} is not a GE-filter of {X} . Finally, we have explored the condition under which the {f} -kernel of {f} formed by the {\Omega}_{(r, l)} -endomorphic GE-derivation or {\Omega}_{(l, r)} -endomorphic GE-derivation becomes a GE-filter.
With the results and ideas obtained in this paper in the background, we will attempt to develop various forms of derivations on GE-algebras, and we also plan to study the concept of derivations in various forms of logical algebra.
Young Bae Jun: Conceptualization, Methodology, Validation, Writing—original draft, Writing—review and editing; Ravikumar Bandaru: Conceptualization, Methodology, Validation, Writing—original draft, Writing—review and editing; Amal S. Alali: Conceptualization, Methodology, Validation, Writing—review and editing, Funding. All authors have read and agreed to the published version of the manuscript.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
The authors extend their appreciation to Princess Nourah bint Abdulrahman University for funding this research under Researchers Supporting Project number(PNURSP2025R231), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.
Young Bae Jun is the Guest Editor of special issue "General Algebraic Structures and Fuzzy Algebras" for AIMS Mathematics. Young Bae Jun was not involved in the editorial review and the decision to publish this article. The authors declare that they have no conflicts of interest.
[1] |
T. K. Nguyen, H. H. Nguyen, E. Bedeer, Performance improvement of LoRa modulation with signal combining and semi-coherent detection, IEEE Commun. Lett., 25 (2021), 2889–2893. https://doi.org/10.1109/LCOMM.2021.3091997 doi: 10.1109/LCOMM.2021.3091997
![]() |
[2] |
J. M. Kang, MIMO-LoRa for high-data-rate IoT: Concept and precoding design, IEEE Internet Things J., 9 (2022), 10368–10369. https://doi.org/10.1109/JIOT.2022.3143516 doi: 10.1109/JIOT.2022.3143516
![]() |
[3] |
L. Vangelista, Frequency shift chirp modulation: The LoRa modulation, IEEE Signal Proc. Lett., 24 (2017), 1818–1821. https://doi.org/10.1109/LSP.2017.2762960 doi: 10.1109/LSP.2017.2762960
![]() |
[4] |
M. Chiani, A. Elzanaty, On the LoRa modulation for IoT: Waveform properties and spectral analysis, IEEE Internet Things J., 6 (2019), 8463–8470. https://doi.org/10.1109/JIOT.2019.2919151 doi: 10.1109/JIOT.2019.2919151
![]() |
[5] |
C. Bernier, F. Dehmas, N. Deparis, Low complexity LoRa frame synchronization for ultra-low power software-defined radios, IEEE T. Commun., 68 (2020), 3140–3152. https://doi.org/10.1109/TCOMM.2020.2974464 doi: 10.1109/TCOMM.2020.2974464
![]() |
[6] | R. Ghanaatian, O. Afisiadis, M. Cotting, A. Burg, LoRa digital receiver analysis and implementation, In: ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2019. https://doi.org/10.1109/ICASSP.2019.8683504 |
[7] |
M. Xhonneux, O. Afisiadis, D. Bol, J. Louveaux, A low-complexity LoRa synchronization algorithm robust to sampling time offsets, IEEE Internet Things J., 9 (2022), 3756–3769. https://doi.org/10.1109/JIOT.2021.3101002 doi: 10.1109/JIOT.2021.3101002
![]() |
[8] | O. Georgiou, U. Raza, Low power wide area network analysis: Can LoRa scale? IEEE Wirel. Commun. Lett., 6 (2017), 162–165. https://doi.org/10.1109/LWC.2016.2647247 |
[9] |
O. Afisiadis, S. Li, J. Tapparel, A. Burg, A. Balatsoukas-Stimming, On the advantage of coherent LoRa detection in the presence of interference, IEEE Internet Things J., 8 (2021), 11581–11593. https://doi.org/10.1109/JIOT.2021.3058792 doi: 10.1109/JIOT.2021.3058792
![]() |
[10] |
T. Elshabrawy, J. Robert, Closed-form approximation of LoRa modulation BER performance, IEEE Commun. Lett., 22 (2018), 1778–1781. https://doi.org/10.1109/LCOMM.2018.2849718 doi: 10.1109/LCOMM.2018.2849718
![]() |
[11] |
O. Afisiadis, M. Cotting, A. Burg, A. Balatsoukas-Stimming, On the error rate of the LoRa modulation with Interference, IEEE T. Wirel. Commun., 19 (2020), 1292–1304. https://doi.org/10.1109/TWC.2019.2952584 doi: 10.1109/TWC.2019.2952584
![]() |
[12] | O. Afisiadis, S. Li, J. Tapparel, A. Burg, A. Balatsoukas-Stimming, On the advantage of coherent LoRa detection in the presence of interference, 2020. arXiv: 2010.00507. |
[13] |
D. Croce, M. Gucciardo, S. Mangione, G. Santaromita, I. Tinnirello, Impact of LoRa imperfect orthogonality: Analysis of link-level performance, IEEE Commun. Lett., 22 (2018), 796–799. https://doi.org/10.1109/LCOMM.2018.2797057 doi: 10.1109/LCOMM.2018.2797057
![]() |
[14] |
X. Zhang, W. Xu, G. Cai, Y. Song, G. Chen, A new reconfigurable intelligent-surface-assisted LoRa system, IEEE T. Veh. Technol., 71 (2022), 9055–9060. https://doi.org/10.1109/TVT.2022.3173675 doi: 10.1109/TVT.2022.3173675
![]() |
[15] |
Q. Wu, R. Zhang, Towards smart and reconfigurable environment: Intelligent reflecting surface aided wireless network, IEEE Commun. Mag., 58 (2020), 106–112. https://doi.org/10.1109/MCOM.001.1900107 doi: 10.1109/MCOM.001.1900107
![]() |
[16] |
S. Gong, X. Lu, D. T. Hoang, D. Niyato, L. Shu, D. I. Kim, et al., Towards smart wireless communications via intelligent reflecting surfaces: A contemporary survey, IEEE Commun. Surv. Tut., 22 (2020), 2283–2314. https://doi.org/10.1109/COMST.2020.3004197 doi: 10.1109/COMST.2020.3004197
![]() |
[17] |
J. M. Kang, Intelligent reflecting surface: Joint optimal training sequence and refection pattern, IEEE Commun. Lett., 24 (2020), 1784–1788. https://doi.org/10.1109/LCOMM.2020.2991178 doi: 10.1109/LCOMM.2020.2991178
![]() |
[18] |
B. Zheng, R. Zhang, Intelligent reflecting surface-enhanced OFDM: Channel estimation and reflection optimization, IEEE Wirel. Commun. Lett., 9 (2020), 518–522. https://doi.org/10.1109/LWC.2019.2961357 doi: 10.1109/LWC.2019.2961357
![]() |
[19] |
Y. C. Liang, R. Long, Q. Zhang, J. Chen, H. V. Cheng, H. Guo, Large intelligent surface/antennas (LISA): Making reflective radios smart, J. Commun. Inform. Netw., 4 (2019), 40–50. https://doi.org/10.23919/JCIN.2019.8917871 doi: 10.23919/JCIN.2019.8917871
![]() |
[20] | Q. Wu, R. Zhang, Intelligent reflecting surface enhanced wireless network: Joint active and passive beamforming design, In: 2018 IEEE Global Communications Conference (GLOBECOM), 2018. https://doi.org/10.1109/GLOCOM.2018.8647620 |
[21] |
Q. Wu, R. Zhang, Intelligent reflecting surface enhanced wireless network via joint active and passive beamforming, IEEE T. Wirel. Commun., 18 (2019), 5394–5409. https://doi.org/10.1109/TWC.2019.2936025 doi: 10.1109/TWC.2019.2936025
![]() |
[22] | X. Yu, D. Xu, R. Schober, MISO wireless communication systems via intelligent reflecting surfaces, In: 2019 IEEE/CIC International Conference on Communications in China (ICCC), 2019. https://doi.org/10.1109/ICCChina.2019.8855810 |
[23] |
H. Guo, Y. C. Liang, J. Chen, E. G. Larsson, Weighted sum-rate maximization for reconfigurable intelligent surface aided wireless networks, IEEE T. Wirel. Commun., 19 (2020), 3064–3076. https://doi.org/10.1109/TWC.2020.2970061 doi: 10.1109/TWC.2020.2970061
![]() |
[24] |
M. Zhu, K. Guo, Y. Ye, L. Yang, T. A. Tsiftsis, H. Liu, Active RIS-aided covert communications for MISO-NOMA systems, IEEE Wirel. Commun. Lett., 12 (2023), 2203–2207. https://doi.org/10.1109/LWC.2023.3314625 doi: 10.1109/LWC.2023.3314625
![]() |
[25] |
Z. Lu, Y. Zhao, X. Li, C. Z. Xu, Randomized passive energy beamforming for cooperative localization in reconfigurable intelligent surface assisted wireless backscattered sensor network, IEEE Internet Things J., 11 (2023), 9693–9707. https://doi.org/10.1109/JIOT.2023.3323426 doi: 10.1109/JIOT.2023.3323426
![]() |
[26] |
S. Zhang, R. Zhang, Capacity characterization for intelligent reflecting surface aided MIMO communication, IEEE J. Sel. Area. Commun., 38 (2020), 1823–1838. https://doi.org/10.1109/JSAC.2020.3000814 doi: 10.1109/JSAC.2020.3000814
![]() |
[27] |
M. Hanif, H. H. Nguyen, Slope-shift keying LoRa-based modulation, IEEE Internet Things J., 8 (2021), 211–221. https://doi.org/10.1109/JIOT.2020.3004318 doi: 10.1109/JIOT.2020.3004318
![]() |
[28] | J. Tapparel, Complete reverse engineering of LoRa PHY, Available from: https://www.epfl.ch/labs/tcl/wp-content/uploads/2020/02/Reverse_Eng_Report.pdf |
[29] |
M. Biguesh, A. B. Gershman, Training-based MIMO channel estimation: A study of estimator tradeoffs and optimal training signals, IEEE T. Signal Proces., 54 (2006), 884–893. https://doi.org/10.1109/TSP.2005.863008 doi: 10.1109/TSP.2005.863008
![]() |
[30] | S. Y. Wang, Y. R. Chen, T. Y. Chen, C. H. Chang, Y. H. Cheng, C. C. Hsu, Performance of LoRa-based IoT applications on campus, In: 2017 IEEE 86th Vehicular Technology Conference (VTC-Fall), 2017. https://doi.org/10.1109/VTCFall.2017.8288154 |
[31] | K. E. Nolan, W. Guibene, M. Y. Kelly, An evaluation of low power wide area network technologies for the internet of things, In: 2016 International Wireless Communications and Mobile Computing Conference (IWCMC), 2016. https://doi.org/10.1109/IWCMC.2016.7577098 |
[32] | J. Petajajarvi, K. Mikhaylov, A. Roivainen, T. Hanninen, M. Pettissalo, On the coverage of LPWANs: Range evaluation and channel attenuation model for LoRa technology, In: 2015 14th International Conference on ITS Telecommunications (ITST), 2015. https://doi.org/10.1109/ITST.2015.7377400 |
[33] | J. Tapparel, O. Afisiadis, P. Mayoraz, A. Balatsoukas-Stimming, A. Burg, An open-source LoRa physical layer prototype on GNU radio, In: 2020 IEEE 21st International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2020. https://doi.org/10.1109/SPAWC48557.2020.9154273 |
[34] | IEEE 802.20 WG, IEEE 802.20 channel models document, IEEE 802.20 PD-08r1, 2007. |