Canonical extensions and the intermediate structure

Similar documents
A topological duality for posets

A fresh perspective on canonical extensions for bounded lattices

Topological Duality and Algebraic Completions

A VIEW OF CANONICAL EXTENSION

Boolean Algebra and Propositional Logic

Lattice Theory Lecture 5. Completions

Boolean Algebra and Propositional Logic

Completions of Ordered Algebraic Structures A Survey

Topological Duality and Lattice Expansions Part I: A Topological Construction of Canonical Extensions

Relational semantics for a fragment of linear logic

Several restrictions reminiscent of Hilbert's connection and order axioms were imposed. The modular core of a convexity lattice was interpreted as the

Completions of Ordered Algebraic Structures: A Survey

A duality-theoretic approach to MTL-algebras

A Duality for Distributive Unimodal Logic

Stone Algebra Extensions with Bounded Dense Set

On the normal completion of a Boolean algebra

Duality in Logic. Duality in Logic. Lecture 2. Mai Gehrke. Université Paris 7 and CNRS. {ε} A ((ab) (ba) ) (ab) + (ba) +

2 logic, such as those for resolution and hyperresolution. A number of recent developments serve as the motivation for the current paper. In [2, 3], i

An algebraic approach to Gelfand Duality

A simple propositional calculus for compact Hausdor spaces

arxiv: v1 [math.lo] 10 Sep 2013

Varieties of Heyting algebras and superintuitionistic logics

The lattice of varieties generated by small residuated lattices

Duality and Automata Theory

BOOLEAN TOPOLOGICAL DISTRIBUTIVE LATTICES AND CANONICAL EXTENSIONS

MacNeille completions and canonical extensions

Given a lattice L we will note the set of atoms of L by At (L), and with CoAt (L) the set of co-atoms of L.

The role of the overlap relation in constructive mathematics

Expansions of Heyting algebras

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

Relational Representations for Bounded Lattices with Operators. Gerrit Goosen

Algebraic duality for partially ordered sets

A Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries

Boolean Semilattices

RELATION ALGEBRAS. Roger D. MADDUX. Department of Mathematics Iowa State University Ames, Iowa USA ELSEVIER

The Morita-equivalence between MV-algebras and abelian l-groups with strong unit

Universal Algebra for Logics

Logic, algebra and topology: investigations into canonical extensions, duality theory and point-free topology Vosmaer, J.

Type Classification of Unification Problems over Distributive Lattices and De Morgan Algebras

A bitopological point-free approach to compactifications

Characterising FS domains by means of power domains

The Lattice of Subvarieties of Semilattice Ordered Algebras

848 Jyung Ryun Seo and Chang Koo Lee that NFrm is complete, cocomplete and study permanence properties of important subcategories of NFrm. Furthermore

MV-algebras and fuzzy topologies: Stone duality extended

On the Structure of Rough Approximations

Notes about Filters. Samuel Mimram. December 6, 2012

Congruence lattices and Compact Intersection Property

Relations on Hypergraphs

a j are in M and the x i are indeterminates. Suppose that there is a solution b 1 ; :::; b n to this system in N (that is, the b i are in N and for ea

Modal-Like Operators in Boolean Lattices, Galois Connections and Fixed Points

Skew Boolean algebras

Topological algebra based on sorts and properties as free and cofree universes

An adjoint construction for topological models of intuitionistic modal logic Extended abstract

SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS

STONE DUALITY, TOPOLOGICAL ALGEBRA, AND RECOGNITION

8. Distributive Lattices. Every dog must have his day.

3. Algebraic Lattices. The more I get, the more I want it seems... King Oliver

Computing Spectra via Dualities in the MTL hierarchy

On Jankov-de Jongh formulas

Reflexivity of Locally Convex Spaces over Local Fields

The prime spectrum of MV-algebras based on a joint work with A. Di Nola and P. Belluce

VARIETIES OF POSITIVE MODAL ALGEBRAS AND STRUCTURAL COMPLETENESS

A NEW VERSION OF AN OLD MODAL INCOMPLETENESS THEOREM

SPECTRAL-LIKE DUALITY FOR DISTRIBUTIVE HILBERT ALGEBRAS WITH INFIMUM

DISTRIBUTIVE, STANDARD AND NEUTRAL ELEMENTS IN TRELLISES. 1. Introduction

Implicational classes ofde Morgan Boolean algebras

Topos Theory. Lectures 21 and 22: Classifying toposes. Olivia Caramello. Topos Theory. Olivia Caramello. The notion of classifying topos

ON THE CONGRUENCE LATTICE OF A FRAME

Distributivity conditions and the order-skeleton of a lattice

11 Annihilators. Suppose that R, S, and T are rings, that R P S, S Q T, and R U T are bimodules, and finally, that

Negation from the perspective of neighborhood semantics

Distributive Lattices with Quantifier: Topological Representation

Houston Journal of Mathematics. c 2004 University of Houston Volume 30, No. 4, 2004

On Augmented Posets And (Z 1, Z 1 )-Complete Posets

Open Problems in Algebraic General Topology

Stone and Heyting duality for classical and intuitionistic propositional logic

The Adjoint Action of a Homotopy-associative H-space on its Loop Space.

countably based, totally disconnected compact Hausdor spaces, arises from the fact that compact ultrametric spaces, a category of spaces widely used i

A NOTE ON ORDER CONVERGENCE IN COMPLETE LATTICES

A Duality Theory for Bilattices B. Mobasher, D. Pigozzi, G. Slutzki and G. Voutsadakis July 9, 1999 Abstract Recent studies of the algebraic propertie

Quantifiers and duality

2 THE COMPUTABLY ENUMERABLE SUPERSETS OF AN R-MAXIMAL SET The structure of E has been the subject of much investigation over the past fty- ve years, s

Algebraic General Topology. Volume 1. Victor Porton. address: URL:

Cross Connection of Boolean Lattice

Extending Algebraic Operations to D-Completions

Completeness proofs via canonical models on increasingly generalized settings

Constructive version of Boolean algebra

Priestley Duality for Bilattices

Intersection types and domain operators

Algebraic Canonicity in Non-Classical Logics

DUALITIES, NATURAL AND OTHERWISE GAIA With acknowledgements, in particular, to Brian Davey and Leonardo Cabrer

1 Introduction. (C1) If acb, then a 0 and b 0,

Dedekind MacNeille Completion of n-ordered Sets

Standard Koszul standardly stratied algebras

UNITARY UNIFICATION OF S5 MODAL LOGIC AND ITS EXTENSIONS

Distributive Substructural Logics as Coalgebraic Logics over Posets

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

by Say that A is replete (wrt ) if it is orthogonal to all f: X Y in C such that f : Y X is iso, ie for such f and all there is a unique such that the

Unification and Projectivity in De Morgan and Kleene Algebras

Another Glance at the Alpern-Schneider. Characterization of Safety andliveness in. Concurrent Executions. Abstract

Transcription:

Canonical extensions and the intermediate structure Andrew Craig Mathematical Institute, Oxford University Workshop on Lattices, Relations and Kleene Algebras UCL 21 September 2010

Let L be a lattice and C a complete lattice with L isomorphic to a sublattice of C. Then C is a completion of L and C is a dense completion if any element of C can be expressed as both a meet of joins and join of meets of elements of L, C is a compact completion if for any lter F, and ideal I, of L if F I then F I. If C is both a dense and compact completion of L it is called a canonical extension of L. Theorem (Gehrke & Harding, 2001) Every bounded lattice L has a canonical extension, and this is unique up to an isomorphism which xes L.

History of canonical extensions: 1951 Jónsson & Tarski: canonical extensions for Boolean algebras with operators 1994 Gehrke & Jónsson: bounded distributive lattices with operators 2000 Gehrke & Jónsson: bounded distributive lattices with monotone operations 2001 Gehrke & Harding: bounded lattice expansions 2004 Gehrke & Jónsson: distributive lattices with arbitrary operations 2005 Dunn, Gehrke, Palmigiano: partially ordered sets 2009 Moshier & Jipsen: topological duality theorem for bounded lattices

Construction of the canonical extension Using the lters, F(L), and ideals, I(L), of L, form F(L) I(L). This is the intermediate structure, ordered by: F 1 F 2 F 2 F 1 I 1 I 2 I 1 I 2 F I F I I F x I, y F = x y ( IM(L), ) is the intermediate structure. The canonical extension, L δ, is the MacNeille completion of the intermediate structure. That is, L δ = IM(L).

Filter and ideal elements of L δ p = F, where F F(L), is a lter element u = I, where I I(L), is an ideal element F (L δ ) : lter elements of L δ I (L δ ) : ideal elements of L δ F (L δ ) is order isomorphic to ( F(L), ), and I (L δ ) is order isomorphic to ( I(L), ). α : F(L) C, F e[f ] β : I(L) C, I e[i ] ) ( ) This gives (F(L) I(L), order isomorphic to F (L δ ) I (L δ ),.

Example a 0 a 1 a 0 a 1 a 0 a 1 b 1 b 0 c b 1 b 0 a b b 1 b 0 L L L δ

Example a 0 a 1 a 0 a 1 a 0 a 1 b 1 b 0 c b 1 b 0 a b b 1 b 0 L L L δ

Example a 0 a 1 a 0 a 1 a 0 a 1 b 1 b 0 c b 1 b 0 a b b 1 b 0 L L L δ

Canonical extensions destroy existing innite meets and joins: a0 a1 b1 b0 a0 a1 a 1 b 1 b1 b0 a0 a1 a 2 a 1 b 1 b 2 b1 b0 L L δ (L δ ) δ

The intermediate structure Intermediate structure rst described by Ghilardi and Meloni (1997). Used by Dunn, Gehrke and Palmigiano (2005) to describe canonical extensions of posets. Gehrke and Priestley (2008) use the intermediate structure to explain why the canonical extension is functorial. This is done using the following concept. Denition (Erné, 1991) An order-preserving map f : P Q is cut-stable if for all q 1, q 2 Q, q 1 q 2 = p 1, p 2 P s.t. p 1 p 2 and f 1 ( q 1 ) p 1 and f 1 ( q 2 ) p 2.

Theorem (Erné, 1991) The category of complete lattices with complete lattice homomorphisms is a full reective subcategory of the category of posets with cut-stable maps. Dene the extension of a map f : L M to IM(f ) : IM(L) IM(M): IM(f )(x) = { {f (a) : a x, a L} if x I(L) {f (a) : a x, a L} if x F(L) Theorem (Gehrke & Priestley, 2008) For f : L M a lattice homomorphism, the extension IM(f ) : IM(L) IM(M) is a cut-stable map.

Algebraicity of canonical extensions Gehrke and Jónsson (1994) showed that the canonical extension of a distributive lattice is always doubly algebraic. That is, both L δ and (L δ ) are algebraic. The following example is originally due to Harding (1998). It is a non-distributive lattice whose canonical extension is not algebraic. The result below helps us to construct its canonical extension. Lemma (Gehrke & Vosmaer) If a lattice L satises ACC, then L δ = F (L δ ). Dually, if L satises DCC, then L δ = I (L δ ).

a 20 a 00 a 20 a 00 a 11 a 02 a 11 x 2 x 1 a 02 x 0 L L δ = F (L δ )

Dene the following: F I if F I and I F. F I = {x F : y I, x y} I F = {y I : x F, y x}. Theorem If F I and either F I or I F is nite, then both F I and F I exist.

Lemma Consider the embeddings e 1 : ( F(L), ) ( IM(L), ), F F and e 2 : ( I(L), ) ( IM(L), ), I I. Then e 1 preserves arbitrary meets and nite joins, and e 2 preserves arbitrary joins and nite meets. Question: Is the canonical extension of a lattice always the same as the intermediate structure? Answer: No!

Lemma Consider the embeddings e 1 : ( F(L), ) ( IM(L), ), F F and e 2 : ( I(L), ) ( IM(L), ), I I. Then e 1 preserves arbitrary meets and nite joins, and e 2 preserves arbitrary joins and nite meets. Question: Is the canonical extension of a lattice always the same as the intermediate structure? Answer: No!

A distributive lattice whose canonical extension is not the intermediate structure: (0, 1) (0, 0) ( 2, 0)

A distributive lattice whose canonical extension is not the intermediate structure: (0, ω) (0, 1) (0, 0) ( 2, 0) ( 1, ω) ( ω, 1)

A distributive lattice whose canonical extension is not the intermediate structure: (0, ω) (0, 1) (0, 0) ( 2, 0) ( 1, ω) ( ω, 1) ( ω, ω)

Distributivity of canonical extensions The canonical extension of a distributive lattice is always distributive. By contrast, the MacNeille completion does not always preserve distributivity. Counter-example due to Funayama (1944) makes use of the concept of neutral elements. Denition (Ore, 1935) An element a of a lattice L is neutral if, for any x, y L, the lattice generated by {a, x, y} is distributive. The neutral elements of a lattice L form a distributive sublattice of L. Hence the MacNeille completion, L of a distributive lattice L is distributive if and only if every element of L is neutral.

Consider the following lattices a 0 a 1 a 0 a 1 p q b 1 b 1 b 0 b 0 L 1 L 2 L 3 Let L = L 1 L 2 L 3.

(a 0, p, c 0 ) L = L 1 L 2 L 3 (b 0, q, d 0 )

(b 3, p, c 0 ) (b 0, p, c 0 ) (b 0, q, c 0 ) (b 0, q, c 3 ) (a 0, p, c 0 ) (b 0, q, d 0 ) Distributive sublattice of L. The MacNeille completion of this is not distributive.

(a 0, p, c 0 ) (b ω, p, c 0 ) (b 3, p, c 0 ) (b 0, p, c 0 ) (b 0, q, c 0 ) (b ω, q, d ω ) (b 0, q, c 3 ) (b 0, q, d ω ) (b 0, q, d 0 ) This is the MacNeille completion of the sublattice of L. This completion is not distributive.

(a 0, p, c 0 ) (a ω, p, c 0 ) (a 0, p, c ω ) (b ω, p, c 0 ) (b 3, p, c 0 ) (b 0, p, c 0 ) (b 0, q, c 0 ) (b 0, q, c 3 ) (b 0, q, c ω ) (b ω, q, d 0 ) The intermediate structure. (b 0, q, d 0 )

(a 0, p, c 0 ) (b ω, p, c 0 ) (b 3, p, c 0 ) (b 0, p, c 0 ) x (b 0, q, c 0 ) (b 0, q, c 3 ) y (b 0, q, c ω ) (b ω, q, d 0 ) The canonical extension. (b 0, q, d 0 )

Further work: Use the intermediate structure to nd when L δ will be: algebraic; continuous; meet-continuous.