Are we allowed, by the definition of induction, to assume that $f_{1}(x)$ still has the same formula, even...











up vote
0
down vote

favorite
1












I'm pretty sure i'm supposed to demonstate this by induction but i think there is a problem with the way the proposition is stated that impossibilitates that, I need to prove that



For all natural number $n$, $f_{0}(x) = frac{x}{x+1} & f_{n+1}(x)=(f_{0}(f_{n}(x))) implies f_{n}(x) = frac{x}{(n+1)x + 1}$



So if we first verify it for n=0 then the explicit formula for $f_{n}$ is given. But then, if we try to verify it for any other $n$, let's say $n=1$, we would have the formula for $f_{0}(x)$ as always, and we would also have that $f_{2}(x) = f_{0}(f_{1}(x))$ but how is that suppose to lead us to conclude the explicit formula for $f_{1}$ if we don't know what $f_{2}(x)$ looks like?



Did I get induction wrong?










share|cite|improve this question




















  • 1




    Note that $f_1(x) = f_0(f_0(x))$.
    – Fabio Somenzi
    Nov 18 at 11:14










  • Yes but only when n = 0 right? How can that still hold if we consider other values of n?
    – ArielK
    Nov 18 at 11:15








  • 1




    Yes, but that's not a problem. You can verify that $f_1(x) = frac{x}{2x+1}$. That's not the inductive proof, but the inductive step is not much different.
    – Fabio Somenzi
    Nov 18 at 11:19






  • 1




    The induction step is like this: let $f_{n+1}(x) = f_0(f_n(x))$ and suppose $f_n(x)=frac{x}{(n+1)x+1}$. Prove that $f_{n+1}(x) = frac{x}{(n+2)x+1}$. It's a matter of plugging the hypothesis for $f_n(x)$ into the definition of $f_{n+1}(x)$ and simplifying.
    – Fabio Somenzi
    Nov 18 at 11:27






  • 1




    The main problem with this problem is that your $f_0$ should be called $f_1$ to begin with. In this way $f_0$ is the identity, and $f_{m+n}=f^{circ m}circ f^{circ n}$, etcetera.
    – Christian Blatter
    Nov 18 at 11:55















up vote
0
down vote

favorite
1












I'm pretty sure i'm supposed to demonstate this by induction but i think there is a problem with the way the proposition is stated that impossibilitates that, I need to prove that



For all natural number $n$, $f_{0}(x) = frac{x}{x+1} & f_{n+1}(x)=(f_{0}(f_{n}(x))) implies f_{n}(x) = frac{x}{(n+1)x + 1}$



So if we first verify it for n=0 then the explicit formula for $f_{n}$ is given. But then, if we try to verify it for any other $n$, let's say $n=1$, we would have the formula for $f_{0}(x)$ as always, and we would also have that $f_{2}(x) = f_{0}(f_{1}(x))$ but how is that suppose to lead us to conclude the explicit formula for $f_{1}$ if we don't know what $f_{2}(x)$ looks like?



Did I get induction wrong?










share|cite|improve this question




















  • 1




    Note that $f_1(x) = f_0(f_0(x))$.
    – Fabio Somenzi
    Nov 18 at 11:14










  • Yes but only when n = 0 right? How can that still hold if we consider other values of n?
    – ArielK
    Nov 18 at 11:15








  • 1




    Yes, but that's not a problem. You can verify that $f_1(x) = frac{x}{2x+1}$. That's not the inductive proof, but the inductive step is not much different.
    – Fabio Somenzi
    Nov 18 at 11:19






  • 1




    The induction step is like this: let $f_{n+1}(x) = f_0(f_n(x))$ and suppose $f_n(x)=frac{x}{(n+1)x+1}$. Prove that $f_{n+1}(x) = frac{x}{(n+2)x+1}$. It's a matter of plugging the hypothesis for $f_n(x)$ into the definition of $f_{n+1}(x)$ and simplifying.
    – Fabio Somenzi
    Nov 18 at 11:27






  • 1




    The main problem with this problem is that your $f_0$ should be called $f_1$ to begin with. In this way $f_0$ is the identity, and $f_{m+n}=f^{circ m}circ f^{circ n}$, etcetera.
    – Christian Blatter
    Nov 18 at 11:55













up vote
0
down vote

favorite
1









up vote
0
down vote

favorite
1






1





I'm pretty sure i'm supposed to demonstate this by induction but i think there is a problem with the way the proposition is stated that impossibilitates that, I need to prove that



For all natural number $n$, $f_{0}(x) = frac{x}{x+1} & f_{n+1}(x)=(f_{0}(f_{n}(x))) implies f_{n}(x) = frac{x}{(n+1)x + 1}$



So if we first verify it for n=0 then the explicit formula for $f_{n}$ is given. But then, if we try to verify it for any other $n$, let's say $n=1$, we would have the formula for $f_{0}(x)$ as always, and we would also have that $f_{2}(x) = f_{0}(f_{1}(x))$ but how is that suppose to lead us to conclude the explicit formula for $f_{1}$ if we don't know what $f_{2}(x)$ looks like?



Did I get induction wrong?










share|cite|improve this question















I'm pretty sure i'm supposed to demonstate this by induction but i think there is a problem with the way the proposition is stated that impossibilitates that, I need to prove that



For all natural number $n$, $f_{0}(x) = frac{x}{x+1} & f_{n+1}(x)=(f_{0}(f_{n}(x))) implies f_{n}(x) = frac{x}{(n+1)x + 1}$



