open access

Journal of Mathematics, Physics and Mechanics

Rough JU-Algebras in Quantales Via Core Successor Classes Based on Fuzzy Relations
Research Article - Volume: 1, Issue: 1 , 2026(September)

Muhammad Yousaf1*Chadaphorn Kodsueb2

1Department of Mathematics, Government College University, Faisalabad, Pakistan
2School of Mathematical Sciences and Geoinformatics, Institute of Science, Suranaree University of Technology, Nakhon Ratchasima, Thailand

*Correspondence to: Muhammad Yousaf, 1Department of Mathematics, Government College University, Faisalabad, Pakistan, E-mail:

Received: July 25, 2026; Manuscript No: JMPM-26-1420; Editor Assigned: July 28, 2026; PreQc No: JMPM-26-1420 (PQ); Reviewed: July 31, 2026; Revised: August 06, 2026; Manuscript No: JMPM-26-1420 (R); Published: September 21, 2026

ABSTRACT

Fuzzy sets (FSs), rough sets (RSs), quantales, and core successor classes (CSCs) are mathematical tools that are applicable in real-world situations with imprecise and ambiguous data. In this research, we propose the novel idea of RSs on -algebra in quantales that are based on CSCs under fuzzy relations (FRs). The following article contains a notion that has never been introduced before. This merges the -algebras and RSs in quantales to provide a new approach for reducing uncertainty in various fields. We develop a mathematical model for approximate substructures on -algebras via CSCs, based on which options can be evaluated in a situation where the information is imprecise. The proposed approach is a recommended technique for coping with ambiguity and uncertainty in multiple fields. Applications in different fields are described, and theoretical foundations of rough -algebras are explored. Our findings demonstrate the effectiveness of the suggested strategy in handling ambiguity.

Keywords: Rough sets, Fuzzy Sets, Algebra, Quantales, Core Successor Classes.

INTRODUCTION

Background and Context

Pawlak tackled uncertain knowledge in the fields of AI information systems, and cognitive sciences in areas including ML, knowledge acquisition, and decision analysis at the start of the 1980s, among others, by utilizing the concept of RSs and its approximations (LAs and UAs) spaces in his papers [1-5]. The relationship between RSs and algebraic systems (structures) was formed via investigation and creativity. As a result, several concepts were introduced by various authors.

AcronymsRepresentationAcronymsRepresentation
โŠ› Binary operationCPFRCompatible preorder fuzzy relation
UAUpper ApproximationRSsRough sets
LALower ApproximationRSTRough set theory
FRFuzzy relationCFRComplete fuzzy relation
SCsSuccessor classesSFRSerial fuzzy relation
CSCsCore successor classesDMDecision-Making
Table 1: List of Acronyms

Numerous arbitrary binary relations, motivated by Pawlak's rough set and induced by an equivalence relation, have been used to study vast concepts. ๐‘† ๐‘ ๐œ‹ ( ๐‘ฅ ) = { ๐‘ฅ โ€ฒ โˆˆ ๐‘‹ : ( ๐‘ฅ , ๐‘ฅ โ€ฒ ) โˆˆ ๐œ‹ } indicates a successor neighborhood of u produced by a binary relation on a universal set U in which u is an element of U. Yao, suggested roughness models based on binary-induced successor neighborhoods [6]. A framework based on binary relations was given for analyzing neighborhood systems and RS approximations, and he explored the features of neighborhood and approximation operators and their relationships. If u is an element in X, then ๐‘† ๐ถ ๐‘ ๐œ‹ ( ๐‘ฅ ) = { ๐‘ฅ โ€ฒ โˆˆ ๐‘‹ : ๐‘† ๐‘ ๐œ‹ ( ๐‘ฅ ) = ๐‘† ๐‘ ๐œ‹ ( ๐‘ฅ ) } denotes the core successor neighborhood generated by a binary relation on a universal set X. RSs were proposed as core successor neighborhoods resulting from binary relations by Mareay [7]. If the property of being an equivalence relation is present in a binary relation on a universal set, then Mareay's RSs and Yao's RSs are extensions of Pawlak's RSs.

In what may be regarded as the notion of roughness in classical algebras, Kuroki, presented roughness in semigroups and its ideals [8]. The concept of rough groups and rough subgroups was later established by Biswas and Nanda [9]. Li and Yin, proposed ฯ‘ - L A and T-UA fuzzy rough approximation operators on a semigroup, whereas Qi and Liu, investigated the ideas of rough approximation in Boolean algebras [10-11]. It was Davvaz, who first proposed the idea of roughness in rings [12].

Rough set theory (RST) was studied by Ameri, in relation to hyper BCK-algebras and by Dudek, in relation to hyper BCI-algebras [13-14]. Roughness concepts in BCC algebras have also been studied by Jun [15]. The origin of FSs goes back to 1965, when they were first developed by Zadeh [16]. Since then, it has been the subject of numerous studies by many authors in several scientific, technical, and engineering fields. Fuzziness, and forms of logical algebras are recent developments and topics of interest for many writers and researchers [17-20].

A number of authors are among them. In recent years, Rough fuzzy ideals in BCK/BCI algebras were investigated by Ahn, and others. Understanding the many kinds and orientations of applied algebras has been largely based on logical and classical algebras [21]. This is particularly true for artificial intelligence related computer systems that simulate how a person would handle the certainty and uncertainty of information using logical approaches [22]. Using these notions to tackle challenges is made easy by these tactics. BCI/BCK algebras and BL-algebras are two important categories of fundamental logical algebras [23].

Perfect BL-algebras, local BL-algebras, SBL-algebras, and all of its variations have been the subject of several investigations. Whether or not they have hyperstructures, these ideas relate to roughness and softness in an intriguing way. Impan introduced the roughness notion lately, and it has been used to UA-algebras [24]. UA-algebras are subject to a number of traditional theorems from RST, and related findings have been analyzed using this idea. A UA-algebra's rough ideal characteristics have been demonstrated using lower approximations (LAs) and upper approximations (UAs). It is demonstrated that a strong UA-ideal is once again a strong ideal in terms of a UA- algebra's UAs and Las.

Motivation and Research Gap

The motivation for this study is to link the fuzzy relational uncertainty with algebraic roughness closer. The RSs approach is successfully applied in various algebraic systems, but the FR induced CSCs and JU-algebraic systems have not been systematically studied.

The primary research gaps, as identified in this study are:

Approximation to the JU-Algebra Using the CSC Approach

The present research deals with the problem of constructing rough JU-substructures and analyzing their algebraic attributes of CSCs based on FRs and its RS approaches, which were developed for a few logical algebras.

Preservation Of JU-Algebraic Structures

It is not sufficient to define lower and upper approximations on a JU-algebra. It also needs to be determined whether they are compatible with the algebraic operation. Thus, the aim of this study is to investigate the preservation of JU-subalgebras, JU-ideals, weak JU-ideals and strong JU-ideals under the proposed approximations.

Approximation by Fuzzy Relations and Dual-Universe

Fuzzy relationships allow to directly address the consideration of uncertain relationships between the two universes in the approximation process. CSCs give the corresponding information granules to build the lower and upper approximations.

Extension to Quantales

The framework is then extended to quantales, to see if the algebraic structure proposed above is compatible with a richer complete-lattice based algebraic structure. The quantale extension is concerned with rough JU-ideals, weak JU-ideals and strong JU-ideals.

For that reason, the main research question of this paper is:

Under what conditions do FR induced CSC-based lower and upper approximations preserve important JU-algebraic structures, and how can this framework be extended to quantales?

This question is different from transferring an already known rough-set definition to another algebraic structure. Rather, the mathematical relationships and interactions between fuzzy relational granulation, the CSC-based approximation operators and the algebraic preservation properties are emphasized.

Key Contributions

Our novel contributions are:

CSC-Based Fuzzy Rough Approximations: We use the CSCs induced by FRs to build the lower and upper approximations, instead of classical equivalence relations.

Interaction with JU-Structures: We investigate that these approximations preserve JU- subalgebras, JU-ideals, weak JU-ideals and strong JU-ideals.

Extension to Quantales: The framework is extended to quantales and results on rough JU- ideals and variants are given.

Dual-Universe Fuzzy Relational Model: The model includes fuzzy relations and CSCs in order to represent the uncertainty existing between two related universes.

New Structural Preservation Results: New results on interaction between CSC-based approximations and algebraic operations and ideal structures.

Summary of The Work

This is a summary of the paper organization. The preliminary result and some of the basic definitions necessary for the subsequent analysis are given in Materials and Methods. The principal theoretical results are extended to quantales, the development of the CSC-based rough JU-substructures under fuzzy relations is carried out in Results. 4. Comparative analysis and Discussion, discusses how the proposed framework compares with the current approaches. Finally, the paper ends with Conclusion that summarizes the findings and provides some directions for future research.

MATERIAL AND METHODS

JU-algebras, JU-subalgebras, and JU-ideals are some of the fundamental definitions that will be covered in this part, along with some associated fundamental findings and examples. These discoveries will support our efforts.

Definition 2.1

When any ๐”ž , ๐”Ÿ , ๐”  โˆˆ ๐’ณ , fulfill the following identities, ๐• ๐•Œ - algebra is defined as an algebra ( X , โŠ› , โŠบ ) with a single binary operation [25] โŠ› .

( ๐•๐•Œ 1 ) ( ๐”Ÿ โŠ› ๐”  ) [ ( ๐”  โŠ› ๐”ž ) โŠ› ( ๐”Ÿ โŠ› ๐”ž ) ] = โŠบ ,

( ๐•๐•Œ 2 ) โŠบ โŠ› ๐”ž = ๐”ž ,

( ๐•๐•Œ 3 ) ๐”ž โŠ› ๐”Ÿ = ๐”Ÿ โŠ› ๐”ž = โŠบ โ‡’ ๐”ž = ๐”Ÿ .

The fixed element of ๐’ณ is the constant โŠบ . For convenience, we express a ๐• ๐•Œ - algebra by writing ๐’ณ rather than ( ๐’ณ , โŠ› , โŠบ ) .

Example 2.1: .In the case of ๐’ณ = { 0 , ๐”ž , ๐”Ÿ , ๐”  , ๐”ก } , where โŠ› is established by the subsequent in Table 2 [25].

๐’ณ defines a binary operation
โŠ› .
โŠ› 0 ๐”ž ๐”Ÿ ๐”  ๐”ก
0 0 ๐”ž ๐”Ÿ ๐”  ๐”ก
๐”ž 0 0 ๐”Ÿ ๐”  ๐”ก
๐”Ÿ 0 ๐”ž 0 ๐”  ๐” 
๐”  0 0 ๐”Ÿ 0 ๐”Ÿ
๐”ก 0 0 0 0 0
Table 2: The set

The fact that ๐’ณ is ๐• ๐•Œ - algebra is obvious.

Definition 2.2 [26]

Fuzzy set (FS) of ๐’ณ is the mapping ๐œ‚ : ๐’ณ โ†’ [ 0 , 1 ] when ๐’ณ is a nonempty universal set.

Definition 2.3 [16]

Fuzzy relation (FR) from ๐’ณ to ๐’ด is defined as mapping ๐œ‚ : ๐’ณ ร— ๐’ด โ†’ [ 0 , 1 ] given two nonempty universal sets ๐’ณ and ๐’ด . A mapping on ๐’ณ is termed FR if it is ๐œ‚ : ๐’ณ ร— ๐’ณ โ†’ [ 0 , 1 ] . An FR represented as a matrix is represented by

( ฮท 1 1 ฮท 1 2 โ‹ฏ ฮท 1 m ฮท 2 1 ฮท 2 2 โ‹ฏ ฮท 2 m โ‹ฎ โ‹ฎ โ‹ฑ โ‹ฎ ฮท n 1 ฮท n 2 โ‹ฏ ฮท n m )

Definition 2.4 [26]

Assume that ๐œ‚ represents a FR between ๐’ณ to ๐’ด . If ๐”Ÿ is in ๐’ณ and for every ๐”ž in ๐’ด , ๐œ‚ ( ๐”Ÿ , ๐”ž ) = 1 then ๐œ‚ is serial FR (SFR).

Definition 2.5 [26]

Let ๐œ‚ be a FR on ๐’ณ , then:

1.It is said to be a reflexive FR if ๐œ‚ ( ๐”Ÿ , ๐”Ÿ ) = 1 , โˆ€ q โˆˆ ๐’ณ ;

