Three Classes of Orthomodular Lattices 3

Similar documents
Boolean Algebras. Chapter 2

Remarks on Concrete Orthomodular Lattices 1

Lattice Theory Lecture 4. Non-distributive lattices

COMPACT ORTHOALGEBRAS

GENERALIZED DIFFERENCE POSETS AND ORTHOALGEBRAS. 0. Introduction

Sets and Motivation for Boolean algebra

Distributive MV-algebra Pastings

Finite homogeneous and lattice ordered effect algebras

The Square of Opposition in Orthomodular Logic

Atomic effect algebras with compression bases

Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations

CD I')I)() Birkh 川 IScr Vcrlag. Ba~cl. In Memory o[ Evelyn Ne/son. OML L has the Block Exlensioll. Property. Algebra Universalis, 27 (1990) 1-9

arxiv: v1 [math.ra] 1 Apr 2015

Orthomodular Lattices

Universal Algebra for Logics

Boolean Algebra CHAPTER 15

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 1. I. Foundational material

cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska

ANNIHILATOR IDEALS IN ALMOST SEMILATTICE

Orthomodular Lattices

2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.

EQUATIONS OF TOURNAMENTS ARE NOT FINITELY BASED

DOCTORAL THESIS SIMION STOILOW INSTITUTE OF MATHEMATICS OF THE ROMANIAN ACADEMY BOOLEAN SUBALGEBRAS AND SPECTRAL AUTOMORPHISMS IN QUANTUM LOGICS

Tense Operators on Basic Algebras

Class Notes on Poset Theory Johan G. Belinfante Revised 1995 May 21

Distributivity conditions and the order-skeleton of a lattice

Quantum logics with given centres and variable state spaces Mirko Navara 1, Pavel Ptak 2 Abstract We ask which logics with a given centre allow for en

Generalized Pigeonhole Properties of Graphs and Oriented Graphs

UNIVERSALITY OF THE LATTICE OF TRANSFORMATION MONOIDS

2. Introduction to commutative rings (continued)

We will begin our study of topology from a set-theoretic point of view. As the subject

Lattice Theory Lecture 5. Completions

Topological Test Spaces 1 Alexander Wilce Department of Mathematical Sciences, Susquehanna University Selinsgrove, Pa

Partial, Total, and Lattice Orders in Group Theory

Sequential product on effect logics

Definition: A binary relation R from a set A to a set B is a subset R A B. Example:

Lecture 4. Algebra, continued Section 2: Lattices and Boolean algebras

Equational Logic. Chapter Syntax Terms and Term Algebras

Section Summary. Relations and Functions Properties of Relations. Combining Relations

CONDITIONS THAT FORCE AN ORTHOMODULAR POSET TO BE A BOOLEAN ALGEBRA. 1. Basic notions

Free Subgroups of the Fundamental Group of the Hawaiian Earring

P.M. Cohn. Basic Algebra. Groups, Rings and Fields. m Springer

10. Finite Lattices and their Congruence Lattices. If memories are all I sing I d rather drive a truck. Ricky Nelson

Abstract Measure Theory

The lattice of varieties generated by residuated lattices of size up to 5

On minimal models of the Region Connection Calculus

Lecture Notes on Discrete Mathematics. October 15, 2018 DRAFT

CHAPTER 1. Relations. 1. Relations and Their Properties. Discussion

Congruence Coherent Symmetric Extended de Morgan Algebras

2MA105 Algebraic Structures I

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

1. To be a grandfather. Objects of our consideration are people; a person a is associated with a person b if a is a grandfather of b.

The Gauss-Jordan Elimination Algorithm

Section 2: Classes of Sets

A locally finite characterization of AE(0) and related classes of compacta

Characterizations of Strongly Regular Graphs: Part II: Bose-Mesner algebras of graphs. Sung Y. Song Iowa State University

Some Basic Notations Of Set Theory

Posets, homomorphisms and homogeneity

ON GENERATING DISTRIBUTIVE SUBLATTICES OF ORTHOMODULAR LATTICES

On a quasi-ordering on Boolean functions

Jónsson posets and unary Jónsson algebras

