Functions of Bounded Variation

jdcasey9
Messages
25
Reaction score
0
1. Homework Statement [/b]
If f has a continuous derivative on [a,b], and if P is any partition of [a,b], show that V(f,P)\leq \intablf'(t)l dt. Hence, Vba\leq\intablf'(t)ldt.

Homework Equations


Monotone function \subset BV[a,b]
\sumf(ti+1)-f(ti) = lf(b) - f(a)l



The Attempt at a Solution


Let P = {a=t0 < t1 < ... < tn}. So if we divide our function into monotone segments we have:

V1(f,P) = \sumf(ti+1)-f(ti) = lf(a1) - f(a)l

V2(f,P) = \sumf(ti+1)-f(ti) = lf(a2) - f(a1)l

.
.
.

Vn(f,P) = \sumf(ti+1)-f(ti) = lf(b)- f(an-1)l

Then, treating this segments independently of the whole, we see that

v1(f,P)= lf(a)-f(a1)l=\intablf'(t)ldt = lf(a1) -f(a)l

etc.

Adding them all up V(f,P)= \intablf'(t)l dt, which satisfies our prompt.
 
Last edited:
Physics news on Phys.org
I can't get the cartesian product off of there, so please just ignore it.
 
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...

Similar threads

Back
Top