GENERALIZED DERIVATIONS WITH LEFT ANNIHILATOR CONDITIONS IN PRIME AND SEMIPRIME RINGS
Journal Title: Discussiones Mathematicae - General Algebra and Applications - Year 2017, Vol 37, Issue 2
Abstract
Let R be a prime ring with its Utumi ring of quotients U, C = Z(U) be the extended centroid of R, H and G two generalized derivations of R, L a noncentral Lie ideal of R, I a nonzero ideal of R. The left annihilator of S ⊆ R is denoted by lR(S) and defined by lR(S) = {x ∈ R | xS = 0}. Suppose that S = {H(un)un + unG(un)| u ∈ L} and T = {H(xn)xn + xnG(xn)| x ∈I}, where n ≥ 1 is a fixed integer. In the paper, we investigate the cases when the sets lR(S) and lR(T ) are nonzero. Keywords: prime ring, derivation, Lie ideal, generalized derivation, extended centroid, Utumi quotient ring. 2010 Mathematics Subject Classification: 16W25, 16W80, 16N60.
Authors and Affiliations
Basudeb Dhara
ON THE UNRECOGNIZABILITY BY PRIME GRAPH FOR THE ALMOST SIMPLE GROUP PGL(2, 9)
The prime graph of a finite group G is denoted by Γ(G). Also G is called recognizable by prime graph if and only if each finite group H with Γ(H) = Γ(G), is isomorphic to G. In this paper, we classify all finite groups w...
ON CENTRALIZER OF SEMIPRIME INVERSE SEMIRING
Let S be 2-torsion free semiprime inverse semiring satisfying A2 condition of Bandlet and Petrich [1]. We investigate, when an additive mapping T on S becomes centralizer.
Idempotent Elements of Weak Projection Generalized Hypersubstitutions
A generalized hypersubstitution of type τ = (ni)i∈I is a mapping σ which maps every operation symbol fi to the term σ(fi) and may not preserve arity. It is the main tool to study strong hyperidentities that are used to c...
SOME RESULTS OF REVERSE DERIVATION ON PRIME AND SEMIPRIME Γ-RINGS
In the present paper, it is introduced the definition of a reverse derivation on a Γ-ring M. It is shown that a mapping derivation on a semiprime Γ-ring M is central if and only if it is reverse derivation. Also it is sh...
VARIETIES OF REGULAR ALGEBRAS AND UNRANKED TREE LANGUAGES
In this paper we develop a variety theory for unranked tree languages and unranked algebras. In an unranked tree any symbol may label a node with any number of successors. Such trees appear in markup languages such as XM...