ALL Metrics
-
Views
-
Downloads
Get PDF
Get XML
Cite
Export
Track
Research Article

Group Structures and Derivations on PMS-algebras

[version 1; peer review: 2 approved]
PUBLISHED 13 Jan 2025
Author details Author details
OPEN PEER REVIEW
REVIEWER STATUS

Abstract

Background

PMS-algebras are a specific algebraic structure that generalizes a propositional algebra called BCK-algebra. This paper delves into the intricate group structure of these algebras and the concept of derivations within this framework.

Methods

We employ rigorous mathematical techniques to analyze the properties of derivations in P MS-algebras. This involves examining various characteristics of derivations and investigating their behavior in specific subcategories, such as torsion-free P MS-algebras.

Results

Our research reveals several key findings. Firstly, we establish that the set of all derivations associated with the binary operation defined on a P MS-algebra constitutes a semigroup. Secondly, we provide a comprehensive analysis of generalized derivations, d-invariant ideals, fixed sets, and torsion-free P MS-algebras within the context of P MS-algebras.

Conclusions

This study contributes to a deeper understanding of the algebraic structure of P MS-algebras and the role of derivations within this context. The findings presented here have implications for further research in abstract algebra and related fields.

Keywords

P MS-algebras, derivations, generalized derivation, torsion free P MS-algebra, semigroup

1. Introduction

Iseki1 introduced a type of abstract algebra known as BCK-algebras. In a subse- quent publication, Iseki2 introduced another class of algebra called BCI-algebras, which can be seen as a generalization of BCK-algebras. Iseki studied some properties of BCI-algebras. Tamalibrasi and Megalai3 introduced T M-algebras based on propositional calculus. Mostafa et al.4 introduced the concepts of KUS-algebras, KUS-ideals, and KUS-subalgebras, and investigated their relationships. Selvam and Nagalakshmi5 introduced an algebraic structure called PMS-algebra, which generalizes the notions of BCK/BCI/TM/KUS-algebras. They also explored additional properties of PMS-algebras and their ideals.

Derivations are an important research area in algebraic structure theory, developed from the concepts of Galois theory and invariant theory. Derivations are a crucial research area in the theory of algebraic structures in mathematics. The ring with derivation is an ancient concept that significantly integrates analysis, algebraic geometry, and algebra. Jun and Xin6 extended the concept of derivations in ring and near-ring theory to BCI algebras and related properties. Ganeshkumar and Chandramouleeswaran7 derivations and generalized derivations on TM algebras were studied. Also, Kim and Lee8 introduced the notion of derivations on BE algebras and studied their properties. Furthermore, Jana et al.9 introduced derivations, generalized, and f-derivations and characterized their properties on KUS algebras. Sawika et al.10 studied the notions of (l, r)-derivations and derivations of UP-algebras, and their properties were investigated. Recently, by Rong et al.,11 the properties of derivations on FI-algebras and the relationship between derivations and ideals were investigated. Sugianti et al.12 introduced the notion of a (l, r)-derivation, a (r, l)-derivation, and derivation in BM-algebras and investigated related properties. Ganesan and Kandaraj13 studied the idea of generalized derivations of BH-algebras and characterized new properties based on the context of BH-algebras in their work. Additionally, Muangkarn et al.14 studied the derivations of d-algebras based on endomorphisms.

This paper focuses on introducing the fundamental concepts of derivations in PMS-algebras, exploring the properties of generalized derivations, and providing a definition of torsion-free PMS-algebras. The study also investigates the properties of a d-invariant ideal and establishes conditions for its existence.

2. Methods

In this section, we will address the concepts and basic properties of PMS-algebras that we need for the main results in the next sections. These concepts are taken from Selvam and Nagalakshmi.5

Definition 1.

5 A PMS-algebra is an algebra (X; ⋆, 0) of type (2, 0) with a constant “0” and a binary operation “⋆” satisfying the following axioms:

  • 1. 0 ⋆ a = a;

  • 2. (b ⋆ a) ⋆ (c ⋆ a) = c ⋆ b for all a, b, c ∈ X.

In X, we define a binary relation “≤” by a ≤ b if and only if a ⋆ b = 0.

Proposition 1.

5 In a PMS-algebra (X; ⋆, 0) the following properties hold for all a, b, c ∈ X.

  • 1. a ⋆ a = 0.

  • 2. (b ⋆ a) ⋆ c = (c ⋆ a) ⋆ b.

  • 3. (b ⋆ a) ⋆ a = b.

  • 4. a ⋆ (b ⋆ a) = b ⋆ 0.

  • 5. If a ⋆ b = 0 and b ⋆ a = 0, then a = b.

Definition 2.

5 Let S be a nonempty subset of a PMS-algebra (X; ⋆, 0). Then S is called a PMS-subalgebra of X if a*b ∈ S for all a, b ∈ S.

Example 1.

5 Consider (Z; ⋆, 0) where a ⋆ b = b - a for all a, b X. Then (Z; ⋆, 0) is a PMS-algebra, and the set E of even integers is a PMS-subalgebra of Z.

Definition 3.

5 Let X be a PMS-algebra and I be a subset of X. Then I is called a PMS-ideal of X if

  • 1. 0 ∈ I

  • 2. c ⋆ b ∈ I and c ⋆ a ∈ I ⇒ b ⋆ a ∈ I for all a, b, c ∈ X.

Definition 4.

5 Let X be a PMS-algebra. The set G(X)={aX|a0=a} is called the G-part of X.

Definition 5.

Let X be a PMS-algebra. The set B(X)={aX|a0=0} is called the p-radical of X.

Definition 6.

5 A PMS-algebra X is said to be Medial if (a ⋆ b) ⋆ (c ⋆ d) = (a ⋆ c) ⋆ (b ⋆ d) for all a, b, c, d ∈ X.

3. Group structure and Derivations on P MS-algebras

