What's the difference between different approaches to demonstrating closedness (etc.) sets?Heine-Borel - Finite Intersection equivalence in subspacesCompact subset of a Hausdorff space is closed.What is the difference between open intervals and standard topology on $mathbbR$How to prove any closed set in $mathbbR$ is $G_delta$Limit point definition of a closed set, versus complement of open set definition?Complements on the product topologyShowing a set is closed and show a set is open(if and only if)Consider the sequence $x_n = (7 + (-1)^n/n, -5) inmathbbR^2$. What are the sets of limit points in different topologies?Please, where can I find some good worked examples of compact spaces?The complement of an open set?
"listening to me about as much as you're listening to this pole here"
What does it exactly mean if a random variable follows a distribution
What do you call something that goes against the spirit of the law, but is legal when interpreting the law to the letter?
New order #4: World
Ideas for 3rd eye abilities
How to move the player while also allowing forces to affect it
Extreme, but not acceptable situation and I can't start the work tomorrow morning
aging parents with no investments
Why airport relocation isn't done gradually?
How to deal with fear of taking dependencies
What is it called when one voice type sings a 'solo'?
What happens when a metallic dragon and a chromatic dragon mate?
How can I plot a Farey diagram?
What is GPS' 19 year rollover and does it present a cybersecurity issue?
Is there a familial term for apples and pears?
Unbreakable Formation vs. Cry of the Carnarium
Typesetting a double Over Dot on top of a symbol
How is it possible for user's password to be changed after storage was encrypted? (on OS X, Android)
Is "plugging out" electronic devices an American expression?
What to wear for invited talk in Canada
How would photo IDs work for shapeshifters?
Why do we use polarized capacitors?
Is every set a filtered colimit of finite sets?
Could a US political party gain complete control over the government by removing checks & balances?
What's the difference between different approaches to demonstrating closedness (etc.) sets?
Heine-Borel - Finite Intersection equivalence in subspacesCompact subset of a Hausdorff space is closed.What is the difference between open intervals and standard topology on $mathbbR$How to prove any closed set in $mathbbR$ is $G_delta$Limit point definition of a closed set, versus complement of open set definition?Complements on the product topologyShowing a set is closed and show a set is open(if and only if)Consider the sequence $x_n = (7 + (-1)^n/n, -5) inmathbbR^2$. What are the sets of limit points in different topologies?Please, where can I find some good worked examples of compact spaces?The complement of an open set?
$begingroup$
What's the difference between different approaches to demonstrating closedness (etc.) sets?
What confuses me that sometimes I for example find showing
complement is open $implies$ the set is closed
easier than some
"take a sequence of elements and show that limit is not in the set"
The problem with this latter approach is that I find that depending on the set it could be difficult to construct such sequence.
Or would you say that these are equivalent in terms of "difficulty"?
general-topology
$endgroup$
|
show 2 more comments
$begingroup$
What's the difference between different approaches to demonstrating closedness (etc.) sets?
What confuses me that sometimes I for example find showing
complement is open $implies$ the set is closed
easier than some
"take a sequence of elements and show that limit is not in the set"
The problem with this latter approach is that I find that depending on the set it could be difficult to construct such sequence.
Or would you say that these are equivalent in terms of "difficulty"?
general-topology
$endgroup$
2
$begingroup$
It's hard to know how to answer your question. Mathematical methods apply differently to different mathematical problems. "Closedness" might be demonstrated one way in one problem and a different way in a different problem. Learning the correct way to demonstrate it in a particular problem is part of the job of the mathematician. If you have a question about doing this in a particular problem that's one thing, but as the question is currently posed I don't think it is answerable.
$endgroup$
– Lee Mosher
Mar 22 at 15:36
$begingroup$
Put a concrete example where "could be difficult to construct such sequence".
$endgroup$
– Martín-Blas Pérez Pinilla
Mar 22 at 16:50
$begingroup$
@Martín-BlasPérezPinilla $ n : n in mathbbZ_+$ is closed, but other than noticing that its complement is union of open intervals $(n,n+1)$, then how would one prove that some sequence would not have a limit in this set? I guess one could show that the sequence difference cannot be less than one?
$endgroup$
– mavavilj
Mar 22 at 17:59
$begingroup$
Right. Using that the space is discrete is the essential fact.
$endgroup$
– Martín-Blas Pérez Pinilla
Mar 22 at 21:12
$begingroup$
That "take a sequence of elements" stuff does not always hold.
$endgroup$
– William Elliot
Mar 22 at 23:11
|
show 2 more comments
$begingroup$
What's the difference between different approaches to demonstrating closedness (etc.) sets?
What confuses me that sometimes I for example find showing
complement is open $implies$ the set is closed
easier than some
"take a sequence of elements and show that limit is not in the set"
The problem with this latter approach is that I find that depending on the set it could be difficult to construct such sequence.
Or would you say that these are equivalent in terms of "difficulty"?
general-topology
$endgroup$
What's the difference between different approaches to demonstrating closedness (etc.) sets?
What confuses me that sometimes I for example find showing
complement is open $implies$ the set is closed
easier than some
"take a sequence of elements and show that limit is not in the set"
The problem with this latter approach is that I find that depending on the set it could be difficult to construct such sequence.
Or would you say that these are equivalent in terms of "difficulty"?
general-topology
general-topology
edited Mar 22 at 23:57
mavavilj
asked Mar 22 at 15:20
mavaviljmavavilj
2,85911138
2,85911138
2
$begingroup$
It's hard to know how to answer your question. Mathematical methods apply differently to different mathematical problems. "Closedness" might be demonstrated one way in one problem and a different way in a different problem. Learning the correct way to demonstrate it in a particular problem is part of the job of the mathematician. If you have a question about doing this in a particular problem that's one thing, but as the question is currently posed I don't think it is answerable.
$endgroup$
– Lee Mosher
Mar 22 at 15:36
$begingroup$
Put a concrete example where "could be difficult to construct such sequence".
$endgroup$
– Martín-Blas Pérez Pinilla
Mar 22 at 16:50
$begingroup$
@Martín-BlasPérezPinilla $ n : n in mathbbZ_+$ is closed, but other than noticing that its complement is union of open intervals $(n,n+1)$, then how would one prove that some sequence would not have a limit in this set? I guess one could show that the sequence difference cannot be less than one?
$endgroup$
– mavavilj
Mar 22 at 17:59
$begingroup$
Right. Using that the space is discrete is the essential fact.
$endgroup$
– Martín-Blas Pérez Pinilla
Mar 22 at 21:12
$begingroup$
That "take a sequence of elements" stuff does not always hold.
$endgroup$
– William Elliot
Mar 22 at 23:11
|
show 2 more comments
2
$begingroup$
It's hard to know how to answer your question. Mathematical methods apply differently to different mathematical problems. "Closedness" might be demonstrated one way in one problem and a different way in a different problem. Learning the correct way to demonstrate it in a particular problem is part of the job of the mathematician. If you have a question about doing this in a particular problem that's one thing, but as the question is currently posed I don't think it is answerable.
$endgroup$
– Lee Mosher
Mar 22 at 15:36
$begingroup$
Put a concrete example where "could be difficult to construct such sequence".
$endgroup$
– Martín-Blas Pérez Pinilla
Mar 22 at 16:50
$begingroup$
@Martín-BlasPérezPinilla $ n : n in mathbbZ_+$ is closed, but other than noticing that its complement is union of open intervals $(n,n+1)$, then how would one prove that some sequence would not have a limit in this set? I guess one could show that the sequence difference cannot be less than one?
$endgroup$
– mavavilj
Mar 22 at 17:59
$begingroup$
Right. Using that the space is discrete is the essential fact.
$endgroup$
– Martín-Blas Pérez Pinilla
Mar 22 at 21:12
$begingroup$
That "take a sequence of elements" stuff does not always hold.
$endgroup$
– William Elliot
Mar 22 at 23:11
2
2
$begingroup$
It's hard to know how to answer your question. Mathematical methods apply differently to different mathematical problems. "Closedness" might be demonstrated one way in one problem and a different way in a different problem. Learning the correct way to demonstrate it in a particular problem is part of the job of the mathematician. If you have a question about doing this in a particular problem that's one thing, but as the question is currently posed I don't think it is answerable.
$endgroup$
– Lee Mosher
Mar 22 at 15:36
$begingroup$
It's hard to know how to answer your question. Mathematical methods apply differently to different mathematical problems. "Closedness" might be demonstrated one way in one problem and a different way in a different problem. Learning the correct way to demonstrate it in a particular problem is part of the job of the mathematician. If you have a question about doing this in a particular problem that's one thing, but as the question is currently posed I don't think it is answerable.
$endgroup$
– Lee Mosher
Mar 22 at 15:36
$begingroup$
Put a concrete example where "could be difficult to construct such sequence".
$endgroup$
– Martín-Blas Pérez Pinilla
Mar 22 at 16:50
$begingroup$
Put a concrete example where "could be difficult to construct such sequence".
$endgroup$
– Martín-Blas Pérez Pinilla
Mar 22 at 16:50
$begingroup$
@Martín-BlasPérezPinilla $ n : n in mathbbZ_+$ is closed, but other than noticing that its complement is union of open intervals $(n,n+1)$, then how would one prove that some sequence would not have a limit in this set? I guess one could show that the sequence difference cannot be less than one?
$endgroup$
– mavavilj
Mar 22 at 17:59
$begingroup$
@Martín-BlasPérezPinilla $ n : n in mathbbZ_+$ is closed, but other than noticing that its complement is union of open intervals $(n,n+1)$, then how would one prove that some sequence would not have a limit in this set? I guess one could show that the sequence difference cannot be less than one?
$endgroup$
– mavavilj
Mar 22 at 17:59
$begingroup$
Right. Using that the space is discrete is the essential fact.
$endgroup$
– Martín-Blas Pérez Pinilla
Mar 22 at 21:12
$begingroup$
Right. Using that the space is discrete is the essential fact.
$endgroup$
– Martín-Blas Pérez Pinilla
Mar 22 at 21:12
$begingroup$
That "take a sequence of elements" stuff does not always hold.
$endgroup$
– William Elliot
Mar 22 at 23:11
$begingroup$
That "take a sequence of elements" stuff does not always hold.
$endgroup$
– William Elliot
Mar 22 at 23:11
|
show 2 more comments
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
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3158283%2fwhats-the-difference-between-different-approaches-to-demonstrating-closedness%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
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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3158283%2fwhats-the-difference-between-different-approaches-to-demonstrating-closedness%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
2
$begingroup$
It's hard to know how to answer your question. Mathematical methods apply differently to different mathematical problems. "Closedness" might be demonstrated one way in one problem and a different way in a different problem. Learning the correct way to demonstrate it in a particular problem is part of the job of the mathematician. If you have a question about doing this in a particular problem that's one thing, but as the question is currently posed I don't think it is answerable.
$endgroup$
– Lee Mosher
Mar 22 at 15:36
$begingroup$
Put a concrete example where "could be difficult to construct such sequence".
$endgroup$
– Martín-Blas Pérez Pinilla
Mar 22 at 16:50
$begingroup$
@Martín-BlasPérezPinilla $ n : n in mathbbZ_+$ is closed, but other than noticing that its complement is union of open intervals $(n,n+1)$, then how would one prove that some sequence would not have a limit in this set? I guess one could show that the sequence difference cannot be less than one?
$endgroup$
– mavavilj
Mar 22 at 17:59
$begingroup$
Right. Using that the space is discrete is the essential fact.
$endgroup$
– Martín-Blas Pérez Pinilla
Mar 22 at 21:12
$begingroup$
That "take a sequence of elements" stuff does not always hold.
$endgroup$
– William Elliot
Mar 22 at 23:11