ABOUT THE CLASS AND NOTES ON SET THEORY

Coreflections in Algebraic Quantum Logic

Foundations of non-commutative probability theory

A Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries

Hamiltonian Tournaments and Gorenstein Rings

2 C. A. Gunter ackground asic Domain Theory. A poset is a set D together with a binary relation v which is reexive, transitive and anti-symmetric. A s

Notes on ordinals and cardinals

Chapter 2 - Basics Structures MATH 213. Chapter 2: Basic Structures. Dr. Eric Bancroft. Fall Dr. Eric Bancroft MATH 213 Fall / 60

Causal completeness of probability theories results and open problems

ADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS

On the variety of linear recurrences and numerical semigroups

Vector Spaces. Chapter 1

Set theory. Math 304 Spring 2007

Alternative Probability Theories for Cognitive Psychology

Congruence Boolean Lifting Property

CHAPTER 1. Preliminaries. 1 Set Theory

P-Spaces and the Prime Spectrum of Commutative Semirings

Course 212: Academic Year Section 1: Metric Spaces

1.4 Equivalence Relations and Partitions

DERIVATIONS. Introduction to non-associative algebra. Playing havoc with the product rule? BERNARD RUSSO University of California, Irvine

On varieties of modular ortholattices which are generated by their finite-dimensional members

mat.haus project Zurab Janelidze s Lectures on UNIVERSE OF SETS last updated 18 May 2017 Stellenbosch University 2017

Economics 204 Fall 2011 Problem Set 1 Suggested Solutions

Introduction to Probability and Stocastic Processes - Part I

Embedding theorems for normal divisible residuated lattices

PETER A. CHOLAK, PETER GERDES, AND KAREN LANGE

Section 7.5: Cardinality

arxiv: v1 [math.ds] 22 Jan 2019

Finite Simple Abelian Algebras are Strictly Simple

Lattices, closure operators, and Galois connections.

Chapter 9: Relations Relations

TRINITY COLLEGE DUBLIN THE UNIVERSITY OF DUBLIN. School of Mathematics

Spanning Paths in Infinite Planar Graphs

D-bounded Distance-Regular Graphs

IDEMPOTENT n-permutable VARIETIES

A BRIEF INTRODUCTION TO ZFC. Contents. 1. Motivation and Russel s Paradox

Thus, X is connected by Problem 4. Case 3: X = (a, b]. This case is analogous to Case 2. Case 4: X = (a, b). Choose ε < b a

BOOLEAN ALGEBRA INTRODUCTION SUBSETS

On lattices of convex sets in R n

Transcription:

International Journal of Theoretical Physics, Vol. 45, No. 2, February 2006 ( C 2006) DOI: 10.1007/s10773-005-9022-y Three Classes of Orthomodular Lattices 3 Richard J. Greechie 1 and Bruce J. Legan 2 Received May 17, 2005; accepted December 12, 2005 Published Online: May 3, 2006 Let OML denote the class of all orthomodular lattices and C denote the class of those that are commutator-finite. Also, let C 1 denote the class of orthomodular lattices that satisfy the block extension property, C 2 those that satisfy the weak block extension property, and C 3 those that are locally finite. We show that the following strict containments hold: C C 1 C 2 C 3 OML. KEY WORDS: orthomodular lattice (OML); commutator-finite OML; block-finite OML; locally finite OML; block extension property; weak block extension property; Greechie space; Loop Lemma; orthogonality space. 1. INTRODUCTION In the concluding remarks of Bruns and Greechie (1990) and in Legan (1998), the authors discuss several classes of orthomodular lattices. Continuing that discussion, we adopt the following notation. Let us denote the class of all orthomodular lattices by OML and the class of commutator-finite orthomodular lattices by C. Additionally, we denote the class of orthomodular lattices that satisfy the block extension property by C 1, the class of those that satisfy the weak block extension property by C 2, and the class of those that are locally finite by C 3.After making the appropriate definitions, we give two examples and refer to two others to show that these classes are ordered by strict containment ( ); namely, C C 1 C 2 C 3 OML. An orthomodular lattice (abbreviated, OML) is an ortholattice L satisfying the condition that if a b and b a = 0, then a = b.acommutator in an OML L is an element of the form (a b) (a b ) (a b) (a b ). A maximal boolean subalgebra of an OML L is called a block of L.AnOMLiscommutator- finite (respectively, block-finite), if it contains only finitely many commutators 1 Department of Mathematics, Louisiana Tech University, Ruston, Louisiana. 2 To whom correspondence should be addressed at Department of Mathematics, Metropolitan State University, St. Paul, Minnesota. 3 Dedicated to the memory of Günter Bruns. 351 0020-7748/06/0200-0351/0 C 2006 Springer Science+Business Media, Inc.