2.It is said to as a symmetric FR if ๐œ‚ ( ๐”Ÿ 1 , ๐”Ÿ 2 ) = ๐œ‚ ( ๐”Ÿ 2 , ๐”Ÿ 1 ) , โˆ€ ๐”Ÿ 1 , ๐”Ÿ 2 โˆˆ ๐’ณ ;

3.Transitive FR if ๐œ‚ ( ๐”Ÿ 1 , ๐”Ÿ 2 ) โ‰ฅ โˆจ ๐”Ÿ 3 โˆˆ ๐’ณ ( ๐œ‚ ( ๐”Ÿ 1 , ๐”Ÿ 3 ) โˆง ๐œ‚ ( ๐”Ÿ 3 , ๐”Ÿ 2 ) ) โˆ€ ๐”Ÿ 1 , ๐”Ÿ 2 โˆˆ ๐’ณ .

Definition 2.6 [26]

๐œ‚ is referred to as similarity FR if it is reflexive, symmetric, and transitive FR.

Definition 2.7 [25]

If ๐”ž โŠ› ๐”Ÿ โˆˆ ๐’ฎ , โˆ€ ๐”ž , ๐”Ÿ โˆˆ ๐’ฎ , then ๐’ฎ โІ ๐’ณ is ๐• ๐•Œ - subalgebra of ๐’ณ .

Definition 2.8 [25]

If ฯ• โ‰  โ„ โІ ๐’ณ fulfills the following specifications, it is referred to as the ๐• ๐•Œ - ideal of ๐’ณ :

(1) 0 โˆˆโ„,

( 2 ) ๐”ž โŠ› ( ๐”Ÿ โŠ› ๐”  ) โˆˆ โ„ , ๐”Ÿ โˆˆ โ„ โ‡’ ๐”ž โŠ› ๐”  โˆˆ โ„ , โˆ€ ๐”ž , ๐”Ÿ , ๐”  โˆˆ ๐’ณ .

Example 2.2: [6] The 3 that follows defines ๐’ณ = { 0 , ๐”ž , ๐”Ÿ , ๐”  , ๐”ก , ๐”ข } and โŠ› .

โŠ› 0 ๐”ž ๐”Ÿ ๐”  ๐”ก ๐”ข
0 0 ๐”ž ๐”Ÿ ๐”  ๐”ก ๐”ข
๐”ž 0 0 ๐”Ÿ ๐”Ÿ ๐”ก ๐”ข
๐”Ÿ 0 0 0 ๐”ž ๐”ก ๐”ข
๐”  0 0 0 0 ๐”ก ๐”ข
๐”ก 0 0 0 ๐”ž 0 ๐”ข
๐”ข 0 0 0 0 0 0
Table 3: The set ๐’ณ defines a binary operation โŠ› .

It is obvious that ( ๐’ณ , โŠ› , โŠบ ) is a ๐• ๐•Œ - algebra. It is easy to demonstrate that ๐”„ = { 0 , ๐”ž } and ๐”™ = { 0 , ๐”ž , ๐”Ÿ , ๐”  , ๐”ก } are ๐• ๐•Œ - ideals of ๐’ณ .

Definition 2.9 [25]

Given a ๐• ๐•Œ - algebra ๐’ณ and 0 โˆˆ โ„ , let ฯ• โ‰  โ„ โІ ๐’ณ .

Then

โ„ is said to be a weak ๐• ๐•Œ - ideal of ๐’ณ if ๐”Ÿ โŠ› ๐”ž โˆˆ โ„ and ๐”Ÿ โˆˆ โ„ โ‡’ ๐”ž โˆˆ โ„ , โˆ€ ๐”ž , ๐”Ÿ โˆˆ ๐’ณ ;

If ๐”Ÿ โŠ› ๐”ž โˆฉ โ„ โ‰  ฯ• and ๐”Ÿ โˆˆ โ„ โ‡’ ๐”ž โˆˆ โ„ , โˆ€ ๐”ž , ๐”Ÿ โˆˆ ๐’ณ , then โ„ is said to be a strong ๐• ๐•Œ - ideal of ๐’ณ .

Definition 2.10 [27]

Let ฯ‚ be in the interval [0,1] and ๐œ‚ be a FR from ๐’ด to ๐’ณ , then for each ๐”Ÿ in ๐’ด :

๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) : = { ๐”ž โˆˆ ๐’ณ : ฮท ( ๐”Ÿ , ๐”ž ) โ‰ฅ ฯ‚ } (1)

It is known that a successor class (SC) of ๐”Ÿ related to ฯ‚ - level under ฮท .

Definition 2.11 [27]

Assume ฯ‚ โˆˆ [ 0 , 1 ] and that ๐œ‚ is a FR from ๐’ด to ๐’ณ , then for ๐”Ÿ 1 โˆˆ ๐’ด : ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ 1 ; ฯ‚ ) : = { ๐”Ÿ 2 โˆˆ ๐’ด : ๐‘† ๐ถ ฮท ( ๐”Ÿ 1 ; ฯ‚ ) = ๐‘† ๐ถ ฮท ( ๐”Ÿ 2 ; ฯ‚ ) } (2)

is referred to as a core successor class (CSC) of ๐”Ÿ 1 associated with ฯ‚ - level under ๐œ‚ . For any ๐”Ÿ in ๐’ด ,

we represent the collection of ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) by ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) .

Proposition 2.1

Let ฯ‚ be in the interval [0,1] and ฮท be a FR from ๐’ด to ๐’ณ .

Then the properties listed below holds:

๐”Ÿ โˆˆ ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) for all ๐”Ÿ โˆˆ ๐’ด

For all ๐”Ÿ 1 , ๐”Ÿ 2 โˆˆ ๐’ด , ๐”Ÿ 2 โˆˆ ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ 1 ; ฯ‚ ) โ‡” ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ 1 ; ฯ‚ ) = ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ 2 ; ฯ‚ ) .

Definition 2.12 [27]

Let ฯ‚ be in the interval [0,1] and ฮท be a FR from ๐’ด to ๐’ณ . A triple ( ๐’ด , ๐’ณ , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) is referred to as an approximation space (AS) based on ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) . If ๐’ด = ๐’ณ , then ( ๐’ด , ๐’ณ , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) can be written as ( ๐’ด , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) .

Definition 2.13 [28]

Let ( ๐’ด , ๐’ณ , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) be an ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - AS and โˆ… โ‰  ๐’ฎ โІ ๐’ด , then we define UA of ๐’ฎ in ( ๐’ด , ๐’ณ , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) as:

ฮท ยฏ ( ๐’ฎ ; ฯ‚ ) โ‰” { ๐”Ÿ โˆˆ ๐’ด : ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) โˆฉ ๐’ฎ โ‰  โˆ… } , (3)

and L A o f ๐’ฎ i n ( ๐’ด , ๐’ณ , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) a s :

ฮท _ ( ๐’ฎ ; ฯ‚ ) โ‰” { ๐”Ÿ โˆˆ ๐’ด : ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) โІ ๐’ฎ } , (4)

If ฮท ยฏ ( ๐’ฎ ; ฯ‚ ) โ‰  ฮท _ ( ๐’ฎ ; ฯ‚ ) , Then ฮท ๐‘… ( ๐’ฎ ; ฯ‚ ) โ‰” ( ฮท ยฏ ( ๐’ฎ ; ฯ‚ ) , ฮท _ ( ๐’ฎ ; ฯ‚ ) ) is known as a rough substructure of ๐’ฎ

i n ( ๐’ด , ๐’ณ , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) .

Definition 2.14 [29]

Let ( ๐’ด , ๐’ณ , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) be an ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - AS and โˆ… โ‰  ๐’ฎ โІ ๐’ด . ฮท ยฏ ( ๐’ฎ ; ฯ‚ ) is called a nonempty ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - U A of ๐’ฎ in ( ๐’ด , ๐’ณ , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) if ฮท ยฏ ( ๐’ฎ ; ฯ‚ ) is nonempty subset of ๐’ด .

ฮท _ ( ๐’ฎ ; ฯ‚ ) is called a nonempty ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - L A of ๐’ฎ in ( ๐’ด , ๐’ณ , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) if ฮท _ ( ๐’ฎ ; ฯ‚ ) is nonempty

subset of ๐’ด . ฮท ๐‘… ( ๐’ฎ ; ฯ‚ ) is referred to as a nonempty ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - rough set in ( ๐’ด , ๐’ณ , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) if ฮท ยฏ ( ๐’ฎ ; ฯ‚ ) is a nonempty ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - U A and ฮท _ ( ๐’ฎ ; ฯ‚ ) is a nonempty ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - L A .

Definition 2.15 [30]

We define FR ฮท on ๐’ด . Then ฮท is said to be compatible if โˆ€ ๐”Ÿ 1 , ๐”Ÿ 2 , ๐”Ÿ 3 , ๐”Ÿ 4 โˆˆ ๐’ด , we have

๐œ‚ ( ๐”Ÿ 1 โŠ› ๐”Ÿ 3 , ๐”Ÿ 2 โŠ› ๐”Ÿ 4 ) โ‰ฅ ๐œ‚ ( ๐”Ÿ 1 , ๐”Ÿ 2 ) โˆง ๐œ‚ ( ๐‘ž 3 , ๐‘ž 4 ) (5)

Definition 2.16 [31]

Let ฮท be a FR on ๐’ด . If ฮท is reflexive, transitive and compatible then ฮท is called a compatible preorder FR (CPFR). If ฮท is a CPFR then ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - AS ( ๐’ด , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) is called an ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - AS of CPFR.

Definition 2.17 [32]

Assume that a nonempty set โ„š ฬ‡ ๐“‰ is a complete lattice and that a binary operation โŠ› satisfies the assertion that โˆ€ ๐”ต , ๐”ต j โˆˆ โ„š ฬ‡ ๐“‰ :

๐”ต โŠ› ( โ‹ ๐‘— โˆˆ ๐ฝ ๐”ต ๐‘— ) = โ‹ ๐‘— โˆˆ ๐ฝ ( ๐”ต โŠ› ๐”ต ๐‘— ) ,

( โ‹ ๐‘— โˆˆ ๐ฝ ๐”ต ๐‘— ) โŠ› ๐”ต = โ‹ ๐‘— โˆˆ ๐ฝ ( ๐”ต ๐‘— โŠ› ๐”ต ) .

It is then known as quantale. Suppose that ๐’ฎ j , ๐’ฎ , ๐’ฏ โІ โ„š ฬ‡ ๐“‰ Following that, we define binary operations and arbitrary joins as

๐’ฎ โˆจ ๐’ฏ = { ๐”ต 1 โˆจ ๐”ต | ๐”ต 1 โˆˆ ๐’ฎ , ๐”ต 2 โˆˆ ๐’ฏ } , (6)

๐’ฎ โŠ› ๐’ฏ = { ๐”ต 1 โŠ› ๐”ต 2 | ๐”ต 1 โˆˆ ๐’ฎ , ๐”ต 2 โˆˆ ๐’ฏ } , (7)

โ‹ ๐‘— โˆˆ ๐ฝ ๐’ฎ ๐‘— = { โ‹ ๐‘— โˆˆ ๐ฝ ๐”ต ๐‘— | ๐”ต ๐‘— โˆˆ ๐’ฎ ๐‘— } . (8)

RESULTS

This section will cover the fundamental characteristics of JU-algebra and associated findings. The findings of JU-algebra, JU-subalgebra, JU-ideal, JU-weak ideal, and JU-strong ideal with respect to the CSCs associated with ฯ‚ - level under FRs have been examined. Furthermore, this section will cover the fundamental characteristics of JU-ideals in quantales and associated findings.

Proposition 3.1

Let ( ๐’ด , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) be an ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - AS of CPFR. Then for all ๐”Ÿ 1 , ๐”Ÿ 2 โˆˆ ๐’ด , we have

๐’ž ๐’ฎ ๐’ž ฮท ( b 1 ; ฯ‚ ) โŠ› ๐’ž ๐’ฎ ๐’ž ฮท ( b 2 ; ฯ‚ ) โІ ๐’ž ๐’ฎ ๐’ž ฮท ( b 1 โŠ› b 2 ; ฯ‚ ) (9)

Example 3.1 Let the following Table 4 define ๐• ๐•Œ - subalgebra on โŠ› as ๐’ณ = { 0 , ๐”ž , ๐”Ÿ , ๐”  , ๐”ก , ๐”ข } .

