Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T13:58:11.398Z Has data issue: false hasContentIssue false

CLOSURE OPERATORS, FRAMES AND NEATEST REPRESENTATIONS

Published online by Cambridge University Press:  21 June 2017

ROB EGROT*
Affiliation:
Faculty of Information and Communication Technology, Mahidol University, 999 Phuttamonthon 4 Road, Salaya, Nakhon Pathom 73170, Thailand email robert.egr@mahidol.ac.th
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Given a poset $P$ and a standard closure operator $\unicode[STIX]{x1D6E4}:{\wp}(P)\rightarrow {\wp}(P)$ , we give a necessary and sufficient condition for the lattice of $\unicode[STIX]{x1D6E4}$ -closed sets of ${\wp}(P)$ to be a frame in terms of the recursive construction of the $\unicode[STIX]{x1D6E4}$ -closure of sets. We use this condition to show that, given a set ${\mathcal{U}}$ of distinguished joins from $P$ , the lattice of ${\mathcal{U}}$ -ideals of $P$ fails to be a frame if and only if it fails to be $\unicode[STIX]{x1D70E}$ -distributive, with $\unicode[STIX]{x1D70E}$ depending on the cardinalities of sets in ${\mathcal{U}}$ . From this we deduce that if a poset has the property that whenever $a\wedge (b\vee c)$ is defined for $a,b,c\in P$ it is necessarily equal to $(a\wedge b)\vee (a\wedge c)$ , then it has an $(\unicode[STIX]{x1D714},3)$ -representation.

Information

Type
Research Article
Copyright
© 2017 Australian Mathematical Publishing Association Inc.