352 Greechie and Legan (respectively, blocks). The set of all blocks of L is denoted by A L. A subalgebra M of an OML L is said to be full when A M A L. We say that an OML L has the block extension property (abbreviated, BEP) if, for every finite set B of blocks of L, there exists a block-finite full subalgebra S of L containing B. Also, we say that an OML L has the weak block extension property (abbreviated, WBEP) if, for every finite set B of blocks of L, the subalgebra, Ɣ( B), of L generated by the elements of B is block-finite. Finally, we call an OML L locally finite if every finite set of elements of L generates a finite subalgebra of L. Our discussion is always within an orthomodular lattice. We assume a fair amount of familiarity with the basic notation, terminology, and results of orthomodular lattice theory, and refer the reader to the bibliography for details. In order to prove that a commutator-finite OML L is locally finite, Bruns and Greechie first show that every commutator-finite OML L has the block-extension property. Consequently, each finite generating set in L, since it is contained in the union of a finite set of blocks of L, is contained in a full block-finite subalgebra of L. Hence, by the main result of Bruns (1978), which states that block-finiteness implies local-finiteness, each such set generates a finite subalgebra of L. In other words, commutator-finiteness implies local-finiteness. So, the BEP plays a crucial role in this result. It is clear that every OML that has the BEP also has the WBEP since subalgebras of block-finite OMLs are again block-finite. Moreover, the WBEP also implies local finiteness in the same way as does the BEP. In the concluding remarks of Bruns and Greechie (1990), the authors pose several questions. The question we answer here is whether or not the BEP is strictly stronger than the WBEP. The example given here shows that it is. We also give an example to show that the class of OMLs possessing the WBEP is strictly contained in the class of locally finite OMLs. 2. AN OML POSSESSING THE WBEP BUT NOT THE BEP In Fig. 1, we have an example of an OML L 1 which possesses the WBEP, but not the BEP. The pattern is repetitive; here is the listing of the atoms in each block. They are, for each i N, {a ij,b ij,a i,j+1 },j = 1, 2, 3, 4, 5, and {a i6,b i6,a i1 }, comprising the infinitely many hexagons, and {a i1,c i1,a i+1,2 }, {a i2,c i2,d i,a i+1,4 }, {a i3,c i3,a i+1,6 }, {a i4,c i4,a i+1,2 }, {a i5,c i5,d i, a i+1,4 }, and {a i6,c i6,a i+1,6 }, comprising the atoms of the blocks between the ith and the (i + 1) st hexagon immediately to its right. Each block in any hexagon and all others except the two that contain d i, for all i N, are copies of 2 3. The two that contain d i, for all i N, are copies of 2 4. The drawing completely describes the OML L 1. Firstly, we must show that L 1 is an OML. We observe that it is not a Greechie space by considering the atoms d i and a i+1,4, which both appear in the same