In this section, we will obtain an abelian group from a PMS-algebra by defining binary operations on it. Moreover, we introduce derivations and similarly the basic properties of derivations on PMS-algebras.

Remark 1.

Let (X; ⋆, 0) be a PMS-algebra. If b ⋆ a = c ⋆ a, then b = c for all a, b, c ∈ X.

Proof.

Let b ⋆ a = c ⋆ a.

Now b = 0 ⋆ b = (a ⋆ a) ⋆ b = (b ⋆ a) ⋆ a = (c ⋆ a) ⋆ a = (a ⋆ a) ⋆ c = 0 ⋆ c = c.

Theorem 2.

Let (X, ⋆, 0) be a PMS-algebra and define ′+′′ as a + b = (b ⋆ 0) ⋆ a, ∀a, b ∈ X. Then the following holds:

  • 1. a + 0 = a = 0 + a.

  • 2. Addition is associative.

  • 3. If a + b = 0, then a = b ⋆ 0.

  • 4. Addition is commutative.

  • 5. The additive inverse of a is a ⋆ 0.

Proof.

  • 1. a + 0 = (0 ⋆ 0) ⋆ a = 0 ⋆ a = a and 0 + a = (a ⋆ 0) ⋆ 0 = (0 ⋆ 0) ⋆ a = 0 ⋆ a = a.

    Hence a + 0 = a = 0 + a.

  • 2. By applying the definition of “+” and by simplifying, we get the result.

  • 3. a + b = 0 (b ⋆ 0) ⋆ a = a ⋆ a, by applying right cancellation we get a = b ⋆ 0.

  • 4. a + b = (b ⋆ 0) ⋆ a = (a ⋆ 0) ⋆ b = b + a.

  • 5. a + (a ⋆ 0) = ((a ⋆ 0) ⋆ 0) ⋆ a = (a ⋆ 0) ⋆ (a ⋆ 0) = a ⋆ a = 0.

Hence a ⋆ 0 is the inverse of a.

Definition 7.

Let (X; ⋆, 0) be a PMS-algebra. Define a + b = (b⋆0) ⋆ a and -a = (a⋆0). Then (X, +) is an abelian group.

Remark 2.

If we have a PMS-algebra (X, ⋆, 0) it follows from the above definition that (X, +) is an abelian group with -b = b ⋆ 0, b X. Then we have b - a = a ⋆ b, ∀ a, b ∈ X. On the other hand if we have an abelian group (X, +) with an identity “0” and define a ⋆ b = b - a, we get a PMS-algebra (X, ⋆, 0), where a + b = (b ⋆ 0) ⋆ a, a, b X.

Example 2.

Let (X, ⋆, 0) be a PMS-algebra as shown in Cayley Table 1.

Table 1. PMS-algebra.

0 1 2 3 4
0 0 1 2 3 4
1 4 0 1 2 3
2 3 4 0 1 2
3 2 3 4 0 1
4 1 2 3 4 0

Define a + b = (b ⋆ 0) ⋆ a

Then (X, +) is an abelian group as shown in Table 2.

Table 2. Abelian group.

+ 0 1 2 3 4
0 0 1 2 3 4
1 1 2 3 4 0
2 2 3 4 0 1
3 3 4 0 1 2
4 4 0 1 2 3

Definition 8.

Let (X; ⋆, 0) be a PMS-algebra. Define a binary operation“∧” on X by x ∧ y = (x ⋆ y) ⋆ y for all x, y ∈ X.

Definition 9.

Let (X; ⋆, 0) be a PMS-algebra. A self-map d: X X is said to be a (left, right)-derivation of X, denoted by, (l, r)-derivation if d(x ⋆ y) = (d(x) ⋆ y) ∧ (x ⋆ d(y)) for all x, y ∈ X.

Example 3.

Consider the PMS-algebra X = {0, 1, 2, 3} as shown in Table 3:

Table 3. (l, r)-derivation on X.

0 1 2 3
0 0 1 2 3
1 1 0 3 2
2 2 3 0 1
3 3 2 1 0

Then the self-map d: X X defined by d(0) = 3, d(1) = 2, d(2) = 1 and d(3) = 0 is a (l, r)-derivation on X.

Remark 3.

Let d: X X be a (l, r)-derivation on X. Then d(x ⋆ y) = d(x) ⋆ y for all x, y X.

Definition 10.

Let (X; ⋆, 0) be a PMS-algebra. A self-map d: X X is said to be a (right, left)-derivation of X, denoted by, (r, l)-derivation if d(x ⋆ y) = (x ⋆ d(y)) (d(x) ⋆ y) for all x, y X.

Example 4.

Let X be the PMS-algebra defined in the above example 3, the self-map d: X X defined by d(0) = 1, d(1) = 0, d(2) = 3 and d(3) = 2 is a (r, l)-derivation on X.

Remark 4.

Let d: X X be a (r, l)-derivation on X. Then d(x ⋆ y) = x ⋆ d(y) for all x, y ∈ X.

Definition 11.

Let d: X X be a self-map on a PMS-algebra (X; ⋆, 0). Then the self-map d is said to be a derivation on X if d is both a (l, r)-derivation and a (r, l)-derivation on X.

Example 5.

Let (Z; ⋆, 0) be a PMS-algebra with x ⋆ y = y − x. Then the map d: Z → Z defined

  • 1. by d(x) = x is a derivation on Z.

  • 2. by d(x) = x-1 is a (r, l) derivation on Z but not a (l, r)-derivation. Hence, d is not a derivation.

Remark 5.

Let d: X→ X be a derivation on X. Then d(x ⋆ y) = d(x) ⋆y = x ⋆ d(y) for all x, y ∈ X.

Theorem 3.

Let (X; ⋆, 0) be a PMS-algebra, and d: X→ X be a (l, r) -derivation. If y ≤ x, then d(x) = d(y) for all x, y ∈ X.

Proof.

Let y ≤ x. Then y ⋆ x = 0.

Now

