Stone Lattices
Formalized Mathematics · 2015
DOI: 10.1515/forma-2015-0031 ↗Kurz gefasst
Fachartikel in der Zeitschrift Formalized Mathematics, 2015. Verfasst von Adam Grabowski. Die Arbeit wurde bisher 2-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY-SA 3.0).
Abstract (Originalsprache)
The article continues the formalization of the lattice theory (as structures with two binary operations, not in terms of ordering relations). In the paper, the notion of a pseudocomplement in a lattice is formally introduced in Mizar, and based on this we define the notion of the skeleton and the set of dense elements in a pseudocomplemented lattice, giving the meet-decomposition of arbitrary element of a lattice as the infimum of two elements: one belonging to the skeleton, and the other which is dense. The core of the paper is of course the idea of Stone identity a * ⊔ a * * = T , $$a^* \sqcup a^{**} = {\rm{T}},$$ which is fundamental for us: Stone lattices are those lattices L , which are distributive, bounded, and satisfy Stone identity for all elements a ∈ L. Stone algebras were introduced by Grätzer and Schmidt in [18]. Of course, the pseudocomplement is unique (if exists), so in a pseudcomplemented lattice we defined a * as the Mizar functor (unary operation mapping every element to its pseudocomplement). In Section 2 we prove formally a collection of ordinary properties of pseudocomplemented lattices. All Boolean lattices are Stone, and a natural example of the lattice which is Stone, but not Boolean, is the lattice of all natural divisors of p 2 for arbitrary prime number p (Section 6). At the end we formalize the notion of the Stone lattice B [2] (of pairs of elements a, b of B such that a ⩽ b ) constructed as a sublattice of B 2 , where B is arbitrary Boolean algebra (and we describe skeleton and the set of dense elements in such lattices). In a natural way, we deal with Cartesian product of pseudocomplemented lattices. Our formalization was inspired by [17], and is an important step in formalizing Jouni Järvinen Lattice theory for rough sets [19], so it follows rather the latter paper. We deal essentially with Section 4.3, pages 423–426. The description of handling complemented structures in Mizar [6] can be found in [12]. The current article together with [15] establishes the formal background for algebraic structures which are important for [10], [16] by means of mechanisms of merging theories as described in [11].
Zitieren
APA
Grabowski, A. (2015). Stone Lattices. Formalized Mathematics. https://doi.org/10.1515/forma-2015-0031
Vancouver
Grabowski A. Stone Lattices. Formalized Mathematics. 2015. doi:10.1515/forma-2015-0031
BibTeX
@article{Grabowski2015,
author = {Grabowski, Adam},
title = {Stone Lattices},
journal = {Formalized Mathematics},
year = {2015},
doi = {10.1515/forma-2015-0031}
}
EUVIMED