Three Classes of Orthomodular Lattices 353 Fig. 1. L 1, an example having the WBEP but not the BEP. two blocks, one having as its set of atoms {a i2,c i2,d i,a i+1,4 } and the other {a i5,c i5,d i,a i+1,4 }, for all i N. However, we can prove that L 1 is an OML by using orthogonality space techniques which we now present. To do this, we first make the following definitions. An ordered pair (X, ) is called an orthogonality space if X is a non-empty set and X X is an anti-reflexive, symmetric binary relation on X; that is, for all x,y X, x x fails, and x y implies that y x. Let (X, ) be an orthogonality space. If M X, then we define M, called the orthogonal of M, by the equation M :={x X x m for every m M}. D X is called a -(sub)set in case d 1 d 2 holds whenever d 1,d 2 D with d 1 d 2. If M X, we say that M is orthogonally-closed (abbreviated, -closed) in case M = M. We define P (X) by the equation P (X) :={M P(X) M is -closed}. Let atl denote the set of atoms of L. LetX = atl 1. These are represented by the vertices in Fig. 1. For x,y X, x y if and only if x y and both x and y are on a common line in Fig. 1. The maximal -sets determine the lines in the Greechie diagram of L 1 : these are in one-to-one correspondence with the blocks of L 1. The following results then hold. The poset (P (X), ) is a complete ortholattice under the orthocomplementation M M ; and P (X) is an OML if and only if, for every M P (X) and for every maximal -subset D of M,D = M holds. (See Kalmbach, 1983, page 262.) We now use these results to show that P (X) is an OML. To accomplish this, we give an exhaustive accounting of the -closed subsets M X and their maximal -subsets ( bases ) D M; the raeder is asked to verify that for all such inclusions in Table I, where, for each of these, i N and a at L 1,wehave D ++ = M. The meaning should remain clear in view of the preceding paragraphs.

354 Greechie and Legan Table I. Orthogonally Closed Subsets and Their Bases M = M D M = X The atoms in just one of any of the blocks {a} {a} {a} The atoms in just one of any of the blocks which contain a, except for a itself {d i,a i+1,4 } {d i,a i+1,4 } {d i,a i+1,4 } ={a i2,c i2,a i5,c i5 } {a i2,c i2 }, {a i5,c i5 } {a i2,a i+1,4 } {a i2,a i+1,4 } {a i2,a i+1,4 } ={c i2,d i } {c i2,d i } {a i2,d i } {a i2,d i } {a i2,d i } ={c i2,a i+1,4 } {c i2,a i+1,4 } {a i5,a i+1,4 } {a i5,a i+1,4 } {a i5,a i+1,4 } ={c i5,d i } {c i5,d i } {a i5,d i } {a i5,d i } {a i5,d i } ={c i5,a i+1,4 } {c i5,a i+1,4 } We now define a sequence of subalgebras which are useful for showing that the WBEP holds, but the BEP does not. For i N, define e i to be d i a i+1,4 ; and define M i L 1 to be the union of all blocks to the left of the ith hexagon, the ith hexagon, {a i1,c i1,a i+1,2 }, {a i3,c i3,a i+1,6 }, {a i4,c i4,a i+1,2 }, {a i6,c i6,a i+1,6 }, {a i2,c i2,e i }, {a i5,c i5,e i }, {a i+1,1,b i+1,1,a i+1,2 }, and {a i+1,6,b i+1,6,a i+1,1 }. Then each M i is a block-finite subalgebra of L 1 which is not full. In Fig. 2, we show the Greechie diagram of M 1. To show that L 1 has the WBEP, let B be any collection of finitely many blocks of L 1.Pickj N so that all of the blocks in B are to the left of the jth hexagon. Fig. 2. M 1, a block-finite subalgebra of L 1 which is not full.