โŠ› 0 ๐”ž ๐”Ÿ ๐”  ๐”ก ๐”ข
0 0 ๐”ž ๐”Ÿ ๐”  ๐”ก ๐”ข
๐”ž 0 0 ๐”Ÿ ๐”Ÿ ๐”ก ๐”ข
๐”Ÿ 0 0 0 ๐”ž ๐”ก ๐”ข
๐”  0 0 0 0 ๐”ก ๐”ข
๐”ก 0 0 0 ๐”ž 0 ๐”ข
๐”ข 0 0 0 0 0 0
Table 4: On the set ๐’ณ , a binary operation โŠ› is defined.

For every two components in ๐’ด , define the membership grades of their connection under ฮท on ๐’ด has the following relations:

( 1 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 0 1 0 0 0 0 1 0 1 0 0 0 0 0 0 1 )

ฮท is obviously compatible. The SCs of each element in ๐’ด associated with 0.6 under ฮท for ฯ‚ = 0 . 6 are:

๐‘† ๐ถ ฮท ( 0 ; 0 . 6 ) = { 0 } ,

๐‘† ๐ถ ฮท ( ๐”ž ; 0 . 6 ) = { ๐”Ÿ , ๐”ก } ,

๐‘† ๐ถ ฮท ( ๐”Ÿ ; 0 . 6 ) = { ๐”Ÿ , ๐”ก } ,

๐‘† ๐ถ ฮท ( ๐”  ; 0 . 6 ) = { ๐”  } ,

๐‘† ๐ถ ฮท ( ๐”ก ; 0 . 6 ) = { ๐”Ÿ , ๐”ก } and

๐‘† ๐ถ ฮท ( ๐”ข ; 0 . 6 ) = { ๐”ข } .

Therefore, each element CSCs in ๐’ด that is connected to the 0.6 level under ฮท are:

๐ถ ๐‘† ๐ถ ฮท ( 0 ; 0 . 6 ) = { 0 } ,

C ๐‘† ๐ถ ฮท ( ๐”ž ; 0 . 6 ) = { ๐”ž , ๐”Ÿ , ๐”ก } ,

C ๐‘† ๐ถ ฮท ( ๐”Ÿ ; 0 . 6 ) = { ๐”ž , ๐”Ÿ , ๐”ก } ,

๐ถ ๐‘† ๐ถ ฮท ( ๐”  ; 0 . 6 ) = { ๐”  } ,

C ๐‘† ๐ถ ฮท ( ๐”ก ; 0 . 6 ) = { ๐”ž , ๐”Ÿ , ๐”ก } and

๐ถ ๐‘† ๐ถ ฮท ( ๐”ข ; 0 . 6 ) = { ๐”ข } .

Here, it is simple to confirm that โˆ€ ๐”Ÿ 1 , ๐”Ÿ 2 โˆˆ ๐’ด ,

๐’ž ๐’ฎ ๐’ž ฮท ( b 1 ; ฯ‚ ) โŠ› ๐’ž ๐’ฎ ๐’ž ฮท ( b 2 ; ฯ‚ ) โІ ๐’ž ๐’ฎ ๐’ž ฮท ( b 1 โŠ› b 2 ; ฯ‚ ) .

Note that equality in general does not apply in this case. Let's look at the example that holds equality is as follows.

Example 3.2 Using the following Table 5 and let ๐’ณ = { 0 , ๐”ž , ๐”Ÿ , ๐”  , ๐”ก , ๐”ข } be ๐• ๐•Œ - subalgebra defined on โŠ› .

โŠ› 0 ๐”ž ๐”Ÿ ๐”  ๐”ก ๐”ข
0 0 ๐”ž ๐”Ÿ ๐”  ๐”ก ๐”ข
๐”ž 0 0 ๐”Ÿ ๐”Ÿ ๐”ก ๐”ข
๐”Ÿ 0 0 0 ๐”ž ๐”ก ๐”ข
๐”  0 0 0 0 ๐”ก ๐”ข
๐”ก 0 0 0 ๐”ž 0 ๐”ข
๐”ข 0 0 0 0 0 0
Table 5

For every two components in ๐’ด , define the membership grades of their connection under ฮท on ๐’ด has the following relations:

( 0 0 0 0 1 0 0 1 1 1 0 0 0 1 1 1 0 0 0 1 1 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 )

Here ฮท is compatible. For ฯ‚ = 0 . 6 , any element in ๐’ด that is connected to 0.6 under ฮท has a SCs that are:

๐‘† ๐ถ ฮท ( 0 ; 0 . 6 ) = { ๐”ก } ,

๐‘† ๐ถ ฮท ( ๐”ž ; 0 . 6 ) = { ๐”ž , ๐”Ÿ , ๐”  } ,

๐‘† ๐ถ ฮท ( ๐”Ÿ ; 0 . 6 ) = { ๐”ž , ๐”Ÿ , ๐”  } ,

๐‘† ๐ถ ฮท ( ๐”  ; 0 . 6 ) = { ๐”ž , ๐”Ÿ , ๐”  } ,

๐‘† ๐ถ ฮท ( ๐”ก ; 0 . 6 ) = { ๐”ก } and

๐‘† ๐ถ ฮท ( ๐”ข ; 0 . 6 ) = { ๐”ข } .

Accordingly, each member in ๐’ด CSCs at the 0.6 level under ฮท are:

๐ถ ๐‘† ๐ถ ฮท ( 0 ; 0 . 6 ) = { 0 , ๐”ก } ,

C ๐‘† ๐ถ ฮท ( ๐”ž ; 0 . 6 ) = { ๐”ž , ๐”Ÿ , ๐”  } ,

๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; 0 . 6 ) = { ๐”ž , ๐”Ÿ , ๐”  } ,

๐ถ ๐‘† ๐ถ ฮท ( ๐”  ; 0 . 6 ) = { ๐”ž , ๐”Ÿ , ๐”  } ,

๐ถ ๐‘† ๐ถ ฮท ( ๐”ก ; 0 . 6 ) = { 0 , ๐”ก } and

๐ถ ๐‘† ๐ถ ฮท ( ๐”ข ; 0 . 6 ) = { ๐”ข } .

It is simple to confirm here that โˆ€ ๐”Ÿ 1 , ๐”Ÿ 2 โˆˆ ๐’ด ,

๐’ž ๐’ฎ ๐’ž ฮท ( b 1 ; ฯ‚ ) โŠ› ๐’ž ๐’ฎ ๐’ž ฮท ( b 2 ; ฯ‚ ) = ๐’ž ๐’ฎ ๐’ž ฮท ( b 1 โŠ› b 2 ; ฯ‚ ) .

Remark 3.1

The FR matrices used in the examples are constructed mathematical examples rather than arbitrary empirical datasets. They are particularly chosen to fulfill assumptions used in the definitions and theorems of the corresponding classes and to facilitate the construction of SCs, CSCs, lower and upper approximation.

Definition 3.1

[33]-[34]

Let ( ๐’ด , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) be an ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - AS of CPFR. If for all ๐”Ÿ 1 , ๐”Ÿ 2 โˆˆ ๐’ด ,

๐’ž ๐’ฎ ๐’ž ฮท ( b 1 ; ฯ‚ ) โŠ› ๐’ž ๐’ฎ ๐’ž ฮท ( b 2 ; ฯ‚ ) = ๐’ž ๐’ฎ ๐’ž ฮท ( b 1 โŠ› b 2 ; ฯ‚ ) (10)

Then the collection ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) is called โŠ› โˆ’ Complete FR (CFR).

Let ( ๐’ด , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) be an ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - AS of CPFR. If for all ๐”Ÿ 1 , ๐”Ÿ 2 โˆˆ ๐’ด ,

๐’ž ๐’ฎ ๐’ž ฮท ( b 1 ; ฯ‚ ) โˆจ ๐’ž ๐’ฎ ๐’ž ฮท ( b 2 ; ฯ‚ ) = ๐’ž ๐’ฎ ๐’ž ฮท ( b 1 โˆจ b 2 ; ฯ‚ ) (11)

Then the collection ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) is called โˆจ โˆ’ CFR.

If it is both โŠ› โˆ’ Complete and โˆจ โˆ’ Complete is called CFR.

Theorem 3.1

Let ( ๐’ด , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) and ( ๐’ณ , ๐’ž ๐’ฎ ๐’ž ฮธ ( ๐’ณ ; ฯ„ ) ) be an ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - AS and ๐’ž ๐’ฎ ๐’ž ฮธ ( ๐’ณ ; ฯ„ ) - AS respectively. These characteristics are true if ฯ• โ‰  ๐’ฎ , ๐’ฏ โІ ๐’ด :

1 . ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) โІ ๐’ฎ โІ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) ;

2 . ๐œ‚ _ ( ฯ• , ฯ‚ ) = ฯ• = ๐œ‚ ยฏ ( ฯ• , ฯ‚ ) ;

3 . ๐œ‚ ยฏ ( ๐’ฎ โˆช ๐’ฏ , ฯ‚ ) = ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) โˆช ๐œ‚ ยฏ ( ๐’ฏ , ฯ‚ ) ;

4 . ๐œ‚ _ ( ๐’ฎ โˆฉ ๐’ฏ , ฯ‚ ) = ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) โˆฉ ๐œ‚ _ ( ๐’ฏ , ฯ‚ ) ;

5 . ๐’ฎ โІ ๐’ฏ implies that ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) โІ ๐œ‚ _ ( ๐’ฏ , ฯ‚ ) and ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) โІ ๐œ‚ ยฏ ( ๐’ฏ , ฯ‚ ) .

6 . ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) โˆฉ ๐œ‚ _ ( ๐’ฏ , ฯ‚ ) โІ ๐œ‚ _ ( ๐’ฎ โˆฉ ๐’ฏ , ฯ‚ ) ;

7 . ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) โˆช ๐œ‚ ยฏ ( ๐’ฏ , ฯ‚ ) โІ ๐œ‚ ยฏ ( ๐’ฎ โˆช ๐’ฏ , ฯ‚ ) ;

8 . ฮท โІ ฮธ and ฯ‚ โІ ฯ„ implies that ๐œƒ ( ๐’ฎ ; ฯ„ ) โІ ๐œ‚ _ ( ๐’ฎ ; ฯ‚ ) and ๐œ‚ ยฏ ( ๐’ฎ ; ฯ‚ ) โІ ๐œƒ ( ๐’ฎ ; ฯ„ ) .

Proof

(1) If ๐”Ÿ โˆˆ ๐œ‚ _ ( ๐’ฎ ; ฯ‚ ) , then ๐”Ÿ โˆˆ ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) โІ ๐’ฎ . This implies that ๐”Ÿ โˆˆ ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) and ๐”Ÿ โˆˆ ๐’ฎ . From

there we can write ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) โˆฉ ๐’ฎ โ‰  ฯ• . This implies that ๐”Ÿ โˆˆ ๐œ‚ ยฏ ( ๐’ฎ ; ฯ‚ ) . Hence, ๐’ฎ โІ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) . Consequently, ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) โІ ๐’ฎ โІ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) .

(2) It is straightforward.

(3) Let,

๐”Ÿ โˆˆ ๐œ‚ ยฏ ( ๐’ฎ โˆช ๐’ฏ , ฯ‚ ) โ‡” ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) โˆฉ ( ๐’ฎ โˆช ๐’ฏ ) โ‰  ฯ•

โ‡” ( ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) โˆฉ ๐’ฎ ) โˆช ( ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) โˆฉ ๐’ฏ ) โ‰  ฯ•

โ‡” ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) โˆฉ ๐’ฎ โ‰  ๐œ™ ๐‘œ ๐‘Ÿ ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) โˆฉ ๐’ฏ โ‰  ฯ•

โ‡” ๐”Ÿ โˆˆ ๐œ‚ ยฏ ( ๐’ฎ ; ฯ‚ ) o r ๐”Ÿ โˆˆ ๐œ‚ ยฏ ( ๐’ฏ ; ฯ‚ )

โ‡” ๐”Ÿ โˆˆ ๐œ‚ ยฏ ( ๐’ฎ ; ฯ‚ ) โˆช ๐œ‚ ยฏ ( ๐’ฏ ; ฯ‚ ) .

Thus,

๐œ‚ ยฏ ( ๐’ฎ โˆช ๐’ฏ , ฯ‚ ) = ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) โˆช ๐œ‚ ยฏ ( ๐’ฏ , ฯ‚ ) .

