IDEAS home Printed from https://ideas.repec.org/a/hin/jjmath/8990430.html
   My bibliography  Save this article

Applications of δ-Open Sets via Separation Axioms, Covering Properties, and Rough Set Models

Author

Listed:
  • Tareq M. Al-Shami
  • Muneerah Al Nuwairan

Abstract

In this article, we make use of δ-open sets to establish some topological concepts related to separation axioms and covering properties and to propose novel topological rough set models. We first demonstrate that the classes of regular-open and δ-open subsets of a finite topological space are equivalent when this space has the property of ∂A∩∂B⊆∂A∪B for subsets A,B, where ∂ means the boundary topological operator. Then, we prove the equivalence between δTi and Ti in the cases of i=2,21/2 and construct an illustrative example showing that δ-topology is a proper class of an original topology in these two cases.With the help of counterexamples, we demonstrate that a normal (resp., a regular) space is a stronger condition than δ-normal (resp., δ-regular) and show that every Ti-space is δTi for each i=3,4. We also reveal the relationships between the covering properties studied herein (compactness, Lindelöf, local compactness, and local Lindelöf) and investigate some equivalences when the topological space is δT2. Furthermore, we discuss how the introduced concepts behave in the spaces of product topology, box topology, and sum topology. Finally, we set up a new framework for rough set models based on δ-open sets and examine its advantages and limitations in terms of retaining the characterizations of lower and upper approximations and increasing accuracy measures. An algorithm is designed to determine whether a subset is δ-definable or δ-rough.

Suggested Citation

  • Tareq M. Al-Shami & Muneerah Al Nuwairan, 2025. "Applications of δ-Open Sets via Separation Axioms, Covering Properties, and Rough Set Models," Journal of Mathematics, Hindawi, vol. 2025, pages 1-12, August.
  • Handle: RePEc:hin:jjmath:8990430
    DOI: 10.1155/jom/8990430
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/jmath/2025/8990430.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/jmath/2025/8990430.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/jom/8990430?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jjmath:8990430. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.