English

Rough sets determined by tolerances

Rings and Algebras 2015-04-30 v2

Abstract

We show that for any tolerance RR on UU, the ordered sets of lower and upper rough approximations determined by RR form ortholattices. These ortholattices are completely distributive, thus forming atomistic Boolean lattices, if and only if RR is induced by an irredundant covering of UU, and in such a case, the atoms of these Boolean lattices are described. We prove that the ordered set RS\mathit{RS} of rough sets determined by a tolerance RR on UU is a complete lattice if and only if it is a complete subdirect product of the complete lattices of lower and upper rough approximations. We show that RR is a tolerance induced by an irredundant covering of UU if and only if RS\mathit{RS} is an algebraic completely distributive lattice, and in such a situation a quasi-Nelson algebra can be defined on RS\mathit{RS}. We present necessary and sufficient conditions which guarantee that for a tolerance RR on UU, the ordered set RSX\mathit{RS}_X is a lattice for all XUX \subseteq U, where RXR_X denotes the restriction of RR to the set XX and RSX\mathit{RS}_X is the corresponding set of rough sets. We introduce the disjoint representation and the formal concept representation of rough sets, and show that they are Dedekind--MacNeille completions of RS\mathit{RS}.

Keywords

Cite

@article{arxiv.1303.6332,
  title  = {Rough sets determined by tolerances},
  author = {Jouni Järvinen and Sándor Radeleczki},
  journal= {arXiv preprint arXiv:1303.6332},
  year   = {2015}
}

Comments

Revised version (28 pages, 1 figure)

R2 v1 2026-06-21T23:48:07.227Z