(4) Let,

๐”Ÿ โˆˆ ๐œ‚ _ ( ๐’ฎ โˆฉ ๐’ฏ , ฯ‚ ) โ‡” ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) โІ ( ๐’ฎ โˆฉ ๐’ฏ )

โ‡” ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) โІ ๐’ฎ ๐‘Ž ๐‘› ๐‘‘ ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) โІ ๐’ฏ

โ‡” ๐”Ÿ โˆˆ ๐œ‚ _ ( ๐’ฎ ; ฯ‚ ) and ๐”Ÿ โˆˆ ๐œ‚ _ ( ๐’ฏ ; ฯ‚ )

โ‡” ๐”Ÿ โˆˆ ๐œ‚ _ ( ๐’ฎ ; ฯ‚ ) โˆฉ ๐œ‚ _ ( ๐’ฏ ; ฯ‚ ) .

Thus,

๐œ‚ _ ( ๐’ฎ โˆฉ ๐’ฏ , ฯ‚ ) = ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) โˆฉ ๐œ‚ _ ( ๐’ฏ , ฯ‚ ) .

(5) Since ๐’ฎ โІ ๐’ฏ if and only if ๐’ฎ โˆฉ ๐’ฏ = ๐’ฎ , by (3) we have

๐œ‚ _ ( ๐’ฎ , ฯ‚ ) = ๐œ‚ _ ( ๐’ฎ โˆฉ ๐’ฏ , ฯ‚ ) = ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) โˆฉ ๐œ‚ _ ( ๐’ฏ , ฯ‚ )

This implies that ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) โІ ๐œ‚ _ ( ๐’ฏ , ฯ‚ ) . Additionally, take note that ๐’ฎ โІ ๐’ฏ if and only if ๐’ฎ โˆฉ ๐’ฏ = ๐’ฎ .

From (2), we obtain ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) = ๐œ‚ ยฏ ( ๐’ฎ โˆช ๐’ฏ , ฯ‚ ) = ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) โˆช ๐œ‚ ยฏ ( ๐’ฏ , ฯ‚ ) .

This implies that ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) โІ ๐œ‚ ยฏ ( ๐’ฏ , ฯ‚ ) .

(6) Since ๐’ฎ โІ ๐’ฎ โˆช ๐’ฏ and ๐’ฏ โІ ๐’ฎ โˆช ๐’ฏ , by (4) we have

๐œ‚ _ ( ๐’ฎ , ฯ‚ ) = ๐œ‚ _ ( ๐’ฎ โˆฉ ๐’ฏ , ฯ‚ ) and ๐œ‚ _ ( ๐’ฏ , ฯ‚ ) = ๐œ‚ _ ( ๐’ฎ โˆฉ ๐’ฏ , ฯ‚ )

This implies that ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) โˆช ๐œ‚ _ ( ๐’ฏ , ฯ‚ ) = ๐œ‚ _ ( ๐’ฎ โˆฉ ๐’ฏ , ฯ‚ ) .

(7) Since ๐’ฎ โˆฉ ๐’ฏ โІ ๐’ฎ and ๐’ฎ โˆฉ ๐’ฏ โІ ๐’ฏ , by (4) we have

๐œ‚ ยฏ ( ๐’ฎ โˆฉ ๐’ฏ , ฯ‚ ) โІ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) and ๐œ‚ ยฏ ( ๐’ฎ โˆฉ ๐’ฏ , ฯ‚ ) โІ ๐œ‚ ยฏ ( ๐’ฏ , ฯ‚ )

which implies that ๐œ‚ ยฏ ( ๐’ฎ โˆฉ ๐’ฏ , ฯ‚ ) โІ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) โˆฉ ๐œ‚ ยฏ ( ๐’ฏ , ฯ‚ ) .

(8) Since ฯ‚ โІ ฯ„ . If x โˆˆ ๐œƒ ( ๐’ฎ ; ฯ„ ) , then ๐ถ ๐‘† ๐ถ ฮธ ( x ; ฯ„ ) โІ ๐’ฎ . But ฯ‚ โІ ฯ„ . Therefore, ๐ถ ๐‘† ๐ถ ฮท ( x ; ฯ‚ ) โІ ๐ถ ๐‘† ๐ถ ฮธ ( x ; ฯ„ ) โІ ๐’ฎ .

This implies that ๐ถ ๐‘† ๐ถ ฮท ( x ; ฯ‚ ) โІ ๐’ฎ . Thus, x โˆˆ ๐œ‚ _ ( ๐’ฎ ; ฯ‚ ) . Hence, ๐œƒ ( ๐’ฎ ; ฯ„ ) โІ ๐œ‚ _ ( ๐’ฎ ; ฯ‚ ) .

Now, let x โˆˆ ๐œ‚ ยฏ ( ๐’ฎ ; ฯ‚ ) , then we have ๐ถ ๐‘† ๐ถ ฮท ( x ; ฯ‚ ) โˆฉ ๐’ฎ โ‰  ๐œ™ .

Then โˆƒ y โˆˆ ๐ถ ๐‘† ๐ถ ฮท ( x ; ฯ‚ ) โˆฉ ๐’ฎ s . t . y โˆˆ ๐ถ ๐‘† ๐ถ ฮท ( x ; ฯ‚ ) and y โˆˆ ๐’ฎ . Hence, ๐‘† ๐ถ ฮท ( y ; ฯ‚ ) = ๐‘† ๐ถ ฮท ( x ; ฯ‚ ) , Since ฯ‚ โІ ฯ„ , so we have y โˆˆ ๐ถ ๐‘† ๐ถ ฮธ ( x ; ฯ„ ) .

Therefore, we have y โˆˆ ๐ถ ๐‘† ๐ถ ฮธ ( x ; ฯ„ ) โˆฉ ๐’ฎ .

Which means that x โˆˆ ๐œƒ ( ๐’ฎ ; ฯ„ ) .

Hence, ๐œ‚ ยฏ ( ๐’ฎ ; ฯ‚ ) โІ ๐œƒ ( ๐’ฎ ; ฯ„ ) .

Theorem 3.2 Let ( ๐’ด , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) be an ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - AS. If ๐’ฎ are nonempty subsets of ๐’ด , then

1 . ๐œ‚ _ ( ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) , ฯ‚ ) = ๐œ‚ _ ( ๐’ฎ , ฯ‚ )

2 . ๐œ‚ ยฏ ( ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) , ฯ‚ ) = ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ )

3 . ๐œ‚ ยฏ ( ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) , ฯ‚ ) = ๐œ‚ _ ( ๐’ฎ , ฯ‚ )

4 . ๐œ‚ _ ( ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) , ฯ‚ ) = ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ )

5 . ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) = ( ( ๐œ‚ ยฏ ( ๐’ฎ c , ฯ‚ ) ) ๐‘

6 . ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) = ( ( ๐œ‚ _ ( ๐’ฎ c , ฯ‚ ) ) ๐‘

7 . ๐œ‚ _ ( ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) , ฯ‚ ) = ๐’ด = ๐œ‚ _ ( ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) , ฯ‚ ) , for all ๐”Ÿ โˆˆ ๐’ฎ .

Proof

Proof is simple.

Theorem 3.3

Let ( ๐’ด , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) be an ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - AS. If ฯ• โ‰  ๐’ฎ โІ ๐’ด , then

1 . ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) โŠ› ๐œ‚ ยฏ ( ๐’ฏ , ฯ‚ ) โІ ๐œ‚ ยฏ ( ๐’ฎ โŠ› ๐’ฏ , ฯ‚ )

2. If ฮท is CFR, then ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) โŠ› ๐œ‚ _ ( ๐’ฏ , ฯ‚ ) โІ ๐œ‚ _ ( ๐’ฎ โŠ› ๐’ฏ , ฯ‚ ) .

Proof

(1) Any element of ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) โŠ› ๐œ‚ ยฏ ( ๐’ฏ , ฯ‚ ) can be ๐”  . Consequently, ๐”  = ๐”ญ โŠ› ๐”ฎ , where ๐”ญ โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) and ๐”ฎ โˆˆ ๐œ‚ ยฏ ( ๐’ฏ , ฯ‚ ) . As a result, ๐”ต , ๐”ถ exist in ๐’ฎ such that ๐”ต โˆˆ C S C ฮท ( ๐”ญ , ฯ‚ ) โˆฉ ๐’ฎ and ๐”ถ โˆˆ C S C ฮท ( ๐”ฎ , ฯ‚ ) โˆฉ ๐’ฏ . It follows from this that ๐”ต โˆˆ C S C ฮท ( ๐”ญ , ฯ‚ ) , ๐”ต โˆˆ ๐’ฎ and ๐”ถ โˆˆ C S C ฮท ( ๐”ฎ , ฯ‚ ) , ๐”ถ โˆˆ ๐’ฏ .

Proposition 3. gives us

๐”ต โŠ› ๐”ถ โˆˆ C S C ฮท ( ๐”ญ , ฯ‚ ) โŠ› C S C ฮท ( ๐”ฎ , ฯ‚ ) โІ C S C ฮท ( ๐”ญ โŠ› ๐”ฎ , ฯ‚ )

Furthermore, since we have ๐”ต โŠ› ๐”ถ โˆˆ ๐’ฎ โŠ› ๐’ฏ , ๐”ต โŠ› ๐”ถ โˆˆ C S C ฮท ( ๐”ญ โŠ› ๐”ฎ , ฯ‚ ) . This suggests that ๐”ต โŠ› ๐”ถ โˆˆ C S C ฮท ( ๐”ญ โŠ› ๐”ฎ , ฯ‚ ) โˆฉ ๐’ฎ โŠ› ๐’ฏ . This implies that ๐”  = ๐”ญ โŠ› ๐”ฎ โˆˆ ๐œ‚ ยฏ ( ๐’ฎ โŠ› ๐’ฏ , ฯ‚ ) . Thus

๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) โŠ› ๐œ‚ ยฏ ( ๐’ฏ , ฯ‚ ) โІ ๐œ‚ ยฏ ( ๐’ฎ โŠ› ๐’ฏ , ฯ‚ )

(2) Let ๐”  be any element of ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) โŠ› ๐œ‚ _ ( ๐’ฏ , ฯ‚ ) . Then ๐”  = ๐”ญ โŠ› ๐”ฎ with ๐”ญ โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) and ๐”ฎ โˆˆ ๐œ‚ _ ( ๐’ฏ , ฯ‚ ) .

This follows that C S C ฮท ( ๐”ญ , ฯ‚ ) โІ ๐’ฎ and C S C ฮท ( ๐”ฎ , ฯ‚ ) โІ ๐’ฏ . Since ฮท is CFR, so we have

C S C ฮท ( ๐”ญ , ฯ‚ ) โŠ› C S C ฮท ( ๐”ฎ , ฯ‚ ) = C S C ฮท ( ๐”ญ โŠ› ๐”ฎ , ฯ‚ ) โІ ๐’ฎ โŠ› ๐’ฏ .

This implies that ๐”  = ๐”ญ โŠ› ๐”ฎ โˆˆ ๐œ‚ _ ( ๐’ฎ โŠ› ๐’ฏ , ฯ‚ ) . Thus,

๐œ‚ _ ( ๐’ฎ , ฯ‚ ) โŠ› ๐œ‚ _ ( ๐’ฏ , ฯ‚ ) โІ ๐œ‚ _ ( ๐’ฎ โŠ› ๐’ฏ , ฯ‚ ) .

Theorem 3.4

Let ๐’ฎ is a ๐• ๐•Œ - subalgebra of ๐’ด and ( ๐’ด , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) be an ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - AS of โŠ› โˆ’ CFR, then

1 . ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) is a ๐• ๐•Œ - subalgebra of ๐’ด .

2 . ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) is a ๐• ๐•Œ - subalgebra of ๐’ด .

Proof

(1) Assume that ๐”ต , ๐”ถ a r e in ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) . Then C S C ฮท ( ๐”ต , ฯ‚ ) โˆฉ ๐’ฎ โ‰  ๐œ™ and C S C ฮท ( ๐”ถ , ฯ‚ ) โˆฉ ๐’ฎ โ‰  ๐œ™ , and so there exist ๐”ž , ๐”Ÿ โˆˆ ๐’ฎ such that ๐”ž โˆˆ C S C ฮท ( ๐”ต , ฯ‚ ) and ๐”Ÿ โˆˆ C S C ฮท ( ๐”ถ , ฯ‚ ) . According to Proposition 3., we have

