What are some interesting applications or properties of the topological residue of a set? Is it too similar to the boundary of a set?Properties of a set (closure, interior, boundary)$X$ a topological space. If $A$ lies inside a closed set. Does it follow that the closure of $A$ also lies inside this closed set?Some topological properties of bounded domainsOn the “regularity” of the boundary of an open setWhy is the boundary of a set in the closure of the set?Name of the set $B:= overlineAsetminus A$What is the boundary of $mathbbQ times mathbbQ$ in $mathbbR times mathbbQ$?Boundary of a Subset is Closed in a SpaceTopology, equivalent statements, nets, boundaryInterior of the boundary of an open set is empty

Science-fiction short story where space navy wanted hospital ships and settlers had guns mounted everywhere

Is there a data structure that only stores hash codes and not the actual objects?

PTIJ: Who should I vote for? (21st Knesset Edition)

How can I track script which gives me "command not found" right after the login?

Who is flying the vertibirds?

How to write cleanly even if my character uses expletive language?

Is it possible to upcast ritual spells?

How to terminate ping <dest> &

What is the significance behind "40 days" that often appears in the Bible?

Combining an idiom with a metonymy

What's the meaning of “spike” in the context of “adrenaline spike”?

Interplanetary conflict, some disease destroys the ability to understand or appreciate music

Life insurance that covers only simultaneous/dual deaths

Why is the President allowed to veto a cancellation of emergency powers?

Is it true that good novels will automatically sell themselves on Amazon (and so on) and there is no need for one to waste time promoting?

Why do Australian milk farmers need to protest supermarkets' milk price?

Why would a flight no longer considered airworthy be redirected like this?

Is a party consisting of only a bard, a cleric, and a warlock functional long-term?

Time travel from stationary position?

Did Ender ever learn that he killed Stilson and/or Bonzo?

Does Wild Magic Surge trigger off of spells on the Sorcerer spell list, if I learned them from another class?

SOQL: Populate a Literal List in WHERE IN Clause

How do anti-virus programs start at Windows boot?

Brexit - No Deal Rejection



What are some interesting applications or properties of the topological residue of a set? Is it too similar to the boundary of a set?


Properties of a set (closure, interior, boundary)$X$ a topological space. If $A$ lies inside a closed set. Does it follow that the closure of $A$ also lies inside this closed set?Some topological properties of bounded domainsOn the “regularity” of the boundary of an open setWhy is the boundary of a set in the closure of the set?Name of the set $B:= overlineAsetminus A$What is the boundary of $mathbbQ times mathbbQ$ in $mathbbR times mathbbQ$?Boundary of a Subset is Closed in a SpaceTopology, equivalent statements, nets, boundaryInterior of the boundary of an open set is empty













0












$begingroup$


Recently I stumbled upon the concept of residue of a set (alternately known as the frontier of a set) in general topology, which is the closure of a set A without A itself, or in other words all of the boundary points of A not contained in A:
$$operatornameRes(A)= overline A setminus A$$
I'm not quite sure who first came up with this idea, so I'm not able to provide any useful references. This is very similar to the boundary of A, which for context is usually defined as the closure minus the interior:
$$ partial(A)= overline A setminus A^circ$$
I'm trying to find applications for this concept, so I've been looking for some properties of this residue operation, such as how unions and intersections of sets behave under this operation, how many different sets I can obtain using only the union and residue operations, whether I can use this notion as a primitive for defining topological spaces or weaker notions of it, etc.
So far I have the following:
beginalign
operatornameRes(A) subseteq & partial A \
operatornameRes(C)=&varnothing Leftrightarrow textC is closed \
operatornameRes(U)=&partial(U) Leftrightarrow textU is open \
complement_X(operatornameRes(A))&=A cup operatornameExt(A) \
operatornameResleft(operatornameRes(A)right)&cap operatornameRes(A)= varnothing quad *
endalign

*(hence each successive iteration of $operatornameRes$ will be disjoint from the previous one.)



Just to be absolutely clear, here I define the exterior of A as:
$$operatornameExt(A)=complement_Xleft(overline Aright)=left(complement_X(A)right)^circ$$



