Functions of Bounded Variation

Click For Summary
The discussion focuses on determining the conditions under which the function f, defined by a sequence of scalars and distinct points, is of bounded variation on the interval [a, b]. It emphasizes that the total variation of f is calculated as the supremum of the sums of jumps in f's values at finite points. A key point is that the function's bounded variation cannot be established by examining the values of cn individually; rather, they must be considered collectively. The conversation also touches on the importance of completeness and norms in proving bounded variation, although some participants express confusion about these concepts. Ultimately, the direct application of the definition of bounded variation is suggested as the most straightforward approach to the problem.
jdcasey9
Messages
25
Reaction score
0

Homework Statement


Given a sequence of scalars (cn) and a sequence of distinct points (xn) in (a, b), define f(x) = cn if x = xn for some n, and f(x) = 0 otherwise. Under what condition(s) is f of bounded variation on [a,b]?


Homework Equations


Vbaf = supp(\Sigmalf(ti) - f(ti-1)l< +inf, then f is of Bounded Variation.


The Attempt at a Solution



My understanding of the question is that we have points at x in a vertical line and points along y=0 at every other value of x. So the only way that this function is of bounded variation is if there is a supremum of the constants so that they can't go on vertically to infinitum. If we merely say that they are bounded above we won't have bounded variation, so we must say that the supremum is a member of the set of cn's.
 
Physics news on Phys.org
No, you're on the wrong track. The total variation V_a^b f = \sup_P \sum_j |f(x_j+1) - f(x_j)| is the supremum of all possible sums of jumps in the value of f where the function is measured at finitely many points. So you should answer two questions:

1. What can a jump of the value of f from one point to another look like?
2. What analytic idea should you use to think about the "supremum of all finite sums of something"?

You can't answer this question by examining the values c_n one by one; there is a sense in which you must consider them collectively.
 
So, we need to use norms? If we add the assumption of completeness, we will satisfy bounded variation.

Since we have Thm: BV[a,b] is complete under llfllBV = lf(a)l + vbaf
and
Lemma: llfllinf \leq llfllBV
then we can prove that llfllBV is complete and therefore the supremum of f is convergent?
 
jdcasey9 said:
So, we need to use norms? If we add the assumption of completeness, we will satisfy bounded variation.

Since we have Thm: BV[a,b] is complete under llfllBV = lf(a)l + vbaf
and
Lemma: llfllinf \leq llfllBV
then we can prove that llfllBV is complete and therefore the supremum of f is convergent?

The sentences "If we add the assumption of completeness, we will satisfy bounded variation" and "we can prove that \|f\|_{BV} is complete and therefore the supremum of f is convergent" don't make any sense to me.

You do not need to think about the BV-norm or completeness to solve this problem -- you can apply the definition of bounded variation rather directly.
 
Ok, to answer your questions:
1. A movement up or down along the x-value.
2. I'm not sure, we can get the supremum of all finite sums of something by taking the l-inf norm of the sum of all of them.
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
Replies
8
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 43 ·
2
Replies
43
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 13 ·
Replies
13
Views
1K