๐”ž โŠ› ๐”Ÿ โˆˆ C S C ฮท ( ๐”ต , ฯ‚ ) โŠ› C S C ฮท ( ๐”ถ , ฯ‚ ) โІ C S C ฮท ( ๐”ต โŠ› ๐”ถ , ฯ‚ ) .

It follows from this that ๐”ž โŠ› ๐”Ÿ โˆˆ C S C ฮท ( ๐”ต โŠ› ๐”ถ , ฯ‚ ) . Given that ๐’ฎ represent a ๐’ด ๐• ๐•Œ - subalgebra, ๐”ž โŠ› ๐”Ÿ โˆˆ ๐’ฎ . Accordingly, ๐”ž โŠ› ๐”Ÿ โˆˆ C S C ฮท ( ๐”ต โŠ› ๐”ถ , ฯ‚ ) โˆฉ ๐’ฎ , that is C S C ฮท ( ๐”ต โŠ› ๐”ถ , ฯ‚ ) โˆฉ ๐’ฎ โ‰  ๐œ™ . In this case, ๐”ต โŠ› ๐”ถ โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) . Hence, ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) is a ๐• ๐•Œ - subalgebra of ๐’ด .

(2) Assume that ๐”ต , ๐”ถ โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) . Then C S C ฮท ( ๐”ต , ฯ‚ ) โІ ๐’ฎ and C S C ฮท ( ๐”ถ , ฯ‚ ) โІ ๐’ฎ , respectively. Given that

๐’ฎ is a ๐• ๐•Œ - subalgebra of ๐’ด and ฮท is โŠ› โˆ’ CFR, so

C S C ฮท ( ๐”ต , ฯ‚ ) โŠ› C S C ฮท ( ๐”ถ , ฯ‚ ) = C S C ฮท ( ๐”ต โŠ› ๐”ถ , ฯ‚ ) โІ ๐’ฎ

Hence ๐”ต โŠ› ๐”ถ โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) . Thus, ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) is ๐• ๐•Œ - subalgebra of ๐’ด .

Theorem 3.5

If ๐’ฎ is a ๐• ๐•Œ - ideal of ๐’ด and ( ๐’ด , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) be an ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - AS of โŠ› โˆ’ CFR, then

1 . ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) is a ๐• ๐•Œ - ideal of ๐’ด .

2 . ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) is a ๐• ๐•Œ - ideal of ๐’ด .

Proof

(1) Consider ๐’ฎ is a ๐• ๐•Œ - ideal of ๐’ด . Indeed, 0 โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) . For ๐”ต , ๐”ถ , ๐”ท โˆˆ ๐’ด , let ๐”ถ โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) and ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) . After that,

C S C ฮท ( ๐”ถ , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ ๐‘Ž ๐‘› ๐‘‘ C S C ฮท ( ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ ,

Thus, ๐”ž , ๐”Ÿ โˆˆ ๐’ฎ such that ๐”ž โˆˆ C S C ฮท ( ๐”ถ , ๐œ ) and ๐”Ÿ โˆˆ C S C ฮท ( ๐”ต โŠ› ( ๐”ถ โŠ› z ) , ๐œ ) respectively. Since S C ฮท ( ๐”ž , ๐œ ) = S C ฮท ( ๐”ถ , ๐œ ) and S C ฮท ( ๐”Ÿ , ๐œ ) = S C ฮท ( ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) , ๐œ ) , it follows that ๐”ถ โŠ› ๐”ž โˆˆ C S C ฮท ( ๐”ถ , ๐œ ) โІ ๐’ฎ and ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) โŠ› ๐‘ โˆˆ C S C ฮท ( ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) , ๐œ ) โІ ๐’ฎ . Given that ๐’ฎ is a ๐• ๐•Œ - ideal and ๐”ž , ๐”Ÿ โˆˆ ๐’ฎ ,

๐”ถ โˆˆ ๐’ฎ and ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) โˆˆ ๐’ฎ ,

According to the definition of ๐• ๐•Œ - ideal, ๐”ต โŠ› ๐”ท โˆˆ ๐’ฎ . ๐”ต โŠ› ๐”ท โˆˆ C S C ฮท ( ๐”ต โŠ› ๐”ท , ๐œ ) should be noted. Accordingly, ๐”ต โŠ› ๐”ท โˆˆ C S C ฮท ( ๐”ต โŠ› ๐”ท , ๐œ ) โˆฉ ๐’ฎ or C S C ฮท ( ๐”ต โŠ› ๐”ท , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ . Thus, ๐”ต โŠ› ๐”ท โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) .

Hence, ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) is a ๐• ๐•Œ - ideal of ๐’ด . (2) Let ๐’ฎ be ๐’ด ' s ๐• ๐•Œ - ideal. Needless to say, 0 โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) . Let ๐”ต , ๐”ถ , ๐”ท โˆˆ ๐’ด be such that ๐”ถ โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) and ๐”ต โŠ›

( ๐”ถ โŠ› ๐”ท ) โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) . Next,

C S C ฮท ( ๐”ถ , ๐œ ) โІ ๐’ฎ ๐‘Ž ๐‘› ๐‘‘ C S C ฮท ( ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) , ๐œ ) โІ ๐’ฎ ,

Let's say that w โˆˆ C S C ฮท ( ๐”ต โŠ› ๐”ท , ๐œ ) = C S C ฮท ( ๐”ต , ๐œ ) โŠ› C S C ฮท ( ๐”ท , ๐œ ) . Then, for any ๐”ž โˆˆ C S C ฮท ( ๐”ต , ๐œ ) and ๐”  โˆˆ C S C ฮท ( ๐”ท , ๐œ ) , we have w โˆˆ C S C ฮท ( ๐”ต , ๐œ ) โŠ› C S C ฮท ( ๐”ท , ๐œ ) . S C ฮท ( ๐”ž , ๐œ ) = S C ฮท ( ๐”ต , ๐œ ) and S C ฮท ( ๐”  , ๐œ ) = S C ฮท ( ๐”ท , ๐œ ) are our two variables. We obtain S C ฮท ( ๐”Ÿ , ๐œ ) = S C ฮท ( ๐”ถ , ๐œ ) for ๐”Ÿ โˆˆ C S C ฮท ( ๐”ถ , ๐œ ) . Given that ฮท is โŠ› โˆ’ CFR,

S C ฮท ( ๐”ž โŠ› ( ๐”Ÿ โŠ› ๐”  ) , ๐œ ) = S C ฮท ( ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) , ๐œ )

Our result is ๐”ž โŠ› ( ๐”Ÿ โŠ› ๐”  ) โˆˆ C S C ฮท ( ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) , ๐œ ) โІ ๐’ฎ . Given that ๐’ฎ is a ๐• ๐•Œ - ideal of ๐’ด , w = ๐”ž โŠ› ๐”  โˆˆ ๐’ฎ according to the definition of a ๐• ๐•Œ - ideal.

Therefore, C S C ฮท ( ๐”ต โŠ› ๐”ท , ๐œ ) โІ ๐’ฎ . Because of this, ๐”ต โŠ› ๐”ท โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) , and ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) is a ๐• ๐•Œ - ideal of ๐’ด .

Theorem 3.6:

If ๐’ฎ is a weak ๐• ๐•Œ - ideal of ๐’ด and ( ๐’ด , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) be an ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - AS of CFR, then

1 . ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) is a weak ๐• ๐•Œ - ideal of ๐’ด .

2 . ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) is a weak ๐• ๐•Œ - ideal of ๐’ด .

Proof:

(1) Let ๐’ฎ represent ๐’ด ' s weak ๐• ๐•Œ - ideal. Indeed, 0 โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) . Assume ๐”ต , ๐”ถ belong to ๐’ด such that ๐”ถ โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) and ๐”ถ โŠ› ๐”ต โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) . After that,

C S C ฮท ( ๐”ถ , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ ๐‘Ž ๐‘› ๐‘‘ C S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ ,

Consequently, ๐”ž , ๐”Ÿ โˆˆ ๐’ฎ such that ๐”ž โˆˆ C S C ฮท ( ๐”ถ , ๐œ ) and ๐”Ÿ โˆˆ C S C ฮท ( ๐”ถ โŠ› x , ๐œ ) . Thus, according to the equations S C ฮท ( ๐”ž , ๐œ ) = S C ฮท ( ๐”ถ , ๐œ ) and S C ฮท ( ๐”Ÿ , ๐œ ) = S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ ) , ๐”ถ โŠ› ๐”ž โˆˆ C S C ฮท ( ๐”ถ , ๐œ ) โІ ๐’ฎ and ( ๐”ถ โŠ› ๐”ต ) โŠ› ๐”Ÿ โˆˆ C S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ ) โІ ๐’ฎ . Since ๐”ถ โˆˆ ๐’ฎ and ๐”ถ โŠ› ๐”ต โˆˆ ๐’ฎ , and since ๐”ž , ๐”Ÿ โˆˆ ๐’ฎ and ๐’ฎ is a weak ๐• ๐•Œ - ideal, the weak ๐• ๐•Œ - ideal definition indicates that ๐”ต โˆˆ ๐’ฎ .

Keep in mind that ๐”ต โˆˆ C S C ฮท ( ๐”ต , ๐œ ) . This suggests that ๐”ต โˆˆ C S C ฮท ( ๐”ต , ๐œ ) โˆฉ ๐’ฎ or C S C ฮท ( ๐”ต , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ . Therefore, ๐”ต โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) . Hence, ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) is a weak ๐• ๐•Œ - ideal of ๐’ด . (2) Let ๐’ฎ be ๐’ด ' s weak ๐• ๐•Œ - ideal. Of course, 0 โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) .

If ๐”ต , ๐”ถ โˆˆ ๐’ด , then ๐”ถ โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) and ๐”ถ โŠ› ๐”ต โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) . Then,

C S C ฮท ( ๐”ถ , ๐œ ) โІ ๐’ฎ ๐‘Ž ๐‘› ๐‘‘ C S C ฮท ( ๐”ถ , ๐œ ) โŠ› C S C ฮท ( ๐”ต , ๐œ ) = C S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ ) โІ ๐’ฎ ,

Assuming that ๐”ด is a member of C S C ฮท ( ๐”ต , ๐œ ) , we obtain S C ฮท ( ๐”ž , ๐œ ) = S C ฮท ( ๐”ต , ๐œ ) for some ๐”ž โˆˆ C S C ฮท ( ๐”ต , ๐œ ) . Taking ๐”Ÿ โˆˆ C S C ฮท ( ๐”ถ , ๐œ ) , we obtain S C ฮท ( ๐”Ÿ , ๐œ ) = S C ฮท ( ๐”ถ , ๐œ ) . Since ฮท is โŠ› โˆ’ CFR,

S C ฮท ( ๐”Ÿ โŠ› ๐”ž , ๐œ ) = S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ )

Therefore, ๐”Ÿ โŠ› ๐”ž โˆˆ C S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ ) โІ ๐’ฎ . According to the definition of a weak ๐• ๐•Œ - ideal and ๐”ด = ๐”ž โˆˆ ๐’ฎ . Since ๐’ฎ is a weak ๐• ๐•Œ - ideal of ๐’ด . Thus, C S C ฮท ( ๐”ต , ๐œ ) โІ ๐’ฎ . Because ๐”ต is a member of ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) .

Hence, ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) is a weak ๐• ๐•Œ - ideal of ๐’ด .

Theorem 3.7

If ๐’ฎ is a strong ๐• ๐•Œ - ideal of ๐’ด and ( ๐’ด , ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) ) be an ๐’ž ๐’ฎ ๐’ž ฮท ( ๐’ด ; ฯ‚ ) - AS of CFR, then

1 . ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) referred as a strong ๐• ๐•Œ - ideal of ๐’ด .

2 . ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) referred as a strong ๐• ๐•Œ - ideal of ๐’ด .

Proof. (1) Assume that ๐”ต , ๐”ถ โˆˆ ๐’ด

๐”ถ โŠ› ๐”ต โˆฉ ฮท ยฏ ( ๐’ฎ , ฯ‚ ) and ๐”ถ โˆˆ ฮท ยฏ ( ๐’ฎ , ฯ‚ ) .