This is pretty tedious work, and I realize to many this is pretty trivial and not all that interesting, but I just want to see how much I can get out of this residue operator and whether it has any interesting connections to other topological notions.










share|cite|improve this question











$endgroup$











  • $begingroup$
    I don't know anything about residues, but one thing you might consider is the following: given a particular set how many different sets can you get to using the residue, complement, interior, and closure operators? I believe with closure, complement, and interior the answer is 14. Maybe you can get all sets if you add residue?
    $endgroup$
    – Robert Thingum
    Mar 7 at 1:07










  • $begingroup$
    @RobertThingum I actually did something similar with the boundary, building sets only using A, the boundary operator, and union. There I got 13 distinct sets (not counting the empty set), so I might try the same with the residue operator. Thanks a bunch for the suggestion!
    $endgroup$
    – Quantum Chill
    Mar 7 at 13:49











  • $begingroup$
    In the event you can get every set (doubtful). You should potentially design a structure with operations that act as residue, interior, etc. that is in all but the literal sense a topological space. The study of frames and locales is somewhat like this.
    $endgroup$
    – Robert Thingum
    Mar 7 at 13:54






  • 1




    $begingroup$
    A closely related concept is defined in: Ronald Brown, Topology and Groupoids, Ex. 2.2.8. What is usually called the boundary of a subset is here called its frontier, and what you call the residue of a subset is what here would be called the boundary of its complement: "For any subset $A$ of a topological space $X$, define [...] $operatornameBdA$ (the boundary of $A$) [...] as follows: [...] $operatornameBdA=A setminusoperatornameIntA$ [...]" There follows a list of identities to be proved, including some involving $operatornameBdA$.
    $endgroup$
    – Calum Gilhooley
    Mar 11 at 22:22










  • $begingroup$
    @CalumGilhooley Thanks for the reference! I actually just defined the above concept of boundary myself, so far I'm calling it the perimeter of $A$, and I found that I can represent my notion of boundary of $A$ as a disjoint union of the residue and perimeter. These two sets seem to be dual to each other in a way, as the perimeter is empty for open sets and the residue is empty for closed sets.
    $endgroup$
    – Quantum Chill
    Mar 12 at 14:49















0












$begingroup$


Recently I stumbled upon the concept of residue of a set (alternately known as the frontier of a set) in general topology, which is the closure of a set A without A itself, or in other words all of the boundary points of A not contained in A:
$$operatornameRes(A)= overline A setminus A$$
I'm not quite sure who first came up with this idea, so I'm not able to provide any useful references. This is very similar to the boundary of A, which for context is usually defined as the closure minus the interior:
$$ partial(A)= overline A setminus A^circ$$
I'm trying to find applications for this concept, so I've been looking for some properties of this residue operation, such as how unions and intersections of sets behave under this operation, how many different sets I can obtain using only the union and residue operations, whether I can use this notion as a primitive for defining topological spaces or weaker notions of it, etc.
So far I have the following:
beginalign
operatornameRes(A) subseteq & partial A \
operatornameRes(C)=&varnothing Leftrightarrow textC is closed \
operatornameRes(U)=&partial(U) Leftrightarrow textU is open \
complement_X(operatornameRes(A))&=A cup operatornameExt(A) \
operatornameResleft(operatornameRes(A)right)&cap operatornameRes(A)= varnothing quad *
endalign

*(hence each successive iteration of $operatornameRes$ will be disjoint from the previous one.)



Just to be absolutely clear, here I define the exterior of A as:
$$operatornameExt(A)=complement_Xleft(overline Aright)=left(complement_X(A)right)^circ$$



This is pretty tedious work, and I realize to many this is pretty trivial and not all that interesting, but I just want to see how much I can get out of this residue operator and whether it has any interesting connections to other topological notions.










share|cite|improve this question











