Mixing
Determine all functions $f(x)$ such that $f(f(x+y))=f(x)+f(y)$
$begingroup$
The question is from here:
Find all continuous functions $f:mathbb Rto mathbb R$ such that for any real $x$ and $y$,
$$f(f(x+y))=f(x)+f(y).$$
I'm totally new to functional equations so please correct me if I make a mistake.
I try plugging in simple functions and I find that $f(x)=0$ and $f(x)=x+c$ for some $c in mathbb R$ works.
Then I believe the next step is to derive $f(x)=x+c$ as a solution.
Let $y=0$. Then we have
begin{align}
f(f(x))=f(x)+f(0)
end{align}
Then we can make the substitution $u=f(x)$, which produces
$$f(u)=u+c$$
since $f(0)$ is just a constant.
Hence the solutions are $f(x)=0$ and $f(x)=x+c$ for some $c in mathbb R$. $Box$
Is this a valid answer? As some of you may know the AMO is happening in a few days and I would appreciate any help in improving the quality of my answers.
contest-math functional-equations
asked Feb 3 at 5:49
LandurosLanduros
1,8871620
$endgroup$
add a comment |
$begingroup$
The question is from here:
Find all continuous functions $f:mathbb Rto mathbb R$ such that for any real $x$ and $y$,
$$f(f(x+y))=f(x)+f(y).$$
I'm totally new to functional equations so please correct me if I make a mistake.
I try plugging in simple functions and I find that $f(x)=0$ and $f(x)=x+c$ for some $c in mathbb R$ works.
Then I believe the next step is to derive $f(x)=x+c$ as a solution.
Let $y=0$. Then we have
begin{align}
f(f(x))=f(x)+f(0)
end{align}
Then we can make the substitution $u=f(x)$, which produces
$$f(u)=u+c$$
since $f(0)$ is just a constant.
Hence the solutions are $f(x)=0$ and $f(x)=x+c$ for some $c in mathbb R$. $Box$
Is this a valid answer? As some of you may know the AMO is happening in a few days and I would appreciate any help in improving the quality of my answers.
contest-math functional-equations
asked Feb 3 at 5:49
LandurosLanduros
1,8871620
$endgroup$
$begingroup$
You've found a particular solution and a family of solutions. What you haven't found is a proof that these are all possible solutions. How do you know there aren't some other simple (or not so simple) substitutions you could make to wring out some other solutions?
$endgroup$
– Theo Bendit
Feb 3 at 5:56
$begingroup$
Also, is this part of an on-going contest? It is our policy to only help with contests that have ended, and a link to the question is required for proof.
$endgroup$
– Theo Bendit
Feb 3 at 5:59
$begingroup$
@TheoBendit No, this is from a few years back.
$endgroup$
– Landuros
Feb 3 at 6:03
1
$begingroup$
@D.B. $f(x)+f(y)=x+y+2c$.
$endgroup$
– Lord Shark the Unknown
Feb 3 at 6:04
add a comment |
$begingroup$
The question is from here:
Find all continuous functions $f:mathbb Rto mathbb R$ such that for any real $x$ and $y$,
$$f(f(x+y))=f(x)+f(y).$$
I'm totally new to functional equations so please correct me if I make a mistake.
I try plugging in simple functions and I find that $f(x)=0$ and $f(x)=x+c$ for some $c in mathbb R$ works.
Then I believe the next step is to derive $f(x)=x+c$ as a solution.
Let $y=0$. Then we have
begin{align}
f(f(x))=f(x)+f(0)
end{align}
Then we can make the substitution $u=f(x)$, which produces
$$f(u)=u+c$$
since $f(0)$ is just a constant.
Hence the solutions are $f(x)=0$ and $f(x)=x+c$ for some $c in mathbb R$. $Box$
Is this a valid answer? As some of you may know the AMO is happening in a few days and I would appreciate any help in improving the quality of my answers.
contest-math functional-equations
asked Feb 3 at 5:49
LandurosLanduros
1,8871620
$endgroup$
The question is from here:
Find all continuous functions $f:mathbb Rto mathbb R$ such that for any real $x$ and $y$,
$$f(f(x+y))=f(x)+f(y).$$
I'm totally new to functional equations so please correct me if I make a mistake.
I try plugging in simple functions and I find that $f(x)=0$ and $f(x)=x+c$ for some $c in mathbb R$ works.
Then I believe the next step is to derive $f(x)=x+c$ as a solution.
Let $y=0$. Then we have
begin{align}
f(f(x))=f(x)+f(0)
end{align}
Then we can make the substitution $u=f(x)$, which produces
$$f(u)=u+c$$
since $f(0)$ is just a constant.
Hence the solutions are $f(x)=0$ and $f(x)=x+c$ for some $c in mathbb R$. $Box$
Is this a valid answer? As some of you may know the AMO is happening in a few days and I would appreciate any help in improving the quality of my answers.
contest-math functional-equations
contest-math functional-equations
asked Feb 3 at 5:49
LandurosLanduros
1,8871620
asked Feb 3 at 5:49
LandurosLanduros
1,8871620
edited Feb 3 at 6:06
Landuros
asked Feb 3 at 5:49
LandurosLanduros
1,8871620
asked Feb 3 at 5:49
LandurosLanduros
1,8871620
asked Feb 3 at 5:49
LandurosLanduros
1,8871620
1,8871620
$begingroup$
You've found a particular solution and a family of solutions. What you haven't found is a proof that these are all possible solutions. How do you know there aren't some other simple (or not so simple) substitutions you could make to wring out some other solutions?
$endgroup$
– Theo Bendit
Feb 3 at 5:56
$begingroup$
Also, is this part of an on-going contest? It is our policy to only help with contests that have ended, and a link to the question is required for proof.
$endgroup$
– Theo Bendit
Feb 3 at 5:59
$begingroup$
@TheoBendit No, this is from a few years back.
$endgroup$
– Landuros
Feb 3 at 6:03
1
$begingroup$
@D.B. $f(x)+f(y)=x+y+2c$.
$endgroup$
– Lord Shark the Unknown
Feb 3 at 6:04
add a comment |
$begingroup$
You've found a particular solution and a family of solutions. What you haven't found is a proof that these are all possible solutions. How do you know there aren't some other simple (or not so simple) substitutions you could make to wring out some other solutions?
$endgroup$
– Theo Bendit
Feb 3 at 5:56
$begingroup$
Also, is this part of an on-going contest? It is our policy to only help with contests that have ended, and a link to the question is required for proof.
$endgroup$
– Theo Bendit
Feb 3 at 5:59
$begingroup$
@TheoBendit No, this is from a few years back.
$endgroup$
– Landuros
Feb 3 at 6:03
1
$begingroup$
@D.B. $f(x)+f(y)=x+y+2c$.
$endgroup$
– Lord Shark the Unknown
Feb 3 at 6:04
$begingroup$
You've found a particular solution and a family of solutions. What you haven't found is a proof that these are all possible solutions. How do you know there aren't some other simple (or not so simple) substitutions you could make to wring out some other solutions?
$endgroup$
– Theo Bendit
Feb 3 at 5:56
$begingroup$
You've found a particular solution and a family of solutions. What you haven't found is a proof that these are all possible solutions. How do you know there aren't some other simple (or not so simple) substitutions you could make to wring out some other solutions?
$endgroup$
– Theo Bendit
Feb 3 at 5:56
$begingroup$
Also, is this part of an on-going contest? It is our policy to only help with contests that have ended, and a link to the question is required for proof.
$endgroup$
– Theo Bendit
Feb 3 at 5:59
$begingroup$
Also, is this part of an on-going contest? It is our policy to only help with contests that have ended, and a link to the question is required for proof.
$endgroup$
– Theo Bendit
Feb 3 at 5:59
$begingroup$
@TheoBendit No, this is from a few years back.
$endgroup$
– Landuros
Feb 3 at 6:03
$begingroup$
@TheoBendit No, this is from a few years back.
$endgroup$
– Landuros
Feb 3 at 6:03
1
1
$begingroup$
@D.B. $f(x)+f(y)=x+y+2c$.
$endgroup$
– Lord Shark the Unknown
Feb 3 at 6:04
$begingroup$
@D.B. $f(x)+f(y)=x+y+2c$.
$endgroup$
– Lord Shark the Unknown
Feb 3 at 6:04
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
This is not correct. You can not let $u=f(x)$ since you haven't prove that $f(x)$ is surjective.
Here is a hint: use $f(f(x))=f(x)+f(0)$ to change the LHS or the original functional equation so you have $f(x+y)+f(0)=f(x)+f(y)$. This really looks like Cauchy's functional equation. Can you keep going?
answered Feb 3 at 6:01
abc...abc...
3,242739
$endgroup$
add a comment |
$begingroup$
All such functions are of the form $$f(x) = lambda x + c , xin Bbb R$$ where $c = f(0), lambda = f(1)-f(0)$ and where either $lambda = c = 0$ or $lambda = 1$. So either $$f(x) = 0, text {for all} x in Bbb R$$ or $$f(x) = x + c, text {for all} x in Bbb R.$$
EDIT $:$
First observe that $$f(x+y) + f(0) = f(x) + f(y), text {for all} x,y in Bbb R .$$ Now observe that for any $n in Bbb N$ $$f(n) = lambda + f(n-1).$$ By recurrence it is not hard to see that for all $n in Bbb N,$ $f(n) = lambda n + c,$ where $c = f(0)$ and $lambda = f(1) - f(0).$ Now extend $f$ over $Bbb Z$ by using the fact that $f(x) + f(-x) = 2c$ for all $x in Bbb R$. Extending $f$ over rationals and irrationals is also not very tough. Extending over irrationals from rationals follows from two facts. One is density of rationals and the other is sequential criterion for continuous functions. So we have proved that $$f(x) = lambda x + c, text {for all} x in Bbb R.$$ Now again using the given functional equation and putting the values of $f(x)$ there we get
$$(lambda - 1) (lambda(x+y) + c) = 0, text {for all} x,y in Bbb R.$$ So either $lambda = 1$ or $lambda (x + y) + c = 0,$ for all $x,y in Bbb R$. For the later case if $lambda neq 0$ then it yields a contradiction because otherwise we have for all $x,y in Bbb R,$ $x+y = -frac {c} {lambda},$ which is obviously false. Hence for the later case we should have $lambda = 0$. But that implies $c=0$. So either $lambda = c =0$ or $lambda = 1$.
This completes the proof.
Is it ok now @abc...?
answered Feb 3 at 6:35
Dbchatto67Dbchatto67
3,187625
$endgroup$
$begingroup$
And what's your reasoning?
$endgroup$
– abc...
Feb 3 at 7:06
$begingroup$
Well I will update it soon.
$endgroup$
– Dbchatto67
Feb 3 at 7:08
$begingroup$
This is a brilliant proof. Just saying you might want to show explicitly how to extend from rationals to the irrationals. "It's not very touch" but it doesn't seem too trivial to me.
$endgroup$
– abc...
Feb 3 at 9:35
$begingroup$
@abc... Consider a irrational number $alpha$. By density of rationals in the reals you would easily find a sequence of rationals converging to $alpha$. If you are not aware with this fact simply take the sequence $left {frac {[{n alpha}]} {n} right }$ of rationals converging to the irrational $alpha$. Since $f$ is continuous by using sequential criterion for continuous functions it follows that the sequence ${f(alpha_n) }$ converges to $f(alpha),$ where $alpha_n = frac {[{n alpha}]} {n},$ for all $n in Bbb N$. Can you now fill in the gaps @abc...?
$endgroup$
– Dbchatto67
Feb 3 at 12:06
$begingroup$
Where $[x]$ the greatest integer not exceeding $x$.
$endgroup$
– Dbchatto67
Feb 3 at 12:21
|
show 2 more comments
Your Answer
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%2f3098231%2fdetermine-all-functions-fx-such-that-ffxy-fxfy%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
$begingroup$
This is not correct. You can not let $u=f(x)$ since you haven't prove that $f(x)$ is surjective.
Here is a hint: use $f(f(x))=f(x)+f(0)$ to change the LHS or the original functional equation so you have $f(x+y)+f(0)=f(x)+f(y)$. This really looks like Cauchy's functional equation. Can you keep going?
answered Feb 3 at 6:01
abc...abc...
3,242739
$endgroup$
add a comment |
$begingroup$
This is not correct. You can not let $u=f(x)$ since you haven't prove that $f(x)$ is surjective.
Here is a hint: use $f(f(x))=f(x)+f(0)$ to change the LHS or the original functional equation so you have $f(x+y)+f(0)=f(x)+f(y)$. This really looks like Cauchy's functional equation. Can you keep going?
answered Feb 3 at 6:01
abc...abc...
3,242739
$endgroup$
add a comment |
$begingroup$
This is not correct. You can not let $u=f(x)$ since you haven't prove that $f(x)$ is surjective.
Here is a hint: use $f(f(x))=f(x)+f(0)$ to change the LHS or the original functional equation so you have $f(x+y)+f(0)=f(x)+f(y)$. This really looks like Cauchy's functional equation. Can you keep going?
answered Feb 3 at 6:01
abc...abc...
3,242739
$endgroup$
This is not correct. You can not let $u=f(x)$ since you haven't prove that $f(x)$ is surjective.
Here is a hint: use $f(f(x))=f(x)+f(0)$ to change the LHS or the original functional equation so you have $f(x+y)+f(0)=f(x)+f(y)$. This really looks like Cauchy's functional equation. Can you keep going?
answered Feb 3 at 6:01
abc...abc...
3,242739
answered Feb 3 at 6:01
abc...abc...
3,242739
answered Feb 3 at 6:01
abc...abc...
3,242739
answered Feb 3 at 6:01
abc...abc...
3,242739
3,242739
add a comment |
add a comment |
$begingroup$
All such functions are of the form $$f(x) = lambda x + c , xin Bbb R$$ where $c = f(0), lambda = f(1)-f(0)$ and where either $lambda = c = 0$ or $lambda = 1$. So either $$f(x) = 0, text {for all} x in Bbb R$$ or $$f(x) = x + c, text {for all} x in Bbb R.$$
EDIT $:$
First observe that $$f(x+y) + f(0) = f(x) + f(y), text {for all} x,y in Bbb R .$$ Now observe that for any $n in Bbb N$ $$f(n) = lambda + f(n-1).$$ By recurrence it is not hard to see that for all $n in Bbb N,$ $f(n) = lambda n + c,$ where $c = f(0)$ and $lambda = f(1) - f(0).$ Now extend $f$ over $Bbb Z$ by using the fact that $f(x) + f(-x) = 2c$ for all $x in Bbb R$. Extending $f$ over rationals and irrationals is also not very tough. Extending over irrationals from rationals follows from two facts. One is density of rationals and the other is sequential criterion for continuous functions. So we have proved that $$f(x) = lambda x + c, text {for all} x in Bbb R.$$ Now again using the given functional equation and putting the values of $f(x)$ there we get
$$(lambda - 1) (lambda(x+y) + c) = 0, text {for all} x,y in Bbb R.$$ So either $lambda = 1$ or $lambda (x + y) + c = 0,$ for all $x,y in Bbb R$. For the later case if $lambda neq 0$ then it yields a contradiction because otherwise we have for all $x,y in Bbb R,$ $x+y = -frac {c} {lambda},$ which is obviously false. Hence for the later case we should have $lambda = 0$. But that implies $c=0$. So either $lambda = c =0$ or $lambda = 1$.
This completes the proof.
Is it ok now @abc...?
answered Feb 3 at 6:35
Dbchatto67Dbchatto67
3,187625
$endgroup$
$begingroup$
And what's your reasoning?
$endgroup$
– abc...
Feb 3 at 7:06
$begingroup$
Well I will update it soon.
$endgroup$
– Dbchatto67
Feb 3 at 7:08
$begingroup$
This is a brilliant proof. Just saying you might want to show explicitly how to extend from rationals to the irrationals. "It's not very touch" but it doesn't seem too trivial to me.
$endgroup$
– abc...
Feb 3 at 9:35
$begingroup$
@abc... Consider a irrational number $alpha$. By density of rationals in the reals you would easily find a sequence of rationals converging to $alpha$. If you are not aware with this fact simply take the sequence $left {frac {[{n alpha}]} {n} right }$ of rationals converging to the irrational $alpha$. Since $f$ is continuous by using sequential criterion for continuous functions it follows that the sequence ${f(alpha_n) }$ converges to $f(alpha),$ where $alpha_n = frac {[{n alpha}]} {n},$ for all $n in Bbb N$. Can you now fill in the gaps @abc...?
$endgroup$
– Dbchatto67
Feb 3 at 12:06
$begingroup$
Where $[x]$ the greatest integer not exceeding $x$.
$endgroup$
– Dbchatto67
Feb 3 at 12:21
|
show 2 more comments
$begingroup$
All such functions are of the form $$f(x) = lambda x + c , xin Bbb R$$ where $c = f(0), lambda = f(1)-f(0)$ and where either $lambda = c = 0$ or $lambda = 1$. So either $$f(x) = 0, text {for all} x in Bbb R$$ or $$f(x) = x + c, text {for all} x in Bbb R.$$
EDIT $:$
First observe that $$f(x+y) + f(0) = f(x) + f(y), text {for all} x,y in Bbb R .$$ Now observe that for any $n in Bbb N$ $$f(n) = lambda + f(n-1).$$ By recurrence it is not hard to see that for all $n in Bbb N,$ $f(n) = lambda n + c,$ where $c = f(0)$ and $lambda = f(1) - f(0).$ Now extend $f$ over $Bbb Z$ by using the fact that $f(x) + f(-x) = 2c$ for all $x in Bbb R$. Extending $f$ over rationals and irrationals is also not very tough. Extending over irrationals from rationals follows from two facts. One is density of rationals and the other is sequential criterion for continuous functions. So we have proved that $$f(x) = lambda x + c, text {for all} x in Bbb R.$$ Now again using the given functional equation and putting the values of $f(x)$ there we get
$$(lambda - 1) (lambda(x+y) + c) = 0, text {for all} x,y in Bbb R.$$ So either $lambda = 1$ or $lambda (x + y) + c = 0,$ for all $x,y in Bbb R$. For the later case if $lambda neq 0$ then it yields a contradiction because otherwise we have for all $x,y in Bbb R,$ $x+y = -frac {c} {lambda},$ which is obviously false. Hence for the later case we should have $lambda = 0$. But that implies $c=0$. So either $lambda = c =0$ or $lambda = 1$.
This completes the proof.
Is it ok now @abc...?
answered Feb 3 at 6:35
Dbchatto67Dbchatto67
3,187625
$endgroup$
$begingroup$
And what's your reasoning?
$endgroup$
– abc...
Feb 3 at 7:06
$begingroup$
Well I will update it soon.
$endgroup$
– Dbchatto67
Feb 3 at 7:08
$begingroup$
This is a brilliant proof. Just saying you might want to show explicitly how to extend from rationals to the irrationals. "It's not very touch" but it doesn't seem too trivial to me.
$endgroup$
– abc...
Feb 3 at 9:35
$begingroup$
@abc... Consider a irrational number $alpha$. By density of rationals in the reals you would easily find a sequence of rationals converging to $alpha$. If you are not aware with this fact simply take the sequence $left {frac {[{n alpha}]} {n} right }$ of rationals converging to the irrational $alpha$. Since $f$ is continuous by using sequential criterion for continuous functions it follows that the sequence ${f(alpha_n) }$ converges to $f(alpha),$ where $alpha_n = frac {[{n alpha}]} {n},$ for all $n in Bbb N$. Can you now fill in the gaps @abc...?
$endgroup$
– Dbchatto67
Feb 3 at 12:06
$begingroup$
Where $[x]$ the greatest integer not exceeding $x$.
$endgroup$
– Dbchatto67
Feb 3 at 12:21
|
show 2 more comments
$begingroup$
All such functions are of the form $$f(x) = lambda x + c , xin Bbb R$$ where $c = f(0), lambda = f(1)-f(0)$ and where either $lambda = c = 0$ or $lambda = 1$. So either $$f(x) = 0, text {for all} x in Bbb R$$ or $$f(x) = x + c, text {for all} x in Bbb R.$$
EDIT $:$
First observe that $$f(x+y) + f(0) = f(x) + f(y), text {for all} x,y in Bbb R .$$ Now observe that for any $n in Bbb N$ $$f(n) = lambda + f(n-1).$$ By recurrence it is not hard to see that for all $n in Bbb N,$ $f(n) = lambda n + c,$ where $c = f(0)$ and $lambda = f(1) - f(0).$ Now extend $f$ over $Bbb Z$ by using the fact that $f(x) + f(-x) = 2c$ for all $x in Bbb R$. Extending $f$ over rationals and irrationals is also not very tough. Extending over irrationals from rationals follows from two facts. One is density of rationals and the other is sequential criterion for continuous functions. So we have proved that $$f(x) = lambda x + c, text {for all} x in Bbb R.$$ Now again using the given functional equation and putting the values of $f(x)$ there we get
$$(lambda - 1) (lambda(x+y) + c) = 0, text {for all} x,y in Bbb R.$$ So either $lambda = 1$ or $lambda (x + y) + c = 0,$ for all $x,y in Bbb R$. For the later case if $lambda neq 0$ then it yields a contradiction because otherwise we have for all $x,y in Bbb R,$ $x+y = -frac {c} {lambda},$ which is obviously false. Hence for the later case we should have $lambda = 0$. But that implies $c=0$. So either $lambda = c =0$ or $lambda = 1$.
This completes the proof.
Is it ok now @abc...?
answered Feb 3 at 6:35
Dbchatto67Dbchatto67
3,187625
$endgroup$
All such functions are of the form $$f(x) = lambda x + c , xin Bbb R$$ where $c = f(0), lambda = f(1)-f(0)$ and where either $lambda = c = 0$ or $lambda = 1$. So either $$f(x) = 0, text {for all} x in Bbb R$$ or $$f(x) = x + c, text {for all} x in Bbb R.$$
EDIT $:$
First observe that $$f(x+y) + f(0) = f(x) + f(y), text {for all} x,y in Bbb R .$$ Now observe that for any $n in Bbb N$ $$f(n) = lambda + f(n-1).$$ By recurrence it is not hard to see that for all $n in Bbb N,$ $f(n) = lambda n + c,$ where $c = f(0)$ and $lambda = f(1) - f(0).$ Now extend $f$ over $Bbb Z$ by using the fact that $f(x) + f(-x) = 2c$ for all $x in Bbb R$. Extending $f$ over rationals and irrationals is also not very tough. Extending over irrationals from rationals follows from two facts. One is density of rationals and the other is sequential criterion for continuous functions. So we have proved that $$f(x) = lambda x + c, text {for all} x in Bbb R.$$ Now again using the given functional equation and putting the values of $f(x)$ there we get
$$(lambda - 1) (lambda(x+y) + c) = 0, text {for all} x,y in Bbb R.$$ So either $lambda = 1$ or $lambda (x + y) + c = 0,$ for all $x,y in Bbb R$. For the later case if $lambda neq 0$ then it yields a contradiction because otherwise we have for all $x,y in Bbb R,$ $x+y = -frac {c} {lambda},$ which is obviously false. Hence for the later case we should have $lambda = 0$. But that implies $c=0$. So either $lambda = c =0$ or $lambda = 1$.
This completes the proof.
Is it ok now @abc...?
answered Feb 3 at 6:35
Dbchatto67Dbchatto67
3,187625
edited Feb 3 at 8:54
answered Feb 3 at 6:35
Dbchatto67Dbchatto67
3,187625
answered Feb 3 at 6:35
Dbchatto67Dbchatto67
3,187625
answered Feb 3 at 6:35
Dbchatto67Dbchatto67
3,187625
3,187625
$begingroup$
And what's your reasoning?
$endgroup$
– abc...
Feb 3 at 7:06
$begingroup$
Well I will update it soon.
$endgroup$
– Dbchatto67
Feb 3 at 7:08
$begingroup$
This is a brilliant proof. Just saying you might want to show explicitly how to extend from rationals to the irrationals. "It's not very touch" but it doesn't seem too trivial to me.
$endgroup$
– abc...
Feb 3 at 9:35
$begingroup$
@abc... Consider a irrational number $alpha$. By density of rationals in the reals you would easily find a sequence of rationals converging to $alpha$. If you are not aware with this fact simply take the sequence $left {frac {[{n alpha}]} {n} right }$ of rationals converging to the irrational $alpha$. Since $f$ is continuous by using sequential criterion for continuous functions it follows that the sequence ${f(alpha_n) }$ converges to $f(alpha),$ where $alpha_n = frac {[{n alpha}]} {n},$ for all $n in Bbb N$. Can you now fill in the gaps @abc...?
$endgroup$
– Dbchatto67
Feb 3 at 12:06
$begingroup$
Where $[x]$ the greatest integer not exceeding $x$.
$endgroup$
– Dbchatto67
Feb 3 at 12:21
|
show 2 more comments
$begingroup$
And what's your reasoning?
$endgroup$
– abc...
Feb 3 at 7:06
$begingroup$
Well I will update it soon.
$endgroup$
– Dbchatto67
Feb 3 at 7:08
$begingroup$
This is a brilliant proof. Just saying you might want to show explicitly how to extend from rationals to the irrationals. "It's not very touch" but it doesn't seem too trivial to me.
$endgroup$
– abc...
Feb 3 at 9:35
$begingroup$
@abc... Consider a irrational number $alpha$. By density of rationals in the reals you would easily find a sequence of rationals converging to $alpha$. If you are not aware with this fact simply take the sequence $left {frac {[{n alpha}]} {n} right }$ of rationals converging to the irrational $alpha$. Since $f$ is continuous by using sequential criterion for continuous functions it follows that the sequence ${f(alpha_n) }$ converges to $f(alpha),$ where $alpha_n = frac {[{n alpha}]} {n},$ for all $n in Bbb N$. Can you now fill in the gaps @abc...?
$endgroup$
– Dbchatto67
Feb 3 at 12:06
$begingroup$
Where $[x]$ the greatest integer not exceeding $x$.
$endgroup$
– Dbchatto67
Feb 3 at 12:21
$begingroup$
And what's your reasoning?
$endgroup$
– abc...
Feb 3 at 7:06
$begingroup$
And what's your reasoning?
$endgroup$
– abc...
Feb 3 at 7:06
$begingroup$
Well I will update it soon.
$endgroup$
– Dbchatto67
Feb 3 at 7:08
$begingroup$
Well I will update it soon.
$endgroup$
– Dbchatto67
Feb 3 at 7:08
$begingroup$
This is a brilliant proof. Just saying you might want to show explicitly how to extend from rationals to the irrationals. "It's not very touch" but it doesn't seem too trivial to me.
$endgroup$
– abc...
Feb 3 at 9:35
$begingroup$
This is a brilliant proof. Just saying you might want to show explicitly how to extend from rationals to the irrationals. "It's not very touch" but it doesn't seem too trivial to me.
$endgroup$
– abc...
Feb 3 at 9:35
$begingroup$
@abc... Consider a irrational number $alpha$. By density of rationals in the reals you would easily find a sequence of rationals converging to $alpha$. If you are not aware with this fact simply take the sequence $left {frac {[{n alpha}]} {n} right }$ of rationals converging to the irrational $alpha$. Since $f$ is continuous by using sequential criterion for continuous functions it follows that the sequence ${f(alpha_n) }$ converges to $f(alpha),$ where $alpha_n = frac {[{n alpha}]} {n},$ for all $n in Bbb N$. Can you now fill in the gaps @abc...?
$endgroup$
– Dbchatto67
Feb 3 at 12:06
$begingroup$
@abc... Consider a irrational number $alpha$. By density of rationals in the reals you would easily find a sequence of rationals converging to $alpha$. If you are not aware with this fact simply take the sequence $left {frac {[{n alpha}]} {n} right }$ of rationals converging to the irrational $alpha$. Since $f$ is continuous by using sequential criterion for continuous functions it follows that the sequence ${f(alpha_n) }$ converges to $f(alpha),$ where $alpha_n = frac {[{n alpha}]} {n},$ for all $n in Bbb N$. Can you now fill in the gaps @abc...?
$endgroup$
– Dbchatto67
Feb 3 at 12:06
$begingroup$
Where $[x]$ the greatest integer not exceeding $x$.
$endgroup$
– Dbchatto67
Feb 3 at 12:21
$begingroup$
Where $[x]$ the greatest integer not exceeding $x$.
$endgroup$
– Dbchatto67
Feb 3 at 12:21
|
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.
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%2f3098231%2fdetermine-all-functions-fx-such-that-ffxy-fxfy%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
$begingroup$
You've found a particular solution and a family of solutions. What you haven't found is a proof that these are all possible solutions. How do you know there aren't some other simple (or not so simple) substitutions you could make to wring out some other solutions?
$endgroup$
– Theo Bendit
Feb 3 at 5:56
$begingroup$
Also, is this part of an on-going contest? It is our policy to only help with contests that have ended, and a link to the question is required for proof.
$endgroup$
– Theo Bendit
Feb 3 at 5:59
$begingroup$
@TheoBendit No, this is from a few years back.
$endgroup$
– Landuros
Feb 3 at 6:03
1
$begingroup$
@D.B. $f(x)+f(y)=x+y+2c$.
$endgroup$
– Lord Shark the Unknown
Feb 3 at 6:04