Then C S C ฮท ( ๐”ถ , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ ๐‘Ž ๐‘› ๐‘‘ C S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ , and โˆƒ ๐”ท โˆˆ ๐’ด such that ๐”ท = ๐”ถ โŠ› ๐”ต and ๐”ท โˆˆ ฮท ยฏ ( ๐’ฎ , ฯ‚ ) . This implies that, C S C ฮท ( ๐”ท , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ and โˆƒ ๐”  , ๐”ก โˆˆ ๐’ด s . t . ๐”  โˆˆ C S C ฮท ( ๐”ท , ๐œ ) โˆฉ ๐’ฎ and ๐”ก โˆˆ C S C ฮท ( y , ๐œ ) โˆฉ ๐’ฎ .

Hence S C ฮท ( ๐”  , ๐œ ) = S C ฮท ( ๐”ท , ๐œ ) and S C ฮท ( ๐”ก , ๐œ ) = S C ฮท ( ๐”ถ , ๐œ ) , where ๐”  , ๐”ก โˆˆ ๐’ฎ . Consequently, this suggests that ๐”ท โŠ› ๐”  โˆˆ C S C ฮท ( ๐”ท , ๐œ ) โІ ๐’ฎ and ๐”ถ โŠ› ๐”ก โˆˆ C S C ฮท ( y , ๐œ ) โІ ๐’ฎ . ๐’ฎ is a strong ๐• ๐•Œ - ideal, and ๐”  , ๐”ก , ๐”ท , and ๐”ถ are all in S.

We have thus demonstrated that ๐”ถ โŠ› ๐”ต โˆฉ C S C ฮท ( ๐”ถ , ๐œ ) โ‰  ฯ• and ๐”ถ โˆˆ C S C ฮท ( ๐”ถ , ๐œ ) . Since ๐’ฎ is a strong ๐• ๐•Œ - ideal, ๐”ต โˆˆ ๐’ฎ , and so C S C ฮท ( ๐”ต , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ .

That is, ฮท ยฏ ( ๐’ฎ , ฯ‚ ) is a strong ๐• ๐•Œ - ideal of ๐’ฎ .

(2) If ๐”ต , ๐”ถ โˆˆ ๐’ด , then ๐”ถ โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) and ๐”ถ โŠ› ๐”ต โˆฉ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) . Assume that ๐”ž and ๐”Ÿ are both belonging to

C S C ฮท ( ๐”ท , ๐œ ) and C S C ฮท ( ๐”ถ , ๐œ ) respectively. Our S C ฮท ( ๐”ž , ๐œ ) = S C ฮท ( ๐”ท , ๐œ ) and S C ฮท ( ๐”Ÿ , ๐œ ) = S C ฮท ( ๐”ถ , ๐œ ) are as follows.

Because ฮท is CFR, S C ฮท ( ๐”Ÿ โŠ› ๐”ž , ๐œ ) = S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ ) . A ๐”ฑ in ๐’ด such that ๐”ฑ โˆˆ ๐”ถ โŠ› ๐”ต and ๐”ฑ โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ )

exists since ๐”ถ โŠ› ๐”ต โˆฉ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) . The statement ๐”ฑ โˆˆ S C ฮท ( ๐”Ÿ โŠ› ๐”ž , ๐œ ) = S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ ) now suggests that there

is a ๐”ท โˆˆ S C ฮท ( ๐”Ÿ โŠ› ๐”ž , ๐œ ) such that S C ฮท ( ๐”ท , ๐œ ) = S C ฮท ( ๐”ฑ , ๐œ ) , and therefore C S C ฮท ( ๐”ฑ , ๐œ ) = ๐ถ S C ฮท ( ๐”ฑ , ๐œ ) โˆˆ ๐’ฎ . As a result, ๐”ท โˆˆ ๐’ฎ and ( ๐”Ÿ โŠ› ๐”ž ) โˆฉ โ‰  ฯ• .

Alternatively, we have ๐”Ÿ โˆˆ C S C ฮท ( ๐”ถ , ๐œ ) โІ ๐’ฎ . Since ๐”ž โˆˆ ๐’ฎ , which suggests that C S C ฮท ( ๐”ต , ๐œ ) โІ ๐’ฎ , ๐’ฎ is a strong ๐• ๐•Œ - ideal of ๐’ด .

This indicates that ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) is a strong ๐• ๐•Œ - ideal of ๐’ด , since ๐”ต belongs to ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) .

Remark 3.2

A quantale is a more richly-structured algebraic setting in which the underlying structure is an ordered complete-lattice, along with an associative multiplication which distributes over all joins. This additional structure will provide a natural context for the study of whether the proposed rough approximations and JU-ideal structures are compatible with stronger order-algebraic properties.

Theorem 3.8

Assume that โ„š ฬ‡ ๐“‰ is quantale and ฯ• โ‰  ๐’ฎ โІ โ„š ฬ‡ ๐“‰ . If ๐’ฎ is a ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ and ( โ„š ฬ‡ ๐“‰ , ๐’ž ๐’ฎ ๐’ž ฮท ( โ„š ฬ‡ ๐“‰ ; ฯ‚ ) ) be

an ๐’ž ๐’ฎ ๐’ž ฮท ( โ„š ฬ‡ ๐“‰ ; ฯ‚ ) - AS of CFR, then

๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) referred as ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ .

๐œ‚ _ ( ๐’ฎ , ฯ‚ ) referred as ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ .

Proof

(1) Consider ๐’ฎ is a ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ . Indeed, 0 โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) . For ๐”ต , ๐”ถ , ๐”ท โˆˆ โ„š ฬ‡ ๐“‰ , let ๐”ถ โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) and ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) . After that, C S C ฮท ( ๐”ถ , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ ๐‘Ž ๐‘› ๐‘‘ C S C ฮท ( ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ ,

Thus, ๐”ž , ๐”Ÿ โˆˆ ๐’ฎ such that ๐”ž โˆˆ C S C ฮท ( ๐”ถ , ๐œ ) and ๐”Ÿ โˆˆ C S C ฮท ( ๐”ต โŠ› ( ๐”ถ โŠ› z ) , ๐œ ) respectively.

Since S C ฮท ( ๐”ž , ๐œ ) = S C ฮท ( ๐”ถ , ๐œ ) and S C ฮท ( ๐”Ÿ , ๐œ ) = S C ฮท ( ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) , ๐œ ) , it follows that ๐”ถ โŠ› ๐”ž โˆˆ C S C ฮท ( ๐”ถ , ๐œ ) โІ ๐’ฎ and ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) โŠ› ๐‘ โˆˆ C S C ฮท ( ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) , ๐œ ) โІ ๐’ฎ .

Given that ๐’ฎ is a ๐• ๐•Œ - ideal and ๐”ž , ๐”Ÿ โˆˆ ๐’ฎ , ๐”ถ โˆˆ ๐’ฎ and ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) โˆˆ ๐’ฎ , According to the definition of ๐• ๐•Œ - ideal, ๐”ต โŠ› ๐”ท โˆˆ ๐’ฎ . ๐”ต โŠ› ๐”ท โˆˆ C S C ฮท ( ๐”ต โŠ› ๐”ท , ๐œ ) should be noted.

Accordingly, ๐”ต โŠ› ๐”ท โˆˆ C S C ฮท ( ๐”ต โŠ› ๐”ท , ๐œ ) โˆฉ ๐’ฎ or C S C ฮท ( ๐”ต โŠ› ๐”ท , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ . Thus, ๐”ต โŠ› ๐”ท โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) .

Similarly, we can prove for โˆจ . Hence ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) is ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ .

(2) Let ๐’ฎ be โ„š ฬ‡ ๐“‰ ' s ๐• ๐•Œ - ideal. Needless to say, 0 โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) . Let ๐”ต , ๐”ถ , ๐”ท โˆˆ โ„š ฬ‡ ๐“‰ be such that ๐”ถ โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ )

and ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) . Next,

C S C ฮท ( ๐”ถ , ๐œ ) โІ ๐’ฎ ๐‘Ž ๐‘› ๐‘‘ C S C ฮท ( ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) , ๐œ ) โІ ๐’ฎ ,

Suppose that w โˆˆ C S C ฮท ( ๐”ต โŠ› ๐”ท , ๐œ ) = C S C ฮท ( ๐”ต , ๐œ ) โŠ› C S C ฮท ( ๐”ท , ๐œ ) . Then for any ๐”ž โˆˆ C S C ฮท ( ๐”ต , ๐œ ) and ๐”  โˆˆ C S C ฮท ( ๐”ท , ๐œ ) , we have w โˆˆ C S C ฮท ( ๐”ต , ๐œ ) โŠ› C S C ฮท ( ๐”ท , ๐œ ) . S C ฮท ( ๐”ž , ๐œ ) = S C ฮท ( ๐”ต , ๐œ ) and S C ฮท ( ๐”  , ๐œ ) = S C ฮท ( ๐”ท , ๐œ ) are our two variables. We obtain S C ฮท ( ๐”Ÿ , ๐œ ) = S C ฮท ( ๐”ถ , ๐œ ) for ๐”Ÿ โˆˆ C S C ฮท ( ๐”ถ , ๐œ ) .

Given that ฮท is CFR, so

S C ฮท ( ๐”ž โŠ› ( ๐”Ÿ โŠ› ๐”  ) , ๐œ ) = S C ฮท ( ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) , ๐œ )

Our result is ๐”ž โŠ› ( ๐”Ÿ โŠ› ๐”  ) โˆˆ C S C ฮท ( ๐”ต โŠ› ( ๐”ถ โŠ› ๐”ท ) , ๐œ ) โІ ๐’ฎ . Given that ๐’ฎ is a ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ , w = ๐”ž โŠ› ๐”  โˆˆ ๐’ฎ according to the definition of a ๐• ๐•Œ - ideal.

Therefore, C S C ฮท ( ๐”ต โŠ› ๐”ท , ๐œ ) โІ ๐’ฎ . Because of this, ๐”ต โŠ› ๐”ท โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) .

Similarly, we can prove for โˆจ . Hence, ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) is a ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ .

Theorem 3.9

If ๐’ฎ is a weak ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ and ( โ„š ฬ‡ ๐“‰ , ๐’ž ๐’ฎ ๐’ž ฮท ( โ„š ฬ‡ ๐“‰ ; ฯ‚ ) ) be an ๐’ž ๐’ฎ ๐’ž ฮท ( โ„š ฬ‡ ๐“‰ ; ฯ‚ ) - AS of CFR, then

1 . ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) referred as a weak ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ .

2 . ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) referred a weak ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ .

Proof

(1) Let ๐’ฎ represent โ„š ฬ‡ ๐“‰ ' s weak ๐• ๐•Œ - ideal. Indeed, 0 โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) . Assume ๐”ต , ๐”ถ belong to โ„š ฬ‡ ๐“‰ such that ๐”ถ โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) and ๐”ถ โŠ› ๐”ต โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) . This implies that,

C S C ฮท ( ๐”ถ , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ ๐‘Ž ๐‘› ๐‘‘ C S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ ,

Consequently, ๐”ž , ๐”Ÿ โˆˆ ๐’ฎ such that ๐”ž โˆˆ C S C ฮท ( ๐”ถ , ๐œ ) and ๐”Ÿ โˆˆ C S C ฮท ( ๐”ถ โŠ› x , ๐œ ) . Thus, according to the equations S C ฮท ( ๐”ž , ๐œ ) = S C ฮท ( ๐”ถ , ๐œ ) and S C ฮท ( ๐”Ÿ , ๐œ ) = S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ ) , ๐”ถ โŠ› ๐”ž โˆˆ C S C ฮท ( ๐”ถ , ๐œ ) โІ ๐’ฎ and ( ๐”ถ โŠ› ๐”ต ) โŠ› ๐”Ÿ โˆˆ C S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ ) โІ ๐’ฎ .

Since ๐”ถ โˆˆ ๐’ฎ and ๐”ถ โŠ› ๐”ต โˆˆ ๐’ฎ , and ๐”ž , ๐”Ÿ โˆˆ ๐’ฎ and ๐’ฎ is a weak ๐• ๐•Œ - ideal, The weak ๐• ๐•Œ - ideal definition indicates that ๐”ต โˆˆ ๐’ฎ . We know that ๐”ต โˆˆ C S C ฮท ( ๐”ต , ๐œ ) . This suggests that ๐”ต โˆˆ C S C ฮท ( ๐”ต , ๐œ ) โˆฉ ๐’ฎ or C S C ฮท ( ๐”ต , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ .

Therefore, ๐”ต โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) . Similarly, we can prove for โˆจ . Hence, ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) is a weak ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ .

(2) Let ๐’ฎ be โ„š ฬ‡ ๐“‰ ' s weak ๐• ๐•Œ - ideal. Of course, 0 โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) . If ๐”ต , ๐”ถ โˆˆ โ„š ฬ‡ ๐“‰ , then ๐”ถ โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) and ๐”ถ โŠ› ๐”ต โˆˆ

๐œ‚ _ ( ๐’ฎ , ฯ‚ ) . Then

C S C ฮท ( ๐”ถ , ๐œ ) โІ ๐’ฎ ๐‘Ž ๐‘› ๐‘‘ C S C ฮท ( ๐”ถ , ๐œ ) โŠ› C S C ฮท ( ๐”ต , ๐œ ) = C S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ ) โІ ๐’ฎ ,

Assuming that ๐”ด is a member of C S C ฮท ( ๐”ต , ๐œ ) , we obtain S C ฮท ( ๐”ž , ๐œ ) = S C ฮท ( ๐”ต , ๐œ ) for some ๐”ž โˆˆ C S C ฮท ( ๐”ต , ๐œ ) . Taking ๐”Ÿ โˆˆ C S C ฮท ( ๐”ถ , ๐œ ) , we obtain S C ฮท ( ๐”Ÿ , ๐œ ) = S C ฮท ( ๐”ถ , ๐œ ) . Since ฮท is CFR, S C ฮท ( ๐”Ÿ โŠ› ๐”ž , ๐œ ) = S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ ) .

Therefore, ๐”Ÿ โŠ› ๐”ž โˆˆ C S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ ) โІ ๐’ฎ . According to the definition of a weak ๐• ๐•Œ - ideal, ๐”ด = ๐”ž โˆˆ

๐’ฎ . Since ๐’ฎ is a weak ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ . Thus, C S C ฮท ( ๐”ต , ๐œ ) โІ ๐’ฎ . Because ๐”ต is a member of ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) .

Similarly, we can prove for โˆจ . Hence, ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) is a weak ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ .

Theorem 3.10

If ๐’ฎ is a strong ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ and ( โ„š ฬ‡ ๐“‰ , ๐’ž ๐’ฎ ๐’ž ฮท ( โ„š ฬ‡ ๐“‰ ; ฯ‚ ) ) be an ๐’ž ๐’ฎ ๐’ž ฮท ( โ„š ฬ‡ ๐“‰ ; ฯ‚ ) - AS of CFR, then

1 . ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) referred as a strong ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ .

2 . ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) referred as a strong ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ .

Proof

(1) Assume that ๐”ต , ๐”ถ โˆˆ โ„š ฬ‡ ๐“‰ , ( ๐”ถ โŠ› ๐”ต ) โˆฉ ฮท ยฏ ( ๐’ฎ , ฯ‚ ) and ๐”ถ โˆˆ ฮท ยฏ ( ๐’ฎ , ฯ‚ ) .

Then C S C ฮท ( ๐”ถ , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ ๐‘Ž ๐‘› ๐‘‘ C S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ , and โˆƒ ๐”ท โˆˆ โ„š ฬ‡ ๐“‰ such that ๐”ท = ๐”ถ โŠ› ๐”ต and ๐”ท โˆˆ ฮท ยฏ ( ๐’ฎ , ฯ‚ ) .

Hence, C S C ฮท ( ๐”ท , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ and โˆƒ ๐”  , ๐”ก โˆˆ ๐’ด s . t . ๐”  โˆˆ C S C ฮท ( ๐”ท , ๐œ ) โˆฉ ๐’ฎ and ๐”ก โˆˆ C S C ฮท ( y , ๐œ ) โˆฉ ๐’ฎ .

Hence S C ฮท ( ๐”  , ๐œ ) = S C ฮท ( ๐”ท , ๐œ ) and S C ฮท ( ๐”ก , ๐œ ) = S C ฮท ( ๐”ถ , ๐œ ) ,

where ๐”  , ๐”ก โˆˆ ๐’ฎ .

Consequently, this suggests that ๐”ท โŠ› ๐”  โˆˆ C S C ฮท ( ๐”ท , ๐œ ) โІ ๐’ฎ and ๐”ถ โŠ› ๐”ก โˆˆ C S C ฮท ( y , ๐œ ) โІ ๐’ฎ . ๐’ฎ is a strong ๐• ๐•Œ - ideal, and ๐”  , ๐”ก , ๐”ท , and ๐”ถ are all in ๐’ฎ .

We have thus demonstrated that ๐”ถ โŠ› ๐”ต โˆฉ C S C ฮท ( ๐”ถ , ๐œ ) โ‰  ฯ• and ๐”ถ โˆˆ C S C ฮท ( ๐”ถ , ๐œ ) .

Since ๐’ฎ is a strong ๐• ๐•Œ - ideal, ๐”ต โˆˆ ๐’ฎ , and so C S C ฮท ( ๐”ต , ๐œ ) โˆฉ ๐’ฎ โ‰  ๐œ™ and ๐”ต โˆˆ ๐œ‚ ยฏ ( ๐’ฎ , ฯ‚ ) .

Similarly, we can prove for โˆจ . Hence, ฮท ยฏ ( ๐’ฎ , ฯ‚ ) is a strong ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ .

(2) If ๐”ต , ๐”ถ โˆˆ โ„š ฬ‡ ๐“‰ , then ๐”ถ โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) and ๐”ถ โŠ› ๐”ต โˆฉ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) .

Assume that ๐”ž and ๐”Ÿ are both belonging to C S C ฮท ( ๐”ท , ๐œ ) and C S C ฮท ( ๐”ถ , ๐œ ) respectively. Our S C ฮท ( ๐”ž , ๐œ ) = S C ฮท ( ๐”ท , ๐œ ) and S C ฮท ( ๐”Ÿ , ๐œ ) = S C ฮท ( ๐”ถ , ๐œ ) are as follows.

Because ฮท is CFR, S C ฮท ( ๐”Ÿ โŠ› ๐”ž , ๐œ ) = S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ ) . A ๐”ฑ in โ„š ฬ‡ ๐“‰ such that ๐”ฑ โˆˆ ๐”ถ โŠ› ๐”ต and ๐”ฑ โˆˆ ๐œ‚ _ ( ๐’ฎ , ฯ‚ )

exists, since ๐”ถ โŠ› ๐”ต โˆฉ ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) .

The statement " ๐”ฑ โˆˆ S C ฮท ( ๐”Ÿ โŠ› ๐”ž , ๐œ ) = S C ฮท ( ๐”ถ โŠ› ๐”ต , ๐œ ) " now suggests that there is a ๐”ท โˆˆ S C ฮท ( ๐”Ÿ โŠ› ๐”ž , ๐œ ) such that S C ฮท ( ๐”ท , ๐œ ) = S C ฮท ( ๐”ฑ , ๐œ ) , and therefore C S C ฮท ( ๐”ฑ , ๐œ ) = ๐ถ S C ฮท ( ๐”ฑ , ๐œ ) โˆˆ ๐’ฎ . As a result, ๐”ท โˆˆ ๐’ฎ .

Alternatively, we have ๐”Ÿ โˆˆ C S C ฮท ( ๐”ถ , ๐œ ) โІ ๐’ฎ .

Since ๐”ž โˆˆ ๐’ฎ , which suggests that C S C ฮท ( ๐”ต , ๐œ ) โІ ๐’ฎ , since ๐’ฎ is a strong ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ .

Hence, ๐”ต belongs to ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) . Similarly, we can prove for โˆจ .

Hence, ๐œ‚ _ ( ๐’ฎ , ฯ‚ ) is a strong ๐• ๐•Œ - ideal of โ„š ฬ‡ ๐“‰ .

COMPARATIVE ANALYSIS AND DISCUSSION

This section is a comparative study of the suggested CSC-FR based approximation framework and discusses the conceptual advantages of this framework over existing frameworks. In particular, we point out the limitations of the quantale rough approximation schemes of congruence-based and of soft-relation-based, the research gap, and the motivation for the study of rough approximations of quantale substructures through CSCs under FRs.

The proposed one is a contribution to the theory of quantales and other suggestions of ideals, where LA and UA are introduced to the major substructures, such as ๐• ๐•Œ - subalgebras, ๐• ๐•Œ - ideals, weak ๐• ๐•Œ - ideals and strong ๐• ๐•Œ - ideals. It is based on core neighborhood structures induced by FRs to provide a more flexible approximation mechanism in quantales, rather than using equivalence or congruence classes. This can be very helpful in situations where the granularity of the partition is too fine, and the core relational relationships require a description of their behavior. The study of ๐• ๐•Œ - subalgebras, ๐• ๐•Œ - ideals, weak ๐• ๐•Œ - ideals, and strong ๐• ๐•Œ - ideals can be helpful in the development of new theoretical tools for representing uncertainty and relational dependence in algebraic systems in a broader way.

Specific comparison of our proposed framework with some of the existing methodologies is as follows:

(1) Generalized soft-relation based approximations of fuzzy substructures in quantales were

extended to semigroups and quantales by Qurashi. However, rough approximations of fuzzy ๐• ๐•Œ - substructures using CSCs induced by FRs have not been systematically investigated. In contrast, in this article we explored a few characterizations of quantale substructures induced by the FRs, resulting in an innovative approximation framework for quantales.

(2) Finding suitable equivalence or congruence relations is not typically easy in algebraic

structures, and may be limiting for coarse approximation. The existing quantale-roughness paradigms, accordingly, require extra structures specifications Error! Reference source not found.. Contrary to this, the presented approach does not need an equivalence or a congruence relation: the theory is placed in a more flexible environment because it uses CSCs that are extracted from FRs.

(3) The rough approximation notion has been applied in some previous works on rough

approximations in quantales and semigroups using soft relations, in which aftersets and foresets are used [29,31,32]. The approach in the present article consists in the use of approximations of quantale substructures based on CSCs created from FRs (or, if necessary, on associated compatibility conditions). This is a different approach from the partition classes or parameterized soft families which are typically used.

(4) Furthermore, Qurashi and Kanwal and Shabir studied approximation methods for fuzzy

substructures of semigroups and quantales, respectively, using soft relations (usually aftersets and foresets) [30,34]. The proposed work leads to the development of CSCs from a complete/FR framework (refer to our setting), and uses these CSCs to describe lower and upper approximations of fuzzy subsets and ๐• ๐•Œ - Ideal-type substructures respectively. This CSC-driven methodology is, to our knowledge, an original approach in the context of the quantale environment and is thus a fresh perspective in the comparative context.

(5) A comparison of the conceptual characteristics of the three approximation frameworks

(congruence-based, soft relation-based, and the suggested CSC-based model) is recapitulated in Table 6. It is worth noticing that the comparison is performed for a fixed ฯ‚ - cut level ฯ‚ โˆˆ [ 0 , 1 ] . In the proposed framework, we have ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) : = { ๐”ž โˆˆ ๐’ณ : ฮท ( ๐”Ÿ , ๐”ž ) โ‰ฅ ฯ‚ } and ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ 1 ; ฯ‚ ) : = { ๐”Ÿ 2 โˆˆ ๐’ด : ๐‘† ๐ถ ฮท ( ๐”Ÿ 1 ; ฯ‚ ) = ๐‘† ๐ถ ฮท ( ๐”Ÿ 2 ; ฯ‚ ) } , where ฮท is FR from ๐’ณ to ๐’ด .