$endgroup$











  • $begingroup$
    I don't know anything about residues, but one thing you might consider is the following: given a particular set how many different sets can you get to using the residue, complement, interior, and closure operators? I believe with closure, complement, and interior the answer is 14. Maybe you can get all sets if you add residue?
    $endgroup$
    – Robert Thingum
    Mar 7 at 1:07










  • $begingroup$
    @RobertThingum I actually did something similar with the boundary, building sets only using A, the boundary operator, and union. There I got 13 distinct sets (not counting the empty set), so I might try the same with the residue operator. Thanks a bunch for the suggestion!
    $endgroup$
    – Quantum Chill
    Mar 7 at 13:49











  • $begingroup$
    In the event you can get every set (doubtful). You should potentially design a structure with operations that act as residue, interior, etc. that is in all but the literal sense a topological space. The study of frames and locales is somewhat like this.
    $endgroup$
    – Robert Thingum
    Mar 7 at 13:54






  • 1




    $begingroup$
    A closely related concept is defined in: Ronald Brown, Topology and Groupoids, Ex. 2.2.8. What is usually called the boundary of a subset is here called its frontier, and what you call the residue of a subset is what here would be called the boundary of its complement: "For any subset $A$ of a topological space $X$, define [...] $operatornameBdA$ (the boundary of $A$) [...] as follows: [...] $operatornameBdA=A setminusoperatornameIntA$ [...]" There follows a list of identities to be proved, including some involving $operatornameBdA$.
    $endgroup$
    – Calum Gilhooley
    Mar 11 at 22:22










  • $begingroup$
    @CalumGilhooley Thanks for the reference! I actually just defined the above concept of boundary myself, so far I'm calling it the perimeter of $A$, and I found that I can represent my notion of boundary of $A$ as a disjoint union of the residue and perimeter. These two sets seem to be dual to each other in a way, as the perimeter is empty for open sets and the residue is empty for closed sets.
    $endgroup$
    – Quantum Chill
    Mar 12 at 14:49













0












0








0





$begingroup$


Recently I stumbled upon the concept of residue of a set (alternately known as the frontier of a set) in general topology, which is the closure of a set A without A itself, or in other words all of the boundary points of A not contained in A:
$$operatornameRes(A)= overline A setminus A$$
I'm not quite sure who first came up with this idea, so I'm not able to provide any useful references. This is very similar to the boundary of A, which for context is usually defined as the closure minus the interior:
$$ partial(A)= overline A setminus A^circ$$
I'm trying to find applications for this concept, so I've been looking for some properties of this residue operation, such as how unions and intersections of sets behave under this operation, how many different sets I can obtain using only the union and residue operations, whether I can use this notion as a primitive for defining topological spaces or weaker notions of it, etc.
So far I have the following:
beginalign
operatornameRes(A) subseteq & partial A \
operatornameRes(C)=&varnothing Leftrightarrow textC is closed \
operatornameRes(U)=&partial(U) Leftrightarrow textU is open \
complement_X(operatornameRes(A))&=A cup operatornameExt(A) \
operatornameResleft(operatornameRes(A)right)&cap operatornameRes(A)= varnothing quad *
endalign

*(hence each successive iteration of $operatornameRes$ will be disjoint from the previous one.)



Just to be absolutely clear, here I define the exterior of A as:
$$operatornameExt(A)=complement_Xleft(overline Aright)=left(complement_X(A)right)^circ$$



This is pretty tedious work, and I realize to many this is pretty trivial and not all that interesting, but I just want to see how much I can get out of this residue operator and whether it has any interesting connections to other topological notions.










share|cite|improve this question











$endgroup$




Recently I stumbled upon the concept of residue of a set (alternately known as the frontier of a set) in general topology, which is the closure of a set A without A itself, or in other words all of the boundary points of A not contained in A:
$$operatornameRes(A)= overline A setminus A$$
I'm not quite sure who first came up with this idea, so I'm not able to provide any useful references. This is very similar to the boundary of A, which for context is usually defined as the closure minus the interior:
$$ partial(A)= overline A setminus A^circ$$
I'm trying to find applications for this concept, so I've been looking for some properties of this residue operation, such as how unions and intersections of sets behave under this operation, how many different sets I can obtain using only the union and residue operations, whether I can use this notion as a primitive for defining topological spaces or weaker notions of it, etc.
So far I have the following:
beginalign
operatornameRes(A) subseteq & partial A \
operatornameRes(C)=&varnothing Leftrightarrow textC is closed \
operatornameRes(U)=&partial(U) Leftrightarrow textU is open \
complement_X(operatornameRes(A))&=A cup operatornameExt(A) \
operatornameResleft(operatornameRes(A)right)&cap operatornameRes(A)= varnothing quad *
endalign