d(x)=d(0x)=d((yx)x)=d((yx)(0x))=d(0y)=d(y)

Hence, d(x) = d(y).

Definition 12.

Let (X; ⋆, 0) be a PMS-algebra. A self-map d on X is said to be regular if d(0) = 0.

Example 6.

Let X be the PMS-algebra defined as in Example 3. The self-map d: X→ X defined by d(0) = 0, d(1) = 1, d(2) = 2, d(3) = 3 is a regular derivation.

Theorem 4.

Let (X; ⋆, 0) be a PMS-algebra. If d: X→ X is a regular (l, r)-derivation, then d(x) ≤ x for all x ∈ X.

Proof.

Suppose d is a regular (l, r)-derivation on X. Then d(0) = d(x ⋆ x) implies d(x) ⋆ x = 0. Thus d(x) ≤ x.

Theorem 5.

Let (X, ⋆, 0) be a PMS-algebra. If d: X→ X be a regular (r, l)-derivation, then x ≤ d(x) for all x ∈ X.

Proof.

Suppose d is a regular (r, l)-derivation on X. Then d(0) = d(x ⋆ x) implies that x ⋆ d(x) = 0. Thus x ≤ d(x).

Theorem 6.

Let (X; ⋆, 0) a PMS-algebra and d: X X be a (l, r)-derivation. Then d is regular if and only if d(x) = x.

Proof.

Let d be a derivation on X. Suppose that d(0) = 0.

Now

d(x)=d(0x)=(d(0)x)(0d(x))=(0x)(d(x))=xd(x)=(xd(x))d(x)=(d(x)d(x))x=0x=x.

Therefore, d(x) = x.

Conversely, assume that d(x) = x, x X.

In particular, d(0) = 0. Hence d is regular.

Theorem 7.

Let G(X) be the G-part of a PMS-algebra X and d be a (l, r)-derivation on X. Then d(x) ∈ G(X), ∀x ∈ G(X).

Proof.

Let x∈G(X). Then x ⋆ 0 = x. Now

d(x)=d(x0)=d(x)0.

Hence d(x) ∈ G(X).

Theorem 8.

Let B(X) be the P-radical of a PMS-algebra X and d be a (l, r)-derivation on B(X). Then d is regular.

Proof.

Let x ∈ B(X). Then x ⋆ 0 = 0.

Now

d(0)=d(x0)=d(x)0=0
Hence d(0) = 0:

Therefore, d is a regular derivation on B(X).

Theorem 9.

Let (X; ⋆, 0) be a PMS-algebra and d: X X be a (l, r)-derivation. Then

  • 1. d(x) ⋆ x = 0 ∀x ∈ X if and only if d is regular.

  • 2. d(x ⋆ d(x)) = 0 ∀x ∈ X.

Proof.

  • 1. Suppose that d(x) ⋆ x = 0. Now

    d(0)=d(xx)=d(x)x=0

    Hence, d is regular.

    Conversely, assume that d(0) = 0

    Now d(x ⋆ x) = 0 implies that d(x) ⋆ x = 0 Hence d(x) ⋆ x = 0.

  • 2. d(x ⋆ d(x)) = d(x) ⋆ d(x) = 0.

Theorem 10.

Let (X; ⋆, 0) be a PMS-algebra and d: X X be a (r, l)-derivation. Then

  • 1. x ⋆ d(x) = 0, ∀x ∈ X if and only if d is regular.

  • 2. d(d(x) ⋆ x) = 0, ∀x ∈ X.

Proof.

  • 1. Suppose that d(x) ⋆ x = 0 Now

    d(0)=d(xx)=d(x)x=0

    Hence, d is regular.

    Conversely, assume that d(0) = 0

    Now d(x ⋆ x) = d(0) implies that d(x) ⋆ x = 0

    Hence d(x) ⋆ x = 0.

  • 2. d(d(x) ⋆ x) = d(x) ⋆ d(x) = 0.

Theorem 11.

Let d be a self-map of a PMS-algebra X.

  • 1. Let d be a (l, r) -derivation on X. Then d regular if and only if d(x) = x ∧ d(x).

  • 2. Let d be a (r, l) -derivation on X. If d is regular, then d(x) = d(x) ∧ x.

Proof.

  • 1. Let d be a self-map on a PMS-algebra. Suppose that d is regular (l, r)-derivation on X.

    d(x)=d(0x)=(d(0)x)(0d(x))=(0x)(0d(x))=xd(x).

    Conversely, assume that d(x) = x∧d(x). Then d(0) = 0∧d(0) = (0 ⋆ d(0)) ⋆ d(0) = (d(0) ⋆ d(0)) ⋆ 0 = 0 ⋆ 0 = 0.

  • 2. Let d be regular (l, r)-derivation.

    d(x)=d(0x)=(0d(x))(d(0)x)=(0d(x))(0x)=d(x)x.

Theorem 12.

Let d be a (r, l)-derivation on a PMS-algebra X. Then

  • 1. d(0) = x ⋆ d(x).

  • 2. d is 1-1.

  • 3. If there is an element x∈X such that d(x) = x, then d is the identity map.

  • 4. If there is an element x∈X such that d(y) ⋆ x = 0 for all y∈X, then d(y) = x, that is, d is a constant map.

Proof.

  • 1. d(0) = d(x ⋆ x) = x ⋆ d(x) Because d is a (r, l)-derivation on X.

  • 2. Let x, y ∈ X and d(x) = d(y).

    (1)
    d(0)=d(xx)=xd(x)
    (2)
    d(0)=d(yy)=yd(y)

    From (1) and (2) we have by x ⋆ d(x) = y ⋆ d(y) implies that x ⋆ d(x) = y ⋆ d(x). Hence by right cancellation we have x = y.

    Therefore d is a one to one map.

  • 3. Let x ∈ X such that d(x) = x.

    Let y ∈ X be any element of X. Then y = 0 ⋆ y = (x ⋆ x) ⋆ y = (y ⋆ x) ⋆ x. Then

    d(y)=d((yx)x)=(yx)d(x)=(yx)x=y

    Hence, d(x) = x, ∀x∈X.

    This proves that d is the identity map on X.

  • 4. Given d(y) ⋆ x = 0 implies that d(y) ⋆ x = x ⋆ x, and hence by right cancellation we have d(y) = x.

