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.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top