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

Fuzzy PTM subalgebra of PTM - algebra

[version 1; peer review: 1 approved with reservations]
PUBLISHED 06 Jan 2025
Author details Author details
OPEN PEER REVIEW
REVIEWER STATUS

Abstract

Background

This article introduces the concept of fuzzy pseudo-TM subalgebra (FPTMSA) of pseudo-TM algebra (PTMA). This study explores the relationship between FPTMSAs and their level sets within the context of PTMA. It further investigates the homomorphic behavior of FPTMSAs under various algebraic operations, thereby providing a foundation for further exploration of the algebraic structure of fuzzy pseudo-ideals within PTMAs.

Methods

The concept of level sets for FPTMSAs is defined and examined, highlighting their role in characterizing these subalgebras within a PTMA. This study explores the behavior of FPTMSAs under homomorphisms, considering both homomorphic images (HI) and inverse images (II) of FPTMSAs in PTMAs. In addition, the composition of epimorphic images and inverse images of FPTMSAs is discussed. The study also considers the properties of FPTMSAs under Cartesian products (CPs), demonstrating that the Cartesian product of two FPTMSAs remains an FPTMSA.

Results

This study establishes several key properties of FPTMSAs in PTMAs, particularly focusing on their behavior under homomorphisms, epimorphisms, and Cartesian products. Specifically, this study demonstrates that the Cartesian product of two FPTMSAs results in another FPTMSA. Additionally, this study examines the relationships between the homomorphic image and inverse image of FPTMSAs and presents further algebraic results related to these concepts.

Conclusions

The article concludes by highlighting the significant role of FPTMSAs in the structure of PTMAs, particularly in their interaction with homomorphisms, epimorphisms, and Cartesian products. The results suggest that the FPTMSAs are robust under various algebraic operations. Future work will extend these concepts to intuitionistic fuzzy pseudo-TM subalgebra within PTMAs with the goal of uncovering new algebraic insights and results.

Keywords

PTMA, FPTMSA, Level set of a PTMA, CP of FPTMSA

Introduction

Iski and Imai examined two types of algebras: BCI -algebras and BCK -algebras.5,4,8 It is established that BCK -algebras form a proper subclass within the broader class of BCI -algebras. Iorgulescu and Georgescu introduced the concept of pseudo- BCI algebra as a generalization of BCK -algebra.1,3 Jun examined the idea of a pseudo-ideal in pseudo-BCK-algebra.9 H. S. Kim and J. Neggers explained the notion of d-algebras, which is another useful generalization of BCK-algebras, and investigated several relations between d-algebras and oriented diagraphs.12 Roh, Jun, and Kim introduced a new concept known as BH algebra, which is a generalization of BCI and BCK-algebras. The FS f of a set S is defined as a mapping element of S to values within the closed interval [0,1] . In 1965, Zadeh introduced the idea of an FS for a set that was initially introduced.19 Kim10 introduced the concept of BG-algebra, which generalizes B-algebra. Somjanta et al.18 introduced and explored various properties of fuzzy UP-subalgebras and fuzzy UP-ideals within UP algebras. Prabpayak et al.15 examined various results related to fuzzy pseudo-KU algebras. Y. B. H. S., Jun, Kim, and S.S. Ahn7 introduced pseudo-Q-algebras as a generalization of Q-algebras.13 Jawad6 defined the concept of fuzzy pseudo-ideals (FPI) in pseudo Q-algebras. Megalai and Tamilarasi11 introduced TMA, which generalizes BCK, BCH, Q, and BCI algebras. Chanwit and Prabpayak16 presented the concept of homomorphisms in FTMA, and established several properties. Mostafa et al.12 studied the idea of FTMA within TMA and investigated its related properties.

In this article, we present the concept and characteristics of FPTMSAs within PTMA We explain the concept of level subsets in FPTMSA of PTMAs. Various properties of these FPTMSAs have been investigated with respect to homomorphisms and CP leading to several noteworthy findings. We denote if and only if by iff, by minimum, by maximum, by sup, TM algebra by TMA, pseudo TM-algebra by PTMA, fuzzy subset by FS, fuzzy pseudo TM-subalgebra by FPTMSA, pseudo TM homomorphism by PTMH, homomorphic image by HI, inverse image by II, and cartesian product by CP.

