If $f$ is integrable and and $g=f$ except at fintely many points. Prove that $g$ is integrable












1












$begingroup$



Let $f: A rightarrow mathbb{R} $ be integrable and let $g=f$ except at fintely many points. Show that $g$ is integrable and that $int_A f = int_A g$




The question above is from Spivak's "Calculus on Manifolds" question 3-2 in the chapter on integration.



I want to prove this by using the theorem that states that a function is integrable iff $ exists p $ such that $U(f,p)-L(f,p) < epsilon$ $, forall epsilon$



Since I can assume that this condition holds for $f$ I want to find a partition $p'$ such that $U(g,p') leq U(f,p)$ and $L(g,p') > L(f,p)$.



I have tried by starting with the case where $f$ and $g$ only differ at one point. It is then clear that in the case where $g(x_0) > f(x_0)$, that we can satisfy the inequality $U(g,p') leq U(f,p)$ by refining the $p$ that satisfies $U(f,p)-L(f,p) < epsilon$.



My Question
How can I precisely pick $p'$ so that $U(g,p')=U(f,p)$ in the special case I described above? Intuitively, I can just keep refining $p$ and that partition which includes $x_0$ will tend to $0$, but I want to rigorously know at what point will $U(g,p')=U(f,p)$?



Thanks










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    The refinement may strictly decrease the upper sum, you can't ensure exact equality between them. In any case, think of the worst case scenario, where $f(x_0)$ was the maximum on its interval in $p$ and now $g(x_0)$ is a bit bigger, say by $a$. How exactly can you refine near $x_0$ so that $U(g,p')$ is close enough to $U(f,p')$? You'll need the interval containing $x_0$ to be short...how short?
    $endgroup$
    – Ian
    Jan 23 at 3:37












  • $begingroup$
    In the second last line of your comment, did you mean to write "close enough to $U(f,p)$ instead of "close enough to $U(f,p')$?
    $endgroup$
    – john fowles
    Jan 23 at 5:39












  • $begingroup$
    No, it is easier to compare on the same partition. Then $U(f,p')$ will be close enough to $U(f,p)$ because $U(f,p)$ is already quite close to the integral of $f$.
    $endgroup$
    – Ian
    Jan 23 at 8:58












  • $begingroup$
    Please, please be careful with your order of quantifiers.
    $endgroup$
    – Ted Shifrin
    Jan 25 at 1:15
















1












$begingroup$



Let $f: A rightarrow mathbb{R} $ be integrable and let $g=f$ except at fintely many points. Show that $g$ is integrable and that $int_A f = int_A g$




The question above is from Spivak's "Calculus on Manifolds" question 3-2 in the chapter on integration.



I want to prove this by using the theorem that states that a function is integrable iff $ exists p $ such that $U(f,p)-L(f,p) < epsilon$ $, forall epsilon$



Since I can assume that this condition holds for $f$ I want to find a partition $p'$ such that $U(g,p') leq U(f,p)$ and $L(g,p') > L(f,p)$.



I have tried by starting with the case where $f$ and $g$ only differ at one point. It is then clear that in the case where $g(x_0) > f(x_0)$, that we can satisfy the inequality $U(g,p') leq U(f,p)$ by refining the $p$ that satisfies $U(f,p)-L(f,p) < epsilon$.



My Question
How can I precisely pick $p'$ so that $U(g,p')=U(f,p)$ in the special case I described above? Intuitively, I can just keep refining $p$ and that partition which includes $x_0$ will tend to $0$, but I want to rigorously know at what point will $U(g,p')=U(f,p)$?



Thanks










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    The refinement may strictly decrease the upper sum, you can't ensure exact equality between them. In any case, think of the worst case scenario, where $f(x_0)$ was the maximum on its interval in $p$ and now $g(x_0)$ is a bit bigger, say by $a$. How exactly can you refine near $x_0$ so that $U(g,p')$ is close enough to $U(f,p')$? You'll need the interval containing $x_0$ to be short...how short?
    $endgroup$
    – Ian
    Jan 23 at 3:37












  • $begingroup$
    In the second last line of your comment, did you mean to write "close enough to $U(f,p)$ instead of "close enough to $U(f,p')$?
    $endgroup$
    – john fowles
    Jan 23 at 5:39












  • $begingroup$
    No, it is easier to compare on the same partition. Then $U(f,p')$ will be close enough to $U(f,p)$ because $U(f,p)$ is already quite close to the integral of $f$.
    $endgroup$
    – Ian
    Jan 23 at 8:58












  • $begingroup$
    Please, please be careful with your order of quantifiers.
    $endgroup$
    – Ted Shifrin
    Jan 25 at 1:15














1












1








1





$begingroup$



Let $f: A rightarrow mathbb{R} $ be integrable and let $g=f$ except at fintely many points. Show that $g$ is integrable and that $int_A f = int_A g$




The question above is from Spivak's "Calculus on Manifolds" question 3-2 in the chapter on integration.



I want to prove this by using the theorem that states that a function is integrable iff $ exists p $ such that $U(f,p)-L(f,p) < epsilon$ $, forall epsilon$



Since I can assume that this condition holds for $f$ I want to find a partition $p'$ such that $U(g,p') leq U(f,p)$ and $L(g,p') > L(f,p)$.



I have tried by starting with the case where $f$ and $g$ only differ at one point. It is then clear that in the case where $g(x_0) > f(x_0)$, that we can satisfy the inequality $U(g,p') leq U(f,p)$ by refining the $p$ that satisfies $U(f,p)-L(f,p) < epsilon$.



My Question
How can I precisely pick $p'$ so that $U(g,p')=U(f,p)$ in the special case I described above? Intuitively, I can just keep refining $p$ and that partition which includes $x_0$ will tend to $0$, but I want to rigorously know at what point will $U(g,p')=U(f,p)$?



Thanks










share|cite|improve this question









$endgroup$





Let $f: A rightarrow mathbb{R} $ be integrable and let $g=f$ except at fintely many points. Show that $g$ is integrable and that $int_A f = int_A g$




The question above is from Spivak's "Calculus on Manifolds" question 3-2 in the chapter on integration.



I want to prove this by using the theorem that states that a function is integrable iff $ exists p $ such that $U(f,p)-L(f,p) < epsilon$ $, forall epsilon$



Since I can assume that this condition holds for $f$ I want to find a partition $p'$ such that $U(g,p') leq U(f,p)$ and $L(g,p') > L(f,p)$.



I have tried by starting with the case where $f$ and $g$ only differ at one point. It is then clear that in the case where $g(x_0) > f(x_0)$, that we can satisfy the inequality $U(g,p') leq U(f,p)$ by refining the $p$ that satisfies $U(f,p)-L(f,p) < epsilon$.



My Question
How can I precisely pick $p'$ so that $U(g,p')=U(f,p)$ in the special case I described above? Intuitively, I can just keep refining $p$ and that partition which includes $x_0$ will tend to $0$, but I want to rigorously know at what point will $U(g,p')=U(f,p)$?



Thanks







multivariable-calculus proof-writing






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Jan 23 at 3:26









john fowlesjohn fowles

1,208817




1,208817








  • 1




    $begingroup$
    The refinement may strictly decrease the upper sum, you can't ensure exact equality between them. In any case, think of the worst case scenario, where $f(x_0)$ was the maximum on its interval in $p$ and now $g(x_0)$ is a bit bigger, say by $a$. How exactly can you refine near $x_0$ so that $U(g,p')$ is close enough to $U(f,p')$? You'll need the interval containing $x_0$ to be short...how short?
    $endgroup$
    – Ian
    Jan 23 at 3:37












  • $begingroup$
    In the second last line of your comment, did you mean to write "close enough to $U(f,p)$ instead of "close enough to $U(f,p')$?
    $endgroup$
    – john fowles
    Jan 23 at 5:39












  • $begingroup$
    No, it is easier to compare on the same partition. Then $U(f,p')$ will be close enough to $U(f,p)$ because $U(f,p)$ is already quite close to the integral of $f$.
    $endgroup$
    – Ian
    Jan 23 at 8:58












  • $begingroup$
    Please, please be careful with your order of quantifiers.
    $endgroup$
    – Ted Shifrin
    Jan 25 at 1:15














  • 1




    $begingroup$
    The refinement may strictly decrease the upper sum, you can't ensure exact equality between them. In any case, think of the worst case scenario, where $f(x_0)$ was the maximum on its interval in $p$ and now $g(x_0)$ is a bit bigger, say by $a$. How exactly can you refine near $x_0$ so that $U(g,p')$ is close enough to $U(f,p')$? You'll need the interval containing $x_0$ to be short...how short?
    $endgroup$
    – Ian
    Jan 23 at 3:37












  • $begingroup$
    In the second last line of your comment, did you mean to write "close enough to $U(f,p)$ instead of "close enough to $U(f,p')$?
    $endgroup$
    – john fowles
    Jan 23 at 5:39












  • $begingroup$
    No, it is easier to compare on the same partition. Then $U(f,p')$ will be close enough to $U(f,p)$ because $U(f,p)$ is already quite close to the integral of $f$.
    $endgroup$
    – Ian
    Jan 23 at 8:58












  • $begingroup$
    Please, please be careful with your order of quantifiers.
    $endgroup$
    – Ted Shifrin
    Jan 25 at 1:15








1




1




$begingroup$
The refinement may strictly decrease the upper sum, you can't ensure exact equality between them. In any case, think of the worst case scenario, where $f(x_0)$ was the maximum on its interval in $p$ and now $g(x_0)$ is a bit bigger, say by $a$. How exactly can you refine near $x_0$ so that $U(g,p')$ is close enough to $U(f,p')$? You'll need the interval containing $x_0$ to be short...how short?
$endgroup$
– Ian
Jan 23 at 3:37






$begingroup$
The refinement may strictly decrease the upper sum, you can't ensure exact equality between them. In any case, think of the worst case scenario, where $f(x_0)$ was the maximum on its interval in $p$ and now $g(x_0)$ is a bit bigger, say by $a$. How exactly can you refine near $x_0$ so that $U(g,p')$ is close enough to $U(f,p')$? You'll need the interval containing $x_0$ to be short...how short?
$endgroup$
– Ian
Jan 23 at 3:37














$begingroup$
In the second last line of your comment, did you mean to write "close enough to $U(f,p)$ instead of "close enough to $U(f,p')$?
$endgroup$
– john fowles
Jan 23 at 5:39






$begingroup$
In the second last line of your comment, did you mean to write "close enough to $U(f,p)$ instead of "close enough to $U(f,p')$?
$endgroup$
– john fowles
Jan 23 at 5:39














$begingroup$
No, it is easier to compare on the same partition. Then $U(f,p')$ will be close enough to $U(f,p)$ because $U(f,p)$ is already quite close to the integral of $f$.
$endgroup$
– Ian
Jan 23 at 8:58






$begingroup$
No, it is easier to compare on the same partition. Then $U(f,p')$ will be close enough to $U(f,p)$ because $U(f,p)$ is already quite close to the integral of $f$.
$endgroup$
– Ian
Jan 23 at 8:58














$begingroup$
Please, please be careful with your order of quantifiers.
$endgroup$
– Ted Shifrin
Jan 25 at 1:15




$begingroup$
Please, please be careful with your order of quantifiers.
$endgroup$
– Ted Shifrin
Jan 25 at 1:15










0






active

oldest

votes











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3084047%2fif-f-is-integrable-and-and-g-f-except-at-fintely-many-points-prove-that-g%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3084047%2fif-f-is-integrable-and-and-g-f-except-at-fintely-many-points-prove-that-g%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

Does disintegrating a polymorphed enemy still kill it after the 2018 errata?

A Topological Invariant for $pi_3(U(n))$