name of algebraic structure generalizing closure and interior












0












$begingroup$


Is there a name for an algebraic structure equipped with an involution and two additional unary functions that "act like" the interior and closure of a set?



I'm after something a little bit like an $i$-lattice / DeMorgan algebra but additionally with something that "feels like" $square$ and $lozenge$ from modal logic.



Suppose we take the sets of subsets of $mathbb{R}$ and consider the operations $cup(cdot, cdot);,; cap(cdot, cdot);,; cdot^complement;,; mathrm{int}(cdot);,; overline{(cdot)} $ , so union, intersection, complement, interior, and closure.



$cup$ and $cap$ distribute over each other and are duals with respect to $cdot^complement$ and $x^complement{^complement} = x$ .



Interior are closure are also dual and each is idempotent.



$$ mathrm{int}(x^complement)^complement = overline{x} tag{1} $$



$$ mathrm{int}(mathrm{int}(x)) = mathrm{int}(x) tag{2} $$



And the union of the closures is the closure of the (finite) union(s).



$$ overline{x} cup overline{y} = overline{x cup y} tag{3} $$



Here's an example of a finite structure satisfying the rules. The domain of our structure is ${text{-1}, 0, 1}$



$$ x cap y stackrel{df}{=} min(x, y) tag{4} $$
$$ x cup y stackrel{df}{=} max(x, y) tag{5} $$
$$ x ^complement stackrel{df}{=} -x tag{6} $$
$$ mathrm{int}(text{-1}) stackrel{df}{=} text{-1} \
mathrm{int}(0) stackrel{df}{=} 0 \
mathrm{int}(1) stackrel{df}{=} 0 tag{7} $$

$$ overline{(text{-1})} stackrel{df}{=} 0 \
overline{0} stackrel{df}{=} 0 \
overline{1} stackrel{df}{=} 1 tag{8} $$



Note that it isn't possible to swap the definitions in (7) and (8) because of (3) ... which guarantees that union and closure "move things in a similar direction".










share|cite|improve this question









$endgroup$












  • $begingroup$
    I think this falls into the category of Boolean algebras with operators?
    $endgroup$
    – Noah Schweber
    Dec 3 '18 at 1:14










  • $begingroup$
    @NoahSchweber Isn't it amazing that one could own that book for $389?!!
    $endgroup$
    – rschwieb
    Dec 3 '18 at 2:22
















0












$begingroup$


Is there a name for an algebraic structure equipped with an involution and two additional unary functions that "act like" the interior and closure of a set?



I'm after something a little bit like an $i$-lattice / DeMorgan algebra but additionally with something that "feels like" $square$ and $lozenge$ from modal logic.



Suppose we take the sets of subsets of $mathbb{R}$ and consider the operations $cup(cdot, cdot);,; cap(cdot, cdot);,; cdot^complement;,; mathrm{int}(cdot);,; overline{(cdot)} $ , so union, intersection, complement, interior, and closure.



$cup$ and $cap$ distribute over each other and are duals with respect to $cdot^complement$ and $x^complement{^complement} = x$ .



Interior are closure are also dual and each is idempotent.



$$ mathrm{int}(x^complement)^complement = overline{x} tag{1} $$



$$ mathrm{int}(mathrm{int}(x)) = mathrm{int}(x) tag{2} $$



And the union of the closures is the closure of the (finite) union(s).



$$ overline{x} cup overline{y} = overline{x cup y} tag{3} $$



Here's an example of a finite structure satisfying the rules. The domain of our structure is ${text{-1}, 0, 1}$



$$ x cap y stackrel{df}{=} min(x, y) tag{4} $$
$$ x cup y stackrel{df}{=} max(x, y) tag{5} $$
$$ x ^complement stackrel{df}{=} -x tag{6} $$
$$ mathrm{int}(text{-1}) stackrel{df}{=} text{-1} \
mathrm{int}(0) stackrel{df}{=} 0 \
mathrm{int}(1) stackrel{df}{=} 0 tag{7} $$

$$ overline{(text{-1})} stackrel{df}{=} 0 \
overline{0} stackrel{df}{=} 0 \
overline{1} stackrel{df}{=} 1 tag{8} $$



Note that it isn't possible to swap the definitions in (7) and (8) because of (3) ... which guarantees that union and closure "move things in a similar direction".










share|cite|improve this question









$endgroup$












  • $begingroup$
    I think this falls into the category of Boolean algebras with operators?
    $endgroup$
    – Noah Schweber
    Dec 3 '18 at 1:14










  • $begingroup$
    @NoahSchweber Isn't it amazing that one could own that book for $389?!!
    $endgroup$
    – rschwieb
    Dec 3 '18 at 2:22














0












0








0





$begingroup$


Is there a name for an algebraic structure equipped with an involution and two additional unary functions that "act like" the interior and closure of a set?



I'm after something a little bit like an $i$-lattice / DeMorgan algebra but additionally with something that "feels like" $square$ and $lozenge$ from modal logic.



Suppose we take the sets of subsets of $mathbb{R}$ and consider the operations $cup(cdot, cdot);,; cap(cdot, cdot);,; cdot^complement;,; mathrm{int}(cdot);,; overline{(cdot)} $ , so union, intersection, complement, interior, and closure.



