Prove that a function is not of bounded variation

mahler1
Messages
217
Reaction score
0
Homework Statement .

Prove or disprove that the function ##f(x)= x^2sin^2(\dfrac{\pi}{x})## if ##0<x\leq 1## and ##f(x)=0## if ##x=0## is of bounded variation. The attempt at a solution.

I've seen the graph of this function on wolfram and for me it's clearly not of bounded variation since it has too many jumps (when ##x## approaches ##0##, ##f(x)## changes its value "too quickly"). The problem is I don't know how to prove it formally.

I've tried to prove it by contradiction: Suppose ##f(x)## is of bounded variation, then there exists ##M>0 : \sum_{k=1}^n|Δf_k|\leq M## for every partition ##π=\{x_0,...,x_n\}## of ##[0,1]##.

Which is the proper partition ##π=\{x_0,...,x_n\}## of the interval ##[0,1]## such that ##\sum_{k=1}^n|Δf_k|> M##? I need help to find the appropiate partition that would lead me to a contradiction.
 
Last edited:
Physics news on Phys.org
mahler1 said:
Homework Statement .

Prove or disprove that the function ##f(x)= x^2sin^2(\dfrac{\pi}{x})## if ##0<x\leq 1## and ##f(x)=0## if ##x=0## is of bounded variation.


The attempt at a solution.

I've seen the graph of this function on wolfram and for me it's clearly not of bounded variation since it has too many jumps (when ##x## approaches ##0##, ##f(x)## changes its value "too quickly"). The problem is I don't know how to prove it formally.

I've tried to prove it by contradiction: Suppose ##f(x)## is of bounded variation, then there exists ##M>0 : \sum_{k=1}^n|Δf_k|\leq M## for every partition ##π=\{x_0,...,x_n\}## of ##[0,1]##.

Which is the proper partition ##π=\{x_0,...,x_n\}## of the interval ##[0,1]## such that ##\sum_{k=1}^n|Δf_k|> M##? I need help to find the appropiate partition that would lead me to a contradiction.

I wouldn't be so confident that just because there are 'too many jumps' that the function isn't of bounded variation. Try estimating the position and size of all of the maxima and from that estimate the total variation.
 
  • Like
Likes 1 person
Dick said:
I wouldn't be so confident that just because there are 'too many jumps' that the function isn't of bounded variation. Try estimating the position and size of all of the maxima and from that estimate the total variation.

I've seen that ##f'(x)## is bounded, and this is sufficient for the function ##f## to be of bounded variation. Is this correct?
 
mahler1 said:
I've seen that ##f'(x)## is bounded, and this is sufficient for the function ##f## to be of bounded variation. Is this correct?

Yes. If you'd followed my suggestion you would have seen that the total variation is approximately 2(2/3)^2+2(2/5)^2+2(2/7)^2+... which is a convergent series. So even though there are an infinite number of bumps, they still sum to a finite number. That's maybe hard to turn into a rigorous proof because the those maxes are only approximate. But they are a very good approximation. So, yes, the easiest way to prove it is to note f'(x) exists and it's bounded.
 
  • Like
Likes 1 person
Dick said:
Yes. If you'd followed my suggestion you would have seen that the total variation is approximately 2(2/3)^2+2(2/5)^2+2(2/7)^2+... which is a convergent series. So even though there are an infinite number of bumps, they still sum to a finite number. That's maybe hard to turn into a rigorous proof because the those maxes are only approximate. But they are a very good approximation. So, yes, the easiest way to prove it is to note f'(x) exists and it's bounded.

Yes, sorry for not following your suggestion but I found it easier to prove that the derivative is bounded. Thanks!
 
mahler1 said:
Yes, sorry for not following your suggestion but I found it easier to prove that the derivative is bounded. Thanks!

No need for apologies. I didn't mean 'prove it that way'. I just meant it to show how you can have an infinite number of jumps and still have bounded variation.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top