Summary 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].
[1]
R. Milewski.
More on the Lattice of Many Sorted Equivalence Relations
,
1996
.
[2]
Adam Naumowicz,et al.
Mizar: State-of-the-art and Beyond
,
2015,
CICM.
[3]
S. Zukowski.
Introduction to Lattice Theory
,
1990
.
[4]
Adam Grabowski,et al.
Efficient Rough Set Theory Merging
,
2014,
CS&P.
[5]
Marek Chmur.
The Lattice of Natural Numbers and The Sublattice of it. The Set of Prime Numbers
,
1991
.
[6]
Adam Grabowski,et al.
Rough Set Theory from a Math-Assistant Perspective
,
2007,
RSEISP.
[7]
Adam Grabowski,et al.
Mechanizing Complemented Lattices Within Mizar Type System
,
2015,
Journal of Automated Reasoning.
[8]
E. T. Schmidt,et al.
On a problem of M. H. Stone
,
1957
.
[9]
W. C. Mcginnis.
Ideals
,
1925,
Free Speech.
[10]
Grzegorz Zwara,et al.
The Divisibility of Integers and Integer Relatively Primes 1
,
1990
.
[11]
Grzegorz Bancerek,et al.
Complete Lattices
,
1992
.
[12]
Kenneth Halpern August.
The Cardinal Numbers
,
1888,
Nature.
[13]
Adam Grabowski.
Two Axiomatizations of Nelson Algebras
,
2015,
Formaliz. Math..
[14]
Adam Grabowski,et al.
Prime Filters and Ideals in Distributive Lattices
,
2013,
Formaliz. Math..
[15]
Rafał Kwiatek.
Factorial and Newton Coefficients Rafał Kwiatek Nicolaus
,
1990
.
[16]
G. Bancerek.
Filters - Part II. Quotient Lattices Modulo Filters and Direct Product of Two Lattices
,
1991
.
[17]
M. Jastrzębska,et al.
On the Properties of the Möbius Function
,
2006
.
[18]
Adam Grabowski,et al.
On the Computer-Assisted Reasoning about Rough Sets
,
2004,
MSRAS.
[19]
Artur Korni,et al.
Some Basic Properties of Many Sorted Sets
,
1996
.
[20]
G. Bancerek,et al.
Ordinal Numbers
,
2003
.
[21]
Jouni Järvinen,et al.
Lattice Theory for Rough Sets
,
2007,
Trans. Rough Sets.
[22]
Adam Grabowski,et al.
On Square-Free Numbers
,
2013,
Formaliz. Math..
[23]
Jolanta Kamiénska.
Homomorphisms of Lattices , Finite Join and Finite Meet
,
2004
.