Is there a function f which is discontinuous at every point, and which has only removable discontinuities? (Extra credits if you can prove your answer)
The book rated this question 'Extra hard' and suggested that you will need some knowledge of infinite sequences in order to do the 'proof' part, but knowing limits would be enough to give a simple answer.
The only way I can think of doing that would be to define the function at every point, and cause it to be discontinuous. Alternatively, you could cheat: \[\Gamma(x)*i\] is a continuous function, but only in the complex plane. Causing it to be discontinuous (and undefined) in the reals... but you could fill these gaps by applying /i to all the y values.
my 2cents worth - what about:\[f(x)=\frac{1}{x(x^2-1)(x^2-4)...(x^n-n^2)...}\]this is discontinuous from -infinity to infinity (including zero). but only at integer values of x. is this what you want?
JamesJ to the rescue!
I'm pretty sure the answer is no. An example of such a function that is discontinuous everywhere is the following: \[ f(x) = \left\{\begin{matrix}1 & x \in Q \\ 0 & x \in R - Q \end{matrix}\right. \]
or rather, that we need some additional hypothesis
or shaper hypothesis such as the number of points where the function is discontinuous are countable.
Once that Spivak Answer book arrives I will know the true answer. The infinite sequence section 400 pages later says something about it not being possible for f to be discontinuous everywhere
what about the indicator function? http://en.wikipedia.org/wiki/Indicator_function
This is in Spivak? One sec
Yes, my intuition was right. If a function f has only removable discontinuities, then f is continuous except at a countable set of points. Hence if a function f is discontinuous everywhere, it cannot have only removable discontinuities.
Changing topic, I wish I'd enrolled in the MIT ML course. How's that one going for you?
I like the AI course a lot, but the ML course looks like the applied version of that and I would appreciate the discipline of having to actually code the algorithms.
It's working so great that I finally understand virtually everything in this page: http://david-hu.com/2011/11/02/how-khan-academy-is-using-machine-learning-to-assess-student-mastery.html
but the ML class uses GNU Octave (its like a free version of MATLAB) and not Python.
Even so, having to write a program that using the algorithm I think is essential for really learning the material; I worry that in six months I will have forgotten most of it.
It's analogous to telling someone: given the equation ax^2 + bx + c = 0, where a, b, c are constants and a is not zero then x = -b +- ..... ...and then not getting them to actually solve any quadratic equations.
I worry the same thing about the AI class, which has no mandatory programming assignments although the ones assigned to the actual Stanford class are available on the internet.
In other words, there's a huge difference between understanding something at some superficial level of theory, and actually using it, which nearly always deepens the understanding of that theory.
They'd originally thought of giving programming assignments, but when enrollment went over 20,000--- or so the story has it---- that they were worried it wouldn't be pragmatic for them.
:( would have been nice to have some programming assignments.
Agreed. Well, at least you have some in the ML course, so good for you.
The DB class programming assignments are quite non-trivial :(
ha. Well, you signed up!
The subject of discontinuities seems interesting so I looked around to see I could find anything that could explain the concept to me in more detail. Unfortunately it all looks too complex and beyond my grasp. However, I did come across this article that may (or may not) be of some interest to you as it seems to be related to your question: http://math.stackexchange.com/questions/3777/is-there-a-function-with-a-removable-discontinuity-at-every-point
I must say until 10 days ago, I didn't even understand the Machine Learning was a major topic in AI. Had I known that four weeks ago, I would have signed up for the ML course. Live and learn.
jamesj and agdgdgdgwngo - if you guys need any help in programming that I am more than willing to help - I have over 30 years of experience in the field and use C++, Java, Python.
I need help understanding basic data structures such as linked lists, binary trees, and hash tables.
Have you looked at AI assignment 4 yet? I thought assignment 3 was really too easy. That might be a bastard of a thing to say, but assignment 3 was not at university level at all.
(@asnaneer, thanks.)
Assignment 3 was cake, and I think assignment 4 will be cake too, at least for you :) ; I am averaging 60% in the class quizzes :(.
I'm still planning to stick and work hard on the AI class, for this: http://www.aaai.org/Membership/ai-course-offer.php
Don't worry about the class quizzes; the whole point of those is to make you think through the material. I made quite a few errors in unit 5 quizzes at first, mainly because it wasn't intuitively obviously how to do some of those probability calculations until you've seen one. But after you've seen it, it's pretty straight forward.
So for example unit 6 was back on familiar mathematical ground for me and that was straightforward.
I was joking with a good friend of mine that I haven't actually used the formula for regression coefficients for over a decade; it's something I do all the time, but I always have it done for me computationally or by someone working for me. It was a bit like going back to high school where we had to calculate those things without using stat functions on calculators.
Right. The AI class instructors have a somewhat different teaching style compared to Andrew Ng's ML class; they explain the 'basics' and then follow up with a relatively challenging quiz :) while Ng anticipates the hard stuff and explains it first to build your intuition before the quizzes.
So, for the material that was new, I go back through the quizzes again the next day and make sure I've got it down.
I have to tell you, if nothing else, the AI course has turned into a Bayesian calculating machine. I won't forget that skill in six months.
james, that function is discontinuous everywhere
the x =1 , x = 0 one
@sarah: yes, I know.
Scroll up to find our final conclusion.
The following: If a function f has only removable discontinuities, then f is continuous except at a countable set of points. Hence if a function f is discontinuous everywhere, it cannot have only removable discontinuities.
hmmm
We haven't give here, but you'll find it as a relatively sophisticated exercise--and broken down in steps--in Spivak, chapter 22.
if f has removable discontinuues... why cant it be non countable discontinuous
so you only proved one statement, and other is the contrapositive?
it is sufficient to prove the first part, If a function f has only removable discontinuities, then f is continuous except at a countable set of points.
I haven't proved either here, but yes, they are contrapositives of each other. But I believe it.
what are you guys talking about bayesian calculator and regression coefficients, what is that?
how do you learn about bayesian calculator
We're both taking an on-line course offered by Stanford University on Artificial Intelligence. Bayesian probability is ground-level skill for thinking through a wide range of AI topics, and regression comes up in some context also. That's all. You can find it here: ai-class.com
is it a free course?
Anyway, @agdgd, good to talk to you. See you soon.
Yes. Enrollment however is now closed.
oh damn
when does it start up again?
not yet announced.
ok the question can be answered more concisely as is there exist a function which has a removable discontinuity at every point
so clearly it is discontinuous at every point
i would say, no , because to have removable discontinuity you need to talk about the limit around a point , ie, the neighborhood. since there is no neighborhood , therefore there is no limit around a point .
"since there is no neighborhood" doesn't make sense, however I think your intuition is still pointing in the right direction.
anyway, I am going now. Bye
there is no neighborhood around a point
, oh wait, nevermind
sorry i was thinking there were undefined points for some reason
so assuming that it is discontinuous , then the limit does not exist at any point. and for removable discontinuiity you need at least that the limit exists
Join our real-time social learning platform and learn together with your friends!