Corollary 1.

Let (X; ⋆, 0) be a PMS-algebra. If d is a (r, l)-derivation on X, then x ⋆ d(x) = y ⋆ d(y) ∀x, y ∈ X.

Proof.

Let x, y ∈ X. Then

(3)
d(0)=d(xx)=xd(x)
(4)
d(0)=d(yy)=yd(y)

From (3) and (4) we have x ⋆ d(x) = y ⋆ d(y)

Theorem 13.

Let X be a PMS-algebra and d be a regular (l, r)-derivation on X. Then Ker d = {x ∈ X: d(x) = 0} is a PMS-subalgebra of X.

Proof.

Since d is a regular, d(0) = 0.

Hence 0 ∈ Ker d. It follows that Ker d .

Let x, y ∈ Ker d. Then d(x) = 0,

d(y) = 0. Now we have

d(xy)=d(x)y=xy=d(x)d(y)=00=0.

Hence x ⋆ y ∈ Ker d.

Therefore Ker d is a PMS-subalgebra of X.

Theorem 14.

Let d be a (r, l)-derivation on a PMS-algebra X. If x ≤ y and x ∈ Ker d, then y ∈ Ker d.

Proof.

Let x≤y and x∈Ker d. Then x ⋆ y = 0 and d(x) = 0.

Now d(y) = d(0 ⋆ y) = d((x ⋆ y) ⋆ y) = d((y ⋆ y) ⋆ x) = d(0 ⋆ x) = d(x) = 0. Hence y ∈ Ker d.

Theorem 15.

Let X be medial of a PMS-algebra and d be a regular (l, r)-derivation on X. Then Ker d is a PMS-ideal of X.

Proof.

Let z ⋆ x Ker d and z ⋆ y Ker d. Then d(z ⋆ x) = 0 and d(z ⋆ y) = 0. Now

d(xy)=d(0(xy))=d((zz)(xy))=d((zx)(zy))=d(zx)(zy)=d(zx)d(zy)=00=0.

Hence x ⋆ y ∈ Ker d

Therefore Ker d is a PMS-ideal of X.

Theorem 16.

Let X be a PMS-algebra and d be a (l, r)-derivation on X. Then Ker d = {0} if and only if d is regular.

Proof.

Suppose that Ker d = {0}.

Let x ∈ Ker d. Then d(x) = 0, ∀x ∈ X in particular d(0) = 0. Hence d is regular.

Conversely, assume that d is regular Let x ∈ Ker d. Then d(x) = 0.

Now 0 = d(0) = d(x ⋆ x) = d(x) ⋆ x = 0 ⋆ x = x. Hence, x = 0

Thus Ker d = {0}.

Definition 13.

Let X be a PMS-algebra and d: X→ X be a derivation of X. Define Fixd(X)={xX|d(x)=x} is called the fixed set of X.

Theorem 17.

Let (X; ⋆, 0) be a PMS-algebra and d be a (l, r)-derivation on X. Then Fixd(X) is a PMS-subalgebra of X.

Proof.

Since 0 ∈ X, and d(0) = 0. Hence 0 ∈ Fixd(X). It follows that Fixd(X) .

Let x, y ∈ Fixd(X). Then d(x) = x and d(y) = y.

Now

d(xy)=d(x)y=xd(y)=xy

Hence d(x ⋆ y) = x ⋆ y implies that x ⋆ y ∈ Fixd(X). Therefore, Fixd(X) is a PMS-subalgebra of X.

Theorem 18.

Let d be a (r, l)-derivation on a PMS-algebra X. If x ≤ y and y ∈ Fixd(X), then x ∈ Fixd(X).

Proof.

Let x y and y Fixd(X). Then x ⋆ y = 0 and d(y) = y. Now

d(x)=d(0x)=d((yy)x)=d((xy)y)=(xy)d(y)=(xy)y=(yy)x=0x=x

Hence, x ∈ Fixd(X).

Theorem 19.

Let X be a medial PMS-algebra and d be a (r, l)-derivation on X. Then Fixd(X) is a PMS-ideal of X.

Proof.

  • 1. Since d(x) = x for all x ∈ Fixd(X), d(0) = 0.

    Hence, 0 ∈ Fixd(X).

  • 2. Let z ⋆ x∈Fixd(X) and z ⋆ y∈Fixd(X). Then d(z ⋆ x) = z ⋆ x and d(z ⋆ y) = z ⋆ y.

    Now

    d(xy)=d(0(xy))=d((zz)(xy))=d((zx)(zy))=(zx)d(zy)=(zx)(zy)=(zz)(xy)=0(xy)=xy

Hence, x ⋆ y ∈ Fixd(X).

Therefore, Fixd(X) is an ideal of X.

Theorem 20.

Let X be a PMS-algebra and d be a (r, l)-derivation on X. If y≤x and d(x) = x, then d(y) = y.

Proof.

d(y) = d(0 ⋆ y) = d((x ⋆ x) ⋆ y) = d((y ⋆ x) ⋆ x) = (y ⋆ x) ⋆ d(x) = (y ⋆ x) ⋆ x = (x ⋆ x) ⋆ y = 0 ⋆ y = y.

Definition 14.

Let X be a PMS-algebra. A self-map d on X is said to be an isotone if x≤y implies that d(x) ≤d(y) for all x, y∈X.

Theorem 21.

Let X be a PMS-algebra and d be a regular (l, r)-derivation on X. Then the following properties are equivalent:

  • 1. d is an isotone derivation on X.

  • 2. x ≤ y implies d(x ⋆ y) = d(x) ⋆ y.