Preliminaries

In this section, we review the basic results and definitions essential for the analysis presented in this article.

Definition 2.1.

(Ref. 14) A PTMA is defined as an algebra (Σ;,,0) that satisfies the following axioms: For every ρ,ς,ϱΣ

1.ρ0=ρ0=ρ2.(ρς)(ρϱ)=ϱςand(ρς)(ρϱ)=ϱς.

In a PTMA Σ , define a relation such that ρς iff ρς=0 and ρς=0 . Furthermore, any PTMA Σ in which ρς=ρς for every ρ,ςΣ is classified as TMA.

Lemma 2.2.

(Ref. 14) In PTMA Σ the next holds for every ρ,ςΣ .

  • (i) ρρ=ρρ=0

  • (ii) ς(ρς)=ς=ς(ρς)

  • (iii) (ρς)ρ=0ς and (ρς)ρ=0ς

  • (iv) ρ(ρ(ρς))=ρς,ρ(ρ(ρς))=ρς

  • (v) 0(ρς)=ς,0(ρς)=ς

  • (vi) 0(ςρ)=ρς,0(ςρ)=ρς

  • (vii) (ρ(ρς))ς=0,(ρ(ρς))ς=0

  • (viii) ρ(ρς)=ς,ρ(ρς)=ς

  • (ix) ρ(ςρ)=ρ,ρ(ςρ)=ρ

  • (x) ς(ςρ)=ρ,ς(ςρ)=ρ

Definition 2.3.

(Ref. 19) Let Σ be a non-void. The mapping n:Σ[0,1] is called the FS of Σ . The complement of n , denoted by nc , is given by nc(ρ)=1n(ρ) for each ρΣ .

Definition 2.4.

(Ref. 2) Let n be the FS in Σ . For a fixed e[0,1] , the set v(n:e)=ne={ρ Σ|n(ρ)e} is the upper level of n . Similarly, ι(n:e)=ne={ρΣ|n(ρ)e} is the lower level of n .

In addition, we can define the upper-strong and lower-strong level subsets of n as follows:

The upper-strong-level subset is v+(n:e)=ne={ρΣ|n(ρ)>e} .

ii. The lower-strong-level subset is ι(n:e)=ne={ρρ|n(ρ)<e} .

Remark 2.5.

(Ref. 19) If e1e2 , then v(n:e2)v(n:e1) and ι(n:e1)ι(n:e2) for every e1,e2[0,1] .

Definition 2.6.

(Ref. 17) A FS n of a nonvoid Σ , with a membership map n:Σ[0,1] , is said to be the supremum property if, for any subset W of Σ , there exists a ρW in which n(ρ)=supwWn(w) .

Definition 2.7.

(Ref. 17) Let h:WZ be a mapping, where W and Z are nonempty subsets of Σ . If n and r are FSs of W and Z , respectively, then the image of n under h , denoted by h(n) , is an FS of Z defined as follows:

h(n)(ς)={{n(ρ)|ρh1(ς)}ifh1(ς),0otherwise
where ςZ . The II of r under h , denoted by h1(r) , is an FS of W defined by h1(r)(ρ)= r(h(ρ)) for every ρW .

Definition 2.8.

(Ref. 19) Let n and r be any two FSs of Σ . Then th statements hereunder hold:

  • 1. nr iff n(ρ)r(ρ) for every ρΣ .

  • 2. n=r iff n(ρ)=r(ρ) for every ρΣ .

  • 3. The product of n and r , denoted (n×r)(ρ,ς) , is given by {n(ρ),r(ς)} for every (ρ,ς)ρ×ς .

  • 4. The intersection of n and r is given by nr={n(ρ),r(ρ)} for every ρΣ .

  • 5. The union of n and r is nr={n(ρ),r(ρ)} for every ρΣ .

Lemma 2.9.

(Ref. 2) Let n be any FS of Σ . Then, the axioms hold for any ,ςΣ :

  • 1. 1{n(ρ),n(ς)}={1n(ρ),1n(ς)} .

  • 2. 1{n(ρ),n(ς)}={1n(ρ),1n(ς)} .

Fuzzy pseudo TM-Subalgebra of pseudo TM-algebra

In this section, we examine the FPTMSAs within PTMAs and explore some fundamental properties of these subalgebras. Unless specified otherwise, Σ and ψ represent the PTMAs throughout this section and the subsequent sections.

Definition 3.1.

An FS n of a PTMA Σ is called an FPTMSA of Σ if the following statements hold.

  • 1. n(ρς){n(ρ),n(ς)} for every ρ,ςΣ .

  • 2. n(ρς){n(ρ),n(ς)} for every ρ,ςΣ .

Example 3.2.

Let Σ={0,g,s,t} be a set equipped with two binary compositions, and , defined in the tables below.

0gst
00000
gg000
sss00
ttss0

0gst
00000
gg000
sss00
tttg0

Thus, (Σ,,,0) forms PTMA. Let n and r be FSs of Σ defined hereunder.

n(ρ)={1,ifρ=0;310,ifρ=t;0.otherwise.andr(ρ)={710,ifρ=012,ifρ=t;0.otherwise.

It is evident that n and r are FPTMSAs of Σ .

Lemma 3.3.

If n is an FPTMSA of Σ , then n(0)n(ρ) , for each ρΣ .

Proof.

Assuming n is an FPTMSA of Σ , we can apply Lemma 2.2 to obtain

n(0)=n(ρρ){n(ρ),n(ρ)}=n(ρ)
and
n(0)=n(ρρ){n(ρ),n(ρ)}=n(ρ)

Therefore, n(0)n(ρ) for each ρΣ .

Theorem 3.4.

Let n be a FPTMSA of Σ . Then n(ρς)=n(ς) iff n(ρ)=n(0) for every ρ,ςΣ .

Proof.

Assume n(ρς)=n(ς) for every ρ,ςΣ . Claim: n(ρ)=n(0) for every ρΣ .

By a PTMA, we have ρ0=0 and ρ0=0 for every ρΣ . Thus

(ρ0)0=ρ0=ρ
and
(ρ0)0=ρ0=ρ

Therefore:

n(ρ)=n((ρ0)0){n(ρ0),n(0)}={n(0),n(0)}=n(0)n(ρ)=n((ρ0)0){n(ρ0),n(0)}={n(0),n(0)}=n(0)

From Lemma 3.3, we also have n(0)n(ρ) . Therefore, n(ρ)=n(0) for each ρΣ .

Conversely, it is assumed n(ρ)=n(0) for every ρΣ . Claim: n(ρς)=n(ς) and n(ρς)=n(ς) .

Using Lemma 3.3, n(0)n(ς) for any ςρ , so n(ρ)n(ς) . Also:

n(ρς){n(ρ),n(ς)}=n(ς)n(ρς){n(ρ),n(ς)}=n(ς)

Additionally:

n(ς)=n(0(ρς)){n(0),n(ρς)}={n(ρ),n(ρς)}=n(ρς)n(ς)=n(0(ρς)){n(0),n(ρς)}={n(x),n(xς)}=n(xς)

Thus, n(xς)=n(ς) and n(xς)=n(ς) .

Theorem 3.5.

If n and r are two FPTMSAs of Σ , then their intersection nr is also a FPTMSA of X .

Proof.

Let n and r be the two FPTMSAs of Σ . Claim: nr is an FPTMSA of Σ .

Consider ρ,ςΣ:(nr)(ρς)={n(ρς),r(ρς)}{{n(ρ),n(ς)},{r(ρ),r(ς)}}={{n(ρ),r(ρ)},{n(ς),r(ς)}} . This implies that (nr)(ρς){(nr)(ρ),(nr)(ς)} .

Similarly, (nr)(ρς)={n(ρς),r(ρς)}{{n(ρ),n(ς)},{r(ρ),r(ς)}}={{n(ρ),r(ρ)},{n(ς),r(ς)}} . Thus, (nr)(ρς){(nr)(ρ),(nr)(ς)} .

Corollary 3.6.

Let {ni|iI} be a family of FPTMSA with Σ . Their intersection iIni is also an FPTMSA of Σ .

Remark 3.7.

The union of the two FPTMSAs of X is not necessarily an FPTMSA of Σ .

Example 3.8.

Let Q be a set of rational numbers. Define two binary operations and on Q as ρς=ρς and xς=ρς for every ρ,ςQ , where – denotes the usual subtraction in Q . Thus, (Q,,,0) is a PTMA.

Let n and r be FSs of Q by:

n(ρ)={910ifρ515otherwise
and
r(ρ)={45ifρ4110otherwise

Clearly, n and r are the FPTMSAs of Q .

Consider the union ( nr ) defined by

(nr)(ρ)={910ifρ545ifρ4\5110otherwise

For ρ=5 and =4 :

(nr)(5)=0.9(nr)(4)=0.8

Then:

(nr)(54)={n(54),r(54)}={0.2,0.1}=0.2
(nr)(54)={n(54),r(54)}={0.2,0.1}=0.2

So:

(nr)(54)=0.2=(nr)(54)

However:

{(nr)(5),(nr)(4)}={0.9,0.8}=0.8

Thus, 0.20.8 , which contradicts the definition of an FPTMSA. This indicates that the union of the two FPTMSAs may not be an FPTMSA of Σ .

Proposition 3.9.

If n is an FPTMSA of Σ , then the following results hold.

  • 1. n(0ρ)n(ρ) and n(0ρ)n(ρ) .

  • 2. If there exists a sequence ρk in Σ such that limkn(ρk)=1 , then n(0)=1 .

Proof.

Suppose that n is an FPTMSA of Σ . Claim: n(0ρ)n(ρ) and n(0ρ)n(ρ) .

  • i. Since n(0ρ){n(0),n(ρ)} . It implies that n(0ρ)n(ρ) and n(0ρ){n(0),n(ρ)}n(0ρ)n(ρ) .

  • ii. Suppose that n is an FPTMSA of Σ . From Lemma 3.3n(0)n(ρ) , for every ρΣ . If ρk is a sequence in Σ , then 1n(0)=n(ρkρn){n(ρk),n(ρk)}=n(ρk) . As k , we have limk1limkn(0)limkn(ρk) .

Hence, n(0)=1 .

Similarly, 1n(0)=n(ρnρn){n(ρk),n(kk)}=n(ρk) . As k . Thus, limk1limkn(0)limkn(ρk) .

Hence, n(0)=1 .

Definition 3.10.

Let v(n:e) be non-void for every e[0,1] . An FS n of a PTMA Σ is called the upper level of n if v(n:e)=ne={ρΣ|n(ρ)e} . Similarly, ι(n:e)=ne={ρΣ| n(ρ)e} is the lower level of n .

Theorem 3.11.

Let n be a FPTMSA of Σ . Then the set Gn={ρΣ|n(ρ)=n(0)} forms a FPTMSA of Σ .

Proof.

Suppose that n is an FPTMSA of Σ . Let ρ,ςGn . Then n(ρ)=n(0)=n(ς) . Now, n(ρς){n(ρ),n(ς)}=n(0) . This implies that n(ρς)n(0) . By Lemma 3.3, n(0)n(ρς) for every ρ,ςΣ . It follows that n(ρς)=n(0) . This implies that ρςGn . Similarly, n(ρς){n(ρ),n(ς)}=n(0) . It implies n(ρς)n(0) . By Lemma 3.3, n(0)n(ρς) for every ρ,ςΣ . It follows that n(ρς)=n(0) . This implies that ρςGn . Hence, Gn is an FPTMSA with Σ .

Theorem 3.12.

An FS n of a PTMA Σ is an FPTMSA iff for every e[0,1] the level set v(n,e) is either empty or a pseudo TM subalgebra of Σ .

Proof.

We assume that n is an FPTMSA of Σ . Claim: The level subset v(n,e) is either empty or PTMA of Σ . Suppose that the level subset v(n,e) . For any ρ,ςv(n,e) we have n(ρ)e and n(ς)e . Then:

n(ρς){n(ρ),n(ς)}{e,e}=eandn(ρς){n(ρ),n(ς)}{e,e}=e

Hence, ρς,ρςv(n,e) . Therefore, v(n,e) represents the PTMSA of Σ .

Conversely, we assume that v(n,e) is a PTMA of Σ . Claim n is the FPTMSA of Σ .

For any ρ,ςΣ . Take e={n(ρ),n(ς)} . Then ρς,ρςv(n,e) which implies that n(ρς)e={n(ρ),n(ς)} and n(ρy)e={n(ρ),n(ς)} .

Hence, ρς,ρςn . Therefore, n is a PTMSA with Σ .

Corollary 3.13.

Let n be a PTMSA of Σ and e[0,1] . If e=1 , then the upper level set v(n,e) is either empty or a PTMSA of Σ .

Theorem 3.14.

Let W be any non-void subset of a PTMA Σ , and let n be an FS of Σ defined by

n(x)={uifρWvifρW
where u,v[0,1] and uv .

Then, n is an FPTMSA of Σ if W is a PTMSA of Σ .

Proof.

We assume that n is an FPTMSA of Σ . Claim: W is PTMSA of Σ .

Let ρ,ςW . Because n is an FPTMSA of Σ , we have

n(ρς){n(ρ),n(ς)}={u,u}=uandn(ρς){n(ρ),n(ς)}={u,u}=u.
Hence, 0, ρ ⋉ ς, ρ ⋊ ς ∈ W.

Hence, W is the FPTMSA of Σ .

Conversely, we assume that n is the PTMA of Σ . Claim n is the FPTMSA of Σ . Consider Case 1. If ρ,ςW , then ρς,ρςW .

n(ρς)=u{n(ρ),n(ς)}andn(ρς)=u{n(ρ),n(ς)}.
Hence, ρς, ρςn.

Case 2. If ρW and ςW , then n(ρ)=u and n(ς)=v .Thus

n(ρς){u,v}={n(ρ),n(ς)}andn(ρς){u,v}={n(ρ),n(y)}.
Hence, ρς, ρςn.

Case 3. If ρW and ςW , then swapping the roles of ρ and ς in case (2) produces similar results.

n(ρς){v,u}={n(ς),n(ρ)}={n(ρ),n(ς)}and n(ρς){v,u}={n(ς),n(ρ)}={n(ς),n(ρ)}.
Hence, ρς, ρςn.

Case 4. If ρW,ςW , then n(ρ)=v and n(ς)=v .Thus

n(ρς){v,v}={n(ρ),n(ς)}andn(ρς){v,v}={n(ρ),n(ς)}.
Hence, ρς, ρςn.

Therefore, for each case, n is the FPTMSA of Σ .

Lemma 3.15.

Any PTMSA of a PTMA Σ can be represented as a level PTMSA of an FPTMSA of Σ .

Proof.

Let n be a PTMSA of a PTMA Σ . For α[0,1] , let n be an FS of Σ defined as:

n(ρ)={α,ifρn0,otherwise

If ρ,ςn , then ρς,ρςn . Then by definition n(x)=n(ς)=n(ρς)=n(ρς)=α .

n(ρς)=α{n(ρ),n(ς)}andn(ρς)=α{n(ρ),n(ς)}.
Hence, ρ ⋉ ς, ρ ⋊ ς ∈ n.

Similarly, if ρ,ςn , then n(ρ)=n(ς)=0 .

n(ρς)=0{n(ρ),n(ς)}andn(ρς)=0{n(ρ),n(ς)}
Hence, ρ ⋉ ς, ρ ⋊ ς ∈ n.

If at most one of ρ,ςn , then n(ρ) or n(ς) is equal to 0.

n(ρς)=0{n(ρ),n(ς)}andn(ρς)=0{n(ρ),n(ς)}.
Hence, ρ ⋉ ς, ρ ⋊ ς ∈ n.

This indicates that W is the PTMSA level of Σ , corresponding to an FPTMSA of Σ .

Corollary 3.16.

Let W be a subset of a PTMA Σ . Characteristic mapping is defined as

χW(ρ)={1ifρW0ifρW
is a FPTMSA of Σ iff W is a PTMSA of Σ .

Homomorphism on fuzzy pseudo TM-subalgebras

In this section, we explore FPTMSAs within a PTMA under homomorphic conditions. We examined the HI and II of FPTMSAs in a PTMA. In addition, we discuss the composition of two epimorphic images and inverse images of FPTMSAs, along with other related results.

Definition 4.1.

Let (Σ;ρ,ρ,0ρ) and (ψ;ς,ς,0ς) be two pseudo-TMAs. A mapping h:Σψ is called PTMH if h(ρς)=h(ρ)h(ς) and h(ρς)=h(ρ)h(ς) for every ρ,ςΣ .

Note that if h:Σψ is a pseudo-TM homomorphism, then h(0Σ)=0r where 0Σ and 0r are zero constant elements of Σ and ψ respectively.

Theorem 4.2.

Let (Σ;ρ,ρ,0ρ) and (ψ;ς,ς,0ς) be two PTMAs. Let h:Σψ be the epimorphism of the PTMAs. If n is an FPTMSA of Σ with the sup-property, then h(n) is an FPTMSA of r .

Theorem 4.3.

Let(Σ;ρ,ρ,0ρ) and (r;ς,ς,0ς) be two PTMAs. Let h:Σψ be an epimorphism of a PTMA. If r is an FPTMSA of ψ , then h1(r) is an FPTMSA of Σ .

Proof.

We assumed that r is an FPTMSA of ψ . Claim: h1(r) is the FPTMSA of Σ . For any ρ,ςΣ , we have: h1(r(ρρς))=r(h(ρρς))=r(h(ρ)ςh(ς)){r(h(ρ)),r(h(ς))}= {h1(r)(ρ),h1(r)(ς)} . Similarly, f1(r(ρρς))=r(h(ρρς))=r(h(ρ)ςh(ς)){r(h(ρ)),r(h(ς))}= {h1(r)(ρ),h1(r)(ς)}

Therefore, h1(r) is a FPTMSA of Σ .

Lemma 4.4.

Let h:Σψ be an epimorphism and r be an FS in ψ . If h1(r) is an FPTMSA of Σ , then r must be an FPTMSA of r .

Definition 4.5.

Let h:Σψ be the homomorphism of the PTMAs. Then, for any FS n in ψ,nh in Σ by nh(ρ)=n(h(ρ)) for all ρΣ is called the epimorphism of a PTMA Σ .

Theorem 4.6.

Let h:Σψ be an epimorphism of a PTMA.Then the FS n is an FPTMSA of ψ iff nh is an FPTMSA of Σ .

Proposition 4.7.

Let h:Σψ and g:ψZ be the epimorphism of a PTMAs, and r be an FPTMSA. Then, (goh)1(r) is an FPTMSA of Σ iff (goh)(r) is an FPTMSA of Z , assuming that the sup-property holds.

Cartesian product of fuzzy pseudo TM-subalgebra

In this section, we explore the concept of CP in relation to the level subsets of FPTMSA. We demonstrate that the CP of two FPTMSA yields another FPTMSA and investigate additional related results.

Definition 5.1.

Suppose Σ and ψ are PTMAs, with n1 as an FPTMSA of Σ and n2 as an FPTMSA of ψ . The CP of n1 and n2 , denoted as n1×n2 , is defined by

(n1×n2)((ρ1,ρ2)(ς1,ς2))={n1(ρ1ς1),n2(ρ2ς2)}
and
(n1×n2)((ρ1,ρ2)(ς1,ς2))={n1(ρ1ς1),n2(ρ2ς2)}
for all (ρ1,ρ2) and (ς1,ς2)Σ×ψ .

Lemma 5.2.

Let n1 and n2 any two FPTMSA of Σ and ψ respectively. Then (n1×n2)(0,0) (n1×n2)(ρ,ς) , for all (ρ,ς)Σ×ψ .

Proof.

For every (ρ,ς)Σ×ψ .

(n1×n2)(0,0)=(n1×n2)(ρρ,ςς)={n1(ρρ),n2(ςς)}{{n1(ρ),n1(ρ)},{n2(ς),n2(ς)}}={n1(ρ),n2(ς)}=(n1×n2)(ρ,ς)and(n1×n2)(0,0)=(n1×n2)(ρρ,ςς)={n1(ρρ),n2(ςς)}{{n1(ρ),n1(ρ)},{n2(ς),n2(ς)}}={n1(ρ),n2(ς)}=(n1×n2)(ρ,ς)

Hence, (n1×n2)(0,0)(n1×n2)(ρ,ς) , for all (ρ,ς)Σ×ψ .

Theorem 5.3.

If n1 and n2 are FPTMSA of Σ and ψ respectively, then the FS(n)=n1×n2 defined on Σ×ψ is a FPTMSA of Σ×ψ .

Proof.

Assume that n1 and n2 be a FPTMSA of Σ and ψ respectively. For any (ρ1,ρ2) and (ς1,ς2)Σ×r .

n((ρ1,ρ2)(ς1,ς2))=n(ρ1ς1,ρ2ς2)=(n1×n2)(ρ1ς1,ρ2ς2)={n1(x1ς1),n2(ρ2ς2))}{{n1(ρ1),n1(ς1)},{n2(ρ2),n2(ς2)}}={{n1(ρ1),n2(ρ2)},{n1(ς1),n2(ς2)}}={(n1×n2)(ρ1,ρ2),(n1×n2)(ς1,ς2)}={n(ρ1,ρ2),n(ς1,ς2)}andn((ρ1,ρ2)(ς1,ς2))=n(ρ1ς1,ρ2ς2)=(n1×n2)(ρ1ς1,ρ2ς2)={n1(ρ1ς1),n2(ρ2ς2)}{{n1(ρ1),n1(ς1)},{n2(ρ2),n2(ς2)}}={{n1(ρ1),n2(ρ2)},{n1(ς1),n2(ς2)}}={(n1×n2)(x1,x2),(n1×n2)(ς1,ς2)}={n(ρ1,ρ2),n(ς1,ς2)}

Definition 5.4.

Let n1 and n2 be the two FS of Σ and ψ respectively. For any e[0,1] the set v(n1×n2,t)={(ρ,ς)Σ×r/(n1×n2)(ρ,ς)e} is called the upper-level subset of n1×n2 .

Theorem 5.5.

Let n1 and n2 be the FSs of Σ and r , respectively. The CPn1×n2 forms an FPTMSA of Σ×ψ iff the nonvoid upper e-level set v(n1×n2,e) is an FPTMSA of Σ×ψ .

Conclusion

In this article, we introduce the concept of FSs applied to PTMSAs within PTMAs. We define the idea of an FPTMSA of a PTMA and explore the various results. The characterization of an FPTMSA is provided through its level subsets in PTMA. We investigated several properties of FPTMSAs with homomorphisms and CPs. The HIs and preimages of FPTMSA of a PTMA were examined, and the CP of two FPTMSA was studied, yielding related results. Additionally, we characterized CPs of FPTMSA in their level sets.

In future work, we plan to extend these concepts to the fuzzy pseudo-ideals of a PTMA, aiming to achieve new results.

Ethics and consent

Ethical approval and consent were not required.

Comments on this article Comments (0)

Version 1
VERSION 1 PUBLISHED 06 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
Melaku AG, Alaba BA, Bitew BT and Derseh BL. Fuzzy PTM subalgebra of PTM - algebra [version 1; peer review: 1 approved with reservations]. F1000Research 2025, 14:32 (https://doi.org/10.12688/f1000research.160239.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 06 Jan 2025
Views
12
Cite
Reviewer Report 27 Feb 2025
Munusamy Premkumar, Sathyabama Institute of Science and Technology, Chennai, Tamil Nadu, India 
Approved with Reservations
VIEWS 12
Reviewer’s Recommendation:  Accept with Minor Revisions
1. General Comments
The author's work is highly valuable and contributes significantly to the field. I recommend acceptance of the paper after addressing the following minor revisions to improve clarity, readability, and ... Continue reading
CITE
CITE
HOW TO CITE THIS REPORT
Premkumar M. Reviewer Report For: Fuzzy PTM subalgebra of PTM - algebra [version 1; peer review: 1 approved with reservations]. F1000Research 2025, 14:32 (https://doi.org/10.5256/f1000research.176100.r366638)
NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article.
  • Author Response 28 Feb 2025
    Alemayehu Girum Melaku, Bahir Dar University Department of Mathematics, Bahir Dar, Ethiopia
    28 Feb 2025
    Author Response
    This article explains a significant advancement in the field of algebraic structures by introducing the concept of fuzzy pseudo-TM subalgebra (FPTMSA) within pseudo-TM algebra (PTMA). The importance of this work ... Continue reading
COMMENTS ON THIS REPORT
  • Author Response 28 Feb 2025
    Alemayehu Girum Melaku, Bahir Dar University Department of Mathematics, Bahir Dar, Ethiopia
    28 Feb 2025
    Author Response
    This article explains a significant advancement in the field of algebraic structures by introducing the concept of fuzzy pseudo-TM subalgebra (FPTMSA) within pseudo-TM algebra (PTMA). The importance of this work ... Continue reading

Comments on this article Comments (0)

Version 1
VERSION 1 PUBLISHED 06 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.