*(hence each successive iteration of $operatornameRes$ will be disjoint from the previous one.)



Just to be absolutely clear, here I define the exterior of A as:
$$operatornameExt(A)=complement_Xleft(overline Aright)=left(complement_X(A)right)^circ$$



This is pretty tedious work, and I realize to many this is pretty trivial and not all that interesting, but I just want to see how much I can get out of this residue operator and whether it has any interesting connections to other topological notions.







general-topology






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 11 at 21:08







Quantum Chill

















asked Mar 6 at 18:36









Quantum ChillQuantum Chill

718




718











  • $begingroup$
    I don't know anything about residues, but one thing you might consider is the following: given a particular set how many different sets can you get to using the residue, complement, interior, and closure operators? I believe with closure, complement, and interior the answer is 14. Maybe you can get all sets if you add residue?
    $endgroup$
    – Robert Thingum
    Mar 7 at 1:07










  • $begingroup$
    @RobertThingum I actually did something similar with the boundary, building sets only using A, the boundary operator, and union. There I got 13 distinct sets (not counting the empty set), so I might try the same with the residue operator. Thanks a bunch for the suggestion!
    $endgroup$
    – Quantum Chill
    Mar 7 at 13:49











  • $begingroup$
    In the event you can get every set (doubtful). You should potentially design a structure with operations that act as residue, interior, etc. that is in all but the literal sense a topological space. The study of frames and locales is somewhat like this.
    $endgroup$
    – Robert Thingum
    Mar 7 at 13:54






  • 1




    $begingroup$
    A closely related concept is defined in: Ronald Brown, Topology and Groupoids, Ex. 2.2.8. What is usually called the boundary of a subset is here called its frontier, and what you call the residue of a subset is what here would be called the boundary of its complement: "For any subset $A$ of a topological space $X$, define [...] $operatornameBdA$ (the boundary of $A$) [...] as follows: [...] $operatornameBdA=A setminusoperatornameIntA$ [...]" There follows a list of identities to be proved, including some involving $operatornameBdA$.
    $endgroup$
    – Calum Gilhooley
    Mar 11 at 22:22










  • $begingroup$
    @CalumGilhooley Thanks for the reference! I actually just defined the above concept of boundary myself, so far I'm calling it the perimeter of $A$, and I found that I can represent my notion of boundary of $A$ as a disjoint union of the residue and perimeter. These two sets seem to be dual to each other in a way, as the perimeter is empty for open sets and the residue is empty for closed sets.
    $endgroup$
    – Quantum Chill
    Mar 12 at 14:49
















  • $begingroup$
    I don't know anything about residues, but one thing you might consider is the following: given a particular set how many different sets can you get to using the residue, complement, interior, and closure operators? I believe with closure, complement, and interior the answer is 14. Maybe you can get all sets if you add residue?
    $endgroup$
    – Robert Thingum
    Mar 7 at 1:07










  • $begingroup$
    @RobertThingum I actually did something similar with the boundary, building sets only using A, the boundary operator, and union. There I got 13 distinct sets (not counting the empty set), so I might try the same with the residue operator. Thanks a bunch for the suggestion!
    $endgroup$
    – Quantum Chill
    Mar 7 at 13:49











  • $begingroup$
    In the event you can get every set (doubtful). You should potentially design a structure with operations that act as residue, interior, etc. that is in all but the literal sense a topological space. The study of frames and locales is somewhat like this.
    $endgroup$
    – Robert Thingum
    Mar 7 at 13:54






  • 1




    $begingroup$
    A closely related concept is defined in: Ronald Brown, Topology and Groupoids, Ex. 2.2.8. What is usually called the boundary of a subset is here called its frontier, and what you call the residue of a subset is what here would be called the boundary of its complement: "For any subset $A$ of a topological space $X$, define [...] $operatornameBdA$ (the boundary of $A$) [...] as follows: [...] $operatornameBdA=A setminusoperatornameIntA$ [...]" There follows a list of identities to be proved, including some involving $operatornameBdA$.
    $endgroup$
    – Calum Gilhooley
    Mar 11 at 22:22










  • $begingroup$
    @CalumGilhooley Thanks for the reference! I actually just defined the above concept of boundary myself, so far I'm calling it the perimeter of $A$, and I found that I can represent my notion of boundary of $A$ as a disjoint union of the residue and perimeter. These two sets seem to be dual to each other in a way, as the perimeter is empty for open sets and the residue is empty for closed sets.
    $endgroup$
    – Quantum Chill
    Mar 12 at 14:49