Proof.

Suppose that d is an isotone (l, r)-derivation on X. Let x, y∈X such that x≤y. Then we have d(x ⋆ y) = d(0) = 0. Since d is isotone, we get d(x) ⋆ d(y) = 0. Now

d(xy)=0=d(x)d(y)=d(x)d(0y)=d(x)(d(0)y)=d(x)(0y)=d(x)y.

Therefore, d(x ⋆ y) = d(x) ⋆ y.

Assume that x ≤ y implies d(x ⋆ y) = d(x) ⋆ y. Let x, y∈X such that x ≤ y. Now

d(x)d(y)=d(x)d(0y)=d(x)(d(0)y)=d(x)(0y)=d(x)y=d(xy)=d(0)=0

Hence, d(x) ⋆ d(y) = 0 implies that d(x) ≤ d(y).

Therefore, d is an isotone derivation on X.

Definition 15.

Let LDer(X) be the set of all (l, r)-derivations on X. Define a binary operation “∧” on LDer(X) by (d1 ∧ d2)(x) = d1(x) ∧ d2(x) for all x ∈ X, where d1, d2 ∈ LDer(X).

Lemma 1.

If d1 and d2 are (l, r)-derivations on X, then (d1 d2) is also a (l, r) derivation on X. Proof.

(5)
(d1d2)(xy)=d1(xy)d2(xy)=(d1(x)y)(d2(x)y)=((d1(x)y)(d2(x)y))(d2(y)y)=d1(x)y
(6)
(d1d2)(x)y=(d1(x)d2(x))y=((d1(x)d2(x))d2(x))y=d1(x)y

From (5) and (6) we have (d1 ∧ d2)(x ⋆ y) = (d1 ∧ d2)(x) ⋆ y. Hence, (d1 ∧ d2) (l, r)-derivation.

Lemma 2.

The binary operation “∧” defined on LDer(X) is associative. Proof. Let X be a PMS-algebra.

Let d1, d2, d3 be (l, r)-derivations on X. Now

(7)
((d1d2)d3)(x)=((d1d2)d3)(0x)=(d1d2)(0x)d3(0x)=(d1(0)x)(d3(0)x)=((d1(0)x)(d3(0)x))(d3(0)x)=d1(0)x
(8)
(d1(d2d3))(x)=(d1(d2d3))(0x)=d1(0x)(d2d3)(0x)=(d1(0)x)(d2(0)x)=((d1(0)x)(d2(0)x))((d2(0)x)=d1(0)x

From (7) and (8) we have (d1 ∧ d2) ∧ d3)(x) = d1 ∧ (d2 ∧ d3)(x), ∀x ∈ X. Hence “∧” is associative.

Combining the above two lemmas we get following theorem.

Theorem 22.

LDer(X) is a semigroup under the binary operation defined by (d1 ∧ d2)(x) = d1(x)∧d2(x) ∀x∈X, where d1,d2∈LDer(X).

Definition 16.

Let RDer(X) be the set of all (l, r)-derivations on X. Define a binary operation “∧” on RDer(X) by (d1 ∧ d2)(x) = d1(x) ∧ d2(x) for all x ∈ X, where d1, d2 ∈ RDer(X).

Lemma 3.

If d1 and d2 are (r, l)-derivations on X, then (d1∧d2) is also a (r, l)-derivation on X.

Proof.

Let d1 and d2 are (r, l)-derivations on X. Then

(9)
(d1d2)(xy)=d1(xy)d2(xy)=(xd1(y))(xd2(y))=(((xd1(y))(xd2(y)))(xd2(y)))=xd1(y)
(10)
x(d1d2)(y)=x((d1(y)d2(y))=x((d1(y)d2(y))d2(y))=xd1(y)

From (9) and (10) we have (d1 ∧ d2)(x ⋆ y) = x ⋆ (d1 ∧ d2)(y). Hence, (d1 ∧ d2) (l, r)-derivation on X.

Lemma 4.

The binary operation “∧” defined on RDer(X) is associative.

Proof.

Let X be a PMS-algebra.

Let d1, d2, d3 be (r, l)-derivations on X.

Now

(11)
((d1d2)d3)(x)=((d1d2)d3)(0x)=(d1d2)(0x)d3(0x)=(d1(0)d2(x))(0d3(x))=(0d1(x))(d3(x)y))(d3(x)y)=d1(x)y
(12)
(d1(d2d3))(xy)=d1(xy)(d2d3)(xy)=(d1(x)y)(d2(x)y)=((d1(x)y)(d2(x)y))((d2(x)y)=d1(x)y

From (11) and (12) we have (d1 ∧ d2) ∧ d3) = d1 ∧ (d2 ∧ d3). Combining the above two lemmas we get following theorem.

Theorem 23.

RDer(X) is a semigroup under the binary composition defined by (d1 ∧ d2)(x) = d1(x) ∧ d2(x) ∀x ∈ X and d1, d2 ∈ RDer(X).

Lemma 5.

Let (X; ⋆, 0) be a PMS-algebra and d1, d2 be (l, r)-derivations on X. Then the composition (d1 ◦ d2) is a (l, r)-derivation on X.

Proof.

(d1 ◦ d2)(x⋆ y) = d1(d2(x⋆ y)) = d1(d2(x) ⋆ y) = d1(d2(x)) ⋆ y = (d1 ◦ d2)(x) ⋆ y. Hence, (d1 ◦ d2) is a (l, r)-derivation on X.

Lemma 6.

Let (X; ⋆, 0) be a PMS-algebra and d1, d2 be (r, l)-derivations on X. Then the composition (d1 ◦ d2) is a (r, l)-derivation on X.

Proof.

(d1 ◦ d2)(x⋆ y) = d1(d2(x⋆ y)) = d1(x⋆ d2(y)) = x⋆ d1(d2(y)) = x⋆ (d1 ◦ d2)(y). Hence, (d1 ◦ d2) is a (r, l)-derivation on X.