Three Classes of Orthomodular Lattices 355 Since B M j L 1 and subalgebras of block-finite OMLs are block-finite, it follows that Ɣ( B) is block-finite. To verify the failure of the BEP, choose B := {{a 12,b 12,a 13 }, {a 15,b 15,a 16 }} and observe that Ɣ( B) = M 1. Observe that any full subalgebra of L 1 that contains B must, therefore, contain {a 12,c 12,d 1,a 24 } and {a 15,c 15,d 1,a 24 }.However, Ɣ(( B) {a 12,c 12,d 1,a 24 } {a 15,c 15,d 1,a 24 }) = M 2. In a similar way, if any full subalgebra contains M i, then it also contains M i+1, for all i 2. Hence, the only full subalgebra containing this finite choice of blocks is L 1 itself. Since L 1 is not block-finite, it does not have the BEP. 3. A LOCALLY FINITE OML NOT POSSESSING THE WBEP In Fig. 3, we present an example of an OML L 2 which is locally finite but does not possess the WBEP. Observe also that L 2 possesses a collection of four infinite blocks, B := {A, B, C, D}. The blocks of L 2 have as sets of atoms {a ij,b ij,a i,j+1 },j = 1, 2, 3, 4, 5, and {a i6,b i6,a i1 }, where i N, comprising the infinitely many hexagons, and ata = {b 13,b 16,b 25,b 22,b 33,b 36,b 45,b 42,...},atB ={b 11,b 21,b 31,...}, atc ={b 14, b 24,b 34,...}, and atd ={b 15,b 12,b 23,b 26,b 35,b 32,b 43,b 46,...}; these comprise the four infinite lines each of which intersects each hexagon in one (for B and C) or two (for A and D) atoms. Each block in any hexagon is a copy of 2 3, and each of the four infinite blocks is a copy of the power set of the integers, P(Z). The second example, L 2, is a Greechie space since any two lines in its Greechie diagram intersect in at most one point. Recall that a loop of order n in a Greechie space is a sequence of n lines where each line intersects the successive line in one point, non-successive lines do not intersect, and the last line intersects the first line in one point also. Note that L 2 satisfies the Loop Lemma condition for being an OML, which simply requires that there are no loops of order less than five. The drawing completely describes the OML L 2. Moreover, L 2 is locally finite and does not have the WBEP for the following reasons. Firstly, for any finite collection K of elements of L 2, there exists n N such that only the four infinite blocks and the first n hexagons contain elements of K. However, an atom from a hexagon further to the right than the nth hexagon may be generated by elements that are only in the same infinite block. Now, each infinite block of L 2 contains finitely many elements of K, and blocks are locally finite. Moreover, two elements from two different infinite blocks together do not generate a new element, except possibly if they are also from the same hexagon. Also, an element x from a given hexagon and another element y from an infinite block to which x does not also belong do not generate a new element, except possibly an element in the given hexagon. So, there exists m N with m n such

356 Greechie and Legan Fig. 3. L2, an example of a locally finite OML that does not possess the WBEP.

Three Classes of Orthomodular Lattices 357 that the subalgebra generated by K,Ɣ(K), includes elements from only the first m hexagons and finite subsets of the four infinite blocks. So, Ɣ(K) is finite. Hence, L 2 is locally finite. Secondly, B := {A, B, C, D} is a finite collection of blocks whose union generates L 2 itself, which has infinitely many blocks. Therefore, L 2 does not have the WBEP. It is, of course, true that the horizontal sum of infinitely many copies of OMLs possessing the BEP and having a commutator poset which is not contained in {0, 1} possesses the BEP but is not commutator-finite. In particular, the horizontal sum of infinitely many copies of G 12 (the 12-element OML having two 8-element blocks) is the simplest example of such an OML. Let us denote this example by N 1. Furthermore, let us denote the example from Greechie (1977) (which may also be found in Harding, 2002) by N 2. From our Introduction, we know that C C 1 C 2 C 3 OML. However, the existence of N 1 allows us to conclude that C 1 C, ofl 1 that C 2 C 1,ofL 2 that C 3 C 2, and of N 2 that OML C 3. Therefore, C C 1 C 2 C 3 OML. REFERENCES Bruns, G. (1978). A finiteness criterion for orthomodular lattices. Canadian Journal of Mathematics 30(2), 315 320. Bruns, G. and Greechie, R. (1990). Blocks and commutators in orthomodular lattices. Algebra Universalis 27, 1 9. Greechie, R. (1977). Any complete atomic orthomodular lattice with countably many atoms is a sublattice of one generated by three elements. Journal of Natural Science and Mathematics 17(2), 33 41. Harding, J. (2002). The free orthomodular lattice on countably many generators is a subalgebra of the free orthomodular lattice on three generators. Algebra Universalis 48(2), 171 182. Kalmbach, G. (1983). Orthomodular Lattices, Academic Press, London, Great Britain. Legan, B. (1998). On a Structure Theory for Commutator-Finite Orthomodular Lattices, Doctoral Dissertation. Kansas State University, Manhattan.