So if we first verify it for n=0 then the explicit formula for $f_{n}$ is given. But then, if we try to verify it for any other $n$, let's say $n=1$, we would have the formula for $f_{0}(x)$ as always, and we would also have that $f_{2}(x) = f_{0}(f_{1}(x))$ but how is that suppose to lead us to conclude the explicit formula for $f_{1}$ if we don't know what $f_{2}(x)$ looks like?



Did I get induction wrong?







abstract-algebra algebra-precalculus proof-writing induction






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 18 at 11:08

























asked Nov 18 at 10:49









ArielK

195




195








  • 1




    Note that $f_1(x) = f_0(f_0(x))$.
    – Fabio Somenzi
    Nov 18 at 11:14










  • Yes but only when n = 0 right? How can that still hold if we consider other values of n?
    – ArielK
    Nov 18 at 11:15








  • 1




    Yes, but that's not a problem. You can verify that $f_1(x) = frac{x}{2x+1}$. That's not the inductive proof, but the inductive step is not much different.
    – Fabio Somenzi
    Nov 18 at 11:19






  • 1




    The induction step is like this: let $f_{n+1}(x) = f_0(f_n(x))$ and suppose $f_n(x)=frac{x}{(n+1)x+1}$. Prove that $f_{n+1}(x) = frac{x}{(n+2)x+1}$. It's a matter of plugging the hypothesis for $f_n(x)$ into the definition of $f_{n+1}(x)$ and simplifying.
    – Fabio Somenzi
    Nov 18 at 11:27






  • 1




    The main problem with this problem is that your $f_0$ should be called $f_1$ to begin with. In this way $f_0$ is the identity, and $f_{m+n}=f^{circ m}circ f^{circ n}$, etcetera.
    – Christian Blatter
    Nov 18 at 11:55














  • 1




    Note that $f_1(x) = f_0(f_0(x))$.
    – Fabio Somenzi
    Nov 18 at 11:14










  • Yes but only when n = 0 right? How can that still hold if we consider other values of n?
    – ArielK
    Nov 18 at 11:15








  • 1




    Yes, but that's not a problem. You can verify that $f_1(x) = frac{x}{2x+1}$. That's not the inductive proof, but the inductive step is not much different.
    – Fabio Somenzi
    Nov 18 at 11:19






  • 1




    The induction step is like this: let $f_{n+1}(x) = f_0(f_n(x))$ and suppose $f_n(x)=frac{x}{(n+1)x+1}$. Prove that $f_{n+1}(x) = frac{x}{(n+2)x+1}$. It's a matter of plugging the hypothesis for $f_n(x)$ into the definition of $f_{n+1}(x)$ and simplifying.
    – Fabio Somenzi
    Nov 18 at 11:27






  • 1




    The main problem with this problem is that your $f_0$ should be called $f_1$ to begin with. In this way $f_0$ is the identity, and $f_{m+n}=f^{circ m}circ f^{circ n}$, etcetera.
    – Christian Blatter
    Nov 18 at 11:55








1




1




Note that $f_1(x) = f_0(f_0(x))$.
– Fabio Somenzi
Nov 18 at 11:14




Note that $f_1(x) = f_0(f_0(x))$.
– Fabio Somenzi
Nov 18 at 11:14












Yes but only when n = 0 right? How can that still hold if we consider other values of n?
– ArielK
Nov 18 at 11:15






Yes but only when n = 0 right? How can that still hold if we consider other values of n?
– ArielK
Nov 18 at 11:15






1




1




Yes, but that's not a problem. You can verify that $f_1(x) = frac{x}{2x+1}$. That's not the inductive proof, but the inductive step is not much different.
– Fabio Somenzi
Nov 18 at 11:19




Yes, but that's not a problem. You can verify that $f_1(x) = frac{x}{2x+1}$. That's not the inductive proof, but the inductive step is not much different.
– Fabio Somenzi
Nov 18 at 11:19




1




1




The induction step is like this: let $f_{n+1}(x) = f_0(f_n(x))$ and suppose $f_n(x)=frac{x}{(n+1)x+1}$. Prove that $f_{n+1}(x) = frac{x}{(n+2)x+1}$. It's a matter of plugging the hypothesis for $f_n(x)$ into the definition of $f_{n+1}(x)$ and simplifying.
– Fabio Somenzi
Nov 18 at 11:27




The induction step is like this: let $f_{n+1}(x) = f_0(f_n(x))$ and suppose $f_n(x)=frac{x}{(n+1)x+1}$. Prove that $f_{n+1}(x) = frac{x}{(n+2)x+1}$. It's a matter of plugging the hypothesis for $f_n(x)$ into the definition of $f_{n+1}(x)$ and simplifying.
– Fabio Somenzi
Nov 18 at 11:27




1




1




The main problem with this problem is that your $f_0$ should be called $f_1$ to begin with. In this way $f_0$ is the identity, and $f_{m+n}=f^{circ m}circ f^{circ n}$, etcetera.
– Christian Blatter
Nov 18 at 11:55




The main problem with this problem is that your $f_0$ should be called $f_1$ to begin with. In this way $f_0$ is the identity, and $f_{m+n}=f^{circ m}circ f^{circ n}$, etcetera.
– Christian Blatter
Nov 18 at 11:55















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',
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%2f3003378%2fare-we-allowed-by-the-definition-of-induction-to-assume-that-f-1x-still%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













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.





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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3003378%2fare-we-allowed-by-the-definition-of-induction-to-assume-that-f-1x-still%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

AnyDesk - Fatal Program Failure

How to calibrate 16:9 built-in touch-screen to a 4:3 resolution?

QoS: MAC-Priority for clients behind a repeater