Can Subdivision Properties Prove Equivalence?

  • Thread starter Thread starter TheyCallMeMini
  • Start date Start date
  • Tags Tags
    Proof
TheyCallMeMini
Messages
5
Reaction score
0

Homework Statement



Suppose f is a function bounded on [a,b], A=GLB(S u,f), and B=LUB(S W,f).


Homework Equations



1. For each e>0, there is a subdivision D={Xi}of [a,b] such that |U f,D - W f,D|<e
2. There is a number Q such that if e>0, then there is a subdivision D of [a,b] such that if K={Yi}is a refinement of D, then |U f,K - Q|<e and |W f,K - Q|<e.

U=upper sums
W=lower sums

The Attempt at a Solution



I'm supposed to show that 1 implies 2 and 2 implies 1. Trying to do 1 implies 2 confuses the hell out of me, but if I do 2 implies 1 isn't that just doing a triangle inequality and account for the number Q?
 
Physics news on Phys.org
TheyCallMeMini said:

Homework Statement



Suppose f is a function bounded on [a,b], A=GLB(S u,f), and B=LUB(S W,f).
Your notation is not very clear here. What is S? Is this for the Riemann-stieltjes integral, and S is the monotonically increasing function of integration? In your question the S doesn't seem to come into play, so it's not too big a deal..

For 1 implies 2, do you have the theorem that if P is a refinement of D then L(D,f)<L(P,f)<U(P,f)<U(D,f)? (where < is supposed to be less than or equal too but I'm lazy on my ipad).
 
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