Riemann Integration ... Existence Result .... Browder, Theorem 5.12 ....

Click For Summary
SUMMARY

The discussion centers on Theorem 5.12 from Andrew Browder's "Mathematical Analysis: An Introduction," specifically regarding the proof of the Riemann Integral's existence results. Participants analyze the necessity of the "+1" in the expression \([f(b) - f(a) + 1](b - a) / \epsilon\). It is concluded that the "+1" ensures the integer \(n\) is always greater than the expression, thus guaranteeing the existence of \(n\) and avoiding potential equality issues that could arise without it.

PREREQUISITES
  • Understanding of Riemann Integration principles
  • Familiarity with mathematical proofs and theorems
  • Knowledge of epsilon-delta definitions in analysis
  • Basic comprehension of integer properties in mathematical contexts
NEXT STEPS
  • Study the details of Theorem 5.12 in Browder's "Mathematical Analysis: An Introduction"
  • Explore the implications of the epsilon-delta definition in Riemann Integration
  • Investigate other existence results related to Riemann Integrals
  • Review common pitfalls in mathematical proofs involving inequalities
USEFUL FOR

Students of mathematical analysis, educators teaching Riemann Integration, and mathematicians interested in the nuances of proof techniques in analysis.

Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
TL;DR
I need help with an aspect of Andrew Browder's proof of the fact that if f is a monotone function on [a, b] then the Riemann integral of f exists ...
I am reading Andrew Browder's book: "Mathematical Analysis: An Introduction" ... ...

I am currently reading Chapter 5: The Riemann Integral and am currently focused on Section 5.2 Existence Results ... ...

I need some help in understanding the proof of Theorem 5.12 ...Theorem 5.12 and its proof read as follows:
Browder ... Theorem 5.12 .png

In the above proof by Andrew Browder we read the following:

" ... ... [For instance, one can choose a positive integer ##n## such that ##n \gt [f(b) - f(a) + 1](b - a) / \epsilon## ... ... "My question is as follows:

Why does Browder have ##+1## in the expression ##[f(b) - f(a) + 1](b - a) / \epsilon## ... ... ?Surely ##[f(b) - f(a)](b - a) / \epsilon## will do fine ... since ...

##\mu ( \pi ) = (b - a)/ n##

and so

##\mu ( \pi ) [f(b) - f(a)] = [f(b) - f(a)] (b - a)/ n \lt \epsilon## ...

... so we only need ...

##n \gt [f(b) - f(a)](b - a) / \epsilon##

Hope someone can help ...

Peter
 
Physics news on Phys.org
Math Amateur said:
Why does Browder have ##+1## in the expression ##[f(b) - f(a) + 1](b - a) / \epsilon## ... ... ?

Surely ##[f(b) - f(a)](b - a) / \epsilon## will do fine ... since ...

##\mu ( \pi ) = (b - a)/ n##

I think you are right. I suspect he put in the ##1## to avoid equality, but he didn't need it.
 
  • Like
Likes   Reactions: bhobba, Math Amateur and member 587159


Hi Peter,

I believe the reason for the "+1" in the expression is to ensure that the chosen integer n is always greater than the given expression. In other words, if we just have [f(b) - f(a)](b - a) / epsilon, there is a possibility that the integer n might not be large enough to satisfy the condition. However, by adding the "+1", we guarantee that n will always be greater than the given expression, ensuring the existence of n.

I hope this helps clarify the proof for you.

 

Similar threads

Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 14 ·
Replies
14
Views
5K
Replies
2
Views
2K
Replies
3
Views
2K
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K