Mathematical approaches to structure model problems have a significant role in expanding our knowledge in our routine life circumstances. To put them into practice, the right formulation, method, systematic representation, and formulation are needed. The purpose of introducing soft graphs is to discretize these fundamental mathematical ideas, which are inherently continuous, and to provide new tools for applying mathematical analysis technology to real-world applications including imperfect and inexact data or uncertainty. Soft rough covering models (briefly, SRC-Models), a novel theory that addresses uncertainty. In this present paper, we have introduced two new concepts Li-soft rough covering graphs (Li-SRCGs) and the concept of fixed point of such graphs. Furthermore, we looked into a some algebras that dealt with the fixed points of Li-SRCGs. Applications of the algebraic structures available in covering soft sets to soft graphs may reveal new facets of graph theory.
Citation: Imran Shahzad Khan, Nasir Shah, Abdullah Shoaib, Poom Kumam, Kanokwan Sitthithakerngkiet. A new approach to the study of fixed points based on soft rough covering graphs[J]. AIMS Mathematics, 2023, 8(9): 20415-20436. doi: 10.3934/math.20231041
[1] | Zhimin Liu, Ripeng Huang, Songtao Shao . Data-driven two-stage fuzzy random mixed integer optimization model for facility location problems under uncertain environment. AIMS Mathematics, 2022, 7(7): 13292-13312. doi: 10.3934/math.2022734 |
[2] | Shuai Huang, Youwu Lin, Jing Zhang, Pei Wang . Chance-constrained approach for decentralized supply chain network under uncertain cost. AIMS Mathematics, 2023, 8(5): 12217-12238. doi: 10.3934/math.2023616 |
[3] | Chang-Jun Wang, Zi-Jian Gao . Two-stage stochastic programming with imperfect information update: Value evaluation and information acquisition game. AIMS Mathematics, 2023, 8(2): 4524-4550. doi: 10.3934/math.2023224 |
[4] | Ruiping Wen, Wenwei Li . An accelerated alternating directional method with non-monotone technique for matrix recovery. AIMS Mathematics, 2023, 8(6): 14047-14063. doi: 10.3934/math.2023718 |
[5] | Ebenezer Fiifi Emire Atta Mills . The worst-case scenario: robust portfolio optimization with discrete distributions and transaction costs. AIMS Mathematics, 2024, 9(8): 20919-20938. doi: 10.3934/math.20241018 |
[6] | Massoumeh Nazari, Mahmoud Dehghan Nayeri, Kiamars Fathi Hafshjani . Developing mathematical models and intelligent sustainable supply chains by uncertain parameters and algorithms. AIMS Mathematics, 2024, 9(3): 5204-5233. doi: 10.3934/math.2024252 |
[7] | Yang Chang, Guangyang Liu, Hongyan Yan . Bang-bang control for uncertain random continuous-time switched systems. AIMS Mathematics, 2025, 10(1): 1645-1674. doi: 10.3934/math.2025076 |
[8] | Zongqi Sun, Peng Yang, Jing Wu, Yunpeng Fan . The defined contribution pension plan after retirement under the criterion of a revised loss considering the economic situation. AIMS Mathematics, 2024, 9(2): 4749-4761. doi: 10.3934/math.2024229 |
[9] | Yanfei Chai . Robust strong duality for nonconvex optimization problem under data uncertainty in constraint. AIMS Mathematics, 2021, 6(11): 12321-12338. doi: 10.3934/math.2021713 |
[10] | Zongqi Sun, Peng Yang, Ying Wang, Jing Lu . Research on the wealth management fees of defined contribution pensions during the pre-retirement stage. AIMS Mathematics, 2024, 9(12): 36102-36115. doi: 10.3934/math.20241713 |
Mathematical approaches to structure model problems have a significant role in expanding our knowledge in our routine life circumstances. To put them into practice, the right formulation, method, systematic representation, and formulation are needed. The purpose of introducing soft graphs is to discretize these fundamental mathematical ideas, which are inherently continuous, and to provide new tools for applying mathematical analysis technology to real-world applications including imperfect and inexact data or uncertainty. Soft rough covering models (briefly, SRC-Models), a novel theory that addresses uncertainty. In this present paper, we have introduced two new concepts Li-soft rough covering graphs (Li-SRCGs) and the concept of fixed point of such graphs. Furthermore, we looked into a some algebras that dealt with the fixed points of Li-SRCGs. Applications of the algebraic structures available in covering soft sets to soft graphs may reveal new facets of graph theory.
The algebra of derivations and generalized derivations play a crucial role in the study of functional identities and their applications. There are many generalizations of derivations viz., generalized derivations, multiplicative generalized derivations, skew generalized derivations, b−generalized derivations, etc. The notion of b−generalized derivation was first introduced by Koșan and Lee [17]. The most important and systematic research on the b−generalized derivations have been accomplished in [11,17,22,26] and references therein. In this manuscript, we characterize b−generalized derivations which are strong commutative preserving (SCP) on R. Moreover, we also discuss and characterize b−generalized derivations involving certain ∗−differential/functional identities on rings possessing involution.
In the early nineties, after a memorable work on the structure theory of rings, a tremendous work has been established by Brešar considering centralizing mappings, commuting mappings, commutativity preserving (CP) mappings and strong commutativity preserving (SCP) mappings on some appropriate subset of rings. Since then it became a tempting research idea in the matrix theory/operator theory/ring theory for algebraists. Commutativity preserving (CP) maps were introduced and studied by Watkins [32] and further extended to SCP by Bell and Mason [6]. Inspired by the concept of SCP maps, Bell and Daif [5] demonstrated the commutativity of (semi-)prime rings possessing derivations and endomorphisms on right ideals (see also [27] and references therein). In [12], Deng and Ashraf studied strong commutativity preserving maps in more general context as follows: Let R be a semiprime ring. If R admits a mapping ψ and a derivation δ on R such that [ψ(r),δ(v)]=[r,v] for every r,v∈R, then R is commutative. In 1994, Brešar and Miers [7] characterized an additive map f:R→R satisfying SCP on a semiprime ring R and showed that f is of the form f(r)=λr+μ(r) for every r∈R, where λ∈C, λ2=1 and μ:R→R is an additive map. Later, Lin and Liu [23] extended this result to Lie ideals of prime rings. Chasing to this, several techniques have been developed to investigate the behavior of strong commutativity preserving maps (SCP) using restrictions on polynomials, invoking derivations, generalized derivations, etcetera. An account of work has been done in the literature [3,10,12,13,15,20,21,23,24,25,27,30,31].
On the other hand, the study of additive maps on rings possessing involution was initiated by Brešar et al. [7] and they characterized the additive centralizing mappings on the skew-symmetric elements of prime rings possessing involution. In the same vein, Lin and Liu [24] describe SCP additive maps on skew-symmetric elements of prime rings possessing involution. Later, Liau et al. [21] improved the above mentioned result for non-additive SCP mappings. Interestingly, in 2015 Ali et al. [1] studied the SCP maps in different way on rings possessing involution. They established the commutativity of prime ring of charateristic not two possessing second kind of involution satisfying [δ(r),δ(r∗)]−[r,r∗]=0 for every r∈R, where δ is a nonzero derivation of R. Recently, Khan and Dar [8] improved this result by studying the case of generalized derivations.
Motivated by the above presented work, in this manuscript we have characterized b−generalized derivations on prime rings possessing involution. Moreover, we also present some examples in support of our main theorems.
Throughout the manuscript unless otherwise stated, R is a prime ring with center Z(R), Q is the maximal right ring of quotients, C=Z(Q) is the center of Q usually known as the extended centroid of R and is a field. "A ring R is said to be 2− torsion free if 2r=0 (where r∈R) implies r=0". The characteristic of R is represented by char(R). "A ring R is called a prime ring if rRv=(0) (where r,v∈R) implies r=0 or v=0 and is called a semiprime ring in case rRr=(0) implies r=0". "An additive map r↦r∗ of R into itself is called an involution if (i) (rv)∗=v∗r∗ and (ii) (r∗)∗=r hold for all r,v∈R. A ring equipped with an involution is known as a ring with involution or a ∗−ring. An element r in a ring with involution ∗ is said to be hermitian/symmetric if r∗=r and skew-hermitian/skew-symmetric if r∗=−r". The sets of all hermitian and skew-hermitian elements of R will be denoted by W(R) and K(R), respectively. "If R is 2−torsion free, then every r∈R can be uniquely represented in the form 2r=h+k where h∈W(R) and k∈K(R). Note that in this case r is normal, i.e., rr∗=r∗r, if and only if h and k commute. If all elements in R are normal, then R is called a normal ring". An example is the ring of quaternions. "The involution is said to be of the first kind if Z(R)⊆W(R), otherwise it is said to be of the second kind. In the later case it is worthwhile to see that K(R)∩Z(R)≠(0)". We refer the reader to [4,14] for justification and amplification for the above mentioned notations and key definitions.
For r,v∈R, the commutator of r and v is defined as [r,v]=rv−vr. We say that a map f:R→R preserves commutativity if [f(r),f(v)]=0 whenever [r,v]=0 for all r,v∈R. Following [7], "let S be a subset of R, a map f:R→S is said to be strong commutativity preserving (SCP) on S if [f(r),f(v)]=[r,v] for all r,v∈S". Following [33], "an additive mapping T:R→R is said to be a left (respectively right) centralizer (multiplier) of R if T(rv)=T(r)v (respectively T(rv)=rT(v)) for all r,v∈R. An additive mapping T is called a centralizer in case T is a left and a right centralizer of R". In ring theory it is more common to work with module homomorphisms. Ring theorists would write that T:R→R is a homomorphism of a ring module R into itself. For a prime ring R all such homomorphisms are of the form T(r)=qr for all r∈R, where q∈Q (see Chapter 2 in [4]). "An additive mapping δ:R→R is said to be a derivation on R if δ(rv)=δ(r)v+rδ(v) for all r,v∈R". It is well-known that every derivation of R can be uniquely extended to a derivation of Q. "A derivation δ is said to be Q−inner if there exists α∈Q such that δ(r)=αr−rα for all r∈R. Otherwise, it is called Q−outer (δ is not inner)". "An additive map H:R→R is called a generalized derivation of R if there exists a derivation δ of R such that H(rv)=H(r)v+rδ(v) for all r,v∈R". The derivation δ is uniquely determined by H and is called the associated derivation of H. The concept of generalized derivations covers the both the concepts of a derivation and a left centralizer. We would like to point out that in [19] Lee proved that "every generalized derivation can be uniquely extended to a generalized derivation of Q and thus all generalized derivations of R will be implicitly assumed to be defined on the whole Q".
The recent concept of generalized derivations were introduced by Koșan and Lee [17], namely, b−generalized derivations which was defined as follows: "An additive mapping H:R→Q is called a (left) b−generalized derivation of R associated with δ, an additive map from R to Q, if H(rv)=H(r)v+brδ(v) for all r,v∈R, where b∈Q". Also they proved that if "R is a prime ring and 0≠b∈Q, then the associated map δ is a derivation i.e., δ(rv)=δ(r)v+rδ(v) for all r,v∈R". It is easy to see that every generalized derivation is a 1−generalized derivation. Also, the mapping r∈R→αr+brc∈Q for a,b,c∈Q is a b−generalized derivation of R, which is known as inner b−generalized derivation of R. In spite of this, they also characterized b−generalized derivation. That is, every b−generalized derivation H on a semiprime ring R is of the form H(r)=αr+bδ(r) for all r∈R, where a,b∈Q. Following important facts are frequently used in the proof of our results:
Fact 2.1 ([1,Lemma 2.1]). "Let R be a prime ring with involution such that char(R)≠2. If K(R)∩Z(R)≠(0) and R is normal, then R is commutative."
Fact 2.2. "Let R be a ring with involution such that char(R)≠2. Then every r∈R can uniquely represented as 2r=w+s, where w∈W(R) and s∈K(R)."
Fact 2.3 ([17,Theorem 2.3]). "Let R be a semiprime ring, b∈Q, and let H:R→Q be a b−generalized derivation associated with δ. Then δ is a derivation and there exists α∈Q such that H(r)=αr+bδ(r) for every r∈R."
Fact 2.4 ([8,Lemma 2.2]). "Let R be a non-commutative prime ring with involution of the second kind such that char(R)≠2. If R admits a derivation δ:R→R such that [δ(w),w]=0 for every w∈W(R), then δ(Z(R))=(0)."
We need a well-known lemma due to Martindale [28], stated below in a form, convenient for our purpose.
Lemma 2.1 ([28,Theorem 2(a)]). "Let R be a prime ring and ai,bi,cj,dj∈Q. Suppose that ∑mi=1airbi+∑nj=1cjrdj=0 for all r∈R. If a1,⋯,am are C−independent, then each bi is a C−linear combination of d1,⋯,dn. If b1,⋯,bm are C−independent, then each ai is a C−linear combination of c1,⋯,cn."
We need Kharchenko's theorem for differential identities to prime rings [16]. The lemma below is a special case of [16,Lemma 2].
Lemma 2.2 ([16,Lemma 2]). "Let R be a prime ring and ai,bi,cj,dj∈Q and δ a Q−outer derivation of R. Suppose that ∑mi=1airbi+∑nj=1cjδ(r)dj=0 for all r∈R. Then ∑mi=1airbi=0=∑nj=1cjrdj for all r∈R."
We begin with the following Lemma which is needed for developing the proof of our theorems:
Lemma 3.1. Let R be a non-commutative prime ring of characteristic different from two with involuation of the second kind. If for any α∈R, [αr,αr∗]−[r,r∗]=0 for every r∈R, then α∈C and α2=1.
Proof. For any r∈R, we have
[αr,αr∗]−[r,r∗]=0. | (3.1) |
This can also be written as
α2[r,r∗]+α[r,α]r∗+α[α,r∗]r−[r,r∗]=0 | (3.2) |
for every r∈R. Replace r by r+s′ in above equation, where s′∈K(R)∩Z(R), we get
α2[r,r∗]+α[r,α]r∗−α[r,α]s′+α[α,r∗]r+α[α,r∗]s′−[r,r∗]=0 | (3.3) |
for every r∈R and s′∈K(R)∩Z(R). In view of (3.2), we have
α[α,r]s′+α[α,r∗]s′=α[α,r+r∗]s′=0 | (3.4) |
for every r∈R and s′∈K(R)∩Z(R). Since the involution is of the second kind, so we have
α[α,r+r∗]=0 | (3.5) |
for every r∈R. For r=w+s, where w∈W(R) and s∈K(R), observe that
α[α,w]=0 | (3.6) |
for every w∈W(R). Substitute ss′ for w in above expression, we get
α[α,s]=0 | (3.7) |
for every s∈K(R), since the involution is of the second kind. Observe from Fact 2.2 that 2α[α,r]=α[α,2r]=α[α,w+s]=α[α,w]+α[α,s]=0. Thus we have α∈C and, by our hypothesis, (α2−1)[r,r∗]=0, for every r∈R. By the primeness of R, it follows that either α2=1 or [r,r∗]=0, for any r∈R. Thus we are led to the required conclusion by Fact 2.1.
Theorem 3.1. Let R be a non-commutative prime ring of characteristic different from two. If H is a non-zero b−generalized derivation on R associated with a derivation δ on R and ψ is a non-zero map on R satisfying [ψ(r),H(v)]=[r,v] for every r,v∈R. Then there exists 0≠λ∈C and an additive map μ:R→C such that H(r)=λr, ψ(r)=λ−1r+μ(r), for any r∈R.
Proof. Notice that if either δ=0 or b=0, the map H reduces to a centralizer, that is H(v)=αv, for any v∈R. Then the conclusion follows as a reduced case of [25,Theorem 1.1]. Hence, in the rest of the proof we assume both b≠0 and δ≠0. By Fact 2.3, there exists α∈H such that H(r)=αr+bδ(r) for every r∈R. By the hypothesis
[ψ(r),αv+bδ(v)]=[r,v] | (3.8) |
for every r,v∈R. Taking of vz for v in above expression gives
(αv+bδ(v))[ψ(r),z]+[ψ(r),bvδ(z)]=v[r,z] | (3.9) |
for every r,v,z∈R.
Suppose firstly that δ is not an inner derivation of R. In view of (3.9) and Lemma 2.2, we observe that
(αv+bv′)[ψ(r),z]+[ψ(r),bvz′]=v[r,z] | (3.10) |
for every r,v,z,v′,z′∈R. In particular, for v=0 we have
bv′[ψ(r),z]=0 | (3.11) |
for every r,z,v′∈R. By the primeness of R and since b≠0, it follows that ψ(r)∈Z(R), for any r∈R. On the other hand, by ψ(r)∈Z(R) and (3.8) one has that [r,v]=0 for any r,v∈R, which is a contradiction since R is not commutative.
Therefore, we have to consider the only case when there is q∈H such that δ(r)=[r,q], for every r∈R. Thus we rewrite (3.10) as follows
((α−bq)v+bvq)[ψ(r),z]+[ψ(r),bvzq−bvqz]=v[r,z] | (3.12) |
that is
{(α−bq)vψ(r)+bvqψ(r)−ψ(r)bvq−vr}z+{bqv−αv}zψ(r)+ψ(r)bvzq−bvzqψ(r)+vzr=0 | (3.13) |
for every r,v,z∈R.
Suppose there exists v∈R such that {bv,v} are linearly C-independent. From relation (3.13) and Lemma 2.1, it follows that, for any r∈R, both r and qψ(r) are C-linear combinations of {1,q,ψ(r)}. In other words, there exist α1,α2,α3,β1,β2,β3∈C, depending by the choice of r∈R, such that
r=α1+α2ψ(r)+α3q | (3.14) |
and
qψ(r)=β1+β2ψ(r)+β3q. | (3.15) |
Notice that, for α2=0, relation (3.14) implies that q commutes with element r∈R. On the other hand, in case α2≠0, by (3.14) we have that
ψ(r)=α−12(r−α1−α3q). | (3.16) |
Then, by using (3.16) in (3.15), it follows that
β1+β3q=α−12(q−β2)(r−α1−α3q). | (3.17) |
So, by commuting (3.17) with q, we get α−12(q−β2)[r,q]=0, implying that [r,q]=0 in any case.
Therefore q commutes with any element of R and this contradicts the fact that δ≠0. Therefore, for any v∈R, {v,bv} must be linearly C-dependent. In this case a standard argument shows that b∈C, which implies that H(r)=(α−bq)r+r(bq), for any r∈R. Hence H is a generalized derivation of R and once again the result follows from [25,Theorem 1.1].
The following theorem is a generalization of [8,Theorem 2.3].
Theorem 3.2. Let R be a non-commutative prime ring with involution of the second kind of characteristic different from two. If H is a b−generalized derivation on R associated with a derivation δ on R such that [H(r),H(r∗)]=[r,r∗] for every r∈R, then there exists λ∈C such that λ2=1 and H(r)=λr for every r∈R.
Proof. By the given hypothesis, we have
[H(r),H(r∗)]−[r,r∗]=0 for all r∈R. | (3.18) |
Taking r as r+v in (3.18) to get
[H(r),H(v∗)]+[H(v),H(r∗)]−[r,v∗]−[v,r∗]=0 | (3.19) |
for every r,v∈R. Substitute vs′ for v, where s′∈K(R)∩Z(R), in above relation, we obtain
0=−[H(r),H(v∗)]s′−[H(r),bv∗]δ(s′)+[H(v),H(r∗)]s′+[bv,H(r∗)]δ(s′)+[r,v∗]s′−[v,r∗]s′ | (3.20) |
for every r,v∈R and s′∈K(R)∩Z(R). Multiply (3.19) with s′ and combine with (3.20) to get
2[H(v),H(r∗)]s′−2[v,r∗]s′−[H(r),bv∗]δ(s′)+[bv,H(r∗)]δ(s′)=0 | (3.21) |
for every r,v∈R and s′∈K(R)∩Z(R). Again substitute v as vs′ in (3.21), we get
0=2[H(v),H(r∗)]s′2+2[bv,H(r∗)]δ(s′)s′−2[v,r∗]s′2+[H(r),bv∗]δ(s′)s′+[bv,H(r∗)]δ(s′)s′ | (3.22) |
for every r,v∈R and s′∈K(R)∩Z(R). In view of (3.21), we have
2[bv,H(r∗)]δ(s′)s′+2[H(r),bv∗]δ(s′)s′=0 | (3.23) |
for every r,v∈R and s′∈K(R)∩Z(R). Since char(R)≠2 and the involution is of the second kind, so [bv,H(r∗)]+[H(r),bv∗]=[H(r),bv∗]−[H(r∗),bv]=0 for every r,v∈R or δ(s′)s′=0 for every s′∈K(R)∩Z(R). Observe that s′=0 is also implies δ(s′)=0 for every s′∈K(R)∩Z(R). Assume that δ(s′)≠0, therefore we have
[H(r),bv∗]−[H(r∗),bv]=0 | (3.24) |
for every r,v∈R. Taking r=v=w+s in above expression, we obtain
[H(s),bw]−[H(w),bs]=0 | (3.25) |
for every w∈W(R) and s∈K(R). Replace s by s′ in (3.25), we get
[H(s′),bw]−[H(w),b]s′=0 | (3.26) |
for every w∈W(R) and s′∈K(R)∩Z(R). Substitute ss′ for w in last expression, we get
[H(s′),bs]s′−[H(s),b]s′2+b[b,s]δ(s′)s′=0 | (3.27) |
for every s∈K(R) and s′∈K(R)∩Z(R). One can see from (3.24) that [H(s′),bs]=0 and [H(s),b]s′=0 for every s∈K(R) and s′∈K(R)∩Z(R). This reduces (3.27) into
b[b,s]δ(s′)s′=0 | (3.28) |
for every s∈K(R) and s′∈K(R)∩Z(R). This implies either b[b,s]=0 for every s∈K(R) or δ(s′)=0 for every s′∈K(R)∩Z(R). Suppose b[b,s]=0 for every s∈K(R). Take s=w0s′ and use the fact that the involution is of the second kind, we get b[b,w0]=0 for every w0∈W(R). An application of Fact 2.2 yields b∈C. One can see from (3.27) that b[H(s′),s]=0 for every s∈K(R) and s′∈K(R)∩Z(R). If b=0 and in light of Fact 2.3, H has the following form: H(r)=αr, for some fixed element α∈H. Thus, by Lemma 3.1 and since R is not commutative, we get the required conclusion α∈C and α2=1.
So we assume b≠0 and [H(s′),s]=0 for every s∈K(R) and s′∈K(R)∩Z(R). Again taking s as w0s′ and making use of Fact 2.2 in last relation gives H(s′)∈Z(R) for every s′∈K(R)∩Z(R). Next, take r=w and v=s in (3.19), we get
[H(s),H(w)]+[w,s]=0 | (3.29) |
for every s∈K(R) and w∈W(R). Substitute w0s′ for s in above relation, we get
[H(w0s′),H(w)]+[w,w0]s′=0 | (3.30) |
for every s′∈K(R)∩Z(R) and w,w0∈W(R). It follows from the hypothesis that
[H(w0),H(w)]s′+[bw0,H(w)]δ(s′)+[w,w0]s′=0 | (3.31) |
for every s′∈K(R)∩Z(R) and w,w0∈W(R). For w0=w, we have
b[H(w),w]δ(s′)=0 | (3.32) |
for every s′∈K(R)∩Z(R) and w∈W(R). Since δ(s′)≠0 and b≠0, so [H(w),w]=0 for every w∈W(R). Since b∈C, so we observe from (3.25) that
[H(s),w]−[H(w),s]=0 | (3.33) |
for every w∈W(R) and s∈K(R). Repalcement of s by s′h in above expression and making use of H(s′)∈Z(R) for every s′∈K(R)∩Z(R) and b≠0 yields [δ(w),w]=0 for every w∈W(R). In light of Fact 2.4, we have δ(s′)=0 for every s′∈K(R)∩Z(R). Finally, we suppose δ(s′)=0 and substitute v by vs′ in (3.19), we obtain
−[H(r),H(v∗)]s′+[H(v),H(r∗)]s′+[r,v∗]s′−[v,r∗]s′=0 | (3.34) |
for every r,v∈R and s′∈K(R)∩Z(R). Combination of (3.19) and (3.34) gives
([H(v),H(r∗)]−[v,r∗])s′=0 | (3.35) |
for every r,v∈R and s′∈K(R)∩Z(R). This implies that
[H(v),H(r∗)]−[v,r∗]=0 | (3.36) |
for every r,v∈R. In particular
[H(r),H(v)]−[r,v]=0 | (3.37) |
for every r,v∈R. As a special case of Theorem 3.1, H is of the form H(r)=λr, where λ∈C and λ2=1.
The following theorem is a generalization of [8,Theorem 2.4].
Theorem 3.3. Let R be a non-commutative prime ring with involution of the second kind of characteristic different from two. If H is a b−generalized derivation on R associated with a derivation δ on R such that [H(r),δ(r∗)]=[r,r∗] for every r∈R, then there exists λ∈C such that H(r)=λr for every r∈R.
Proof. By the hypothesis, we have
[H(r),δ(r∗)]−[r,r∗]=0 | (3.38) |
for every r∈R. The derivation δ satisfies δ(R)⊈Z(R), otherwise the hypothesis [H(r),δ(r∗)]=[r,r∗] for every r∈R, would reduce to [r,r∗]=0 for all r∈R, and, therefore R would be commutative, by Fact 2.1. A linearization of (3.38) yields
[H(r),δ(v∗)]+[H(v),δ(r∗)]−[r,v∗]−[v,r∗]=0 | (3.39) |
for every r,v∈R. Replace r by z∈Z(R) in (3.39), we obtain [H(z),δ(v)]=0 for every v∈R and z∈Z(R). Observe from [18,Theorem 2] that H(z)∈Z(R) for every z∈Z(R). Now take r as rs′ in (3.38) and suppose δ(s′)≠0, we get
0=−[H(r),δ(r∗)]s′2−[H(r),r∗]δ(s′)s′−b[r,δ(r∗)]δ(s′)s′−[b,δ(r∗)]rδ(s′)s′−b[r,r∗]δ(s′)2−[b,r∗]rδ(s′)2+[r,r∗]s′2 | (3.40) |
for every r∈R and s′∈K(R)∩Z(R). In view of (3.38), we have
0=−[H(r),r∗]δ(s′)s′−b[r,δ(r∗)]δ(s′)s′−[b,δ(r∗)]rδ(s′)s′−b[r,r∗]δ(s′)2−[b,r∗]rδ(s′)2 | (3.41) |
for every r∈R and s′∈K(R)∩Z(R). Replace r by r+s′ in last expression and use the fact that H(z)∈Z(R) for every z∈Z(R), we get
0=−[H(r),r∗]δ(s′)s′−b[r,δ(r∗)]δ(s′)s′−[b,δ(r∗)]rδ(s′)s′−b[r,r∗]δ(s′)2−[b,r∗]rδ(s′)2−[b,δ(r∗)]δ(s′)s′2−[b,r∗]δ(s′)2s′ | (3.42) |
for every r∈R and s′∈K(R)∩Z(R). Observe from (3.41)
[b,δ(r∗)]δ(s′)s′2+[b,r∗]δ(s′)2s′=0 | (3.43) |
for every r∈R and s′∈K(R)∩Z(R). Replace r by rs′ and use (3.43), we get [b,r∗]δ(s′)2s′=0 This forces that [b,r∗]=0 for every r∈R since δ(s′)≠0. One can easily obtain from last relation that b∈C. On the other hand
0=−H(s′)[r,δ(r∗)]s′−b[δ(r),δ(r∗)]s′2−[b,δ(r∗)]δ(r)s′2−H(s′)[r,r∗]δ(s′)−b[δ(r),r∗]δ(s′)s′−[b,r∗]δ(r)δ(s′)s′+[r,r∗]s′2 | (3.44) |
for every r∈R and s′∈K(R)∩Z(R). Since b∈C, so we have
0=−H(s′)[r,δ(r∗)]s′−b[δ(r),δ(r∗)]s′2−H(s′)[r,r∗]δ(s′)−b[δ(r),r∗]δ(s′)s′+[r,r∗]s′2 | (3.45) |
for every r∈R and s′∈K(R)∩Z(R). Now substitute w and s for r and v in (3.39), respectively. This yields
[H(s),δ(w)]−[H(w),δ(s)]+2[s,w]=0 | (3.46) |
for every w∈W(R) and s∈K(R). Take s as s′w in last relation and use b∈C, we see that
H(s′)[w,δ(w)]−[H(w),w]δ(s′)=0 | (3.47) |
for every w∈W(R) and s′∈K(R)∩Z(R). On the other hand
b[h,δ(w)]δ(s′)−[H(w),w]δ(s′)=0 | (3.48) |
for every w∈W(R) and s′∈K(R)∩Z(R). In view of (3.47) and (3.48), we get
(H(s′)+bδ(s′))[w,δ(w)]=0 | (3.49) |
for every w∈W(R) and s′∈K(R)∩Z(R). Since H(s′)∈Z(R), δ(s′)∈Z(R) and b∈Z(R), so either H(s′)+bδ(s′)=0 for every s′∈K(R)∩Z(R) or [w,δ(w)]=0 for every w∈W(R). If [w,δ(w)]=0 for every w∈W(R), then δ(s′)=0 for every s′∈K(R)∩Z(R) from Fact 2.4. Therefore consider H(s′)=−bδ(s′) for every s′∈K(R)∩Z(R) and use it in (3.45), we obtain
0=b[r,δ(r∗)]δ(s′)s′−b[δ(r),δ(r∗)]s′2+b[r,r∗]δ(s′)2−b[δ(r),r∗]δ(s′)s′+[r,r∗]s′2 | (3.50) |
for every r∈R and s′∈K(R)∩Z(R). For r=w, we have
2b[h,δ(h)]δ(s′)s′=0 | (3.51) |
for every w∈W(R) and s′∈K(R)∩Z(R). Thus b=0 or [w,δ(w)]=0 for every w∈W(R) or δ(s′)=0 for every s′∈K(R)∩Z(R). If b=0 and since s′ is not a zero-divisor, the relation (3.50) reduces to [r,r∗]=0, for every r∈R. Thus the commutativity of R follows from Fact 2.1, a contradiction. The rest of two relations yields δ(s′)=0 for every s′∈K(R)∩Z(R). Finally consider δ(s′)=0 and replace r by rs′ in (3.38) and use the facts that the involution is of the second kind, we see that
[H(r),δ(v∗)]−[H(v),δ(r∗)]−[r,v∗]+[v,r∗]=0 | (3.52) |
for every r,v∈R. Combination of (3.39) and (3.52) yields
[H(r),δ(v∗)]−[r,v∗]=0 | (3.53) |
for every r,v∈R. In particular,
[H(r),δ(v)]−[r,v]=0 | (3.54) |
for every r,v∈R. In view of Theorem 3.1, there exist 0≠λ∈C and an additive map μ:R→C such that H(r)=λr and δ′(r)=λ−1r+μ(r) for every r∈R, where δ′=−δ. Commute the latter case with r, we get [δ′(r),r]=0 for every r∈R. Since δ′=−δ≠0, so R is commutative from [29,Lemma 3], this leads to again a contradiction. This completes the proof of the theorem.
The following example shows that the condition of the second kind involution is essential in Theorems 3.2 and 3.3. This example collected from [2,Example 1].
Example 4.1. Let
R={(β1β2β3β4)|β1,β2,β3,β4∈Z}, |
which is of course a prime ring with ususal addition and multiplication of matrices, where Z is the set of integers. Define mappings H,δ,∗:R→R such that
H(β1β2β3β4)=(0−β2β30), |
δ(β1β2β3β4)=(0−β2β30), |
and a fixed element
b=(1001), |
(β1β2β3β4)∗=(β4−β2−β3β1). |
Obviously,
Z(R)={(β100β1)|β1∈Z}. |
Then r∗=r for every r∈Z(R), and hence Z(R)⊆W(R), which shows that the involution ∗ is of the first kind. Moreover, H, δ are nonzero b−generalized derivation and associated derivation with fixed element b defined as above, such that the hypotheses in Theorems 3.2 and 3.3 are satisfied but H is not in the form H(r)=λr for every r∈R. Thus, the hypothesis of the second kind involution is crucial in our results.
We conclude the manuscript with the following example which reveals that Theorems 3.2 and 3.3 cannot be extended to semiprime rings.
Example 4.2. Let (R,∗) be a ring with involution as defined above, which admits a b−generalized derivation H, where δ is an associated nonzero derivation same as above and R1=C with the usual conjugation involution ⋄. Next, let S=R×R1 and define a b−generalized derivation G on S by G(r,v)=(H(r),0) associated with a derivation D defined by D(r,v)=(δ(r),0). Obviously, (S,τ) is a semiprime ring with involution of the second kind such that τ(r,v)=(r∗,v⋄). Then the b−generalized derivation G satisfies the requirements of Theorems 3.2 and 3.3, but G is not in the form G(r)=λr for every r∈R, and R is not commutative. Hence, the primeness hypotheses in our results is not superfluous.
We recall that "a generalized skew derivation is an additive mapping G:R→R satisfying the rule G(rv)=G(r)v+ζ(r)∂(v) for every r,v∈R, where ∂ is an associated skew derivation of R and ζ is an automorphism of R". Following [9], De Filippis proposed the new concept for further research and he defined the following: "Let R be an associative algebra, b∈Q, ∂ be a linear mapping from R to itself, and ζ be an automorphism of R. A linear mapping G:R→R is called an X−generalized skew derivation of R, with associated term (b,ζ,∂) if G(rv)=G(r)v+bζ(r)∂(v) for every r,v∈R". It is clear from both definitions, the notions of X−generalized skew derivation, generalize both generalized skew derivations and skew derivations. Hence, every X−generalized skew derivation is a generalized skew derivation as well as a skew derivation, but the converse statement is not true in general.
Actuated by the concept specified by De Filippis [9] and having regard to our main theorems, the following are natural problems.
Question 5.1. Let R be a (semi)-prime ring and L be a Lie ideal of R. Next, let F and G be two X−generalized skew derivation with an associated skew derivation ∂ of R such that
[F(r),G(v)]=[r,v],for everyr,v∈L. |
Then what we can say about the behaviour of F and G or about the structure of R?
Question 5.2. Let R be a prime ring possessing second kind involution with suitable torsion restrictions and L be a Lie ideal of R. Next, let F and G be two X−generalized skew derivation with an associated skew derivation ∂ of R such that
[F(r),G(r∗)]=[r,r∗],for everyr∈L. |
Then what we can say about the behaviour of F and G or about the structure of R?
The characterization of strong commutative preserving (SCP) b−generalized derivations has been discussed in non-commutative prime rings. In addition, the behavior of b−generalized derivations with ∗−differential/functional identities on prime rings with involution was investigated. Besides, we present some problems for X−generalized skew derivations on rings with involution.
We are very grateful to the referee for his/her appropriate and constructive suggestions which improved the quality of the paper. This work was supported by the Deanship of Scientific Research (DSR), King Abdulaziz University, Jeddah, under grant no. (G: 156-662-1439). The authors, therefore, gratefully acknowledge the DSR technical and financial support.
The authors declare that they have no competing interests.
[1] |
L. A. Zadeh, Fuzzy sets, Inform. Control, 8 (1965), 338–353. https://doi.org/10.1016/S0019-9958(65)90241-X doi: 10.1016/S0019-9958(65)90241-X
![]() |
[2] |
Z. Pawlak, Rough sets, Int. J. Comput. Inform. Sci., 11 (1982), 341–356. https://doi.org/10.1007/BF01001956 doi: 10.1007/BF01001956
![]() |
[3] |
Z. Bonikowski, E. Bryniariski, V. W. Skardowska, Extension and intensions in the rough set theory, Inform. Sci., 107 (1998), 149–167. https://doi.org/10.1016/S0020-0255(97)10046-9 doi: 10.1016/S0020-0255(97)10046-9
![]() |
[4] |
D. G. Chen, W. X. Zhang, D. Yeung, E. C. C. Tsang, Rough approximations on a complete completely distributive lattice with applications to generalized rough sets, Inform. Sci., 176 (2006), 1829–1848. https://doi.org/10.1016/j.ins.2005.05.009 doi: 10.1016/j.ins.2005.05.009
![]() |
[5] | T. Y. Lin, Y. Y. Yao, L. A. Zadeh, Rough sets, granular computing and data mining, Heidelberg: Physica-Verlag, 2001. |
[6] |
J. Y. Liang, K. S. Chin, C. Y. Dang, R. C. M. Yam, A new method for measuring uncertainty and fuzziness in rough set theory, Int. J. Gen. Syst., 31 (2002), 331–342. https://doi.org/10.1080/0308107021000013635 doi: 10.1080/0308107021000013635
![]() |
[7] |
G. L. Liu, Y. Sai, A comparison of two types of rough sets induced by coverings, Int. J. Approx. Reason., 50 (2009), 521–528. https://doi.org/10.1016/j.ijar.2008.11.001 doi: 10.1016/j.ijar.2008.11.001
![]() |
[8] | Z. Pawlak, Rough sets: Theoretical aspects of reasoning about data, Springer Science Business Media, 1991. |
[9] | Y. F. Liu, W. Zhu, Characteristic of partition-circuit matroid through approximation number, In: 2012 IEEE International conference on granular computing, 2012,314–319. https://doi.org/10.1109/GrC.2012.6468668 |
[10] | Y. Liu, W. Zhu, Y. Zhang, Relationship between partition matroid and rough set through k-rank matroid, J. Inform. Comput. Sci., 8 (2012), 2151–2163. |
[11] | Q. Li, W. Zhu, Lattice structures of fixed points of the lower approximations of two types of covering-based rough sets, arXiv preprint, 2012,109–145. https://doi.org/10.48550/arXiv.1209.5569 |
[12] |
S. P. Wang, Q. X. Zhu, W. Zhu, F. Min, Quantitative analysis for covering-based rough sets using the upper approximation number, Inform. Sci., 220 (2012), 483–491. https://doi.org/10.1016/j.ins.2012.07.030 doi: 10.1016/j.ins.2012.07.030
![]() |
[13] |
S. Yüksel, Z. G. Ergül, N. Tozlu, Soft covering based rough sets and their application, Sci. World J., 2014 (2014), 970893. https://doi.org/10.1155/2014/970893 doi: 10.1155/2014/970893
![]() |
[14] |
J. M. Zhan, M. I. Ali, N. Mehmood, On a novel uncertain soft set model: Z-soft fuzzy rough set model and corresponding decision making methods, Appl. Soft Comput., 56 (2017), 446–457. https://doi.org/10.1016/j.asoc.2017.03.038 doi: 10.1016/j.asoc.2017.03.038
![]() |
[15] |
H. Zhang, J. M. Zhan, Rough soft lattice implication algebras and corresponding decision making methods, Int. J. Mach. Learn. Cyb., 8 (2017), 1301–1308. https://doi.org/10.1007/s13042-016-0502-6 doi: 10.1007/s13042-016-0502-6
![]() |
[16] |
D. Molodtsov, Soft set theory-first results, Comput. Math. Appl., 37 (1999), 19–31. https://doi.org/10.1016/S0898-1221(99)00056-5 doi: 10.1016/S0898-1221(99)00056-5
![]() |
[17] |
M. I. Ali, F. Feng, X. Y. Liu, W. K. Min, M. Shabir, On some new operations in soft set theory, Comput. Math. Appl., 57 (2009), 1547–1553. https://doi.org/10.1016/j.camwa.2008.11.009 doi: 10.1016/j.camwa.2008.11.009
![]() |
[18] |
P. K. Maji, R. Biswas, A. R. Roy, Soft set theory, Comput. Math. Appl., 45 (2003), 555–562. https://doi.org/10.1016/S0898-1221(03)00016-6 doi: 10.1016/S0898-1221(03)00016-6
![]() |
[19] | P. K. Maji, A. R. Roy, R. Biswas, An application of soft sets in a decision making problem, Comput. Math. Appl., 44 (2002), 1077–1083. |
[20] | D. Molodtsov, The theory of soft sets (in Russian), Moscow: URSS Publishers, 2004. https://doi.org/10.1016/S0898-1221(99)00056-5 |
[21] |
J. M. Zhan, J. C. R Alcantud, A novel type of soft rough covering sets and its application to multicriteria group decision making, Artif. Intell. Rev., 52 (2019), 2381–2410. https://doi.org/10.1007/s10462-018-9617-3 doi: 10.1007/s10462-018-9617-3
![]() |
[22] |
J. C. R. Alcantud, J. M. Zhan, Multi-granular soft rough covering sets, Soft Comput., 24 (2020), 9391–9402. https://doi.org/10.1007/s00500-020-04987-5 doi: 10.1007/s00500-020-04987-5
![]() |
[23] | E. Bryniarski, A calculus of rough sets of the first order, Bull. Pol. Acad. Sci. Math., 37 (1989), 71–77. |
[24] | F. Feng, Soft rough sets applied to multicriteria group decision making, Ann. Fuzzy Math. Inf., 2 (2011), 69–80. |
[25] |
M. Atef, A. El F. El Atik, Some extensions of covering-based multigranulation fuzzy rough sets from new perspectives, Soft Comput., 25 (2021), 6633–6651 https://doi.org/10.1007/s00500-021-05659-8. doi: 10.1007/s00500-021-05659-8
![]() |
[26] | G. Birkhoff, Lattice theory, American Mathematical Society, 1940. |
[27] |
N. Shah, N. Rehman, M. Shabir, M. I. Ali, Another approach to roughness of soft graphs with applications in decision making, Symmetry, 10 (2018), 145. https://doi.org/10.3390/sym10050145 doi: 10.3390/sym10050145
![]() |
[28] |
F. Fatimah, D. Rosadi, R. B. F. Hakim, J. C. R. Alcantud, N-soft sets and their decision making algorithms, Soft Comput., 22 (2018), 3829–3842. https://doi.org/10.1007/s00500-017-2838-6 doi: 10.1007/s00500-017-2838-6
![]() |
[29] |
F. Feng, X. Y. Liu, V. L. Fotea, Y. B. Jun, Soft sets and soft rough sets, Inform. Sci., 181 (2011), 1125–1137. https://doi.org/10.1016/j.ins.2010.11.004 doi: 10.1016/j.ins.2010.11.004
![]() |
[30] |
W. Zhu, F. Y. Wang, Reduction and axiomization of covering generalized rough sets, Inform. Sci., 152 (2003), 217–230. https://doi.org/10.1016/S0020-0255(03)00056-2 doi: 10.1016/S0020-0255(03)00056-2
![]() |
[31] |
W. Zhu, Relationship among basic concepts in covering-based rough sets, Inform. Sci., 179 (2009), 2478–2486. https://doi.org/10.1016/j.ins.2009.02.013 doi: 10.1016/j.ins.2009.02.013
![]() |
[32] |
A. El F. El Atik, A. Nawar, M. Atef, Rough approximation models via graphs based on neighborhood systems, Granular Comput., 6 (2021), 1025–1035. https://doi.org/10.1007/s41066-020-00245-z doi: 10.1007/s41066-020-00245-z
![]() |
[33] |
M. Akram, S. Nawaz, Operations on soft graphs, Fuzzy Inform. Eng., 7 (2015), 423–449. https://doi.org/10.1016/j.fiae.2015.11.003 doi: 10.1016/j.fiae.2015.11.003
![]() |
[34] |
B. Praba, G. Gomathi, M. Aparajitha, A lattice structure on minimal soft rough sets and its applications, New Math. Nat. Comput., 16 (2020), 255–269. https://doi.org/10.1142/S1793005720500155 doi: 10.1142/S1793005720500155
![]() |
[35] |
N. Shah, M. I. Ali, M. Shabir, A. Abbas, N. Rehman, Uncertainty measure of Z-soft covering rough models based on a knowledge granulation, J. Intell. Fuzzy Syst., 38 (2020), 1637–1647. https://doi.org/10.3233/JIFS-182708 doi: 10.3233/JIFS-182708
![]() |
[36] |
N. Rehman, N. Shah, M. I. Ali, C. Park, Uncertainty measurement for neighborhood based soft covering rough graphs with applications, Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A, 113 (2019), 2515–2535. https://doi.org/10.1007/s13398-019-00632-5 doi: 10.1007/s13398-019-00632-5
![]() |
[37] |
W. H. Bai, J. J. Ding, C. Zhang, Dual hesitant fuzzy graphs with applications to multi-attribute decision making, Int. J. Cognitive Comput. Eng., 1 (2020), 18–26. https://doi.org/10.1016/j.ijcce.2020.09.002 doi: 10.1016/j.ijcce.2020.09.002
![]() |
[38] |
Z. He, L. Liang, H. M. Baskonus, W Gao, Remarks on path-factor critical avoidable graphs, Int. J. Cogn. Comput. Eng., 4 (2023), 65–70. https://doi.org/10.1016/j.ijcce.2023.02.004 doi: 10.1016/j.ijcce.2023.02.004
![]() |
[39] |
M. Atef, S. I. Nada, On three types of soft fuzzy coverings based rough sets, Math. Comput. Simul., 185 (2021), 452–467. https://doi.org/10.1016/j.matcom.2020.12.023 doi: 10.1016/j.matcom.2020.12.023
![]() |
[40] |
M. Atef, S. Nada, A. Gumaei, A. S. Nawar, On three types of soft rough covering-based fuzzy sets, J. Math., 2021 (2021), 6677298. https://doi.org/10.1155/2021/6677298 doi: 10.1155/2021/6677298
![]() |
[41] |
A. A. Estaji, M. Vatandoost, R. Pourkhandani, Fixed points of covering upper and lower approximation operators, Soft Comput., 23 (2019), 11447–11460. https://doi.org/10.1007/s00500-019-04113-0 doi: 10.1007/s00500-019-04113-0
![]() |
[42] |
J. M. Zhan, K. Y. Zhu, A novel soft rough fuzzy set: Z-soft rough fuzzy ideals of hemirings and corresponding decision making, Soft Comput., 21 (2017), 1923–1936. https://doi.org/10.1007/s00500-016-2119-9 doi: 10.1007/s00500-016-2119-9
![]() |
[43] |
M. Atef, S. Nada, A. Nawar, Covering soft rough sets and its topological properties with application, Soft Comput., 271 (2023), 4451–4461. https://doi.org/10.1007/s00500-023-07812-x doi: 10.1007/s00500-023-07812-x
![]() |
[44] |
Z. Li, N. Xie, G. Wen, Soft coverings and their parameter reductions, Appl. Soft Comput., 31 (2015), 48–60. https://doi.org/10.1016/j.asoc.2015.02.027 doi: 10.1016/j.asoc.2015.02.027
![]() |
[45] |
I. S. Khan, C. Park, A. Shoaib, N. Shah, A study of fixed point sets based on Z-soft rough covering models, AIMS Mathematics, 7 (2022), 13278–13291. https://doi.org/10.3934/math.2022733 doi: 10.3934/math.2022733
![]() |
1. | Shuai Huang, Youwu Lin, Jing Zhang, Pei Wang, Chance-constrained approach for decentralized supply chain network under uncertain cost, 2023, 8, 2473-6988, 12217, 10.3934/math.2023616 | |
2. | Tareq Oshan, Nuha Hamada, Mahmoud Sharkawi, 2024, Optimizing Facility Location Under Disruptions: A Big Data-Driven Approach, 979-8-3503-5475-1, 225, 10.1109/IDSTA62194.2024.10746991 |