On the Construction of Rough Quotient Modules in Finite Approximation Spaces

Let S be a set and φ an equivalence relation on S. The pair (S, φ) forms an approximation space, where the relation φ partitions S into mutually disjoint equivalence classes. For any subset B' ⊆ S, the lower approximation Apr(B') is defined as the union of all equivalence classes entirely contained in B', while the upper approximation Apr(B') is the union of all equivalence classes that have a non-empty intersection with B'. The subset B' is called a rough set in (S, φ) if Apr(B') ≠ Apr(B'). If, in addition, B' satisfies certain algebraic conditions, it is termed a rough module. This paper investigates the construction of rough quotient rings and rough quotient modules within such approximation spaces. The approach is developed using finite sets to facilitate the algebraic formulation and analysis of these rough structures.

Authors

Institutions

Publication Details

Journal
Integra Journal of Integrated Mathematics and Computer Science
Published
2025-03-17
DOI
https://doi.org/10.26554/integrajimcs.20252116
Primary Topic
Rough Sets and Fuzzy Logic
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the Construction of Rough Quotient Modules in Finite Approximation Spaces

Yunita Anwar, Ahmad Faisol, Fitriani Fitriani, Lisa Adelia
Integra Journal of Integrated Mathematics and Computer Science
Rough Sets and Fuzzy Logic
article

On the Construction of Rough Quotient Modules in Finite Approximation Spaces

Yunita Anwar, Ahmad Faisol, Fitriani Fitriani, Lisa Adelia
article en

Abstract

Let S be a set and φ an equivalence relation on S. The pair (S, φ) forms an approximation space, where the relation φ partitions S into mutually disjoint equivalence classes. For any subset B' ⊆ S, the lower approximation Apr(B') is defined as the union of all equivalence classes entirely contained in B', while the upper approximation Apr(B') is the union of all equivalence classes that have a non-empty intersection with B'. The subset B' is called a rough set in (S, φ) if Apr(B') ≠ Apr(B'). If, in addition, B' satisfies certain algebraic conditions, it is termed a rough module. This paper investigates the construction of rough quotient rings and rough quotient modules within such approximation spaces. The approach is developed using finite sets to facilitate the algebraic formulation and analysis of these rough structures.

Integra Journal of Integrated Mathematics and Computer ScienceVol. 2(1)
Lampung University (ID), University of Muhammadiyah Mataram (ID)
Openalex Percentile: Top 81%
Rough Sets and Fuzzy Logic
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.