Theorem 24.

Let (X; ⋆, 0) be a PMS-algebra and d1, d2 be derivations on X. Then the composition (d1 ◦ d2) is also a derivation on X.

Theorem 25.

Let (X; ⋆, 0) be a PMS-algebra and d1, d2 be derivations on X. Then d1 ◦ d2 = d2 ◦ d1.

Proof.

Given d1, d2 be derivation on X. Then d1, d2 are both (l, r) and (r, l)-derivations on X. Now

(13)
(d1d2)(x)=(d1d2)(0x))=d1(d2(0x))=d1(d2(0)x)=d2(0)d1(x)
(14)
(d2d1)(x)=(d2d1)(0x)=d2(d1(0x))=d2(0d1(x))=d2(0)d1(x)

From (13) and (14) we have (d1 ◦ d2)(x) = (d2 ◦ d1)(x). Therefore, d1 ◦ d2 = d2 ◦ d1.

Theorem 26.

Let X be a PMS-algebra and d be a regular (l, r)-derivation on X. Define d2(x) = d(d(x)) for all x ∈ X. Then d2 = d.

Proof.

Now

d2(x)=d(d(x))=d(d(0x))=d((d(0)x)(0d(x))=d((0x)d(x))=d(xd(x))=d((xd(x))d(x))=d((d(x)d(x))x)=d(0x)=d(x),xX.

Hence d2 = d.

Definition 17.

Let (X; ⋆, 0) be a PMS-algebra. Let d1, d2 be self-maps on X. We define (d1 ⋆ d2): X→ X as (d1 ⋆ d2)(x) = d1(x) ⋆ d2(x) ∀x ∈ X.

Theorem 27.

Let (X; ⋆, 0) be a PMS-algebra and d1, d2 be derivations on X. Then d1 ⋆ d2 = d2 ⋆ d1.

Proof.

Let x ∈ X.

(15)
(d1d2)(x)=(d1d2)(0x)=d1(d2(0x))=d1(d2(0)x)=d2(0)d1(x)=d2(0)d1(x).
(16)
(d1d2)(x)=(d1d2)(0x)=d1(d2(0x))=d1(0d2(x))=d1(0)d2(x)=d1(0)d2(x)

From (15) and (16) we have d1(0) ⋆ d2(x) = d2(0) ⋆ d1(x) implies that (d1 ⋆ d2)(x) = (d2 ⋆ d1)(x), ∀x ∈ X.

Hence d1 ⋆ d2 = d2 ⋆ d1.

Definition 18.

Let d a self-map on PMS-algebra of X. A PMS-ideal I of X is said to be d-invariant if d(I) ⊆ I, where d(I) = {d(x): x ∈ I}.

Theorem 28.

Let d be a derivation on a PMS-algebra X. Then d is regular if and only if every PMS-ideal of X is d-invariant.

Proof.

Suppose that d be a regular derivation.

Let y ∈ d(I). Then y = d(x) for some x ∈ I. Now y ⋆ x = d(x) ⋆ x = x ⋆ x = 0, since d is regular d(x) = x and hence y ⋆ x ∈ I as 0 ∈ I.

y = 0 ⋆ y = (x ⋆ x) ⋆ y = (y ⋆ x) ⋆ x ∈ I, since x ∈ I and y ⋆ x ∈ I. Thus, y ∈ I implies that d(I) ⊆ I.

Conversely, assume that every ideal of X is d-invariant, then d(0) ⊆ 0, and hence d(0) = 0.

Therefore, d is regular.

4. Generalized derivations on P MS-algebras

Definition 19.

Let X be a PMS-algebra. A mapping D: X X is called a generalized (l, r)-derivation on X if there exists a (l, r)-derivation d: X X such that D(x ⋆ y) = (D(x) ⋆ y) (x ⋆ d(y), x, y X.

Definition 20.

Let X be a PMS-algebra. A mapping D: X X is called a generalized (r, l)-derivation on X if there exists a (r, l)-derivation d: X X such that D(x ⋆ y) = (x ⋆ D(y)) (d(x) ⋆ y) for all x, y X.

Definition 21.

Let X be a PMS-algebra. A mapping D: X X is called a generalized derivation on X, if there exists a derivation d: X X such that D is both a generalized (l, r)-derivation and a generalized (r, l)-derivation on X.

Example 7.

Consider the PMS-algebra X = {0, 1, 2, 3, 4} as shown in Table 4:

Table 4. Generalized (r, l)-derivation on X.

0 1 2 3 4
0 0 1 2 3 4
1 4 0 1 2 3
2 3 4 0 1 2
3 2 3 4 0 1
4 1 2 3 4 0

Define a self-map d: X X by d(0) = 3, d(1) = 4, d(2) = 0, d(3) = 1, d(4) = 2.

Then d is a (r, l)-derivation on X. But d is not an (l, r)-derivation on X.

Define a map D: X X by D(0) = 1, D(1) = 2, D(2) = 3, D(3) = 4, D(4) = 0.

Then D satisfies the equality, D(x ⋆ y) = (x ⋆ D(y)) ∧ (d(x) ⋆ y) for all x, y∈X. Thus D is a generalized (r, l)-derivation on X. But D is not a (l, r)-derivation on X.

Example 8.

Let (X; ⋆, 0) be the PMS-algebra as shown in Cayley Table 5.

Table 5. Generalized derivation on X.

0 1 2 3
0 0 1 2 3
1 1 0 3 2
2 2 3 0 1
3 3 2 1 0

A self-map d: X X be defined by d(0) = 3, d(1) = 2, d(2) = 1, d(3) = 0.

Then d is a derivation on X.

Define a map D: X X by D(0) = 2, D(1) = 3, D(2) = 0, D(3) = 1. D satisfies the equality, D(x ⋆ y) = (D(x) ⋆ y) (x ⋆ d(y)) for all x, y X and D(x ⋆ y) = (x ⋆ D(y)) (d(x) ⋆ y) for all x, y X. Thus D is a generalized derivation on X.

Theorem 29.

Let D be a self-map on a PMS-algebra X. Then the following holds true.

  • 1. If D is a generalized (r, l)-derivation on X and d be a regular (r, l)-derivation on X, then D(x) = D(x) x for all x X.

  • 2. If D is a generalized (l, r)-derivation on X, then D(0) = 0 if and only if D(x) = x ∧ d(x) for all x ∈ X and for some regular (l, r)-derivation d of X.

Proof.

  • 1. Let d be a regular derivation on X. Now

    D(x)=D(0x)=(0D(x))(d(0)x)=D(x)(0x)=D(x)x

  • 2. Suppose that D(0) = 0. Now

    D(x)=D(0x)=(D(0)x)(0d(x))=(0x)d(x)=xd(x)

    Hence, D(x) = x∧d(x)

    Conversely, assume D(x) = x∧d(x) Now

    D(0)=0d(0)=(0d(0))d(0)=(d(0)d(0))0=00=0

    Hence D(0) = 0.

Theorem 30.

Let D be a generalized (r, l)-derivation on a PMS-algebra X. Then

  • 1. D(a) = a + D(0), ∀a ∈ X.

  • 2. D(x + a) = x + D(a), ∀a, x ∈ X.

  • 3. D(a + b) = D(a) + b = a + D(b), ∀a, b ∈ X.

Proof.

  • 1.

    D(a)=D((a0)0)=(a0)D(0)=(D(0)0)a=a+D(0).

    Hence, D(a) = a + D(0).

  • 2.

    D(x+a)=D((a0)x)=D((x0)a)=(x0)D(a)=((D(a)0)x)=x+D(a)

    Hence, D(x + a) = x + D(a).

  • 3. Since (X, +) is an abelian group, a + b = b + a, ∀a, b ∈ X. Now

    • i.

      D(a)+b=D(a+b)=D(b+a)=D(b)+a

      Hence D(a + b) = D(a) + b = a + D(b), ∀a, b ∈ X.

Theorem 31.

Let D be a generalized (l, r)-derivation on a PMS algebra X. Then

  • 1. D(a)∈G(X) ∀a∈G(X).

  • 2. D(a) = a ⋆ D(0) = a + D(0) ∀a∈X.

  • 3. D(a + b) = D(a) + D(b) - D(0), a, b X.

  • 4. D is the identity map on X if and only if D(0) = 0.

Proof.

  • 1. Let a ∈ G(X), then a ⋆ 0 = a.

    D(a)=D(a0)=(D(a)0)(ad(0))=((D(a)0)(ad(0)))(ad(0))=((ad(0))(ad(0)))((D(a)0)=0((D(a)0)=D(a)0

    Therefore, D(a)∈G(X).

  • 2.

    D(a)=D(0a)=(D(0)a)(0d(a))=((D(0)a)d(a))=(d(a)d(a))(D(0)a)=D(0)a

    Hence, D(a) = D(0) ⋆ a Again

    D(a)=D(0a)=D(0)a=D(00)a=(D(0)0)a=D(0)+a

    Therefore, D(a) = D(0) ⋆ a = D(0) + a.

  • 3.

    D(a+b)=a+b+D(0)=a+D(0)+b+D(0)D(0)=D(a)+D(b)D(0)

    Hence, D(a + b) = D(a) + D(b)-D(0).

  • 4. Suppose D be an identity map on X. Then D(a) = a for all a∈X. Thus, D(0) = 0.

    Conversely, assumed (0) = 0. Now

    D(a)=D(0a)=D(0)a=0a=a

    Thus, D is an identity map on X.

5. Torsion-Free P MS-algebras

Definition 22.

A PMS-algebra X is said to be torsion-free if x = 0 whenever x + x = 0, x X.

Example 9.

Let (X, ⋆, 0) be the PMS-algebra as shown in Cayley Table 6.

Table 6. Torsion free PMS-algebra.

0 1 2 3 4
0 0 1 2 3 4
1 4 0 1 2 3
2 3 4 0 1 2
3 2 3 4 0 1
4 1 2 3 4 0

0 + 0 = 0

1 + 1 = (1 ⋆ 0) ⋆ 1 = 4 ⋆ 1 = 2

2 + 2 = (2 ⋆ 0) ⋆ 2 = 3 ⋆ 2 = 4

3 + 3 = (3 ⋆ 0) ⋆ 3 = 2 ⋆ 3 = 1

4 + 4 = (4 ⋆ 0) ⋆ 4 = 1 ⋆ 4 = 3

Thus X is a Torsion-free PMS-algebra.

Theorem 32.

Let X be a Torsion-free PMS-algebra and let D1 and D2 be two generalized derivations on X. If D1 ◦ D2 = 0 on X, then D2 = 0 on X.

Proof.

Let x ∈ X, then x + x ∈ X.

0=(D1D2)(x+x)=D1(D2(x+x))=D1(0)+D2(x+x)=D1(0)+D2(x)+D2(x)D2(0)=D1(0)D2(0)+D2(x)+D2(x)=(D2(0)D1(0))+D2(x)+D2(x)=(D1(0)0)D2(0)+D2(x)+D2(x)=D1(0)+D2(0)+D2(x)+D2(x)=D1(D2(0))+D2(x)+D2(x)=0+D2(x)+D2(x)

Hence D2(x) + D2(x) = 0.

Since X is a Torsion-free, D2(x) = 0, ∀x ∈ X. Thus D2 = 0 on X.

Corollary 2.

Let X be a Torsion-free PMS-algebra and D be a generalized derivation on X. If D2 = 0 on X, then D = 0 on X.

Proof.

Let x ∈ X, then x + x ∈ X.

0=D2(xx)=D(D(x+x))=D(0)+D(x+x)=D(0)+D(x)+D(x)D(0)

Hence D(x) + D(x) = 0.

Since X is torsion free D2(x) = 0, x X. Thus D2 = 0 on X

6. Conclusions

Derivation is a crucial research area in the field of algebraic structure in mathematics. The derivations on PMS-algebras were applied, and further properties of the derivations on PMS-algebras were discussed. The study focused on generalized derivations in PMS-algebras, including regular derivations, fixed set derivations, and composition of derivations. We demonstrated that the set of all derivations on a PMS-algebra X forms a semigroup under a suitable binary composition. The definitions and main results can be applied to other algebraic systems and to computational physics and computer sciences. Further research is needed to explore the application of these concepts in computer science for information processing, and derivations have also been employed in coding theory. This idea may extend to other algebraic structures.

Ethics and consent

Ethical approval and consent were not required.

Comments on this article Comments (0)

Version 1
VERSION 1 PUBLISHED 13 Jan 2025
Comment
Author details Author details
Competing interests
Grant information
Copyright
Download
 
Export To
metrics
Views Downloads
F1000Research - -
PubMed Central
Data from PMC are received and updated monthly.
- -
Citations
CITE
how to cite this article
Melese Kassahun N, Assaye Alaba B, Gedamu Wondifraw Y and Teshome Wale Z. Group Structures and Derivations on PMS-algebras [version 1; peer review: 2 approved]. F1000Research 2025, 14:75 (https://doi.org/10.12688/f1000research.159712.1)
NOTE: If applicable, it is important to ensure the information in square brackets after the title is included in all citations of this article.
track
receive updates on this article
Track an article to receive email alerts on any updates to this article.

Open Peer Review

Current Reviewer Status: ?
Key to Reviewer Statuses VIEW
ApprovedThe paper is scientifically sound in its current form and only minor, if any, improvements are suggested
Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit.
Not approvedFundamental flaws in the paper seriously undermine the findings and conclusions
Version 1
VERSION 1
PUBLISHED 13 Jan 2025
Views
8
Cite
Reviewer Report 02 Jul 2025
Dr. Vinod Kumar R, Mathematics, Rajalakshmi Engineering College, Thandalam/Chennai, Tamil Nadu, India 
Hemavathi P, Saveetha Institute of Medical and Technical Sciences (SIMATS), Chennai, Tamil Nadu, India 
Approved
VIEWS 8
This paper investigates the concept of ideals within the framework of PMS-algebras—a class of algebraic structures that generalizes several well-known systems such as BCK-, BCI-, and TM-algebras. The authors define and explore various types of ideals (left, right, two-sided, ... Continue reading
CITE
CITE
HOW TO CITE THIS REPORT
R DVK and P H. Reviewer Report For: Group Structures and Derivations on PMS-algebras [version 1; peer review: 2 approved]. F1000Research 2025, 14:75 (https://doi.org/10.5256/f1000research.175479.r393129)
NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article.
  • Author Response 09 Aug 2025
    Nibret Melese Kassahun, Mathematics, Bahir Dar University, Bahir Dar, 6000, Ethiopia
    09 Aug 2025
    Author Response
    We have accepted all the strength comments and suggestion including the minor comments to improve the paper, we will revise to correct some typographical errors and mathematical notations.

    Nibret ... Continue reading
COMMENTS ON THIS REPORT
  • Author Response 09 Aug 2025
    Nibret Melese Kassahun, Mathematics, Bahir Dar University, Bahir Dar, 6000, Ethiopia
    09 Aug 2025
    Author Response
    We have accepted all the strength comments and suggestion including the minor comments to improve the paper, we will revise to correct some typographical errors and mathematical notations.

    Nibret ... Continue reading
Views
8
Cite
Reviewer Report 21 Mar 2025
Mezgebu Manmekto Gereme, Department of Mathematics, Debark University, Debark, Amhara, Ethiopia 
Approved
VIEWS 8
The article, “Group Structure and Derivation on PMS-algebras,” presents a compelling investigation. Using mathematical techniques, the researchers analyzed the properties and behavior of derivations within PMS-algebras. Specifically, they demonstrated that the set of all derivations associated with the defined binary ... Continue reading
CITE
CITE
HOW TO CITE THIS REPORT
Gereme MM. Reviewer Report For: Group Structures and Derivations on PMS-algebras [version 1; peer review: 2 approved]. F1000Research 2025, 14:75 (https://doi.org/10.5256/f1000research.175479.r369263)
NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article.
  • Author Response 16 Jun 2025
    Nibret Melese Kassahun, Mathematics, Bahir Dar University, Bahir Dar, 6000, Ethiopia
    16 Jun 2025
    Author Response
    We have read the comments made by the reviewer and we have been accepted all of the comments. The comments and suggestions are very constructive which motivates our next works.
    ... Continue reading
COMMENTS ON THIS REPORT
  • Author Response 16 Jun 2025
    Nibret Melese Kassahun, Mathematics, Bahir Dar University, Bahir Dar, 6000, Ethiopia
    16 Jun 2025
    Author Response
    We have read the comments made by the reviewer and we have been accepted all of the comments. The comments and suggestions are very constructive which motivates our next works.
    ... Continue reading

Comments on this article Comments (0)

Version 1
VERSION 1 PUBLISHED 13 Jan 2025
Comment
Alongside their report, reviewers assign a status to the article:
Approved - the paper is scientifically sound in its current form and only minor, if any, improvements are suggested
Approved with reservations - A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit.
Not approved - fundamental flaws in the paper seriously undermine the findings and conclusions
Sign In
If you've forgotten your password, please enter your email address below and we'll send you instructions on how to reset your password.

The email address should be the one you originally registered with F1000.

Email address not valid, please try again

You registered with F1000 via Google, so we cannot reset your password.

To sign in, please click here.

If you still need help with your Google account password, please click here.

You registered with F1000 via Facebook, so we cannot reset your password.

To sign in, please click here.

If you still need help with your Facebook account password, please click here.

Code not correct, please try again
Email us for further assistance.
Server error, please try again.