Conversation started Dec 25, 2011 at 15:16.
Dec 25, 2011 15:16
I'm reading tb's answer. It's probably obvious but can someone remind me why a closed set in $\mathbb{R}$ is a countable union of compact sets?
$$ -f(x) = f(b - x) $$
What is that called ?
It does not have a common name afair.
That sucks, I tend to use odd about b, but that sounds strange
@Matt Do you know why an open set is a countable disjoint union of open intervals?
$$ f(x) = f(b-x) $$

is even about b.
Dec 25, 2011 15:18
Then you call it "odd about $b$". I think "symmetric about $b$" seems to ring a bell.
@Matt Were you able to figure it out? =)
Gimme a sec, I'm thinking.
Sure. Sorry, didn't mean to rush you.
Actually, sorry, @Matt. tb's statement is simpler than I imagined.
@Srivatsan Never mind that, I can still try to answer your question up there : )
Given a closed set $C$, write it as $C = \bigcup_{n \geq 0} C \cap B(0, n)$.
Oh, it's that simple?
Dec 25, 2011 15:27
@Matt Yes, that simple. (Unless, of course, I'm missing something.)
But if you want to think about what I said, you can. I have to leave now..
Thanks, Srivatsan! And see you later!
You have a leave?
(Thanks, A. =))
:-P
Did you vote to close?
Dec 25, 2011 15:31
Merry Christmas, @N3buchadnezzar and @robjohn.
Yes, I voted on the duplicate question.
Then @Matt did not yet vote!
Caught me red-handed!
Matt: Aw, I'm damn too sleepy. In chat.stackexchange.com/transcript/message/2819579#2819579, $B(0, n)$ should be $[-n, n]$ instead, since the sets must be compact.
@Srivatsan I know. I had thought of this before you wrote it and then discarded it as too simple and therefore probably wrong. ; )
But for that change, this is what tb had in meant, I think. Just a note: this idea of writing things as a countable union of bounded things comes up often.
E.g., look up $\sigma$-finite measure.
Dec 25, 2011 15:38
Thanks for your help!
NO! It's a trap!!!!
He will enslave you like that guy hypnotized Indie in The Temple of Doom!!!
KALI-MAH!!!! KALI-MAH!!!!
@AsafKaragila Haha, this makes me want to re-watch Temple of Doom tonight : )
It is a nice movie.
I don't remember much of it.
Mmmmm... must be the season of the witch! Must be the season of the witch, yeah... must be the season of the witch.
Dec 25, 2011 15:46
Hey, guys, do you think I should or should not have rejected this edit suggestion? I am feeling pangs of guilt. It obviously has been done with good intentions, and the OP is a newbie, so it's good to help the OP improve the question...
It's fine that you have rejected that.
@Srivatsan I'm not sure why you rejected it. But you shouldn't feel guilty.
No need to enforce manners on people. Especially like that.
The next thing will be people editing into every post "sir" and "dear professors, I am dust at your feet..." and such.
Is my answer wrong?
Dec 25, 2011 15:51
Oh, I did not have manners in mind. But I was thinking that this suggestion ought to be rejected because iyengar changed the question. But in this case, changing/improving the question is not that bad after all. [Of course, I don't approve or worry about of the "Thank you" bit.]
Anyway, what's done is done. Thanks, Asaf and Matt.
[JM, tb: if you were reading the transcript till now, I'll be glad to know your opinion as well.]
Anyway, edited despite I think it was correct like that.
Thank you to all for not answering here and getting more downvotes there! Thank God it's not that important to me.
@Srivatsan Don't feel guilty. It was done in good faith, but I don't think that's what the question asked for and the implicit call for references is always there (and not particularly helpful in this case, or should one refer to Underwood Dudley?)
@Gigili I don't down vote. As I don't know the answer to the question it's hard for me to judge your answer.
@tb We should undelete all his downvoted questions and request a global recalc to be triggered, that way he could not delete his questions right after he got the first answer or pointed out that it is a dup.
Dec 25, 2011 16:03
@Gigili I didn't vote and looked at it only now. Breaking up the problem into even and odd functions doesn't seem to work. Except for pointing out that the constant function $-1$ is also a solution, your answer doesn't contribute much to the solution of the problem. That's just my opinion.
@AsafKaragila well, I don't care much for his deleted questions, but I'm completely opposed to deleting this
Well, I am going home to eat something and rest my tired bones. See you later.
See you later, Asaf!
See you later Asaf
If you have a null set in $\mathbb{R}$, for given $\varepsilon$, how do you get a countable number of intervals such that the sum of their measures is less equals epsilon?
Hi, people, is this method: en.wikipedia.org/wiki/Durand%E2%80%93Kerner_method only can approximate the real roots, not complex roots?
Dec 25, 2011 16:09
I thought you were trying to learn the cross product?
@tb - Thanks for your link, now i completely understand
and just wondering if numerical method have disadvantages
@Matt *) covering the null set, I meant of course.
Oh. I can just intersect with (-n,n).
Ah, no, because it says intervals and the intersection is not an interval.
The other answer annoys me.
Btw, how do you link to an answer directly?
Dec 25, 2011 16:30
@Matt At the bottom of the post, there's a bit that says "link edit flag".
@DylanMoreland Thanks, Dylan.
I don't understand how some answers get upvotes.
@Srivatsan You did the right thing there.
I've long given up on predicting which answers will get which number of upvotes myself. People vote the darndest things.
Happy Holidays everyone!
@JacopoNotarstefano Right back at you. :)
@Matt Or even accepted. :|
Dec 25, 2011 17:04
@Srivatsan Well, I haven't yet figured out how to get disjointness, but I have learnt some new vocabulary : ) So $\mathbb{R}$ is second countable which apparently implies that it's Lindelöf which means that every open cover has a finite subcover. So I can write every open set as a countable union of open sets.
@Matt Wait, how is that different from compactness?
@Srivatsan That is a typo. Where it says finite it should say countable. Sorry, my subconscious speaking. : )
Thanks @tb and @JM.
@Matt How did you make the conclusion "So I can write..."
And every open set is the union of just itself. The deal is to write it in terms of intervals.
@Srivatsan If it's open then for every point in it I can find an open ball around the point that is in the set. All these balls form an open cover of the set so I can make it into a countable open cover. A ball is an interval in $\mathbb{R}$.
Oh right. Sorry.
But let's say $O$ is an arbitrary open set. How does Lindel\"ofness of $\mathbf R$ help you in writing $O$ as union of intervals?
Dec 25, 2011 17:12
@Srivatsan It doesn't. I can write it as an arbitrary union of intervals because $\mathbb{R}$ is a metric space. Then Lindeloefness let's me make the cover into a countable one.
Oh right. You're absolutely right.
I am the one who is screwing up.
@Srivatsan phew
That's cool..
@Matt Do you want hint for disjointness?
I didn't figure it out myself. Someone (Zhen, if I remember right) pointed it to me in chat.
@Srivatsan Ok. Yes please : )
Ok. HINT Connected components.
Dec 25, 2011 17:20
An open set is a union of basis elements and a basis are open intervals?
Then either they are already disjoint or if some of them share points their union is an open interval.
@Matt Well, you might end up using uncountably many open sets.
Also, disjointness would be a problem.
@Matt That's the basic idea. Suppose we can pair up every pair of overlapping intervals and make a bigger interval...
If this process terminates at all, then we got our disjoint intervals. But sadly, it's not clear that it terminates.
@Srivatsan Actually, another basis for it is (q,p) for q,p rational so I can achieve it with countably many.
@Matt Yes, that's a good idea.
Perhaps one can fix this proof.
I'd need a finite subcover. Then it would terminate.
Ok, I have to leave for some time again. See you.
Dec 25, 2011 17:32
See you! And thanks!
@Matt Yes. The problem with the merging idea is this:
Sorry, ignore that comment.
Essentially, I was going to say that if we have infinitely many sets, then it's not clear that we can union pairs of them in some order (even conceptually, if not physically) to get a disjoint family of open sets. But as it is, this is quite obvious.
I still don't know how to fix my proof. Anyway, I think I'm going to be afk for a while, too. bbl
1. Every point in an open subset of the real line has a connected open neighbourhood. 2. Every connected open neighbourhood is contained in a connected component. 3. Connected components are disjoint. 4. The connected open subsets of the real line are the intervals...
@ZhenLin :) I asked you this long back and I certainly remember this proof. Matt and I was trying out to figure out if the alternate approach could be fixed at all.
Use transfinite induction?
Dec 25, 2011 17:47
@ZhenLin I do not know exactly how that works.
So we can start off writing $O$ (an open set) as a countable union of open intervals. Then we want to merge two intervals whenever they overlap, right?
It's really nothing fancy. Just a special case of structural induction, which I'm sure you understand quite well.
@ZhenLin Yes, I do understand structural induction. Would transfinite induction work here? If it does, can you show me how?
Yes. Actually, the trick is to realise that an arbitrarily long chain of pairwise intersecting open intervals has union an open interval (possibly infinite).
Transfinite induction is just structural induction on the ordinals. The ordinals themselves are very simple. There are three constructors: the constant $0$, the successor (unary), and supremum (accepts any set of ordinals as input)
The key theorem in applying transfinite induction is the Hartogs lemma: for any set, there is an ordinal which does not inject into that set.
When did you start talking about set theory here? :-P
Well, I actually don't follow it =)
Dec 25, 2011 17:56
What seems to be the problem officer?
Then I leave the task to Asaf, since it's well past midnight here...
You went back home?
Thanks, Zhen.
@AsafKaragila Just that Zhen was trying to teach me transfinite induction and I didn't follow it. You might safely assume that I know no set theory at all...
But right now, I have to be somewhere. :)
...I really should be sleeping now; see you guys later.
Srivatsan, do let me know when you return.
Dec 25, 2011 17:59
If you're going to teach me, can we do it a little later? I should be back in some time.
Thanks, Asaf.
Sleep well, @JM.
@Matt Just use the definition of Lebesgue outer measure: $$\mu^\ast(N) = \inf{\left\{\sum_{n=1}^{\infty} |I_n|\,:\,N \subset \bigcup_{n=1}^\infty I_n\right\}}$$ and a null set is the same thing as a set with outer measure zero.
 
Conversation ended Dec 25, 2011 at 18:05.