DOCSLIB.ORG

Special Lattice of Rough Algebras

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Special Lattice of Rough Algebras Applied Mathematics, 2011, 2, 1522-1524 doi:10.4236/am.2011.212215 Published Online December 2011 (http://www.SciRP.org/journal/am) Special Lattice of Rough Algebras Yonghong Liu School of Automation, Wuhan University of Technology, Wuhan, China E-mail: [email protected] Received October 14, 2011; revised November 16, 2011; accepted November 24, 2011 Abstract This paper deals with the study of the special lattices of rough algebras. We discussed the basic properties such as the rough distributive lattice; the rough modular lattice and the rough semi-modular lattice etc., some results of lattice are generalized in this paper. The modular lattice of rough algebraic structure can provide academic base and proofs to analyze the coverage question and the reduction question in information system. Keywords: Lattice, Rough Distributive Lattice, Rough Modular Lattice, Rough Semi-Modular Lattice 1. Introduction 3) absorption laws: x (xy ) x and x ( xy ) x . It is generally known that the order and the partial order set theory were widely applied in the discrete mathemat- 4) idempotent laws: ics and fuzzy mathematics. In algebraic theories about x xxand xxx. the notion of lattice as both profound and sweeping. A lattice is an algebra structure L,, that has two The rough set was introduced by Pawlak in 1982 [1]. binary composition and , it satisfies the above- The lattice to characterize rough set is an important task mentioned condition 1), 2), 3) and 4). [2-6]. Actually, we can use a lattice model to represent Definition 1.2. [7] Let L is a lattice, if for any different information flow policies and play an important x,,yz L . role in Boolean algebra. Obviously, the coverage prob- 1) xyzxyxz ( ) ( ) ( ), or lem and the reductions problem are two problems of the cores in information system of lattice relation, which 2)xyzxyxz ( ) ( ) ( ). boosts the development of lattice theory. We give several Therefore, L is called a distributive lattice. special lattices of rough algebras that we discuss in this arti- Definition 1.3. [7] A distributive lattice is called a cle; for instance, we prove that a lattice is necessary and modular lattice. sufficient condition of the rough semi-modular lattice. Theorem 1.1. [7] Let L is modular lattice, then L is We will now describe a lattice definition and then we called a semi-modular lattice. introduce rough approximation spaces. The main con- Definition 1.4. [8] Assume that U is a finite and non- tents are as the following: empty set with the universe, RUU denote a binary Definition 1.1. [7] Let L is a set. Define the meet relation on U . Let (,)UR is an approximation spaces. () and join () operations by Define (,RR ) R U is a rough approximation x yxglb( ,y ), x yxlub( ,y ). spaces. R and R are referred to as the lower and up- per approximation operators respectively. The following properties hold for all elements Theorem 1.2. [8] Let (,)UR be an approximation x,,yz L . spaces. Then algebra ,, is a complete distribu- 1) commutative laws: tive lattice. x yyx and xyyx . 2) associative laws: 2. Main Results ()xy zx () yz and Definition 2.1. Let (,)UR be an approximation spaces. ()xy zx (). yz For all x,.yR If Rx() Ry (), then the rough x and y Copyright © 2011 SciRes. AM Y. H. LIU 1523 are called lower rough equal. The notation x y de- ()()()(yz xy zx xyz) notes that x and y are lower rough equal. If Rx() Ry (), (idempotent laws and commutative laws) then the rough x and y are called upper rough equal. The notation x y denotes that x and y are upper rough ()()(x yyzzx). equal. If x y and x y , then the rough x and y are Sufficiency: called rough equal. The notation x y denotes that x If for any x,,yz R , then and y are rough equal. xyzxxzyz () ()() Definition 2.2. Let xxtt, , and S be a unary operation. We use the notation x (xy ) ( xz ) ( yz ) x ((x y) (y z) (z x)) xttxSt (),x tT tT tT x ((xy ) ( yz ) ( zx )) xttxSt () x. tT tT tT ((x yyzzx ) ( ) ( ))) x The definition represents that the rough union and Because x yx , and since the rough modular laws. rough intersection (where T is an index set). We see that Definition 2.3. Let algebra ,, be a rough lat- ((xy ) (( yz ) ( zx ))) x tice, if for any x,,yz R , satisfying ()((()())x yyzzxx ). x yxzyxzy()() , Because zxx , and since the rough modular laws. Therefore, R is a rough modular lattice. It follows that Theorem 2.1. The rough distributive lattice ,, ()()(x yzxyzxxyxz )()(). is rough modular lattice. Proof. Suppose that R is a rough distributive lattice, We conclude that if for any x,,yz R ,x y , then x ()()(yz xy xz). x ()(())((zy x yz Sxyz )) Show that ,, is the rough distributive lattice. ((x yxzSxyxz ) ( )) (( ) ( )) Theorem 2.3. A necessary and sufficient condition that rough lattice R is a rough modular lattice, for any ()()xyxz Sxyxz x,,yRx y and zR , we have ()()xyxz Sxyxz x zyzxzyz,, then x y. ()()xy xz Proof. Necessity: ().xz y xx () xz xyz() Hence the ,, is rough modular lattice. xzy() Theorem 2.2. The rough modular lattice ,, is rough distributive lattice, if and only if for any ()xz y x,,yz R , the following formulas hold: ()yz y y. ()()()xy yz zx Sufficiency: ()()(x yyzzx). Let x y . To show that z, we thus have Proof. Necessity: x ()()zy xz y. If for any x,,yz R , then We shall prove that the two laws: ()()()xy yz zx 1) (x (zy )) z (( xz ) y ) z , (((x yy ) ) (( xyz ) )) ( zx ) 2) (x (zy )) z (( xz ) y ) z . (distributive laws) To prove 1). In fact, ((yxzyz )())( zx) ((x zyz ) ) (( xzzyzy ) ) , (absorption laws and distributive laws) ((xzy )) z ()()(yz yx xzz )( xzx) ((yzyzyzzy )) , and (y z z) (y z x) yzzy () yz z (()) x zy z, (distributive laws) thus Copyright © 2011 SciRes. AM 1524 Y. H. LIU ((x zyzzy ) ) . i , then xi is coverage of zi , and let ki , we have zx . If there exists j, then y is coverage of z , and For part 2), kk j j let kj , we have z y. If ij , then ((x zy )) zx (()) zy z xz. kk x yttt(,12 , ,n ), where txii , tyj j , tzkk and ( kij , ). ((x zyzxzzxz ) ) ( ) . Here, x y is coverage of x , it is also coverage of y. If ij , then x yu(,12u,,) un , where Since x y, we conclude that x yx, then uxyii i, uzkk (k i). x zxyz() (()) xzyz , Because Ri be a rough semi-modular lattice, hence ui is coverage of xi , and it is also coverage of yi . thus Therefore, x y is not only coverage of x , but also ((x zyzxz ) ) , coverage of y . Corollary 2.1. Let (,UR) be an approximation which proves 2). spaces. Suppose that X is a nonempty set, X U, Definition 2.4. The R is called a rough semi-modu- and R be a set of equivalent relation, then R is a lar lattice denotes that x is coverage of x y , and y rough semi-modular lattice based on the inclusion rela- is also coverage of x y , then x y is coverage of tion. x and it is also coverage of y . Theorem 2.4. If R is a rough modular lattice, then 3. References R is a rough semi-modular lattice. Proof. Let x be coverage of x y and let y is [1] Z. Pawlak, “Rough Sets,” International Journal of Com- also coverage of x y , if for every f R , and puter and Information Sciences, Vol. 11, No. 5, 1982, pp. x fxy, 341-356. doi:10.1007/BF01001956 [2] M. Novotny and Z. Pawlak, “Characterization of Rough which proves that f x , whence x y is coverage of Top Equalities and Rough Bottom Equalities,” Bulletin of x . In fact, the Polish Academy of Sciences. Mathematics, Vol. 33, x fxy, No. 1-2, 1985, pp. 91-97. [3] D. Dubois and H. Prade, “Rough Fuzzy Sets and Fuzzy we have Rough Sets,” International Journal of General Systems, x yfy() xyyy , Vol. 17, No. 2-3, 1990, pp. 191-209. doi:10.1080/03081079008935107 but f yy , if not, x f and y f . This leads [4] Y. H. Liu, “Lattice to Characterizing Rough Set,” Pattern to the contradiction x yf . We see that y is cov- Recognition and Artificial Intelligence, Vol. 16, No. 2, erage of x y , so that 2003, pp. 174-177. x yfy, [5] W. Q. Liu and C. X. Wu, “The Approximation Operator on F-Lattice,” Acta Mathematical Seneca, Vol. 46, No. 6, thus 2003, pp. 1163-1170. f fyxfyxxyxx()() () . [6] G. L. Liu, “The Lattice Properties of Rough Set Quotient Spaces,” Computer Engineering & Science, Vol. 26, No. Similarly, x y is coverage of y . 12, 2004, pp. 82-90. Theorem 2.5. Assume that rough semi-modular lattice [7] D. C. Sheng, “Abstract Algebra,” Science Press, Beijing, RR12,,,. Rn Then the Cartesian product 2001, pp. 114-127. RRR R is a rough semi-modular lattice. 12 n [8] W. X. Zhang, W. Z. Wu, J. Y. Liang and D. Y. Li, Proof. Let x (,xx12 , , xn ) and “Rough Sets: Theory and Methods,” Science Press, Bei- y (,yy12 , , yn ) R, RRR12 Rn , and let x , jing, 2001, pp. 72-77. y are coverage of x yzzz(,12 , ,n ), if there exists Copyright © 2011 SciRes. AM .
Load more

Recommended publications
  • Semimodular Lattices Theory and Applications
    P1: SDY/SIL P2: SDY/SJS QC: SSH/SDY CB178/Stern CB178-FM March 3, 1999 9:46 ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS Semimodular Lattices Theory and Applications MANFRED STERN P1: SDY/SIL P2: SDY/SJS QC: SSH/SDY CB178/Stern CB178-FM March 3, 1999 9:46 PUBLISHED BY THE PRESS SYNDICATE OF THE UNIVERSITY OF CAMBRIDGE The Pitt Building, Trumpington Street, Cambridge, United Kingdom CAMBRIDGE UNIVERSITY PRESS The Edinburgh Building, Cambridge CB2 2RU, UK http://www.cup.cam.ac.uk 40 West 20th Street, New York, NY 10011-4211, USA http://www.cup.org 10 Stamford Road, Oakleigh, Melbourne 3166, Australia c Cambridge University Press 1999 This book is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University Press. First published 1999 Printed in the United States of America Typeset in 10/13 Times Roman in LATEX2ε[TB] A catalog record for this book is available from the British Library. Library of Congress Cataloging-in-Publication Data Stern, Manfred. Semimodular lattices: theory and applications. / Manfred Stern. p. cm. – (Encyclopedia of mathematics and its applications ; v. 73) Includes bibliographical references and index. I. Title. II. Series. QA171.5.S743 1999 511.303 – dc21 98-44873 CIP ISBN 0 521 46105 7 hardback P1: SDY/SIL P2: SDY/SJS QC: SSH/SDY CB178/Stern CB178-FM March 3, 1999 9:46 Contents Preface page ix 1 From Boolean Algebras to Semimodular Lattices 1 1.1 Sources of Semimodularity
    [Show full text]
  • Groups with Almost Modular Subgroup Lattice Provided by Elsevier - Publisher Connector
    Journal of Algebra 243, 738᎐764Ž. 2001 doi:10.1006rjabr.2001.8886, available online at http:rrwww.idealibrary.com on View metadata, citation and similar papers at core.ac.uk brought to you by CORE Groups with Almost Modular Subgroup Lattice provided by Elsevier - Publisher Connector Francesco de Giovanni and Carmela Musella Dipartimento di Matematica e Applicazioni, Uni¨ersita` di Napoli ‘‘Federico II’’, Complesso Uni¨ersitario Monte S. Angelo, Via Cintia, I 80126, Naples, Italy and Yaroslav P. Sysak1 Institute of Mathematics, Ukrainian National Academy of Sciences, ¨ul. Tereshchenki¨ska 3, 01601 Kie¨, Ukraine Communicated by Gernot Stroth Received November 14, 2000 DEDICATED TO BERNHARD AMBERG ON THE OCCASION OF HIS 60TH BIRTHDAY 1. INTRODUCTION A subgroup of a group G is called modular if it is a modular element of the lattice ᑦŽ.G of all subgroups of G. It is clear that everynormal subgroup of a group is modular, but arbitrarymodular subgroups need not be normal; thus modularitymaybe considered as a lattice generalization of normality. Lattices with modular elements are also called modular. Abelian groups and the so-called Tarski groupsŽ i.e., infinite groups all of whose proper nontrivial subgroups have prime order. are obvious examples of groups whose subgroup lattices are modular. The structure of groups with modular subgroup lattice has been described completelybyIwasawa wx4, 5 and Schmidt wx 13 . For a detailed account of results concerning modular subgroups of groups, we refer the reader towx 14 . 1 This work was done while the third author was visiting the Department of Mathematics of the Universityof Napoli ‘‘Federico II.’’ He thanks the G.N.S.A.G.A.
    [Show full text]
  • Meet Representations in Upper Continuous Modular Lattices James Elton Delany Iowa State University
    Iowa State University Capstones, Theses and Retrospective Theses and Dissertations Dissertations 1966 Meet representations in upper continuous modular lattices James Elton Delany Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/rtd Part of the Mathematics Commons Recommended Citation Delany, James Elton, "Meet representations in upper continuous modular lattices " (1966). Retrospective Theses and Dissertations. 2894. https://lib.dr.iastate.edu/rtd/2894 This Dissertation is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Retrospective Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. This dissertation has been microiihned exactly as received 66-10,417 DE LA NY, James Elton, 1941— MEET REPRESENTATIONS IN UPPER CONTINU­ OUS MODULAR LATTICES. Iowa State University of Science and Technology Ph.D., 1966 Mathematics University Microfilms, Inc.. Ann Arbor, Michigan MEET REPRESENTATIONS IN UPPER CONTINUOUS MODULAR LATTICES by James Elton Delany A Dissertation Submitted to the Graduate Faculty in Partial Fulfillment of The Requirements for the Degree of DOCTOR OF PHILOSOPHY Major Subject: Mathematics Approved: Signature was redacted for privacy. I _ , r Work Signature was redacted for privacy. Signature was redacted for privacy. Iowa State University of Science and Technology Ames, Iowa 1966 il TABLE OP CONTENTS Page 1. INTRODUCTION 1 2. TORSION ELEMENTS, TORSION FREE ELEMENTS, AND COVERING CONDITIONS 4 3. ATOMIC LATTICES AND UPPER CONTINUITY 8 4. COMPLETE JOIN HOMOMORPHISMS 16 5. TWO HOMOMORPHISMS 27 6.
    [Show full text]
  • This Is the Final Preprint Version of a Paper Which Appeared at Algebraic & Geometric Topology 17 (2017) 439-486
    This is the final preprint version of a paper which appeared at Algebraic & Geometric Topology 17 (2017) 439-486. The published version is accessible to subscribers at http://dx.doi.org/10.2140/agt.2017.17.439 SIMPLICIAL COMPLEXES WITH LATTICE STRUCTURES GEORGE M. BERGMAN Abstract. If L is a finite lattice, we show that there is a natural topological lattice structure on the geo- metric realization of its order complex ∆(L) (definition recalled below). Lattice-theoretically, the resulting object is a subdirect product of copies of L: We note properties of this construction and of some variants, and pose several questions. For M3 the 5-element nondistributive modular lattice, ∆(M3) is modular, but its underlying topological space does not admit a structure of distributive lattice, answering a question of Walter Taylor. We also describe a construction of \stitching together" a family of lattices along a common chain, and note how ∆(M3) can be regarded as an example of this construction. 1. A lattice structure on ∆(L) I came upon the construction studied here from a direction unrelated to the concept of order complex; so I will first motivate it in roughly the way I discovered it, then recall the order complex construction, which turns out to describe the topological structures of these lattices. 1.1. The construction. The motivation for this work comes from Walter Taylor's paper [20], which ex- amines questions of which topological spaces { in particular, which finite-dimensional simplicial complexes { admit various sorts of algebraic structure, including structures of lattice. An earlier version of that paper asked whether there exist spaces which admit structures of lattice, but not of distributive lattice.
    [Show full text]
  • The Variety of Modular Lattices Is Not Generated
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 255, November 1979 THE VARIETYOF MODULAR LATTICES IS NOT GENERATED BY ITS FINITE MEMBERS BY RALPH FREESE1 Abstract. This paper proves the result of the title. It shows that there is a five-variable lattice identity which holds in all finite modular lattices but not in all modular lattices. It is also shown that every free distributive lattice can be embedded into a free modular lattice. An example showing that modular lattice epimorphisms need not be onto is given. We prove the result of the title by constructing a simple modular lattice of length six not in the variety generated by all finite modular lattices. This lattice can be generated by five elements and thus the free modular lattice on five generators, FM (5), is not residually finite. Our lattice is constructed using the technique of Hall and Dilworth [9] and is closely related to their third example. Let F and K be countably infinite fields of characteristics p and q, where p and q are distinct primes. Let Lp be the lattice of subspaces of a four-dimensional vector space over F, Lq the lattice of subspaces of a four-dimensional vector space over K. Two-dimen- sional quotients (i.e. intervals) in both lattices are always isomorphic to Mu (the two-dimensional lattice with « atoms). Thus Lp and Lq may be glued together over a two-dimensional quotient via [9], and this is our lattice. Notice that if F and K were finite fields we could not carry out the above construction since two-dimensional quotients of Lp would have/)" + 1 atoms and those of Lq would have qm + 1, for some n, m > 1.
    [Show full text]
  • DISTRIBUTIVE LATTICES FACT 1: for Any Lattice <A,≤>: 1 and 2 and 3 and 4 Hold in <A,≤>: the Distributive Inequal
    DISTRIBUTIVE LATTICES FACT 1: For any lattice <A,≤>: 1 and 2 and 3 and 4 hold in <A,≤>: The distributive inequalities: 1. for every a,b,c ∈ A: (a ∧ b) ∨ (a ∧ c) ≤ a ∧ (b ∨ c) 2. for every a,b,c ∈ A: a ∨ (b ∧ c) ≤ (a ∨ b) ∧ (a ∨ c) 3. for every a,b,c ∈ A: (a ∧ b) ∨ (b ∧ c) ∨ (a ∧ c) ≤ (a ∨ b) ∧ (b ∨ c) ∧ (a ∨ c) The modular inequality: 4. for every a,b,c ∈ A: (a ∧ b) ∨ (a ∧ c) ≤ a ∧ (b ∨ (a ∧ c)) FACT 2: For any lattice <A,≤>: 5 holds in <A,≤> iff 6 holds in <A,≤> iff 7 holds in <A,≤>: 5. for every a,b,c ∈ A: a ∧ (b ∨ c) = (a ∧ b) ∨ (a ∧ c) 6. for every a,b,c ∈ A: a ∨ (b ∧ c) = (a ∨ b) ∧ (a ∨ c) 7. for every a,b,c ∈ A: a ∨ (b ∧ c) ≤ b ∧ (a ∨ c). A lattice <A,≤> is distributive iff 5. holds. FACT 3: For any lattice <A,≤>: 8 holds in <A,≤> iff 9 holds in <A,≤>: 8. for every a,b,c ∈ A:(a ∧ b) ∨ (a ∧ c) = a ∧ (b ∨ (a ∧ c)) 9. for every a,b,c ∈ A: if a ≤ b then a ∨ (b ∧ c) = b ∧ (a ∨ c) A lattice <A,≤> is modular iff 8. holds. FACT 4: Every distributive lattice is modular. Namely, let <A,≤> be distributive and let a,b,c ∈ A and let a ≤ b. a ∨ (b ∧ c) = (a ∨ b) ∧ (a ∨ c) [by distributivity] = b ∧ (a ∨ c) [since a ∨ b =b]. The pentagon: The diamond: o 1 o 1 o z o y x o o y o z o x o 0 o 0 THEOREM 5: A lattice is modular iff the pentagon cannot be embedded in it.
    [Show full text]
  • Modular Lattices
    Wednesday 1/30/08 Modular Lattices Definition: A lattice L is modular if for every x; y; z 2 L with x ≤ z, (1) x _ (y ^ z) = (x _ y) ^ z: (Note: For all lattices, if x ≤ z, then x _ (y ^ z) ≤ (x _ y) ^ z.) Some basic facts and examples: 1. Every sublattice of a modular lattice is modular. Also, if L is distributive and x ≤ z 2 L, then x _ (y ^ z) = (x ^ z) _ (y ^ z) = (x _ y) ^ z; so L is modular. 2. L is modular if and only if L∗ is modular. Unlike the corresponding statement for distributivity, this is completely trivial, because the definition of modularity is invariant under dualization. 3. N5 is not modular. With the labeling below, we have a ≤ b, but a _ (c ^ b) = a _ 0^ = a; (a _ c) ^ b = 1^ ^ b = b: b c a ∼ 4. M5 = Π3 is modular. However, Π4 is not modular (exercise). Modular lattices tend to come up in algebraic settings: • Subspaces of a vector space • Subgroups of a group • R-submodules of an R-module E.g., if X; Y; Z are subspaces of a vector space V with X ⊆ Z, then the modularity condition says that X + (Y \ Z) = (X + Y ) \ Z: Proposition 1. Let L be a lattice. TFAE: 1. L is modular. 2. For all x; y; z 2 L, if x 2 [y ^ z; z], then x = (x _ y) ^ z. 2∗. For all x; y; z 2 L, if x 2 [y; y _ z], then x = (x ^ z) _ y.
    [Show full text]
  • Dimensional Functions Over Partially Ordered Sets
    Intro Dimensional functions over posets Application I Application II Dimensional functions over partially ordered sets V.N.Remeslennikov, E. Frenkel May 30, 2013 1 / 38 Intro Dimensional functions over posets Application I Application II Plan The notion of a dimensional function over a partially ordered set was introduced by V. N. Remeslennikov in 2012. Outline of the talk: Part I. Definition and fundamental results on dimensional functions, (based on the paper of V. N. Remeslennikov and A. N. Rybalov “Dimensional functions over posets”); Part II. 1st application: Definition of dimension for arbitrary algebraic systems; Part III. 2nd application: Definition of dimension for regular subsets of free groups (L. Frenkel and V. N. Remeslennikov “Dimensional functions for regular subsets of free groups”, work in progress). 2 / 38 Intro Dimensional functions over posets Application I Application II Partially ordered sets Definition A partial order is a binary relation ≤ over a set M such that ∀a ∈ M a ≤ a (reflexivity); ∀a, b ∈ M a ≤ b and b ≤ a implies a = b (antisymmetry); ∀a, b, c ∈ M a ≤ b and b ≤ c implies a ≤ c (transitivity). Definition A set M with a partial order is called a partially ordered set (poset). 3 / 38 Intro Dimensional functions over posets Application I Application II Linearly ordered abelian groups Definition A set A equipped with addition + and a linear order ≤ is called linearly ordered abelian group if 1. A, + is an abelian group; 2. A, ≤ is a linearly ordered set; 3. ∀a, b, c ∈ A a ≤ b implies a + c ≤ b + c. Definition The semigroup A+ of all nonnegative elements of A is defined by A+ = {a ∈ A | 0 ≤ a}.
    [Show full text]
  • On the Equational Theory of Projection Lattices of Finite Von Neumann
    The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000 ON THE EQUATIONAL THEORY OF PROJECTION LATTICES OF FINITE VON-NEUMANN FACTORS CHRISTIAN HERRMANN Abstract. For a finite von-Neumann algebra factor M, the projections form a modular ortholattice L(M) . We show that the equational theory of L(M) coincides with that of some resp. all L(Cn×n) and is decidable. In contrast, the uniform word problem for the variety generated by all L(Cn×n) is shown to be undecidable. §1. Introduction. Projection lattices L(M) of finite von-Neumann algebra factors M are continuous orthocomplemented modular lattices and have been considered as logics resp. geometries of quantum meachnics cf. [25]. In the finite dimensional case, the correspondence between irreducible lattices and algebras, to wit the matrix rings Cn×n, has been completely clarified by Birkhoff and von Neumann [5]. Combining this with Tarski’s [27] decidability result for the reals and elementary geometry, decidability of the first order theory of L(M) for a finite dimensional factor M has been observed by Dunn, Hagge, Moss, and Wang [7]. The infinite dimensional case has been studied by von Neumann and Murray in the landmark series of papers on ‘Rings of Operators’ [23], von Neumann’s lectures on ‘Continuous Geometry’ [28], and in the treatment of traces resp. transition probabilities in a ring resp. lattice-theoretic framework [20, 29]. The key to an algebraic treatment is the coordinatization of L(M) by a ∗- regular ring U(M) derived from M and having the same projections: L(M) is isomorphic to the lattice of principal right ideals of U(M) (cf.
    [Show full text]
  • Congruence Lattices of Lattices
    App end ix C Congruence lattices of lattices G. Gratzer and E. T. Schmidt In the early sixties, wecharacterized congruence lattices of universal algebras as algebraic lattices; then our interest turned to the characterization of congruence lattices of lattices. Since these lattices are distributive, we gured that this must b e an easier job. After more then 35 years, we know that wewere wrong. In this App endix, we give a brief overview of the results and metho ds. In Section 1, we deal with nite distributive lattices; their representation as congru- ence lattices raises manyinteresting questions and needs sp ecialized techniques. In Section 2, we discuss the general case. A related topic is the lattice of complete congruences of a complete lattice. In contrast to the previous problem, we can characterize complete congruence lattices, as outlined in Section 3. 1. The Finite Case The congruence lattice, Con L, of a nite lattice L is a nite distributive lattice N. Funayama and T. Nakayama, see Theorem I I.3.11. The converse is a result of R. P. Dilworth see Theorem I I.3.17, rst published G. Gratzer and E. T. Schmidt [1962]. Note that the lattice we construct is sectionally complemented. In Section I I.1, we learned that a nite distributive lattice D is determined by the p oset J D of its join-irreducible elements, and every nite p oset can b e represented as J D , for some nite distributive lattice D . So for a nite lattice L, we can reduce the characterization problem of nite congruence lattices to the representation of nite p osets as J Con L.
    [Show full text]
  • Generating All Modular Lattices of a Given Size ADAM 2013
    Generating all modular lattices of a given size ADAM 2013 Nathan Lawless Chapman University June 6-8, 2013 Outline I Introduction to Lattice Theory: Modular Lattices I The Objective: Generating and Counting Modular Lattices I First Approach: From Finite Lattices I Second Approach: From Distributive Lattices I Results I Conclusion Then, we say a partially ordered set (L; ≤) is a lattice if it satisfies the following axioms: I For any two elements a and b of L, there exists a least upper bound, refered to as the join a _ b. I For any two elements a and b of L, there exists a greatest lower bound, refered to as the meet a ^ b. What are lattices? First, let a partially ordered set or poset be a binary relation \≤" over a set P such that 8a; b; c 2 P satisfies: I Reflexivity: a ≤ a. I Antisymmetry: if a ≤ b and b ≤ a, then a = b. I Transitivity: if a ≤ b and b ≤ c, then a ≤ c. What are lattices? First, let a partially ordered set or poset be a binary relation \≤" over a set P such that 8a; b; c 2 P satisfies: I Reflexivity: a ≤ a. I Antisymmetry: if a ≤ b and b ≤ a, then a = b. I Transitivity: if a ≤ b and b ≤ c, then a ≤ c. Then, we say a partially ordered set (L; ≤) is a lattice if it satisfies the following axioms: I For any two elements a and b of L, there exists a least upper bound, refered to as the join a _ b.
    [Show full text]
  • Supermodular Lattices
    Supermodular Lattices Iqbal Unnisa W. B. Vasantha Kandasamy Florentin Smarandache Educational Publisher Inc. Ohio 2012 This book can be ordered from: Education Publisher Inc. 1313 Chesapeake Ave. Columbus, Ohio 43212, USA Toll Free: 1-866-880-5373 Copyright 2012 by Educational Publisher Inc. and the Authors Peer reviewers: Prof. Mihàly Bencze, Department of Mathematics, Áprily Lajos College, Braşov, Romania Dr. Sebastian Nicolaescu, 2 Terrace Ave., West Orange, NJ 07052, USA. Prof. Valeri Kroumov, Okayama Univ. of Science, Okayama, Japan. Many books can be downloaded from the following Digital Library of Science: http://www.gallup.unm.edu/~smarandache/eBooks-otherformats.htm ISBN-13: 978-1-59973-195-7 EAN: 9781599731957 Printed in the United States of America 2 CONTENTS Dedication 5 Preface 7 Chapter One PRELIMINARIES 9 Chapter Two SIMPLE MODULAR LATTICES OF FINITE LENGTH 15 Chapter Three SUPERMODULAR LATTICES 31 Chapter Four SEMI SUPERMODULAR LATTICES 51 3 Chapter Five SOME INTERESTING EQUATIONAL CLASSES OF MODULAR LATTICES 75 Chapter Six SMARANDACHE LATTICES 85 Chapter Seven GB-ALGEBRAIC STRUCTURES 99 FURTHER READING 127 INDEX 129 ABOUT THE AUTHORS 131 4 DEDICATION Mr. Mohammed Jalauddin Kokan and Mrs. Aaisha Begum 5 We dedicate this book to the memory of Dr. Iqbal Unnisa's parents. Her father Mr. Mohammed Jalauddin Kokan was the Post Master in Meenambur and mother Mrs. Aaisha Begum was a housewife. From this remote village of Meenambur in Tamilnadu, her parents shifted to Chennai to educate their children. In those days, girl children being enrolled in primary school was rare. Yet, the Kokans succeeded in educating their daughters into doctors and doctorates.
    [Show full text]