Proving that 2 functions are bounded.
up vote
2
down vote
favorite
Let $f,g:mathbb R -> mathbb R$. Let $h_1$ = $f-g$ and $h_2$ = $f+g$. Suppose $h_1$ and $h_2$ are bounded. Show that $f$ and $g$ are bounded.
I understand the concept of bounded but would've thought you would need to use limits or a derivative to do a proof. How would you accomplish this without one.
real-analysis
add a comment |
up vote
2
down vote
favorite
Let $f,g:mathbb R -> mathbb R$. Let $h_1$ = $f-g$ and $h_2$ = $f+g$. Suppose $h_1$ and $h_2$ are bounded. Show that $f$ and $g$ are bounded.
I understand the concept of bounded but would've thought you would need to use limits or a derivative to do a proof. How would you accomplish this without one.
real-analysis
1
Express $f,g $ in the form of $h_2, h_1$.
– xbh
1 hour ago
$|f(x) pm g(x) | le |f(x)| + |g(x)|$ for all $f,g,x$ so the sum and difference of bounded functions is bounded.
– Henno Brandsma
1 hour ago
add a comment |
up vote
2
down vote
favorite
up vote
2
down vote
favorite
Let $f,g:mathbb R -> mathbb R$. Let $h_1$ = $f-g$ and $h_2$ = $f+g$. Suppose $h_1$ and $h_2$ are bounded. Show that $f$ and $g$ are bounded.
I understand the concept of bounded but would've thought you would need to use limits or a derivative to do a proof. How would you accomplish this without one.
real-analysis
Let $f,g:mathbb R -> mathbb R$. Let $h_1$ = $f-g$ and $h_2$ = $f+g$. Suppose $h_1$ and $h_2$ are bounded. Show that $f$ and $g$ are bounded.
I understand the concept of bounded but would've thought you would need to use limits or a derivative to do a proof. How would you accomplish this without one.
real-analysis
real-analysis
edited 1 hour ago
Henno Brandsma
103k346113
103k346113
asked 1 hour ago
Pablo Tores
386
386
1
Express $f,g $ in the form of $h_2, h_1$.
– xbh
1 hour ago
$|f(x) pm g(x) | le |f(x)| + |g(x)|$ for all $f,g,x$ so the sum and difference of bounded functions is bounded.
– Henno Brandsma
1 hour ago
add a comment |
1
Express $f,g $ in the form of $h_2, h_1$.
– xbh
1 hour ago
$|f(x) pm g(x) | le |f(x)| + |g(x)|$ for all $f,g,x$ so the sum and difference of bounded functions is bounded.
– Henno Brandsma
1 hour ago
1
1
Express $f,g $ in the form of $h_2, h_1$.
– xbh
1 hour ago
Express $f,g $ in the form of $h_2, h_1$.
– xbh
1 hour ago
$|f(x) pm g(x) | le |f(x)| + |g(x)|$ for all $f,g,x$ so the sum and difference of bounded functions is bounded.
– Henno Brandsma
1 hour ago
$|f(x) pm g(x) | le |f(x)| + |g(x)|$ for all $f,g,x$ so the sum and difference of bounded functions is bounded.
– Henno Brandsma
1 hour ago
add a comment |
2 Answers
2
active
oldest
votes
up vote
5
down vote
The sum of bounded functions is bounded and so are scalar multiples. Note that $f= frac{h_1 + h_2}{2}$.
Likewise for differences of bounded functions and $g = frac{h_2 - h_1}{2}$.
add a comment |
up vote
1
down vote
Suppose $h_1, h_2$ are bounded. Let $D(f)$ denote the domain of $f$, where $f$ is a function. Then $exists M_1, M_2$ such that $$h_1(x) = f(x) - g(x) leq M_1 forall x in D(h_1), $$ $$h_2(x) = f(x) + g(x) leq M_2 forall x in D(h_2).$$ So, we have that for arbitrary $x in D(f) cap D(g)$, $$ f(x) - g(x) + f(x) + g(x) = 2f(x) leq M_1 + M_2 implies f(x) leq frac{M_1 + M_2}{2}, $$
so $f$ is bounded, by definition. Similarly, notice that
$$ g(x) - f(x) + g(x) + f(x) = 2g(x) leq M_2 - M_1 implies g(x) leq frac{M_2 - M_1}{2}, $$
so $g$ is bounded, by definition. This completes the proof.
1
Maybe it should be $xin D(h_1)cap D(h_2)$?
– Shubham Johri
23 mins ago
Ah, you are right; good catch! I've edited my answer to include this.
– alexsieusahai
19 mins ago
add a comment |
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',
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%2f3044784%2fproving-that-2-functions-are-bounded%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
up vote
5
down vote
The sum of bounded functions is bounded and so are scalar multiples. Note that $f= frac{h_1 + h_2}{2}$.
Likewise for differences of bounded functions and $g = frac{h_2 - h_1}{2}$.
add a comment |
up vote
5
down vote
The sum of bounded functions is bounded and so are scalar multiples. Note that $f= frac{h_1 + h_2}{2}$.
Likewise for differences of bounded functions and $g = frac{h_2 - h_1}{2}$.
add a comment |
up vote
5
down vote
up vote
5
down vote
The sum of bounded functions is bounded and so are scalar multiples. Note that $f= frac{h_1 + h_2}{2}$.
Likewise for differences of bounded functions and $g = frac{h_2 - h_1}{2}$.
The sum of bounded functions is bounded and so are scalar multiples. Note that $f= frac{h_1 + h_2}{2}$.
Likewise for differences of bounded functions and $g = frac{h_2 - h_1}{2}$.
answered 1 hour ago
Henno Brandsma
103k346113
103k346113
add a comment |
add a comment |
up vote
1
down vote
Suppose $h_1, h_2$ are bounded. Let $D(f)$ denote the domain of $f$, where $f$ is a function. Then $exists M_1, M_2$ such that $$h_1(x) = f(x) - g(x) leq M_1 forall x in D(h_1), $$ $$h_2(x) = f(x) + g(x) leq M_2 forall x in D(h_2).$$ So, we have that for arbitrary $x in D(f) cap D(g)$, $$ f(x) - g(x) + f(x) + g(x) = 2f(x) leq M_1 + M_2 implies f(x) leq frac{M_1 + M_2}{2}, $$
so $f$ is bounded, by definition. Similarly, notice that
$$ g(x) - f(x) + g(x) + f(x) = 2g(x) leq M_2 - M_1 implies g(x) leq frac{M_2 - M_1}{2}, $$
so $g$ is bounded, by definition. This completes the proof.
1
Maybe it should be $xin D(h_1)cap D(h_2)$?
– Shubham Johri
23 mins ago
Ah, you are right; good catch! I've edited my answer to include this.
– alexsieusahai
19 mins ago
add a comment |
up vote
1
down vote
Suppose $h_1, h_2$ are bounded. Let $D(f)$ denote the domain of $f$, where $f$ is a function. Then $exists M_1, M_2$ such that $$h_1(x) = f(x) - g(x) leq M_1 forall x in D(h_1), $$ $$h_2(x) = f(x) + g(x) leq M_2 forall x in D(h_2).$$ So, we have that for arbitrary $x in D(f) cap D(g)$, $$ f(x) - g(x) + f(x) + g(x) = 2f(x) leq M_1 + M_2 implies f(x) leq frac{M_1 + M_2}{2}, $$
so $f$ is bounded, by definition. Similarly, notice that
$$ g(x) - f(x) + g(x) + f(x) = 2g(x) leq M_2 - M_1 implies g(x) leq frac{M_2 - M_1}{2}, $$
so $g$ is bounded, by definition. This completes the proof.
1
Maybe it should be $xin D(h_1)cap D(h_2)$?
– Shubham Johri
23 mins ago
Ah, you are right; good catch! I've edited my answer to include this.
– alexsieusahai
19 mins ago
add a comment |
up vote
1
down vote
up vote
1
down vote
Suppose $h_1, h_2$ are bounded. Let $D(f)$ denote the domain of $f$, where $f$ is a function. Then $exists M_1, M_2$ such that $$h_1(x) = f(x) - g(x) leq M_1 forall x in D(h_1), $$ $$h_2(x) = f(x) + g(x) leq M_2 forall x in D(h_2).$$ So, we have that for arbitrary $x in D(f) cap D(g)$, $$ f(x) - g(x) + f(x) + g(x) = 2f(x) leq M_1 + M_2 implies f(x) leq frac{M_1 + M_2}{2}, $$
so $f$ is bounded, by definition. Similarly, notice that
$$ g(x) - f(x) + g(x) + f(x) = 2g(x) leq M_2 - M_1 implies g(x) leq frac{M_2 - M_1}{2}, $$
so $g$ is bounded, by definition. This completes the proof.
Suppose $h_1, h_2$ are bounded. Let $D(f)$ denote the domain of $f$, where $f$ is a function. Then $exists M_1, M_2$ such that $$h_1(x) = f(x) - g(x) leq M_1 forall x in D(h_1), $$ $$h_2(x) = f(x) + g(x) leq M_2 forall x in D(h_2).$$ So, we have that for arbitrary $x in D(f) cap D(g)$, $$ f(x) - g(x) + f(x) + g(x) = 2f(x) leq M_1 + M_2 implies f(x) leq frac{M_1 + M_2}{2}, $$
so $f$ is bounded, by definition. Similarly, notice that
$$ g(x) - f(x) + g(x) + f(x) = 2g(x) leq M_2 - M_1 implies g(x) leq frac{M_2 - M_1}{2}, $$
so $g$ is bounded, by definition. This completes the proof.
edited 18 mins ago
answered 40 mins ago
alexsieusahai
636
636
1
Maybe it should be $xin D(h_1)cap D(h_2)$?
– Shubham Johri
23 mins ago
Ah, you are right; good catch! I've edited my answer to include this.
– alexsieusahai
19 mins ago
add a comment |
1
Maybe it should be $xin D(h_1)cap D(h_2)$?
– Shubham Johri
23 mins ago
Ah, you are right; good catch! I've edited my answer to include this.
– alexsieusahai
19 mins ago
1
1
Maybe it should be $xin D(h_1)cap D(h_2)$?
– Shubham Johri
23 mins ago
Maybe it should be $xin D(h_1)cap D(h_2)$?
– Shubham Johri
23 mins ago
Ah, you are right; good catch! I've edited my answer to include this.
– alexsieusahai
19 mins ago
Ah, you are right; good catch! I've edited my answer to include this.
– alexsieusahai
19 mins ago
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%2f3044784%2fproving-that-2-functions-are-bounded%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
1
Express $f,g $ in the form of $h_2, h_1$.
– xbh
1 hour ago
$|f(x) pm g(x) | le |f(x)| + |g(x)|$ for all $f,g,x$ so the sum and difference of bounded functions is bounded.
– Henno Brandsma
1 hour ago