Upper and Lower Sums: Functions w/ Property?

  • Thread starter Thread starter Jupiter
  • Start date Start date
  • Tags Tags
    Sums
Click For Summary
SUMMARY

The discussion focuses on the conditions under which upper and lower sums are equal for various types of functions, particularly in the context of Riemann integration. It is established that only constant functions consistently yield equal upper and lower sums across all partitions. The conversation highlights that odd functions may exhibit this property under certain conditions, while even and discontinuous functions generally do not. The participants emphasize the importance of partition selection and refinement in determining the equality of upper and lower sums.

PREREQUISITES
  • Understanding of Riemann integration
  • Familiarity with upper and lower sums
  • Knowledge of function types: constant, odd, even, and discontinuous functions
  • Concept of partitions in mathematical analysis
NEXT STEPS
  • Research the properties of Riemann integrable functions
  • Explore the implications of partition refinement on upper and lower sums
  • Study the behavior of discontinuous functions in integration
  • Examine specific examples of odd functions and their upper/lower sum properties
USEFUL FOR

Mathematicians, students of calculus, and anyone studying Riemann integration and the properties of functions in relation to upper and lower sums.

Jupiter
Messages
46
Reaction score
0
Which functions have the property that some upper some equals some (other) lower sum?

Constant functions obviously do. Odd functions do in some cases. Even functions don't. Step functions won't (unless we restrict our consideration to an interval where it is constant). In fact it seems that all discontinuous functions would fail to have this property. Can anyone generalize/formalize this?
 
Physics news on Phys.org
upper and lower sums of what? are you talking about Riemann integration here?
 
Well, in general they will never be equal on every possible partition. Even for the function f(x)=x on the interval [0,1] that conjecture is trivially false - they differ by approximatey e.f(e) + h.f(1) where e and h are the lengths of the first and last subset in the partition.

So, you are asking if there is always some partition, P, that has U(P)= L(P), what does that imply about f?

Hmm, not sure. What partitions are you using for the results for some odd functions?

In fact because if true for partition P it is true for any refinement of P, then I think it will serverely restrict potential f's
 
Last edited:
I assume that you mean:
e*f(0)+h*f(1)

Obviously, the function f(x)=0 will always have upper and lower sums equal to 0.

To Jupiter:

Even in more abstract situations, constant functions are continuous.

Now, let's assume that we have a function f:\Re\rightarrow\Re that is not constant ]on some interval [a,b].
Now, if f(a)\neq f(b) then we have that the entire interval is a partition with differing upper and lower sums.
Now, since f is not constant, there is some x such that f(x) \neq f(a) unless x=\frac{b+a}{2} the partition on a,x,b will generate differing upper and lower sum, so the only remaining case is where x=\frac{b+a}{2}
Now, if there is some y\neqx and f(y)\neq f(a) then we have a partition on a,y,b which generates differing upper and lower sums.
Otherwise there is no such y so for any z \in [a,b], z\neqx \rightarrow f(z)=f(a) so we can partition along a, \frac{a+a+b}{3},x,b and get differing upper and lower sums.

Therefore, the only functions that can have equal upper and lower sums for all partitions are cosntant functions.
 
. and * both denote multiplication. I don't see what f(x)=0 has to do with my example f(x)=x

secondly, the rest of your argument falls into the trap that i hit: the original question asks, about *a* partition, not *every* partition. You've shown that a 2 part partition might not do it, that doesn't say anything about other more esoteric partitions. As posed, it is not sufficient to provide some partition on which the upper and lower sums are different, but to show that on every partition they are different. (notice the word 'some' in the question.)

I think that the refinement argument might yield something interesting.
 
Last edited:
Well, if you can describe the minimal and maximal U and L partitions, then you should be able to take advantange of continuity to show that for continuous functions there are patitions so that U(P_1)=L(P_2) it's a bit tricky with non-continous functions.

For the upper and lower values on the same partitions to be the same is a good bit trickier.
 
But you can't as the example f(x)=x shows on the interval [0,1]

for any partition the difference is e^2+h, where e and h are the lengths of the first and last subinterval.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 20 ·
Replies
20
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
3
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K