$cup$ and $cap$ distribute over each other and are duals with respect to $cdot^complement$ and $x^complement{^complement} = x$ .



Interior are closure are also dual and each is idempotent.



$$ mathrm{int}(x^complement)^complement = overline{x} tag{1} $$



$$ mathrm{int}(mathrm{int}(x)) = mathrm{int}(x) tag{2} $$



And the union of the closures is the closure of the (finite) union(s).



$$ overline{x} cup overline{y} = overline{x cup y} tag{3} $$



Here's an example of a finite structure satisfying the rules. The domain of our structure is ${text{-1}, 0, 1}$



$$ x cap y stackrel{df}{=} min(x, y) tag{4} $$
$$ x cup y stackrel{df}{=} max(x, y) tag{5} $$
$$ x ^complement stackrel{df}{=} -x tag{6} $$
$$ mathrm{int}(text{-1}) stackrel{df}{=} text{-1} \
mathrm{int}(0) stackrel{df}{=} 0 \
mathrm{int}(1) stackrel{df}{=} 0 tag{7} $$

$$ overline{(text{-1})} stackrel{df}{=} 0 \
overline{0} stackrel{df}{=} 0 \
overline{1} stackrel{df}{=} 1 tag{8} $$



Note that it isn't possible to swap the definitions in (7) and (8) because of (3) ... which guarantees that union and closure "move things in a similar direction".










share|cite|improve this question









$endgroup$




Is there a name for an algebraic structure equipped with an involution and two additional unary functions that "act like" the interior and closure of a set?



I'm after something a little bit like an $i$-lattice / DeMorgan algebra but additionally with something that "feels like" $square$ and $lozenge$ from modal logic.



Suppose we take the sets of subsets of $mathbb{R}$ and consider the operations $cup(cdot, cdot);,; cap(cdot, cdot);,; cdot^complement;,; mathrm{int}(cdot);,; overline{(cdot)} $ , so union, intersection, complement, interior, and closure.



$cup$ and $cap$ distribute over each other and are duals with respect to $cdot^complement$ and $x^complement{^complement} = x$ .



Interior are closure are also dual and each is idempotent.



$$ mathrm{int}(x^complement)^complement = overline{x} tag{1} $$



$$ mathrm{int}(mathrm{int}(x)) = mathrm{int}(x) tag{2} $$



And the union of the closures is the closure of the (finite) union(s).



$$ overline{x} cup overline{y} = overline{x cup y} tag{3} $$



Here's an example of a finite structure satisfying the rules. The domain of our structure is ${text{-1}, 0, 1}$



$$ x cap y stackrel{df}{=} min(x, y) tag{4} $$
$$ x cup y stackrel{df}{=} max(x, y) tag{5} $$
$$ x ^complement stackrel{df}{=} -x tag{6} $$
$$ mathrm{int}(text{-1}) stackrel{df}{=} text{-1} \
mathrm{int}(0) stackrel{df}{=} 0 \
mathrm{int}(1) stackrel{df}{=} 0 tag{7} $$

$$ overline{(text{-1})} stackrel{df}{=} 0 \
overline{0} stackrel{df}{=} 0 \
overline{1} stackrel{df}{=} 1 tag{8} $$



Note that it isn't possible to swap the definitions in (7) and (8) because of (3) ... which guarantees that union and closure "move things in a similar direction".







abstract-algebra






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 3 '18 at 0:42









Gregory NisbetGregory Nisbet

566312




566312












  • $begingroup$
    I think this falls into the category of Boolean algebras with operators?
    $endgroup$
    – Noah Schweber
    Dec 3 '18 at 1:14










  • $begingroup$
    @NoahSchweber Isn't it amazing that one could own that book for $389?!!
    $endgroup$
    – rschwieb
    Dec 3 '18 at 2:22


















  • $begingroup$
    I think this falls into the category of Boolean algebras with operators?
    $endgroup$
    – Noah Schweber
    Dec 3 '18 at 1:14










  • $begingroup$
    @NoahSchweber Isn't it amazing that one could own that book for $389?!!
    $endgroup$
    – rschwieb
    Dec 3 '18 at 2:22
















$begingroup$
I think this falls into the category of Boolean algebras with operators?
$endgroup$
– Noah Schweber
Dec 3 '18 at 1:14




$begingroup$
I think this falls into the category of Boolean algebras with operators?
$endgroup$
– Noah Schweber
Dec 3 '18 at 1:14












$begingroup$
@NoahSchweber Isn't it amazing that one could own that book for $389?!!
$endgroup$
– rschwieb
Dec 3 '18 at 2:22




$begingroup$
@NoahSchweber Isn't it amazing that one could own that book for $389?!!
$endgroup$
– rschwieb
Dec 3 '18 at 2:22










0






active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3023440%2fname-of-algebraic-structure-generalizing-closure-and-interior%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3023440%2fname-of-algebraic-structure-generalizing-closure-and-interior%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

How do I know what Microsoft account the skydrive app is syncing to?

Grease: Live!

When does type information flow backwards in C++?