$begingroup$
I don't know anything about residues, but one thing you might consider is the following: given a particular set how many different sets can you get to using the residue, complement, interior, and closure operators? I believe with closure, complement, and interior the answer is 14. Maybe you can get all sets if you add residue?
$endgroup$
– Robert Thingum
Mar 7 at 1:07




$begingroup$
I don't know anything about residues, but one thing you might consider is the following: given a particular set how many different sets can you get to using the residue, complement, interior, and closure operators? I believe with closure, complement, and interior the answer is 14. Maybe you can get all sets if you add residue?
$endgroup$
– Robert Thingum
Mar 7 at 1:07












$begingroup$
@RobertThingum I actually did something similar with the boundary, building sets only using A, the boundary operator, and union. There I got 13 distinct sets (not counting the empty set), so I might try the same with the residue operator. Thanks a bunch for the suggestion!
$endgroup$
– Quantum Chill
Mar 7 at 13:49





$begingroup$
@RobertThingum I actually did something similar with the boundary, building sets only using A, the boundary operator, and union. There I got 13 distinct sets (not counting the empty set), so I might try the same with the residue operator. Thanks a bunch for the suggestion!
$endgroup$
– Quantum Chill
Mar 7 at 13:49













$begingroup$
In the event you can get every set (doubtful). You should potentially design a structure with operations that act as residue, interior, etc. that is in all but the literal sense a topological space. The study of frames and locales is somewhat like this.
$endgroup$
– Robert Thingum
Mar 7 at 13:54




$begingroup$
In the event you can get every set (doubtful). You should potentially design a structure with operations that act as residue, interior, etc. that is in all but the literal sense a topological space. The study of frames and locales is somewhat like this.
$endgroup$
– Robert Thingum
Mar 7 at 13:54




1




1




$begingroup$
A closely related concept is defined in: Ronald Brown, Topology and Groupoids, Ex. 2.2.8. What is usually called the boundary of a subset is here called its frontier, and what you call the residue of a subset is what here would be called the boundary of its complement: "For any subset $A$ of a topological space $X$, define [...] $operatornameBdA$ (the boundary of $A$) [...] as follows: [...] $operatornameBdA=A setminusoperatornameIntA$ [...]" There follows a list of identities to be proved, including some involving $operatornameBdA$.
$endgroup$
– Calum Gilhooley
Mar 11 at 22:22




$begingroup$
A closely related concept is defined in: Ronald Brown, Topology and Groupoids, Ex. 2.2.8. What is usually called the boundary of a subset is here called its frontier, and what you call the residue of a subset is what here would be called the boundary of its complement: "For any subset $A$ of a topological space $X$, define [...] $operatornameBdA$ (the boundary of $A$) [...] as follows: [...] $operatornameBdA=A setminusoperatornameIntA$ [...]" There follows a list of identities to be proved, including some involving $operatornameBdA$.
$endgroup$
– Calum Gilhooley
Mar 11 at 22:22












$begingroup$
@CalumGilhooley Thanks for the reference! I actually just defined the above concept of boundary myself, so far I'm calling it the perimeter of $A$, and I found that I can represent my notion of boundary of $A$ as a disjoint union of the residue and perimeter. These two sets seem to be dual to each other in a way, as the perimeter is empty for open sets and the residue is empty for closed sets.
$endgroup$
– Quantum Chill
Mar 12 at 14:49




