Abstract

We call a quadruple $\mathcal{W}:=\langle F,U,\Omega,\Lambda \rangle$, where $U$ and $\Omega$ are two given non-empty finite sets, $\Lambda$ is a non-empty set and $F$ is a map having domain $U\times \Omega$ and codomain $\Lambda$, a pairing on $\Omega$. With this structure we associate a set operator $M_{\mathcal{W}}$ by means of which it is possible to define a preorder $\ge_{\mathcal{W}}$ on the power set $\mathcal{P}(\Omega)$ preserving set-theoretical union. The main results of our paper are two representation theorems. In the first theorem we show that for any finite lattice $\mathbb{L}$ there exist a finite set $\Omega_{\mathbb{L}}$ and a pairing $\mathcal{W}$ on $\Omega_\mathbb{L}$ such that the quotient of the preordered set $(\mathcal{P}(\Omega_\mathbb{L}), \ge_\mathcal{W})$ with respect to its symmetrization is a lattice that is order-isomorphic to $\mathbb{L}$. In the second result, we prove that when the lattice $\mathbb{L}$ is endowed with an order-reversing involutory map $\psi: L \to L$ such that $\psi(\hat 0_{\mathbb{L}})=\hat 1_{\mathbb{L}}$, $\psi(\hat 1_{\mathbb{L}})=\hat 0_{\mathbb{L}}$, $\psi(\alpha) \wedge \alpha=\hat 0_{\mathbb{L}}$ and $\psi(\alpha) \vee \alpha=\hat 1_{\mathbb{L}}$, there exist a finite set $\Omega_{\mathbb{L},\psi}$ and a pairing on it inducing a specific poset which is order-isomorphic to $\mathbb{L}$.

Highlights

  • Granular Computing is an emerging paradigm which relies on the idea of partitioning a set of objects in some granules depending on some given criteria [29, 30, 38, 39]

  • We prove a representation result for the closure system M(W) and we insert it within a general research perspective involving the interrelations between combinatorics, order theory and topological structures

  • In this paper we continued the investigations of some links between granular computing (GrC), closure systems and algebraic order theory

Read more

Summary

Introduction

Granular Computing (briefly GrC) is an emerging paradigm which relies on the idea of partitioning a set of objects in some granules depending on some given criteria [29, 30, 38, 39]. We show that for any finite complemented involutory lattice (L, ψ), there exist a the electronic journal of combinatorics 27(1) (2020), #P1.19 finite set ΩL,ψ and a pairing W on ΩL,ψ such that MW(∅) = ∅ and for which the poset of all normally extensible subsets with respect to set theoretical inclusion is a complete lattice order-isomorphic to L (see Theorem 22). There is another lattice which is order isomorphic to the dual closure lattice M(W), whose role is relevant when ones uses micro and macro granular representations induced by information tables (see [14] for details) Such a lattice is obtained by taking firstly the set G(W) := {[A]≈W : A ∈ M(W)}, and by considering the partial order on G(W) defined by: [A]≈W [A ]≈W : ⇐⇒ A ⊆∗ A , for any [A]≈W, [A ]≈W ∈ G(W). To a specific pairing, we shall visualize the lattice G(W) in Example 7

Representation Theorem for Closure Systems
Union Additive Relations and a Related Lattice Representation Theorem
Pairing Representation of Finite Complemented Involutory Lattices
Findings
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call