FeatureCongruence-basedSoft relation-basedOSC-FR-based (Proposed)
Underlying relationEquivalence or congruenceSoft relation (aftersets/foresets )FR ฮท : ๐’ณ ร— ๐’ด โŸถ [ 0 , 1 ]
Classes typePartition class [ ๐”Ÿ ] Parameterized families (e.g., aftersets ๐’œ ( ( ๐”Ÿ ) ) Core families ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) (generally not a partition)
LA criterion ๐”Ÿ โˆˆ ฮท ๐‘… ( ๐’ด ; ๐‘Ÿ ) โŸบ [ ๐”Ÿ ] ๐‘… โІ ๐’ด ๐”Ÿ โˆˆ ฮท ๐‘… ( ๐’ด ; ๐‘Ÿ ) โŸบ ๐’œ ( ๐”Ÿ ) โІ ๐’ด ๐”Ÿ โˆˆ ฮท _ ( ๐’ด ; ๐‘Ÿ ) โŸบ ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) โІ ๐’ด
UA criterion ๐”Ÿ โˆˆ ฮท ๐‘… ( ๐’ด ; ๐‘Ÿ ) โŸบ [ ๐”Ÿ ] ๐‘… โˆฉ ๐’ด โ‰  โˆ… ๐”Ÿ โˆˆ ฮท ๐‘… ( ๐’ด ; ๐‘Ÿ ) โŸบ ๐’œ ( ๐”Ÿ ) โˆฉ ๐’ด โ‰  โˆ… ๐‘ฅ โˆˆ ฮท ยฏ ( ๐’ด ; ๐‘Ÿ ) โŸบ ๐ถ ๐‘† ๐ถ ฮท ( ๐”Ÿ ; ฯ‚ ) โˆฉ ๐’ด โ‰  โˆ…
Requirements to describe approximations Existence of a congruence; partition- based structureExistence of soft relation and parameters; no congruence neededNo congruence required
Handles Core neighbourhoodsNo (partition- based)Limited / parameter-driven Yes (inherent core via CSCs)
Captures indirect membership NoNoYes (membership via core of successor neighborhoods )
Construction difficulty (conceptual) Often restrictive (finding congruences can be nontrivial)Moderate (depends on choice of parameters/soft sets)Flexible (depends mainly on ฮท and ฯ‚ )
Table 6: Approximation Analysis of Various Models by Comparison

CONCLUSION AND FUTURE RESEARCH DIRECTIONS

In this study, we have formulated a rough approximation system for the ๐• ๐•Œ - algebraic structures based on CSCs and FR. The primary goal was to create a systematic relationship between the fuzzy relational uncertainty and the algebraic roughness using some information granules such as SCs and CSCs in the construction of lower and upper approximations. In contrast with classical rough-set models using mainly crisp equivalence relations, the proposed models are based on graded relationships, realized by FRs, and the interaction between the approximations and the algebraic structure of ๐• ๐•Œ - algebras is explored. The study first established the foundation concepts to build the rough approximation based on CSC. The paper focused on the lower and upper approximations related to ๐• ๐•Œ - subalgebras and various classes of ๐• ๐•Œ - ideals, based on these ideas. Specifically, the conditions were determined under which the proposed approximations are ๐• ๐•Œ - subalgebra, ๐• ๐•Œ - ideal, weak ๐• ๐•Œ - ideal and strong ๐• ๐•Œ - ideal.

The results presented here show that the approximation mechanism proposed is not just a set theoretic construct but one that can interact with the algebraic operations and ideal structures of ๐• ๐•Œ - algebras. Another contribution of the study is the extension of the proposed framework to quantales. In the quantale setting, the binary operation is coupled with a full-lattice structure, giving the user a more complex algebraic setting to work in. In this context, rough ๐• ๐•Œ - ideals, rough weak ๐• ๐•Œ - ideals, and rough strong ๐• ๐•Œ - ideals are studied and the corresponding structural results are obtained. Therefore, the proposed framework is not limited to the original ๐• ๐•Œ - algebraic framework, and can be used as a foundation for investigating roughness of CSC in a wider class of ordered algebraic structures.

FUTURE RESEARCH DIRECTIONS

We can design computational processes to generate automatically successor and core successor classes and lower and upper approximations for finite information systems. These algorithms would allow for experimental testing of the results and would allow for systematic comparison with other rough-set approaches.

Future research may be directed towards adapting or designing fuzzy-relation thresholds instead of making them a priori. It can enhance the strength of the approximation mechanism in the case of large or noisy information systems.

The algebraic structure of the suggested rough structures may be further explored by the help of the homomorphisms, congruence relations, quotient structures, closure systems and lattice-theoretic representations.

In conclusion, this study provides a theoretical basis for the fusion of FR induced CSCs and rough JU-algebraic structures and quantales. The results illustrate the possibilities of converting the relational uncertainty into algebraically significant rough structures, which have retained the crucial subalgebraic and ideal features. The proposed framework thus serves as a foundation for further investigations in the area of rough set theory, fuzzy relations, algebraic logic and quantale theory.

AUTHOR CONTRIBUTIONS

M.Y participated in the conceptualization, investigation, validation, visualization, data creation, review, administration, writing the original draft, and editing of the manuscript. C. K participated in the administration, validation, visualization, review and editing of the manuscript. All authors read and approved the final manuscript.

AVAILABILITY OF DATA AND MATERIALS

All data that support the findings of this study are included in the article.

CONFLICTS OF INTEREST

The authors declare no conflict of interest

REFERENCES

    1. Zhao J, Zhao T. Deep interval type-2 generalized fuzzy hyperbolic tangent system for nonlinear regression prediction. Engineering Applications of Artificial Intelligence. 2025;141:109737. [Crossref] [Google Scholar]
    2. Kizielewicz B, Wiฤ™ckowski J, Saล‚abun W. Fuzzy normalization-based multi-attributive border approximation area comparison. Engineering Applications of Artificial Intelligence. 2025;141:109736. [Crossref] [Google Scholar] [PubMed]
    3. Pawlak R, Wyrozฤ™bski P, Pietras I, Parys J. The Use of Machine Learning in Enhancing Data and Information Management Processes in the Context of Knowledge Management. e-mentor. 2025;108(1):52-62. [Crossref] [Google Scholar] [PubMed]
    4. Khelifa R, Hamza T, Fatma B. Fuzzy task assignment in heterogeneous distributed multi-robot system: R. Khelifa et al. Artificial Intelligence Review. 2024;58(1):14. [Crossref] [Google Scholar]
    5. Pawlak Z. Rough sets. International journal of computer & information sciences. 1982;11(5):341-56. [Crossref] [Google Scholar]
    6. Yao YY. Relational interpretations of neighborhood operators and rough set approximation operators. Information sciences. 1998;111(1-4):239-59. [Crossref] [Google Scholar]
    7. Mareay R. Generalized rough sets based on neighborhood systems and topological spaces. Journal of the Egyptian Mathematical Society. 2016;24(4):603-8. [Crossref] [Google Scholar]
    8. Kuroki N. Rough ideals in semigroups. Information sciences. 1997;100(1-4):139-63. [Crossref] [Google Scholar]
    9. Biwas, R., & Nanda, S. (1994). Rough Groups and Rough Subgroups. Bulletin of the Polish Academy of Sciences-Mathematics, 42(3), 251.
    10. Li F, Yin Y. The ϑ-lower and T-upper fuzzy rough approximation operators on a semigroup. Information Sciences. 2012;195:241-55. [Crossref] [Google Scholar]
    11. Qi G, Liu W. Rough operations on Boolean algebras. Information Sciences. 2005;173(1-3):49-63. [Crossref] [Google Scholar]
    12. Davvaz B. Roughness in rings. Information Sciences. 2004;164(1-4):147-63. [Crossref] [Google Scholar]
    13. Ameri R, Moradian R, Borzooei RA. Rough set theory applied to hyper BCK-algebra. Ratio Mathematica. 2014 Jun;26(1):3-20. [Crossref] [Google Scholar]
    14. Dudek W, Jun YB, Kim HS. Rough set theory applied to BCI-algebras. Quasigroups and Related Systems. 2002;9(2):45-54. [Crossref] [Google Scholar]
    15. Jun YB, Kim KH. Rough set theory applied to BCC-algebras. InInternational Mathematical Forum 2007 (Vol. 2, No. 41-44, pp. 2023-2029). [Crossref] [Google Scholar]
    16. Zadeh LA. Fuzzy sets. Information and control. 1965;8(3):338-53. [Crossref] [Google Scholar]
    17. Gulistan M, Hongbin Y, Pedrycz W, Rahim M, Amin F, Khalifa HA. p, q, r-Fractional fuzzy sets and their aggregation operators and applications: M. Gulistan et al. Artificial intelligence review. 2024;57(12):346. [Crossref] [Google Scholar]
    18. Mao X, Zhou H. The application of rough set theory in pseudo-BCK-algebra. J Math Res Appl. 2016;36(1):23-35. [Google Scholar]
    19. Mostafa SM, Abd-Elnaby MA, Yousef MMM. Fuzzy ideals of KU-algebras. Int Math Forum. 2011;6(63):3139-3149. [Google Scholar]
    20. Ansari MA, Koam ANA. Rough approximations in KU-algebras. Ital J Pure Appl Math. 2018;(40):679-691. [Google Scholar]
    21. Pradhan A, Muhiuddin G, Shukla RK, Alsubie T. SR-fuzzy subalgebras and ideals in BCK/BCI-algebras. Fuzzy Inf Eng. 2025;17(4):395-407. [Crossref] [Google Scholar]
    22. Al-Hmouz R, Pedrycz W, Ammari A. Counterfactuals in fuzzy relational models. Artif Intell Rev. 2024;57(12):343. [Crossref] [Google Scholar]
    23. Pelletier FJ. Review of Petr Hájek. Metamathematics of fuzzy logic. Bull Symb Log. 2000;6(3):342-346. [Google Scholar]
    24. Iampan A. A new branch of the logical algebra: UP-algebras. J Algebra Relat Top. 2017;5(1):35-54. [Google Scholar]
    25. Ansari MA. Rough set theory applied to JU-algebras. Int J Math Comput Sci. 2021;16(4):1371-1384. [Google Scholar]
    26. Wu WZ, Mi JS, Zhang WX. Generalized fuzzy rough sets. Inf Sci. 2003;151:263-282. [Crossref] [Google Scholar]
    27. Prasertpong R, Siripitukdet M. On rough sets induced by fuzzy relations approach in semigroups. Open Math. 2018;16(1):1634-1650. [Crossref] [Google Scholar]
    28. Qurashi SM, Almutairi B, Kanwal RS, Krstiฤ‡ M, Yousaf M. Rough substructures based on overlaps of successor in quantales under serial fuzzy relations. IEEE Access. 2023;11:88778-88794. [Crossref] [Google Scholar]
    29. Qurashi SM, Kanwal RS, Shabir M, Ali K. Generalized roughness of fuzzy substructures in quantales with respect to soft relations. J Intell Fuzzy Syst. 2021;40(6):10435-10452. [Crossref] [Google Scholar]
    30. Qurashi SM, Shabir M. Roughness in quantale modules. J Intell Fuzzy Syst. 2018;35(2):2359-2372. [Crossref] [Google Scholar]
    31. Qurashi SM, Gilani KZ, Shabir M, Gulzar M, Alam A. Soft relations applied to the substructures of quantale module and their approximation. Complexity. 2022;2022:9073503. [Crossref] [Google Scholar]
    32. Qurashi SM, Tawfiq F, Xin Q, Kanwal RS, Gilani KZ. Different characterization of soft substructures in quantale modules dependent on soft relations and their approximations. AIMS Math. 2023;8(5):11684-11708. [Crossref] [Google Scholar]
    33. Kanwal RS, Qurashi SM, Shabir M. Generalized approximation of substructures in quantales by soft relations. Comput Appl Math. 2020;39(1):24. [Crossref] [Google Scholar]
    34. Yousaf M, Qurashi SM, Awais HM, Iqbal MAB, Raza MZ, Sadaf M, et al. Generalization of rough bi-ideals in quantales based on cores of successor classes under fuzzy relations. Int J Comput Intell Syst. 2025;18(1):291. [Crossref] [Google Scholar]
Citation: Yousaf M, Kodsueb C (2026). Rough JU-Algebras in Quantales Via Core Successor Classes Based on Fuzzy Relations. J. Math. Phys. Mech. Vol.1 Iss.1, September (2026), pp:23-44.
Copyright: © 2026 Muhammad Yousaf, Chadaphorn Kodsueb. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
×

Contact Emails

mathematics@confmeets.net
support@confmeets.com
finance@confmeets.com
editorial@confmeets.com

Article Processing Timeline

2-5 Days Initial Quality & Plagiarism Check
25-35
Days
Peer Review Feedback
45-60 Days Total article processing time

Why Publish with us?

  • Rigorous Peer Review
  • Rapid Publication
  • Global Open Access
  • Crossref DOI
  • International Editorial Board
  • Global Visibility
  • Plagiarism Screening
  • Dedicated Author Support
  • Special Issues
  • Transparent Publication Process
  • High Publishing Standards
  • Worldwide Research Community
  • Journal Flyer

    Flyer Image