Constructing partition to show that lower sum and upper sum differ by less than $epsilon$
up vote
1
down vote
favorite
Let $f$ be a continuous, increasing function on $[a,b]$. I know that because $f$ is continuous, I can use epsilon-delta to prove that the lower sum $L(f,P)$ and upper sum $U(f,P)$ both converge given a partition of $[a,b]$: I can divide it equally into $n$ segments, such that the function differs by at most $frac{epsilon}{b-a}$ where the specific length of each section is determined by $delta$ from the epsilon-delta definition. (I think this explanation is correct; if not, please let me know).
However, my main question is does this result hold for a non-continuous strictly increasing function on $[a,b]$? If so, how would we prove that?
Additionally, is there an explicit way to construct a partition (based on $epsilon, b, a$) such that it is always the case for any strictly increasing function that the lower and upper sum get within epsilon of each other?
calculus integration
add a comment |
up vote
1
down vote
favorite
Let $f$ be a continuous, increasing function on $[a,b]$. I know that because $f$ is continuous, I can use epsilon-delta to prove that the lower sum $L(f,P)$ and upper sum $U(f,P)$ both converge given a partition of $[a,b]$: I can divide it equally into $n$ segments, such that the function differs by at most $frac{epsilon}{b-a}$ where the specific length of each section is determined by $delta$ from the epsilon-delta definition. (I think this explanation is correct; if not, please let me know).
However, my main question is does this result hold for a non-continuous strictly increasing function on $[a,b]$? If so, how would we prove that?
Additionally, is there an explicit way to construct a partition (based on $epsilon, b, a$) such that it is always the case for any strictly increasing function that the lower and upper sum get within epsilon of each other?
calculus integration
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Let $f$ be a continuous, increasing function on $[a,b]$. I know that because $f$ is continuous, I can use epsilon-delta to prove that the lower sum $L(f,P)$ and upper sum $U(f,P)$ both converge given a partition of $[a,b]$: I can divide it equally into $n$ segments, such that the function differs by at most $frac{epsilon}{b-a}$ where the specific length of each section is determined by $delta$ from the epsilon-delta definition. (I think this explanation is correct; if not, please let me know).
However, my main question is does this result hold for a non-continuous strictly increasing function on $[a,b]$? If so, how would we prove that?
Additionally, is there an explicit way to construct a partition (based on $epsilon, b, a$) such that it is always the case for any strictly increasing function that the lower and upper sum get within epsilon of each other?
calculus integration
Let $f$ be a continuous, increasing function on $[a,b]$. I know that because $f$ is continuous, I can use epsilon-delta to prove that the lower sum $L(f,P)$ and upper sum $U(f,P)$ both converge given a partition of $[a,b]$: I can divide it equally into $n$ segments, such that the function differs by at most $frac{epsilon}{b-a}$ where the specific length of each section is determined by $delta$ from the epsilon-delta definition. (I think this explanation is correct; if not, please let me know).
However, my main question is does this result hold for a non-continuous strictly increasing function on $[a,b]$? If so, how would we prove that?
Additionally, is there an explicit way to construct a partition (based on $epsilon, b, a$) such that it is always the case for any strictly increasing function that the lower and upper sum get within epsilon of each other?
calculus integration
calculus integration
asked Nov 16 at 4:50
D.R.
1,421620
1,421620
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
up vote
1
down vote
accepted
An increasing function has at worst a countable number of discontinuities where right- and left-hand limits exist.
Take a uniform partition $P_n = (x_0,x_1, ldots, x_n) $ with $x_k = a + (b-a)k/n$ and let $f_-(x)$ and $f_+(x)$ denote the left- and right-hand limits. Of course if $f$ is continuous at $x$, then $f_-(x) = f_+(x)$.
Allowing for discontinuities at partition points we have $f_-(x_k) leqslant f(x_k) leqslant f_+(x_k)$ where the value $f(x_k)$ could be taken to be anywhere in $[f_-(x_k), f_+(x_k)]$ without affecting the integral.
It is always true that $sup_{x in [x_{k-1},x_k]}f(x) = f(x_k)$ and $inf_{x in [x_{k-1},x_k]}f(x) = f(x_{k-1})$ regardless of how values are defined at discontinuity points.
Thus,
$$U(P_n,f) - L(P_n,f) = frac{b-a}{n}sum_{k=1}^nfleft(x_k right) - frac{b-a}{n}sum_{k=1}^nfleft(x_{k-1} right) \ = frac{b-a}{n} left(sum_{k=1}^n [f(x_k) - f(x_{k-1})] right) \ = frac{b-a}{n} left(f(b) - f(a) right), $$
where the last equality follows because the sum is telescoping.
Now observe that $U(P_n,f) - L(P_n,f) to 0$ as $n to infty$ and for all $n > frac{(b-a)(f(b)-f(a))}{epsilon}$ we have
$$U(P_n,f) - L(P_n,f) < epsilon$$
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
accepted
An increasing function has at worst a countable number of discontinuities where right- and left-hand limits exist.
Take a uniform partition $P_n = (x_0,x_1, ldots, x_n) $ with $x_k = a + (b-a)k/n$ and let $f_-(x)$ and $f_+(x)$ denote the left- and right-hand limits. Of course if $f$ is continuous at $x$, then $f_-(x) = f_+(x)$.
Allowing for discontinuities at partition points we have $f_-(x_k) leqslant f(x_k) leqslant f_+(x_k)$ where the value $f(x_k)$ could be taken to be anywhere in $[f_-(x_k), f_+(x_k)]$ without affecting the integral.
It is always true that $sup_{x in [x_{k-1},x_k]}f(x) = f(x_k)$ and $inf_{x in [x_{k-1},x_k]}f(x) = f(x_{k-1})$ regardless of how values are defined at discontinuity points.
Thus,
$$U(P_n,f) - L(P_n,f) = frac{b-a}{n}sum_{k=1}^nfleft(x_k right) - frac{b-a}{n}sum_{k=1}^nfleft(x_{k-1} right) \ = frac{b-a}{n} left(sum_{k=1}^n [f(x_k) - f(x_{k-1})] right) \ = frac{b-a}{n} left(f(b) - f(a) right), $$
where the last equality follows because the sum is telescoping.
Now observe that $U(P_n,f) - L(P_n,f) to 0$ as $n to infty$ and for all $n > frac{(b-a)(f(b)-f(a))}{epsilon}$ we have
$$U(P_n,f) - L(P_n,f) < epsilon$$
add a comment |
up vote
1
down vote
accepted
An increasing function has at worst a countable number of discontinuities where right- and left-hand limits exist.
Take a uniform partition $P_n = (x_0,x_1, ldots, x_n) $ with $x_k = a + (b-a)k/n$ and let $f_-(x)$ and $f_+(x)$ denote the left- and right-hand limits. Of course if $f$ is continuous at $x$, then $f_-(x) = f_+(x)$.
Allowing for discontinuities at partition points we have $f_-(x_k) leqslant f(x_k) leqslant f_+(x_k)$ where the value $f(x_k)$ could be taken to be anywhere in $[f_-(x_k), f_+(x_k)]$ without affecting the integral.
It is always true that $sup_{x in [x_{k-1},x_k]}f(x) = f(x_k)$ and $inf_{x in [x_{k-1},x_k]}f(x) = f(x_{k-1})$ regardless of how values are defined at discontinuity points.
Thus,
$$U(P_n,f) - L(P_n,f) = frac{b-a}{n}sum_{k=1}^nfleft(x_k right) - frac{b-a}{n}sum_{k=1}^nfleft(x_{k-1} right) \ = frac{b-a}{n} left(sum_{k=1}^n [f(x_k) - f(x_{k-1})] right) \ = frac{b-a}{n} left(f(b) - f(a) right), $$
where the last equality follows because the sum is telescoping.
Now observe that $U(P_n,f) - L(P_n,f) to 0$ as $n to infty$ and for all $n > frac{(b-a)(f(b)-f(a))}{epsilon}$ we have
$$U(P_n,f) - L(P_n,f) < epsilon$$
add a comment |
up vote
1
down vote
accepted
up vote
1
down vote
accepted
An increasing function has at worst a countable number of discontinuities where right- and left-hand limits exist.
Take a uniform partition $P_n = (x_0,x_1, ldots, x_n) $ with $x_k = a + (b-a)k/n$ and let $f_-(x)$ and $f_+(x)$ denote the left- and right-hand limits. Of course if $f$ is continuous at $x$, then $f_-(x) = f_+(x)$.
Allowing for discontinuities at partition points we have $f_-(x_k) leqslant f(x_k) leqslant f_+(x_k)$ where the value $f(x_k)$ could be taken to be anywhere in $[f_-(x_k), f_+(x_k)]$ without affecting the integral.
It is always true that $sup_{x in [x_{k-1},x_k]}f(x) = f(x_k)$ and $inf_{x in [x_{k-1},x_k]}f(x) = f(x_{k-1})$ regardless of how values are defined at discontinuity points.
Thus,
$$U(P_n,f) - L(P_n,f) = frac{b-a}{n}sum_{k=1}^nfleft(x_k right) - frac{b-a}{n}sum_{k=1}^nfleft(x_{k-1} right) \ = frac{b-a}{n} left(sum_{k=1}^n [f(x_k) - f(x_{k-1})] right) \ = frac{b-a}{n} left(f(b) - f(a) right), $$
where the last equality follows because the sum is telescoping.
Now observe that $U(P_n,f) - L(P_n,f) to 0$ as $n to infty$ and for all $n > frac{(b-a)(f(b)-f(a))}{epsilon}$ we have
$$U(P_n,f) - L(P_n,f) < epsilon$$
An increasing function has at worst a countable number of discontinuities where right- and left-hand limits exist.
Take a uniform partition $P_n = (x_0,x_1, ldots, x_n) $ with $x_k = a + (b-a)k/n$ and let $f_-(x)$ and $f_+(x)$ denote the left- and right-hand limits. Of course if $f$ is continuous at $x$, then $f_-(x) = f_+(x)$.
Allowing for discontinuities at partition points we have $f_-(x_k) leqslant f(x_k) leqslant f_+(x_k)$ where the value $f(x_k)$ could be taken to be anywhere in $[f_-(x_k), f_+(x_k)]$ without affecting the integral.
It is always true that $sup_{x in [x_{k-1},x_k]}f(x) = f(x_k)$ and $inf_{x in [x_{k-1},x_k]}f(x) = f(x_{k-1})$ regardless of how values are defined at discontinuity points.
Thus,
$$U(P_n,f) - L(P_n,f) = frac{b-a}{n}sum_{k=1}^nfleft(x_k right) - frac{b-a}{n}sum_{k=1}^nfleft(x_{k-1} right) \ = frac{b-a}{n} left(sum_{k=1}^n [f(x_k) - f(x_{k-1})] right) \ = frac{b-a}{n} left(f(b) - f(a) right), $$
where the last equality follows because the sum is telescoping.
Now observe that $U(P_n,f) - L(P_n,f) to 0$ as $n to infty$ and for all $n > frac{(b-a)(f(b)-f(a))}{epsilon}$ we have
$$U(P_n,f) - L(P_n,f) < epsilon$$
edited Nov 16 at 8:29
answered Nov 16 at 7:35
RRL
47.3k42368
47.3k42368
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3000735%2fconstructing-partition-to-show-that-lower-sum-and-upper-sum-differ-by-less-than%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown