Some Aspects of Quasi-Stone Algebras, II Solutions and Simplifications of Some Problems from Sankappanavar and Sankappanavar Jonathan David Farley, D.Phil.

Slides:



Advertisements
Similar presentations
Presented by: Ms. Maria Estrellita D. Hechanova, ECE
Advertisements

Introduction The concept of transform appears often in the literature of image processing and data compression. Indeed a suitable discrete representation.
The proof is quite similar to that of a previous result: a compact subspace of a Hausdorff is closed. Theorem: If topological X  space is compact and.
CSCI 115 Chapter 6 Order Relations and Structures.
Section 11 Direct Products and Finitely Generated Abelian Groups One purpose of this section is to show a way to use known groups as building blocks to.
(CSC 102) Discrete Structures Lecture 14.
Basic Properties of Relations
1.  We have studied groups, which is an algebraic structure equipped with one binary operation. Now we shall study rings which is an algebraic structure.
Math 3121 Abstract Algebra I
Algebraic Structures: Group Theory II
Algebraic Structures DEFINITIONS: PROPERTIES OF BINARY OPERATIONS Let S be a set and let  denote a binary operation on S. (Here  does not necessarily.
Chapter 7 Relations : the second time around
Functions Section 2.3 of Rosen Fall 2008
Abstract Some of the so called smallness conditions in algebra as well as in Category Theory, important and interesting for their own and also tightly.
Boolean Algebra cont’ The digital abstraction מבנה המחשב + מבוא למחשבים ספרתיים תרגול 2#
Lattice and Boolean Algebra
App III. Group Algebra & Reduction of Regular Representations 1. Group Algebra 2. Left Ideals, Projection Operators 3. Idempotents 4. Complete Reduction.
Fall 2002CMSC Discrete Structures1 Yes, No, Maybe... Boolean Algebra.
Partially Ordered Sets (POSets)
Relations Chapter 9.
Chapter 6. Order Relations and Structure
Topological Nets and Filters Mark Hunnell. Outline 1.Motivations for Nets and Filters 2.Basic Definitions 3.Construction of Equivalence 4.Comparison and.
The Relationship between Topology and Logic Dr Christopher Townsend (Open University)
Rings,Fields TS. Nguyễn Viết Đông Rings, Integral Domains and Fields, 2. Polynomial and Euclidean Rings 3. Quotient Rings 2.
CSE 460: Switching Theory David M. Zar
Functorial Models, Horn Products, and Positive Omitting Types Realizability Cyrus F Nourani Akdmkrd.tripod;com savoie.fr/~hyvernat/Realisabilite2012/index.php.
FUNCTION Discrete Mathematics Asst. Prof. Dr. Choopan Rattanapoka.
Plan Lecture 3: 1. Fraisse Limits and Their Automaticity: a. Random Graphs. a. Random Graphs. b. Universal Partial Order. b. Universal Partial Order. 2.
Finite Groups & Subgroups. Order of a group Definition: The number of elements of a group (finite or infinite) is called its order. Notation: We will.
Signed-Bit Representations of Real Numbers and the Constructive Stone-Yosida Theorem Robert S. Lubarsky and Fred Richman Florida Atlantic University.
Scott Closed Set Lattices And Applications 1. Some preliminaries 2. Dcpo-completion 3. Equivalence between CONP and CDL 4. The Hoare power domain 5. Scott.
1 On one-generated projective BL-algebras Antonio Di Nola and Revaz Grigolia University of Salerno Tbilisi State University Department of Mathematics Institute.
Linear Programming System of Linear Inequalities  The solution set of LP is described by Ax  b. Gauss showed how to solve a system of linear.
Chapter 9. Chapter Summary Relations and Their Properties Representing Relations Equivalence Relations Partial Orderings.
Chapter 3 Vector Spaces. The operations of addition and scalar multiplication are used in many contexts in mathematics. Regardless of the context, however,
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Computably Enumerable Semigroups, Algebras, and Groups Bakhadyr Khoussainov The University of Auckland New Zealand Research is partially supported by Marsden.
April 14, 2015Applied Discrete Mathematics Week 10: Equivalence Relations 1 Properties of Relations Definition: A relation R on a set A is called transitive.
Section 2.3 Properties of Solution Sets
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
1 Finite Model Theory Lecture 3 Ehrenfeucht-Fraisse Games.
Word : Let F be a field then the expression of the form a 1, a 2, …, a n where a i  F  i is called a word of length n over the field F. We denote the.
Mathematical Preliminaries
Lecture 2 Plan: 1. Automatic Boolean Algebras 2. Automatic Linear Orders 3. Automatic Trees 4. Automatic Versions of König’s lemma 5. Intrinsic Regularity.
Positively Expansive Maps and Resolution of Singularities Wayne Lawton Department of Mathematics National University of Singapore
1 Decomposition into bipartite graphs with minimum degree 1. Raphael Yuster.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Math 3121 Abstract Algebra I Lecture 11 Finish Section 13 Section 14.
UNIT - 2.  A binary operation on a set combines two elements of the set to produce another element of the set. a*b  G,  a, b  G e.g. +, -, ,  are.
Chapter 6 Abstract algebra
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 9 Boolean Algebras and Combinatorial Circuits.
Lecture 4 Infinite Cardinals. Some Philosophy: What is “2”? Definition 1: 2 = 1+1. This actually needs the definition of “1” and the definition of the.
Chapter 8: Relations. 8.1 Relations and Their Properties Binary relations: Let A and B be any two sets. A binary relation R from A to B, written R : A.
Math 3121 Abstract Algebra I Lecture 14 Sections
1 Set Theory Second Part. 2 Disjoint Set let A and B be a set. the two sets are called disjoint if their intersection is an empty set. Intersection of.
Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN.
Properties of Groups Proposition 1: Let (G,  ) be a group. i.The inverse element of any element of G is unique. Remark: In view of i., we may use the.
Boolean Algebra.
1 Lecture 5 Functions. 2 Functions in real applications Curve of a bridge can be described by a function Converting Celsius to Fahrenheit.
Chapter 2 1. Chapter Summary Sets The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions and sequences.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
© Copyright 2008 STI INNSBRUCK Formal Concept Analysis Intelligent Systems – Lecture 12.
Relations Chapter 9 Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
Chapter 6 Order Relations and Structures
Unit-III Algebraic Structures
Equivalence Relations
Relations Chapter 9.
Axioms for a category of spaces
LATTICES AND BOOLEAN ALGEBRA
Chapter 6 Abstract algebra
Presentation transcript:

Some Aspects of Quasi-Stone Algebras, II Solutions and Simplifications of Some Problems from Sankappanavar and Sankappanavar Jonathan David Farley, D.Phil. Institut für Algebra Johannes Kepler Universität Linz A-4040 Linz Österreich Joint work with Sara-Kaja Fischer Universität Bern Bern, Switzerland Buy! This is a subliminal message.

Definition A quasi-Stone algebra (QSA) is a bounded distributive lattice L with a unary operator ‘ such that: 0’=1 and 1’=0 (x  y)’=x’  y’ (x  y’)’=x’  y’’ x  x’’ x’  x’’=1 *** Jonathan D. Farley V Sara-Kaja Fischer

A Natural Example of a Quasi- Stone Algebra *** Jonathan D. Farley V Sara-Kaja Fischer

A Natural Example of a Quasi- Stone Algebra *** Jonathan D. Farley V Sara-Kaja Fischer 

A Natural Example of a Quasi- Stone Algebra *** Jonathan D. Farley V Sara-Kaja Fischer  The 1-element quasi-Stone algebra

A Natural Example of a Quasi- Stone Algebra *** Jonathan D. Farley V Sara-Kaja Fischer  The 1-element quasi-Stone algebra (Also known as the Farley algebra.)

Example of a Fuzzy Quasi-Stone Algebra *** Jonathan D. Farley V Sara-Kaja Fischer

Example of a Fuzzy Quasi-Stone Algebra *** Jonathan D. Farley V Sara-Kaja Fischer 

Example of a Fuzzy Quasi-Stone Algebra *** Jonathan D. Farley V Sara-Kaja Fischer  The ….-element quasi-Stone algebra

Special Quasi-Stone Algebras Let L be a bounded distributive lattice. For any x in L, let x’ be 0 if x  0 and 1 if x=0. This makes L a quasi-Stone algebra, which we call special. *** Jonathan D. Farley V Sara-Kaja Fischer

Special Quasi-Stone Algebras Let L be a bounded distributive lattice. For any x in L, let x’ be 0 if x  0 and 1 if x=0. This makes L a quasi-Stone algebra, which we call special. *** Jonathan D. Farley V Sara-Kaja Fischer

Special Quasi-Stone Algebras 0’=1 and 1’=0 (x  y)’=x’  y’ (x  y’)’=x’  y’’ x  x’’ x’  x’’=1 *** Jonathan D. Farley V Sara-Kaja Fischer

Problems of Sankappanavar and Sankappanavar from Subdirectly irreducibles a.A problem about simple algebras b.A problem about injectives 2.Amalgamation a.Refutation of a claim of Gaitán b.Coproducts *** Jonathan D. Farley V Sara-Kaja Fischer

1.SUBDIRECTLY IRREDUCIBLES *** Jonathan D. Farley V Sara-Kaja Fischer

Finite Subdirectly Irreducible Quasi-Stone Algebras Let m and n be natural numbers. Let A n be the Boolean lattice with n atoms. Let  m be the Boolean lattice with m atoms with a new top element adjoined. Let Q mn be  m  A n viewed as a special quasi- Stone algebra. *** Jonathan D. Farley V Sara-Kaja Fischer

Finite Subdirectly Irreducible Quasi-Stone Algebras Let m and n be natural numbers. Let A n be the Boolean lattice with n atoms. Let  m be the Boolean lattice with m atoms with a new top element adjoined. Let Q mn be  m  A n viewed as a special quasi-Stone algebra. *** Jonathan D. Farley V Sara-Kaja Fischer Q 20 Q 11

Finite Subdirectly Irreducible Quasi-Stone Algebras Theorem (Sankappanavar and Sankappanavar, 1993). The set of finite subdirectly irreducible quasi-Stone algebras is {Q mn : m,n  0}. The set of finite simple quasi-Stone algebras is {Q 0n : n  0}. *** Jonathan D. Farley V Sara-Kaja Fischer Q 20 Q 11 Q 02

P7 Problem (Sankappanavar and Sankappanavar, 1993).Are there non-Boolean simple quasi- Stone algebras? Solution (Celani and Cabrer, 2009). Yes, using a complicated example of Adams and Beazer. An uncomplicated example can be constructed using Priestley duality. *** Jonathan D. Farley V Sara-Kaja Fischer

Priestley Duality for Bounded Distributive Lattices A partially ordered topological space P is totally order-disconnected if, whenever p and q are in P and p is not less than or equal to q, then there exists a clopen up-set U containing p but not q. p q U *** Jonathan D. Farley V Sara-Kaja Fischer

Priestley Duality for Bounded Distributive Lattices A Priestley space is a compact, totally order- disconnected partially ordered topological space. Every compact, Hausdorff totally- disconnected space (i.e., the space of prime ideals of a Boolean algebra) is a Priestley space. *** Jonathan D. Farley V Sara-Kaja Fischer

A Priestley Space Let P be the set {1,2,3,…}  {  } where the open sets are: any set U not containing  ; any co-finite set V containing .   *** Jonathan D. Farley V Sara-Kaja Fischer

A Priestley Space Let P be the set {1,2,3,…}  {  } where the open sets are: any set U not containing  ; any co-finite set V containing .   The clopen up-sets are the finite sets not containing  and P itself. *** Jonathan D. Farley V Sara-Kaja Fischer

Priestley Duality for Bounded Distributive Lattices Theorem (Priestley). The category of bounded distributive lattices + {0,1}-homomorphisms is dually equivalent to the category of Priestley spaces + continuous, order-preserving maps. *** Jonathan D. Farley V Sara-Kaja Fischer

A Topological Representation of Quasi-Stone Algebras Theorem (Gaitán). Let P be a Priestley space and let E be an equivalence relation on P with the property that: Equivalence classes are closed. For every clopen up-set U of P, E(U):={p  P : pEu for some u  U} is a clopen up-set of P and P\E(U) is a clopen up-set of P. Then the lattice of clopen up-sets of P with the operator U’:= P\E(U) is a quasi-Stone algebra, and every quasi-Stone algebra is isomorphic to such an algebra. *** Jonathan D. Farley V Sara-Kaja Fischer

Gaitán’s Representation for Quasi- Stone Algebras *** Jonathan D. Farley V Sara-Kaja Fischer P

Gaitán’s Representation for Quasi- Stone Algebras *** Jonathan D. Farley V Sara-Kaja Fischer a b c  {b}{b} {a,b}{a,b} {a,b,c}{a,b,c} {b,c}{b,c} {c}{c} P L

Gaitán’s Representation for Quasi- Stone Algebras P\E(  )=P\  ={a,b,c} P\E({b})=P\{a,b}={c} P\E({a,b})=P\{a,b}={c} P\E({c})=P\{c}={a,b} P\E({b,c})=P\{a,b,c}=  P\E({a,b,c})=P\{a,b,c}=  *** Jonathan D. Farley V Sara-Kaja Fischer a b c  {b}{b} {a,b}{a,b} {a,b,c}{a,b,c} {b,c}{b,c} {c}{c} P L

Gaitán’s Representation for Quasi- Stone Algebras P\E(  )=P\  ={a,b,c} P\E({b})=P\{a,b}={c} P\E({a,b})=P\{a,b}={c} P\E({c})=P\{c}={a,b} P\E({b,c})=P\{a,b,c}=  P\E({a,b,c})=P\{a,b,c}=  *** Jonathan D. Farley V Sara-Kaja Fischer a b c  {b}{b} {a,b}{a,b} {a,b,c}{a,b,c} {b,c}{b,c} {c}{c} P L x

Fischer’s Representation for Congruences of Quasi-Stone Algebra Let L be a quasi-Stone algebra with Priestley dual space P and equivalence relation E. Fischer proved that every congruence of L corresponds to a closed subset Y of P such that E(Y)=  Y:={p  P : p  y for some y  Y}. *** Jonathan D. Farley V Sara-Kaja Fischer

Fischer’s Representation for Congruences of Quasi-Stone Algebra The quasi-Stone algebra L corresponding to this Priestley space P with E=PxP is simple: Any non-empty closed subset Y corresponding to a congruence must contain all maximal elements by Fischer’s criterion: E(Y)=  Y. Hence Y must contain  too. But L is not Boolean by Nachbin’s theorem. Thus Fischer’s criterion yields a solution to the problem P7 of Sankappanavar and Sankappanavar’s 1993 paper; Celani and Cabrer’s 2009 example was the first, but it is much more complicated. *** Jonathan D. Farley V Sara-Kaja Fischer  

P5 Definition. An algebra I is injective if for all algebras A, B and morphisms f:A  B and h:A  I, where f is an embedding, there exists a morphism g:B  I such that h=g  f. A class of algebras has enough injectives if every algebra can be embedded into an injective algebra. *** Jonathan D. Farley V Sara-Kaja Fischer A B I f g h

P5 A class of algebras has enough injectives if every algebra can be embedded into an injective algebra. Problem (Sankappavar and Sankappanavar, 1993). Does the variety generated by Q 01 have enough injectives? Solution (***). No: this follows almost from the definitions!! This variety does not have the congruence extension property. *** Jonathan D. Farley V Sara-Kaja Fischer A B I f g h Q 01 Q 10

P5 Problem (Sankappavar and Sankappanavar, 1993). Does the variety generated by Q 01 have enough injectives? Solution (***). Any variety with enough injectives has the congruence extension property: Let A be a subalgebra of B and let f:A  B be the embedding. Let θ be a congruence of A. Embed A/θ into an injective I. Then the kernel of g extends θ. QED. *** Jonathan D. Farley V Sara-Kaja Fischer A B I f g h A B I f g A/θA/θ

2.AMALGAMATION *** Jonathan D. Farley V Sara-Kaja Fischer

Amalgamation Bases Definition. An algebra L is an amalgamation base with respect to a class if, for all M and N in the class and embeddings f:L  M and g:L  N, there exist an algebra K in the class and embeddings d:M  K and e:N  K such that d  f=e  g.d  f=e  g. *** Jonathan D. Farley V Sara-Kaja Fischer L N M K g e d f

The Amalgamation Property Definition. A variety has the amalgamation property if every algebra is an amalgamation base. *** Jonathan D. Farley V Sara-Kaja Fischer L N M K g e d f

P3 Problem (Sankappanavar and Sankappanavar, 1993). Investigate the amalgamation property for the subvarieties of quasi-Stone algebras. Gaitán (2000) stated that the proper subvarieties of quasi-Stone algebras containing Q 01 do not have the amalgamation property. He used a difficult universal algebraic result of C. Bergman and McKenzie, which in turn depends on previous results of Bergman and results of Taylor. *** Jonathan D. Farley V Sara-Kaja Fischer

P3 Fischer found intricate combinatorial proofs that the amalgamation property fails for some subvarieties, proofs that we feel we can extend to all subvarieties except the varieties of Stone algebras (which have AP). Note that the kinds of arguments that work for pseudocomplemented distributive lattices do not work here because we do not have the congruence extension property. This is not “turning the crank”. *** Jonathan D. Farley V Sara-Kaja Fischer

Gaitán’s Claim Gaitán also claimed that the class of finite quasi- Stone algebras has the amalgamation property. We discovered, however, that Gaitán’s published “proof” is wrong. It does not simply have a gap: it is wrong. Hence it remains an open problem to show if the class of (finite) quasi-Stone algebras has the amalgamation property. A first step is to show that any two non-trivial quasi- Stone algebras can be embedded into some quasi- Stone algebra. *** Jonathan D. Farley V Sara-Kaja Fischer

Coproducts A coproduct of two objects A and B in a category consists of an object C and morphisms f:A  C and g:B  C such that, whenever D is an object and h:A  D, k:B  D morphisms, there is a unique morphism e:C  D such that e  f=h and e  g=k. *** Jonathan D. Farley V Sara-Kaja Fischer AB C D fg e h k

Free Quasi-Stone Extension of a Bounded Distributive Lattice Theorem (Gaitán 2000). Let M be a bounded distributive lattice. There exists a quasi-Stone algebra N containing L as a {0,1}-sublattice, which is generated by M as a quasi-Stone algebra and is such that every lattice homomorphism from M to a quasi- Stone algebra A extends to a quasi-Stone algebra homomorphism from N to A. *** Jonathan D. Farley V Sara-Kaja Fischer M N A

Coproducts of Quasi-Stone Algebras Theorem (***). Let K and L be non-trivial quasi-Stone algebras. Let M be the coproduct of K and L in the category of bounded distributive lattices. Let N be the free quasi-Stone extension of M. Let θ be the congruence of N generated by all pairs (k’ K,k’ N )and(l’ L,l’ N ) for all k  K and l  L. Then the co-product of K and L in the category of quasi- Stone algebras is N/θ. *** Jonathan D. Farley V Sara-Kaja Fischer

Coproducts of Quasi-Stone Algebras The coproduct of K and L in the category of bounded distributive lattices has 9 elements. The coproduct in the category of quasi-Stone algebras has 324 elements. *** Jonathan D. Farley V Sara-Kaja Fischer K L

Summary and Next Steps Fischer’s representation of the duals of congruences gives us a simpler solution to the 1993 problem of Sankappanavar and Sankappanavar than Celani and Cabrer’s 2009 example. We solved Sankappanavar and Sankappanavar’s 1993 problem about injectives (which is trivial: one can apply a result of Kollár 1980). We showed that Gaitan’s “proof” that the class of finite quasi- Stone algebras has the amalgamation property is wrong. We proved coproducts exist in the category of quasi-Stone algebras. What are the Priestley duals of principal congruences? What is the Priestley dual of a coproduct of quasi-Stone algebras? *** Jonathan D. Farley V Sara-Kaja Fischer