$begingroup$
@CalumGilhooley Thanks for the reference! I actually just defined the above concept of boundary myself, so far I'm calling it the perimeter of $A$, and I found that I can represent my notion of boundary of $A$ as a disjoint union of the residue and perimeter. These two sets seem to be dual to each other in a way, as the perimeter is empty for open sets and the residue is empty for closed sets.
$endgroup$
– Quantum Chill
Mar 12 at 14:49










1 Answer
1






active

oldest

votes


















1












$begingroup$

More of a response to the comments than a direct answer to the question, although the comments suggested this could count as an application:



You can get arbitrarily many sets by iterating the residue operator.



If $X_1$ is the unit circle minus a point then $operatornameRes X_1$ is a point.



If $X_2=Dsetminus X_1$, where D is the unit disc, then $operatornameRes X_2 = X_1$. So iterating the residue operator gives you four sets ($X_2$,$X_1$, point, empty set).



You can build more sets $X_n$ in an analogous manner, getting arbitrarily large numbers of sets you can reach by iterated residues alone.



These sorts of things come up with lexicographic orders, so you might want to see if there's some useful connection.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    I had the suspicion that this would be the case, since the sequence of iterations would go on until we reach a closed set, if we ever reach it. Maybe there exists a concrete class of spaces where iterating the residue of an arbitrary subset results in finitely many sets? Now I gotta brush up on the order topology, cheers!
    $endgroup$
    – Quantum Chill
    Mar 12 at 14:55











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%2f3137950%2fwhat-are-some-interesting-applications-or-properties-of-the-topological-residue%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









1












$begingroup$

More of a response to the comments than a direct answer to the question, although the comments suggested this could count as an application:



You can get arbitrarily many sets by iterating the residue operator.



If $X_1$ is the unit circle minus a point then $operatornameRes X_1$ is a point.



If $X_2=Dsetminus X_1$, where D is the unit disc, then $operatornameRes X_2 = X_1$. So iterating the residue operator gives you four sets ($X_2$,$X_1$, point, empty set).



You can build more sets $X_n$ in an analogous manner, getting arbitrarily large numbers of sets you can reach by iterated residues alone.



These sorts of things come up with lexicographic orders, so you might want to see if there's some useful connection.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    I had the suspicion that this would be the case, since the sequence of iterations would go on until we reach a closed set, if we ever reach it. Maybe there exists a concrete class of spaces where iterating the residue of an arbitrary subset results in finitely many sets? Now I gotta brush up on the order topology, cheers!
    $endgroup$
    – Quantum Chill
    Mar 12 at 14:55
















1












$begingroup$

More of a response to the comments than a direct answer to the question, although the comments suggested this could count as an application:



You can get arbitrarily many sets by iterating the residue operator.



If $X_1$ is the unit circle minus a point then $operatornameRes X_1$ is a point.



If $X_2=Dsetminus X_1$, where D is the unit disc, then $operatornameRes X_2 = X_1$. So iterating the residue operator gives you four sets ($X_2$,$X_1$, point, empty set).



You can build more sets $X_n$ in an analogous manner, getting arbitrarily large numbers of sets you can reach by iterated residues alone.



These sorts of things come up with lexicographic orders, so you might want to see if there's some useful connection.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    I had the suspicion that this would be the case, since the sequence of iterations would go on until we reach a closed set, if we ever reach it. Maybe there exists a concrete class of spaces where iterating the residue of an arbitrary subset results in finitely many sets? Now I gotta brush up on the order topology, cheers!
    $endgroup$
    – Quantum Chill
    Mar 12 at 14:55














1












1








1





$begingroup$

More of a response to the comments than a direct answer to the question, although the comments suggested this could count as an application:



You can get arbitrarily many sets by iterating the residue operator.



If $X_1$ is the unit circle minus a point then $operatornameRes X_1$ is a point.



