DOCSLIB.ORG

The Congruences of a Finite Lattice

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Congruences of a Finite Lattice The Congruences of a Finite Lattice George Gr¨atzer Birkh¨auser Verlag, Boston @ 2005 Birkh¨auser Verlag To L´aszl´o Fuchs, my thesis advisor, my teacher, who taught me to set the bar high; and to the coauthors of my papers, Tomi (E. T. Schmidt), Harry (H. Lakser), Ervin (E. Fried), David (D. Kelly), Bob (R. W. Quackenbush), Fred (Wehrung), and more than fifty others, who helped me raise the bar. Contents Table of Notation xiii Picture Gallery xvii Acknowledgments xix Preface xxi I A Brief Introduction to Lattices 1 1 Basic Concepts 3 1.1 Ordering 3 1.1.1 Orders 3 1.1.2 Diagrams 5 1.1.3 Order constructions 5 1.1.4 Partitions 6 1.2 Lattices and semilattices 8 1.2.1 Lattices 8 1.2.2 Semilattices and closure systems 10 1.3 Some algebraic concepts 12 1.3.1 Homomorphisms 12 1.3.2 Sublattices 13 1.3.3 Congruences 14 2 Special Concepts 19 2.1 Elements and lattices 19 2.2 Direct and subdirect products 20 2.3 Polynomials and identities 23 2.4 Gluing 26 vii viii Contents 2.5 Modular and distributive lattices 30 2.5.1 The characterization theorems 30 2.5.2 Finite distributive lattices 31 2.5.3 Finite modular lattices 32 3 Congruences 35 3.1 Congruence spreading 35 3.2 Prime intervals 37 3.3 Congruence-preserving extensions and variants 39 II Basic Techniques 45 4 Chopped Lattices 47 4.1 Basic definitions 47 4.2 Compatible vectors of elements 49 4.3 Compatible vectors of congruences 50 4.4 From the chopped lattice to the ideal lattice 52 4.5 Sectional complementation 53 5 Boolean Triples 57 5.1 The general construction 57 5.2 The congruence-preserving extension property 60 5.3 The distributive case 62 5.4 Two interesting intervals 63 6 Cubic Extensions 71 6.1 The construction 71 6.2 The basic property 73 III Representation Theorems 77 7 The Dilworth Theorem 79 7.1 The representation theorem 79 7.2 Proof-by-Picture 80 7.3 Computing 82 7.4 Sectionally complemented lattices 83 7.5 Discussion 85 8 Minimal Representations 93 8.1 The results 93 8.2 Proof-by-Picture for minimal construction 94 8.3 The formal construction 95 8.4 Proof-by-Picture for minimality 97 Contents ix 8.5 Computing minimality 99 8.6 Discussion 100 9 Semimodular Lattices 105 9.1 The representation theorem 105 9.2 Proof-by-Picture 106 9.3 Construction and proof 107 9.4 Discussion 114 10 Modular Lattices 115 10.1 The representation theorem 115 10.2 Proof-by-Picture 116 10.3 Construction and proof 120 10.4 Discussion 125 11 Uniform Lattices 129 11.1 The representation theorem 129 11.2 Proof-by-Picture 129 11.3 The lattice N(A, B) 132 11.4 Formal proof 137 11.5 Discussion 139 IV Extensions 143 12 Sectionally Complemented Lattices 145 12.1 The extension theorem 145 12.2 Proof-by-Picture 146 12.3 Simple extensions 148 12.4 Formal proof 150 12.5 Discussion 152 13 Semimodular Lattices 153 13.1 The extension theorem 153 13.2 Proof-by-Picture 153 13.3 The conduit 156 13.4 The construction 157 13.5 Formal proof 159 13.6 Discussion 159 14 Isoform Lattices 161 14.1 The result 161 14.2 Proof-by-Picture 161 14.3 Formal construction 165 14.4 The congruences 171 x Contents 14.5 The isoform property 172 14.6 Discussion 173 15 Independence Theorems 177 15.1 Results 177 15.2 Proof-by-Picture 178 15.2.1 Frucht lattices 178 15.2.2 An automorphism-preserving simple extension 179 15.2.3 A congruence-preserving rigid extension 180 15.2.4 Merging the two extensions 181 15.2.5 The representation theorems 182 15.3 Formal proofs 183 15.3.1 An automorphism-preserving simple extension 183 15.3.2 A congruence-preserving rigid extension 185 15.3.3 Proof of the independence theorems 185 15.4 Discussion 187 16 Magic Wands 189 16.1 Constructing congruence lattices 189 16.1.1 Bijective maps 189 16.1.2 Surjective maps 190 16.2 Proof-by-Picture for bijective maps 191 16.3 Verification for bijective maps 194 16.4 2/3-boolean triples 198 16.5 Proof-by-Picture for surjective maps 204 16.6 Verification for surjective maps 206 16.7 Discussion 207 V Two Lattices 213 17 Sublattices 215 17.1 The results 215 17.2 Proof-by-Picture 217 17.3 Multi-coloring 219 17.4 Formal proof 220 17.5 Discussion 221 18 Ideals 227 18.1 The results 227 18.2 Proof-by-Picture for the main result 228 18.3 A very formal proof: Main result 230 18.3.1 Categoric preliminaries 230 18.3.2 From DI to OR 232 Contents xi 18.3.3 From OR to HE 232 18.3.4 From CH to DI 233 18.3.5 From HE to CH 234 18.3.6 From CH to LA 237 18.3.7 The final step 237 18.4 Proof for sectionally complemented lattices 238 18.5 Proof-by-Picture for planar lattices 241 18.6 Discussion 242 19 Tensor Extensions 245 19.1 The problem 245 19.2 Three unary functions 246 19.3 Defining tensor extensions 248 19.4 Computing 250 19.4.1 Some special elements 250 19.4.2 An embedding 252 19.4.3 Distributive lattices 253 19.5 Congruences 254 19.5.1 Congruence spreading 254 19.5.2 Some structural observations 257 19.5.3 Lifting congruences 259 19.5.4 The main lemma 261 19.6 The congruence isomorphism 262 19.7 Discussion 263 Bibliography 265 Index 275 Table of Notation Symbol Explanation Page Atom(U) set of atoms of the ideal U 84 Aut L automorphism group of L 12 Bn boolean lattice with n atoms 4 Cn n-element chain 4 con(a, b) smallest congruence under which a ≡ b 15 con(c) principal congruence for a color c 39 con(H) smallest congruence collapsing H 16 con(p) principal congruence for the prime interval p 37 Con L congruence lattice of L 15, 48 ConJ L order of join-irreducible congruences of L 37 ConM L order of meet-irreducible congruences of L 71 Cube K cubic extension of K 71 D class (variety) of distributive lattices 24 Diag diagonal embedding of K into Cube K 71 Down P order of down-sets of the (hemi)order P 4, 9, 232 ext: Con K → Con L for K ≤ L, extension map: Θ → conL(Θ) 41 fil(a) filter generated by the element a 14 fil(H) filter generated by the set H 14 FD(3) free distributive lattice on three generators 26 FK(H) free lattice generated by H in a variety K 26 FM(3) free modular lattice on three generators 28 Frucht C Frucht lattice of a graph C 178 hom{∨,0}(X, Y ) {∨, 0}-homomorphism of X into Y 253 xiii xiv Table of Notation Symbol Explanation Page id(a) ideal generated by the element a 14 id(H) ideal generated by the set H 14 Id L ideal lattice of L 14, 48 (Id) condition to define ideals 14, 48 Isoform class of isoform lattices 141 J(D) order of join-irreducible elements of D 19 J(ϕ)J(ϕ): J(E) → J(D), the “inverse” of ϕ: D → E 32 J(a) set of join-irreducible elements below a 19 ker(ϕ) congruence kernel of ϕ 16 L class (variety) of all lattices 25 M class (variety) of modular lattices 25 Max maximal elements of an order 49 mcr(n) minimal congruence representation function 87 mcr(n, V) mcr for a class V 87 M(D) order of meet-irreducible elements of D 32 M3 five-element modular nondistributive lattice xvii, 11, 30 M3[L] order of boolean triples of L 58 M3[L, a] interval of M3[L]63 M3[L, a, b] interval of M3[L]65 M3[a, b] order of boolean triples of the interval [a, b]58 3 M3[Θ] reflection of Θ to M3[L]60 3 M3[Θ,a] reflection of Θ to M3[L, a]64 3 M3[Θ,a,b] reflection of Θ to M3[L, a, b] xvii, 67 N5 five-element nonmodular lattice xvii, 11, 30 N5,5 seven-element nonmodular lattice 94 N6 = N(p, q) six-element nonmodular lattice xvii, 80 N6[L]2/3-boolean triple construction 198 N(A, B) lattice construction 132 O(f) Landau O notation xxvi Part A partition lattice of A 7, 9 Pow X power set lattice of X 4 Pow+ X order of nonempty subsets of X 219 Prime(L) set of prime intervals of L 37 re: Con L → Con K reflection (restriction) map: Θ → ΘK 39 SecComp class of sectionally complemented lattices 87 SemiMod class of semimodular lattices 87 Simp K simple extension of K 71 (SP∨) join-substitution property 14, 48 (SP∧) meet-substitution property xvii, 14, 48 sub(H) sublattice generated by H 13 S8 eight-element semimodular lattice 106 T class (variety) of trivial lattices 25 Uniform class of uniform lattices 141 Table of Notation xv Symbol Explanation Page Relations and Congruences A2 set of ordered pairs of A 3 , τ, π, . binary relations Θ, Ψ, . congruences ω zero of Part A 7 ι unit of Part A 7 a ≡ b (π) a and b in the same block of π 7 ab aand b in relation 3 a ≡ b (Θ) a and b in relation Θ 3 a/π block containing a 6, 14 H/π blocks represented by H 7 α ◦ β product of α and β 21 r α ◦ β reflexive product of α and β 30 ΘK restriction of Θ to the sublattice K 14 L/Θ quotient lattice 16 Φ/Θ quotient congruence 16 πi projection map: L1 ×···×Ln → Li 21 Θ × Φ direct product of congruences 21 Orders ≤, < ordering 3 ≥, > ordering, inverse notation 3 K ≤ LKa sublattice of L 13 ≤Q ordering of P restricted to a subset Q 4 a baincomparable with b 3 a ≺ bais covered by b 5 b abcovers a 5 0 zero, least element of an order 4 1 unit, largest element of an order 4 a ∨ b join operation 9 H least upper bound of H 3 a ∧ b meet operation 9 H greatest lower bound of H 4 P d dual of the order (lattice) P 4, 10 [a, b] interval 13 ↓H down-set generated by H 4 ↓a down-set generated by {a} 4 P =∼ Q order (lattice) P isomorphic to Q 4, 12 xvi Table of Notation Symbol Explanation Page Constructions P × Q direct product of P and Q 5, 20 P + Q sum of P and Q 6 P Q glued sum of P and Q 16 A[B] tensor extension of A by B 248 A ⊗ B tensor product of A and B 245 U V modular lattice construction 120 Perpectivities [a, b] ∼ [c, d][a, b] perspective to [c, d]32 [a, b] ∼u [c, d][a, b] up-perspective to [c, d]33 [a, b] ∼d [c, d][a, b] down-perspective to [c, d]33 [a, b] ≈ [c, d][a, b] projective to [c, d]33 [a, b] [c, d][a, b] up congruence-perspective onto [c, d]35 [a, b] [c, d][a, b] down congruence-perspective onto [c, d]35 [a, b] → [c, d][a, b] congruence-perspective onto [c, d]35 [a, b] ⇒ [c, d][a, b] congruence-projective onto [c, d]36 [a, b] ⇔ [c, d][a, b] ⇒ [c, d] and [c, d] ⇒ [a, b]36 Prime intervals p, q, ..
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]