c.teixeira said:
I have actually tried to prove this by myself. Not even knowing if such thing of aplicable to the case.
Here it goes.
Let A = { ε : ε > 0}; Then 0 would be the greatest lower bound for the set A.
But, inf{U(f, P`)} - sup{L(f, P´)} < ε, for any ε. Thus meaning inf{U(f, P`)} - sup{L(f, P´)} is a lower bound for the set A. Consequenly, inf{U(f, P`)} - sup{L(f, P´)}≤ 0, since 0 is the greatest lower bound. Hence sup{L(f, P´)} = inf{U(f, P`)}, because on the other hand inf{U(f, P`)} - sup{L(f, P´)} ≥ 0. ∴
By how much did I miss the target?
Regards,
That actually seems right to me.
c.teixeira said:
Limits, sure are a dificult concept to grasp completely.
Althoug, you seem quite confident about explanation, I don't undersant it. I have tought about it most of my day.
The defition of lim:
"for every ε > 0, there is some δ > 0 , such that, for all x, if 0 < | x - a |< δ, then | f(x) - L | < ε".
So, there should be and δ_{1} > 0, for which | f(x) - L | < 10^{-20}, given that |x -a| < δ_{1}, and there should be another δ_{2}, for which | f(x) - L | < 10^{-1000}, and in the end, since it is valid for any ε > 0, shouln't it exist an δ_{3} for which | f(x) - L | = 0, given that |x -a| < δ_{3} ?
Because, this is the line of though we use to explain:
→ if inf{U(f, P`)} - sup{L(f, P´)} < ε , for any ε > 0, then it follows that sup{L(f, P´)}=inf{U(f, P`)}∴?, or is it not this tipe of reasoning?Thank you for your most valued explanations.
This is actually the line of reasoning used to explain that sup{L(f, P´)}=inf{U(f, P`)}
Since for any partition P, U(f,P) is greater than or equal to L(f,P') for any partition P', it follows that U(f,P) is an upper bound on {L(f,P)} From this, it follows that inf{U(f,P)} is greater than or equal to sup{L(f,P)} (Otherwise, we would be able to produce some P such that U(f,P) were not an upperbound for {L(f,P)}) Thus, inf{U(f,P)} - sup{L(f,P)} ≥ 0.
Now to the part I think you're confused about. inf{U(f,P)} - sup{L(f,P)} < ε for all ε > 0 because of the following.
Given any ε > 0, there exist two partitions P and P' such that U(f,P) - L(f,P') < ε. Since U(f,P) ≥ inf{U(f,P)}, and L(f,P) ≤ sup{L(f,P)}, we have that
ε > U(f,P) - L(f,P') ≥ inf{U(f,P)} - L(f,P') ≥ inf{U(f,P)} - sup{L(f,P)} ≥ 0
Since we can do this for all ε > 0, we have that
ε > inf{U(f,P)} - sup{L(f,P)} ≥ 0 for all ε > 0, so that inf{U(f,P)} = sup{L(f,P)} holds.
The difference between saying that Lim x-> a of f(x) is L and |a - b| < ε for all ε > 0 is that, in the first case, we are only guaranteed the existence of an interval centered around a so that |f(x) - L| < ε holds for all values in this interval, and it is crucial to note that the interval may or may not depend on ε. While in saying that |a - b| < ε for all ε > 0, we are saying that two
constants are arbitrarily close to each other.
I apologize for my lack of LaTex, but I honestly have no clue how to use it. I hope I helped!