If $X_2=Dsetminus X_1$, where D is the unit disc, then $operatornameRes X_2 = X_1$. So iterating the residue operator gives you four sets ($X_2$,$X_1$, point, empty set).



You can build more sets $X_n$ in an analogous manner, getting arbitrarily large numbers of sets you can reach by iterated residues alone.



These sorts of things come up with lexicographic orders, so you might want to see if there's some useful connection.






share|cite|improve this answer









$endgroup$



More of a response to the comments than a direct answer to the question, although the comments suggested this could count as an application:



You can get arbitrarily many sets by iterating the residue operator.



If $X_1$ is the unit circle minus a point then $operatornameRes X_1$ is a point.



If $X_2=Dsetminus X_1$, where D is the unit disc, then $operatornameRes X_2 = X_1$. So iterating the residue operator gives you four sets ($X_2$,$X_1$, point, empty set).



You can build more sets $X_n$ in an analogous manner, getting arbitrarily large numbers of sets you can reach by iterated residues alone.



These sorts of things come up with lexicographic orders, so you might want to see if there's some useful connection.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Mar 11 at 21:54









Daniel McLauryDaniel McLaury

15.9k32981




15.9k32981











  • $begingroup$
    I had the suspicion that this would be the case, since the sequence of iterations would go on until we reach a closed set, if we ever reach it. Maybe there exists a concrete class of spaces where iterating the residue of an arbitrary subset results in finitely many sets? Now I gotta brush up on the order topology, cheers!
    $endgroup$
    – Quantum Chill
    Mar 12 at 14:55

















  • $begingroup$
    I had the suspicion that this would be the case, since the sequence of iterations would go on until we reach a closed set, if we ever reach it. Maybe there exists a concrete class of spaces where iterating the residue of an arbitrary subset results in finitely many sets? Now I gotta brush up on the order topology, cheers!
    $endgroup$
    – Quantum Chill
    Mar 12 at 14:55
















$begingroup$
I had the suspicion that this would be the case, since the sequence of iterations would go on until we reach a closed set, if we ever reach it. Maybe there exists a concrete class of spaces where iterating the residue of an arbitrary subset results in finitely many sets? Now I gotta brush up on the order topology, cheers!
$endgroup$
– Quantum Chill
Mar 12 at 14:55





$begingroup$
I had the suspicion that this would be the case, since the sequence of iterations would go on until we reach a closed set, if we ever reach it. Maybe there exists a concrete class of spaces where iterating the residue of an arbitrary subset results in finitely many sets? Now I gotta brush up on the order topology, cheers!
$endgroup$
– Quantum Chill
Mar 12 at 14:55


















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%2f3137950%2fwhat-are-some-interesting-applications-or-properties-of-the-topological-residue%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

Lowndes Grove History Architecture References Navigation menu32°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661132°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661178002500"National Register Information System"Historic houses of South Carolina"Lowndes Grove""+32° 48' 6.00", −79° 57' 58.00""Lowndes Grove, Charleston County (260 St. Margaret St., Charleston)""Lowndes Grove"The Charleston ExpositionIt Happened in South Carolina"Lowndes Grove (House), Saint Margaret Street & Sixth Avenue, Charleston, Charleston County, SC(Photographs)"Plantations of the Carolina Low Countrye

random experiment with two different functions on unit interval Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Random variable and probability space notionsRandom Walk with EdgesFinding functions where the increase over a random interval is Poisson distributedNumber of days until dayCan an observed event in fact be of zero probability?Unit random processmodels of coins and uniform distributionHow to get the number of successes given $n$ trials , probability $P$ and a random variable $X$Absorbing Markov chain in a computer. Is “almost every” turned into always convergence in computer executions?Stopped random walk is not uniformly integrable

How should I support this large drywall patch? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How do I cover large gaps in drywall?How do I keep drywall around a patch from crumbling?Can I glue a second layer of drywall?How to patch long strip on drywall?Large drywall patch: how to avoid bulging seams?Drywall Mesh Patch vs. Bulge? To remove or not to remove?How to fix this drywall job?Prep drywall before backsplashWhat's the best way to fix this horrible drywall patch job?Drywall patching using 3M Patch Plus Primer