Proof that monotone functions are integrable with the classical definition of the Riemann Integral
Let $f:[a,b]to mathbb{R}$ be a monotone function (say strictly increasing).
Then, do for every $epsilon>0$ exist two step functions $h,g$ so that $gle fle h$ and $0le h-gle epsilon$?
Does there exist some closed form of these functions like the one below?
I encountered the problem when trying to prove the Riemann Integrability of monotone functions via the traditional definition of the Riemann Integral (not the one with Darboux sums). The book I am reading proves that a continuous function is integrable via the process below:
Let $mathcal{P}=left{ a=x_0<...<x_n=b right}$ be a partition of $[a,b]$. Define $m_i=min_{xin [x_{i-1},x_i]}f(x)$ and $M_i=max_{xin [x_{i-1},x_i]}f(x)$. By the Extreme Value theorem $M_i,m_i$ are well defined. We approximate $f$ with step functions:
begin{gather}g=m_1chi_{[x_0,x_1]}+sum_{i=2}^nm_ichi_{(x_{i-1},x_i]}\
h=M_1chi_{[x_0,x_1]}+sum_{i=2}^nM_ichi_{(x_{i-1},x_i]}end{gather}
It is easily seen that they satisfy the "step function approximation" and as $0le int_a^bh-gle epsilon$ (uniform continuity) by a previous theorem $f$ is integrable.
The book then goes on to generalise by discussing regulated functions. I would like however to see a self contained proof similar to the previous one if $f$ is monotone. This question is reduced to the two questions asked in the beggining of the post
calculus real-analysis integration definite-integrals
add a comment |
Let $f:[a,b]to mathbb{R}$ be a monotone function (say strictly increasing).
Then, do for every $epsilon>0$ exist two step functions $h,g$ so that $gle fle h$ and $0le h-gle epsilon$?
Does there exist some closed form of these functions like the one below?
I encountered the problem when trying to prove the Riemann Integrability of monotone functions via the traditional definition of the Riemann Integral (not the one with Darboux sums). The book I am reading proves that a continuous function is integrable via the process below:
Let $mathcal{P}=left{ a=x_0<...<x_n=b right}$ be a partition of $[a,b]$. Define $m_i=min_{xin [x_{i-1},x_i]}f(x)$ and $M_i=max_{xin [x_{i-1},x_i]}f(x)$. By the Extreme Value theorem $M_i,m_i$ are well defined. We approximate $f$ with step functions:
begin{gather}g=m_1chi_{[x_0,x_1]}+sum_{i=2}^nm_ichi_{(x_{i-1},x_i]}\
h=M_1chi_{[x_0,x_1]}+sum_{i=2}^nM_ichi_{(x_{i-1},x_i]}end{gather}
It is easily seen that they satisfy the "step function approximation" and as $0le int_a^bh-gle epsilon$ (uniform continuity) by a previous theorem $f$ is integrable.
The book then goes on to generalise by discussing regulated functions. I would like however to see a self contained proof similar to the previous one if $f$ is monotone. This question is reduced to the two questions asked in the beggining of the post
calculus real-analysis integration definite-integrals
add a comment |
Let $f:[a,b]to mathbb{R}$ be a monotone function (say strictly increasing).
Then, do for every $epsilon>0$ exist two step functions $h,g$ so that $gle fle h$ and $0le h-gle epsilon$?
Does there exist some closed form of these functions like the one below?
I encountered the problem when trying to prove the Riemann Integrability of monotone functions via the traditional definition of the Riemann Integral (not the one with Darboux sums). The book I am reading proves that a continuous function is integrable via the process below:
Let $mathcal{P}=left{ a=x_0<...<x_n=b right}$ be a partition of $[a,b]$. Define $m_i=min_{xin [x_{i-1},x_i]}f(x)$ and $M_i=max_{xin [x_{i-1},x_i]}f(x)$. By the Extreme Value theorem $M_i,m_i$ are well defined. We approximate $f$ with step functions:
begin{gather}g=m_1chi_{[x_0,x_1]}+sum_{i=2}^nm_ichi_{(x_{i-1},x_i]}\
h=M_1chi_{[x_0,x_1]}+sum_{i=2}^nM_ichi_{(x_{i-1},x_i]}end{gather}
It is easily seen that they satisfy the "step function approximation" and as $0le int_a^bh-gle epsilon$ (uniform continuity) by a previous theorem $f$ is integrable.
The book then goes on to generalise by discussing regulated functions. I would like however to see a self contained proof similar to the previous one if $f$ is monotone. This question is reduced to the two questions asked in the beggining of the post
calculus real-analysis integration definite-integrals
Let $f:[a,b]to mathbb{R}$ be a monotone function (say strictly increasing).
Then, do for every $epsilon>0$ exist two step functions $h,g$ so that $gle fle h$ and $0le h-gle epsilon$?
Does there exist some closed form of these functions like the one below?
I encountered the problem when trying to prove the Riemann Integrability of monotone functions via the traditional definition of the Riemann Integral (not the one with Darboux sums). The book I am reading proves that a continuous function is integrable via the process below:
Let $mathcal{P}=left{ a=x_0<...<x_n=b right}$ be a partition of $[a,b]$. Define $m_i=min_{xin [x_{i-1},x_i]}f(x)$ and $M_i=max_{xin [x_{i-1},x_i]}f(x)$. By the Extreme Value theorem $M_i,m_i$ are well defined. We approximate $f$ with step functions:
begin{gather}g=m_1chi_{[x_0,x_1]}+sum_{i=2}^nm_ichi_{(x_{i-1},x_i]}\
h=M_1chi_{[x_0,x_1]}+sum_{i=2}^nM_ichi_{(x_{i-1},x_i]}end{gather}
It is easily seen that they satisfy the "step function approximation" and as $0le int_a^bh-gle epsilon$ (uniform continuity) by a previous theorem $f$ is integrable.
The book then goes on to generalise by discussing regulated functions. I would like however to see a self contained proof similar to the previous one if $f$ is monotone. This question is reduced to the two questions asked in the beggining of the post
calculus real-analysis integration definite-integrals
calculus real-analysis integration definite-integrals
edited Jan 5 at 19:52
azimut
16.2k1051100
16.2k1051100
asked Jan 21 '13 at 18:59
OptionalOptional
297312
297312
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
Let $varepsilon>0$ and $N_varepsilon$ the smallest $n in mathbb{N}$ such that
$$
frac{1}{n}(b-a)(f(b)-f(a)) le varepsilon
$$
For $n ge max{2,N_varepsilon}$ consider the following partition of $[a,b]$:
$$
mathcal{P}={a=x_0<x_1<ldots<x_n=b}, x_i=a+ifrac{b-a}{n} 0 le i le n.
$$
Set
$$
A_i=begin{cases}
[x_0,x_1] & text{ for } i=0\
(x_i,x_{i+1}]& text{ for } 1 le i le n-1
end{cases}
$$
Since $f$ is strictly increasing for each $i in {0,ldots,n-1}$ we have
$$
f(x_i) le f(x) le f(x_{i+1}) quad forall x_i le x le x_{i+1}.
$$
Setting
$$
h=sum_{i=0}^{n-1}f(x_{i+1})chi_{A_i}, g=sum_{i=0}^{n-1}f(x_i)chi_{A_i}
$$
we have
$$
g(x)le f(x) le h(x) quad forall x in [a,b],
$$
and
$$
h(x)-g(x)=sum_{i=0}^{n-1}Big(f(x_{i+1})-f(x_i)Big)chi_{A_i}(x)>0 quad forall x in [a,b].
$$
In addition
begin{eqnarray}
int_a^b(h-g)&=&sum_{i=0}^{n-1}(f(x_{i+1})-f(x_i))int_a^bchi_{A_i}=sum_{i=0}^{n-1}(f(x_{i+1})-f(x_i))(x_{i+1}-x_i)\
&=&frac{b-a}{n}sum_{i=0}^{n-1}(f(x_{i+1})-f(x_i))=frac{1}{n}(b-a)(f(b)-f(a))\
&le&frac{1}{N_varepsilon}(b-a)(f(b)-f(a))le varepsilon.
end{eqnarray}
1
You didn't have to include so many details but thank you sincerely
– Optional
Jan 22 '13 at 11:19
add a comment |
Let $P$ be a finite partition of $[f(a),f(b)]$ into subintervals of length at most $epsilon$. For $Ain P$, write $m_A<M_A$ for the endpoints of $A$ and define $$g=sum_{Ain P}m_Achi_{f^{-1}(A)}qquadmbox{and}qquad h=sum_{Ain P} M_Achi_{f^{-1}(A)}.$$
Thanks for the answer. Can you suggest such a partition $P$ (that is preferably simple)?
– Optional
Jan 21 '13 at 19:19
Sure. Pick $nge1$ large enough that $delta:=(f(b)-f(a))/nle epsilon$, and take $P={A_1,A_2,dots,A_n}$ where $A_1=[f(a),f(a)+delta)$, $A_2=[f(a)+delta,f(a)+2delta)$, ... , $A_{n-1}=[f(a)+(n-2)delta,f(a)+(n-1)delta)$, $A_n=[f(a)+(n-1)delta,f(a)+ndelta]$.
– user108903
Jan 21 '13 at 19:23
Yeah, thats what I had in mind. The whole process of partitioning the range instead of the domain is a little complicated. Can we partition the domain instead?
– Optional
Jan 21 '13 at 19:28
Well you are partitioning the domain (even into intervals), but you're using a partition of the range to find the partition of the domain.
– user108903
Jan 21 '13 at 19:29
But how do we know $f^{-1}(A)$ is an interval and so the two functions are integrable?
– Optional
Jan 21 '13 at 19:31
|
show 2 more comments
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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%2f283679%2fproof-that-monotone-functions-are-integrable-with-the-classical-definition-of-th%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
Let $varepsilon>0$ and $N_varepsilon$ the smallest $n in mathbb{N}$ such that
$$
frac{1}{n}(b-a)(f(b)-f(a)) le varepsilon
$$
For $n ge max{2,N_varepsilon}$ consider the following partition of $[a,b]$:
$$
mathcal{P}={a=x_0<x_1<ldots<x_n=b}, x_i=a+ifrac{b-a}{n} 0 le i le n.
$$
Set
$$
A_i=begin{cases}
[x_0,x_1] & text{ for } i=0\
(x_i,x_{i+1}]& text{ for } 1 le i le n-1
end{cases}
$$
Since $f$ is strictly increasing for each $i in {0,ldots,n-1}$ we have
$$
f(x_i) le f(x) le f(x_{i+1}) quad forall x_i le x le x_{i+1}.
$$
Setting
$$
h=sum_{i=0}^{n-1}f(x_{i+1})chi_{A_i}, g=sum_{i=0}^{n-1}f(x_i)chi_{A_i}
$$
we have
$$
g(x)le f(x) le h(x) quad forall x in [a,b],
$$
and
$$
h(x)-g(x)=sum_{i=0}^{n-1}Big(f(x_{i+1})-f(x_i)Big)chi_{A_i}(x)>0 quad forall x in [a,b].
$$
In addition
begin{eqnarray}
int_a^b(h-g)&=&sum_{i=0}^{n-1}(f(x_{i+1})-f(x_i))int_a^bchi_{A_i}=sum_{i=0}^{n-1}(f(x_{i+1})-f(x_i))(x_{i+1}-x_i)\
&=&frac{b-a}{n}sum_{i=0}^{n-1}(f(x_{i+1})-f(x_i))=frac{1}{n}(b-a)(f(b)-f(a))\
&le&frac{1}{N_varepsilon}(b-a)(f(b)-f(a))le varepsilon.
end{eqnarray}
1
You didn't have to include so many details but thank you sincerely
– Optional
Jan 22 '13 at 11:19
add a comment |
Let $varepsilon>0$ and $N_varepsilon$ the smallest $n in mathbb{N}$ such that
$$
frac{1}{n}(b-a)(f(b)-f(a)) le varepsilon
$$
For $n ge max{2,N_varepsilon}$ consider the following partition of $[a,b]$:
$$
mathcal{P}={a=x_0<x_1<ldots<x_n=b}, x_i=a+ifrac{b-a}{n} 0 le i le n.
$$
Set
$$
A_i=begin{cases}
[x_0,x_1] & text{ for } i=0\
(x_i,x_{i+1}]& text{ for } 1 le i le n-1
end{cases}
$$
Since $f$ is strictly increasing for each $i in {0,ldots,n-1}$ we have
$$
f(x_i) le f(x) le f(x_{i+1}) quad forall x_i le x le x_{i+1}.
$$
Setting
$$
h=sum_{i=0}^{n-1}f(x_{i+1})chi_{A_i}, g=sum_{i=0}^{n-1}f(x_i)chi_{A_i}
$$
we have
$$
g(x)le f(x) le h(x) quad forall x in [a,b],
$$
and
$$
h(x)-g(x)=sum_{i=0}^{n-1}Big(f(x_{i+1})-f(x_i)Big)chi_{A_i}(x)>0 quad forall x in [a,b].
$$
In addition
begin{eqnarray}
int_a^b(h-g)&=&sum_{i=0}^{n-1}(f(x_{i+1})-f(x_i))int_a^bchi_{A_i}=sum_{i=0}^{n-1}(f(x_{i+1})-f(x_i))(x_{i+1}-x_i)\
&=&frac{b-a}{n}sum_{i=0}^{n-1}(f(x_{i+1})-f(x_i))=frac{1}{n}(b-a)(f(b)-f(a))\
&le&frac{1}{N_varepsilon}(b-a)(f(b)-f(a))le varepsilon.
end{eqnarray}
1
You didn't have to include so many details but thank you sincerely
– Optional
Jan 22 '13 at 11:19
add a comment |
Let $varepsilon>0$ and $N_varepsilon$ the smallest $n in mathbb{N}$ such that
$$
frac{1}{n}(b-a)(f(b)-f(a)) le varepsilon
$$
For $n ge max{2,N_varepsilon}$ consider the following partition of $[a,b]$:
$$
mathcal{P}={a=x_0<x_1<ldots<x_n=b}, x_i=a+ifrac{b-a}{n} 0 le i le n.
$$
Set
$$
A_i=begin{cases}
[x_0,x_1] & text{ for } i=0\
(x_i,x_{i+1}]& text{ for } 1 le i le n-1
end{cases}
$$
Since $f$ is strictly increasing for each $i in {0,ldots,n-1}$ we have
$$
f(x_i) le f(x) le f(x_{i+1}) quad forall x_i le x le x_{i+1}.
$$
Setting
$$
h=sum_{i=0}^{n-1}f(x_{i+1})chi_{A_i}, g=sum_{i=0}^{n-1}f(x_i)chi_{A_i}
$$
we have
$$
g(x)le f(x) le h(x) quad forall x in [a,b],
$$
and
$$
h(x)-g(x)=sum_{i=0}^{n-1}Big(f(x_{i+1})-f(x_i)Big)chi_{A_i}(x)>0 quad forall x in [a,b].
$$
In addition
begin{eqnarray}
int_a^b(h-g)&=&sum_{i=0}^{n-1}(f(x_{i+1})-f(x_i))int_a^bchi_{A_i}=sum_{i=0}^{n-1}(f(x_{i+1})-f(x_i))(x_{i+1}-x_i)\
&=&frac{b-a}{n}sum_{i=0}^{n-1}(f(x_{i+1})-f(x_i))=frac{1}{n}(b-a)(f(b)-f(a))\
&le&frac{1}{N_varepsilon}(b-a)(f(b)-f(a))le varepsilon.
end{eqnarray}
Let $varepsilon>0$ and $N_varepsilon$ the smallest $n in mathbb{N}$ such that
$$
frac{1}{n}(b-a)(f(b)-f(a)) le varepsilon
$$
For $n ge max{2,N_varepsilon}$ consider the following partition of $[a,b]$:
$$
mathcal{P}={a=x_0<x_1<ldots<x_n=b}, x_i=a+ifrac{b-a}{n} 0 le i le n.
$$
Set
$$
A_i=begin{cases}
[x_0,x_1] & text{ for } i=0\
(x_i,x_{i+1}]& text{ for } 1 le i le n-1
end{cases}
$$
Since $f$ is strictly increasing for each $i in {0,ldots,n-1}$ we have
$$
f(x_i) le f(x) le f(x_{i+1}) quad forall x_i le x le x_{i+1}.
$$
Setting
$$
h=sum_{i=0}^{n-1}f(x_{i+1})chi_{A_i}, g=sum_{i=0}^{n-1}f(x_i)chi_{A_i}
$$
we have
$$
g(x)le f(x) le h(x) quad forall x in [a,b],
$$
and
$$
h(x)-g(x)=sum_{i=0}^{n-1}Big(f(x_{i+1})-f(x_i)Big)chi_{A_i}(x)>0 quad forall x in [a,b].
$$
In addition
begin{eqnarray}
int_a^b(h-g)&=&sum_{i=0}^{n-1}(f(x_{i+1})-f(x_i))int_a^bchi_{A_i}=sum_{i=0}^{n-1}(f(x_{i+1})-f(x_i))(x_{i+1}-x_i)\
&=&frac{b-a}{n}sum_{i=0}^{n-1}(f(x_{i+1})-f(x_i))=frac{1}{n}(b-a)(f(b)-f(a))\
&le&frac{1}{N_varepsilon}(b-a)(f(b)-f(a))le varepsilon.
end{eqnarray}
answered Jan 21 '13 at 22:10
Mercy KingMercy King
14k11328
14k11328
1
You didn't have to include so many details but thank you sincerely
– Optional
Jan 22 '13 at 11:19
add a comment |
1
You didn't have to include so many details but thank you sincerely
– Optional
Jan 22 '13 at 11:19
1
1
You didn't have to include so many details but thank you sincerely
– Optional
Jan 22 '13 at 11:19
You didn't have to include so many details but thank you sincerely
– Optional
Jan 22 '13 at 11:19
add a comment |
Let $P$ be a finite partition of $[f(a),f(b)]$ into subintervals of length at most $epsilon$. For $Ain P$, write $m_A<M_A$ for the endpoints of $A$ and define $$g=sum_{Ain P}m_Achi_{f^{-1}(A)}qquadmbox{and}qquad h=sum_{Ain P} M_Achi_{f^{-1}(A)}.$$
Thanks for the answer. Can you suggest such a partition $P$ (that is preferably simple)?
– Optional
Jan 21 '13 at 19:19
Sure. Pick $nge1$ large enough that $delta:=(f(b)-f(a))/nle epsilon$, and take $P={A_1,A_2,dots,A_n}$ where $A_1=[f(a),f(a)+delta)$, $A_2=[f(a)+delta,f(a)+2delta)$, ... , $A_{n-1}=[f(a)+(n-2)delta,f(a)+(n-1)delta)$, $A_n=[f(a)+(n-1)delta,f(a)+ndelta]$.
– user108903
Jan 21 '13 at 19:23
Yeah, thats what I had in mind. The whole process of partitioning the range instead of the domain is a little complicated. Can we partition the domain instead?
– Optional
Jan 21 '13 at 19:28
Well you are partitioning the domain (even into intervals), but you're using a partition of the range to find the partition of the domain.
– user108903
Jan 21 '13 at 19:29
But how do we know $f^{-1}(A)$ is an interval and so the two functions are integrable?
– Optional
Jan 21 '13 at 19:31
|
show 2 more comments
Let $P$ be a finite partition of $[f(a),f(b)]$ into subintervals of length at most $epsilon$. For $Ain P$, write $m_A<M_A$ for the endpoints of $A$ and define $$g=sum_{Ain P}m_Achi_{f^{-1}(A)}qquadmbox{and}qquad h=sum_{Ain P} M_Achi_{f^{-1}(A)}.$$
Thanks for the answer. Can you suggest such a partition $P$ (that is preferably simple)?
– Optional
Jan 21 '13 at 19:19
Sure. Pick $nge1$ large enough that $delta:=(f(b)-f(a))/nle epsilon$, and take $P={A_1,A_2,dots,A_n}$ where $A_1=[f(a),f(a)+delta)$, $A_2=[f(a)+delta,f(a)+2delta)$, ... , $A_{n-1}=[f(a)+(n-2)delta,f(a)+(n-1)delta)$, $A_n=[f(a)+(n-1)delta,f(a)+ndelta]$.
– user108903
Jan 21 '13 at 19:23
Yeah, thats what I had in mind. The whole process of partitioning the range instead of the domain is a little complicated. Can we partition the domain instead?
– Optional
Jan 21 '13 at 19:28
Well you are partitioning the domain (even into intervals), but you're using a partition of the range to find the partition of the domain.
– user108903
Jan 21 '13 at 19:29
But how do we know $f^{-1}(A)$ is an interval and so the two functions are integrable?
– Optional
Jan 21 '13 at 19:31
|
show 2 more comments
Let $P$ be a finite partition of $[f(a),f(b)]$ into subintervals of length at most $epsilon$. For $Ain P$, write $m_A<M_A$ for the endpoints of $A$ and define $$g=sum_{Ain P}m_Achi_{f^{-1}(A)}qquadmbox{and}qquad h=sum_{Ain P} M_Achi_{f^{-1}(A)}.$$
Let $P$ be a finite partition of $[f(a),f(b)]$ into subintervals of length at most $epsilon$. For $Ain P$, write $m_A<M_A$ for the endpoints of $A$ and define $$g=sum_{Ain P}m_Achi_{f^{-1}(A)}qquadmbox{and}qquad h=sum_{Ain P} M_Achi_{f^{-1}(A)}.$$
answered Jan 21 '13 at 19:13
user108903user108903
1,09578
1,09578
Thanks for the answer. Can you suggest such a partition $P$ (that is preferably simple)?
– Optional
Jan 21 '13 at 19:19
Sure. Pick $nge1$ large enough that $delta:=(f(b)-f(a))/nle epsilon$, and take $P={A_1,A_2,dots,A_n}$ where $A_1=[f(a),f(a)+delta)$, $A_2=[f(a)+delta,f(a)+2delta)$, ... , $A_{n-1}=[f(a)+(n-2)delta,f(a)+(n-1)delta)$, $A_n=[f(a)+(n-1)delta,f(a)+ndelta]$.
– user108903
Jan 21 '13 at 19:23
Yeah, thats what I had in mind. The whole process of partitioning the range instead of the domain is a little complicated. Can we partition the domain instead?
– Optional
Jan 21 '13 at 19:28
Well you are partitioning the domain (even into intervals), but you're using a partition of the range to find the partition of the domain.
– user108903
Jan 21 '13 at 19:29
But how do we know $f^{-1}(A)$ is an interval and so the two functions are integrable?
– Optional
Jan 21 '13 at 19:31
|
show 2 more comments
Thanks for the answer. Can you suggest such a partition $P$ (that is preferably simple)?
– Optional
Jan 21 '13 at 19:19
Sure. Pick $nge1$ large enough that $delta:=(f(b)-f(a))/nle epsilon$, and take $P={A_1,A_2,dots,A_n}$ where $A_1=[f(a),f(a)+delta)$, $A_2=[f(a)+delta,f(a)+2delta)$, ... , $A_{n-1}=[f(a)+(n-2)delta,f(a)+(n-1)delta)$, $A_n=[f(a)+(n-1)delta,f(a)+ndelta]$.
– user108903
Jan 21 '13 at 19:23
Yeah, thats what I had in mind. The whole process of partitioning the range instead of the domain is a little complicated. Can we partition the domain instead?
– Optional
Jan 21 '13 at 19:28
Well you are partitioning the domain (even into intervals), but you're using a partition of the range to find the partition of the domain.
– user108903
Jan 21 '13 at 19:29
But how do we know $f^{-1}(A)$ is an interval and so the two functions are integrable?
– Optional
Jan 21 '13 at 19:31
Thanks for the answer. Can you suggest such a partition $P$ (that is preferably simple)?
– Optional
Jan 21 '13 at 19:19
Thanks for the answer. Can you suggest such a partition $P$ (that is preferably simple)?
– Optional
Jan 21 '13 at 19:19
Sure. Pick $nge1$ large enough that $delta:=(f(b)-f(a))/nle epsilon$, and take $P={A_1,A_2,dots,A_n}$ where $A_1=[f(a),f(a)+delta)$, $A_2=[f(a)+delta,f(a)+2delta)$, ... , $A_{n-1}=[f(a)+(n-2)delta,f(a)+(n-1)delta)$, $A_n=[f(a)+(n-1)delta,f(a)+ndelta]$.
– user108903
Jan 21 '13 at 19:23
Sure. Pick $nge1$ large enough that $delta:=(f(b)-f(a))/nle epsilon$, and take $P={A_1,A_2,dots,A_n}$ where $A_1=[f(a),f(a)+delta)$, $A_2=[f(a)+delta,f(a)+2delta)$, ... , $A_{n-1}=[f(a)+(n-2)delta,f(a)+(n-1)delta)$, $A_n=[f(a)+(n-1)delta,f(a)+ndelta]$.
– user108903
Jan 21 '13 at 19:23
Yeah, thats what I had in mind. The whole process of partitioning the range instead of the domain is a little complicated. Can we partition the domain instead?
– Optional
Jan 21 '13 at 19:28
Yeah, thats what I had in mind. The whole process of partitioning the range instead of the domain is a little complicated. Can we partition the domain instead?
– Optional
Jan 21 '13 at 19:28
Well you are partitioning the domain (even into intervals), but you're using a partition of the range to find the partition of the domain.
– user108903
Jan 21 '13 at 19:29
Well you are partitioning the domain (even into intervals), but you're using a partition of the range to find the partition of the domain.
– user108903
Jan 21 '13 at 19:29
But how do we know $f^{-1}(A)$ is an interval and so the two functions are integrable?
– Optional
Jan 21 '13 at 19:31
But how do we know $f^{-1}(A)$ is an interval and so the two functions are integrable?
– Optional
Jan 21 '13 at 19:31
|
show 2 more comments
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%2f283679%2fproof-that-monotone-functions-are-integrable-with-the-classical-definition-of-th%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