Closure operators, frames and neatest representations

DOI10.1017/S0004972717000314zbMATH Open1423.06013arXiv1702.02257MaRDI QIDQ4589153FDOQ4589153

Authors: Robert Egrot 

Publication date: 7 November 2017

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Abstract: Given a poset $P$ and a standard closure operator $Gamma:wp(P)owp(P)$ we give a necessary and sufficient condition for the lattice of $Gamma$-closed sets of $wp(P)$ to be a frame in terms of the recursive construction of the $Gamma$-closure of sets. We use this condition to show that given a set $mathcalU$ of distinguished joins from $P$, the lattice of $mathcalU$-ideals of $P$ fails to be a frame if and only if it fails to be $sigma$-distributive, with $sigma$ depending on the cardinalities of sets in $mathcalU$. From this we deduce that if a poset has the property that whenever $awedge(bveec)$ is defined for $a,b,cinP$ it is necessarily equal to $(awedgeb)vee(awedgec)$, then it has an $(omega,3)$-representation. This answers a question from the literature.

Full work available at URL: https://arxiv.org/abs/1702.02257

Recommendations

• On the representation of partially ordered sets
• Representations of algebraic lattices
• Pseudocomplements of closure operators on posets
• Closure operators on complete almost distributive lattices. III.
• Closure operators on complete almost distributive lattices. II

zbMATH Keywords

representationsposetsclosure operators

Mathematics Subject Classification ID

Galois correspondences, closure operators (in relation to ordered sets) (06A15) Frames, locales (06D22) Logical aspects of lattices and related structures (03G10) Algebraic aspects of posets (06A11)

Cites Work

• On the definition of distributive semilattices
• Representable posets
• REPRESENTATION OF POSETS
• A Representation Theory for Prime and Implicative Semilattices
• Boolean Rings with Isomorphisms Preserving Suprema and Infima
• Standard completions for quasiordered sets
• On congruence lattices of lattices
• Closure
• Universal and internal properties of some completions of k-join-semilattices and k-join-distributive partially ordered sets.
• Weakly distributive semilattices
• Universal and internal properties of some extensions of partially orderd sets.
• Distributive partially ordered sets
• Embedding ordered sets into distributive lattices
• Each join-completion of a partially ordered set in the solution of a universal problem
• Distributivity in semilattices
• On separation properties in semilattices
• Representation of partially ordered sets
• The class of prime semilattices is not finitely axiomatizable
• No finite axiomatizations for posets embeddable into distributive lattices

Cited In (3)

• RECURSIVE AXIOMATISATIONS FROM SEPARATION PROPERTIES
• Title not available (Why is that?)
• On minimum matrix representation of closure operations

This page was built for publication: Closure operators, frames and neatest representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589153)