# A Note on Rough Set Algebra and Core Regular Double Stone Algebras

arXiv: https://arxiv.org/abs/2101.02313 · HTML: https://mlsanity.com/paper/2101.02313/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 0 of its 16 references that are in the map.
- First posted on arXiv 7 Jan 2021.

## Abstract (arXiv)

Rough Set Theory (RST), first introduced by Pawlak in 1982, is an approach for dealing with information systems where knowledge is uncertain or incomplete.citePawlak It is of fundamental importance in many subfields of artificial intelligence and cognitive science.citeRSTppf Given a universe U with an equivalence relation θ, the pair langle U,θrangle is referred to as an information system and we denote its collection of rough sets Rθ. In our main Theorem we show Rθ with |θu| > 1 forall u ∈ U to be isomorphic to core regular double Stone algebras, CRDSA, that are complete and atomic, and that the crisp, or definable, sets form a complete atomistic Boolean algebra. These guarantees of infimum/supremeum for arbitrary subsets and formulations in terms of fundamental elements are likely useful if dealing with equivalence relations with an infinite number of partitions, such as projective Hilbert spaces. We further derive that every CRDSA is isomorphic to a subalgebra of a principal rough set algebra, Rθ, for some approximation space langle U,θ rangle. In our main Corollary we show explicitly how to embed Rθ into the CRDSA and first demonstrate by extending the culminating finite example of citeRCRDSA. As our capstone, we consider the projective Hilbert space of complex numbers, mathbbC and show, among other things, the power set of the set of pure states is a complete, atomistic Boolean algebra. In closing, we suggest other Quantum relevant applications that may be useful, such as Hilbert spaces of operators