Question about the proof of the Recursiontheorem
up vote
0
down vote
favorite
Please have a look at the proof, first of all I don't understand the parts of the proof where one is refering to the Definition of G.
In the inductionbase one Claims that $(1,x)$ is an element of G
In the inductionstep we define $x_{n+1}:= f_n(x_1,..,x_n)$ and claim that $(n+1,x_{n+1})$ is also an element G. Can please someone explain me why these two assertions are true due to the Definition of G?
algebra-precalculus induction
asked Nov 21 at 21:06
RM777
1528
add a comment |
up vote
0
down vote
favorite
Please have a look at the proof, first of all I don't understand the parts of the proof where one is refering to the Definition of G.
In the inductionbase one Claims that $(1,x)$ is an element of G
In the inductionstep we define $x_{n+1}:= f_n(x_1,..,x_n)$ and claim that $(n+1,x_{n+1})$ is also an element G. Can please someone explain me why these two assertions are true due to the Definition of G?
algebra-precalculus induction
asked Nov 21 at 21:06
RM777
1528
It's about the existential proof
– RM777
Nov 21 at 21:14
I would also like to no how the uniqueness is used of $(1,x_1),...,(n,x_n)$ in the inductionstep
– RM777
Nov 22 at 14:16
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Please have a look at the proof, first of all I don't understand the parts of the proof where one is refering to the Definition of G.
In the inductionbase one Claims that $(1,x)$ is an element of G
In the inductionstep we define $x_{n+1}:= f_n(x_1,..,x_n)$ and claim that $(n+1,x_{n+1})$ is also an element G. Can please someone explain me why these two assertions are true due to the Definition of G?
algebra-precalculus induction
asked Nov 21 at 21:06
RM777
1528
Please have a look at the proof, first of all I don't understand the parts of the proof where one is refering to the Definition of G.
In the inductionbase one Claims that $(1,x)$ is an element of G
In the inductionstep we define $x_{n+1}:= f_n(x_1,..,x_n)$ and claim that $(n+1,x_{n+1})$ is also an element G. Can please someone explain me why these two assertions are true due to the Definition of G?
algebra-precalculus induction
algebra-precalculus induction
asked Nov 21 at 21:06
RM777
1528
asked Nov 21 at 21:06
RM777
1528
asked Nov 21 at 21:06
RM777
1528
asked Nov 21 at 21:06
RM777
1528
asked Nov 21 at 21:06
RM777
1528
1528
It's about the existential proof
– RM777
Nov 21 at 21:14
I would also like to no how the uniqueness is used of $(1,x_1),...,(n,x_n)$ in the inductionstep
– RM777
Nov 22 at 14:16
add a comment |
It's about the existential proof
– RM777
Nov 21 at 21:14
I would also like to no how the uniqueness is used of $(1,x_1),...,(n,x_n)$ in the inductionstep
– RM777
Nov 22 at 14:16
It's about the existential proof
– RM777
Nov 21 at 21:14
It's about the existential proof
– RM777
Nov 21 at 21:14
I would also like to no how the uniqueness is used of $(1,x_1),...,(n,x_n)$ in the inductionstep
– RM777
Nov 22 at 14:16
I would also like to no how the uniqueness is used of $(1,x_1),...,(n,x_n)$ in the inductionstep
– RM777
Nov 22 at 14:16
add a comment |
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
});
}
});
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%2f3008364%2fquestion-about-the-proof-of-the-recursiontheorem%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3008364%2fquestion-about-the-proof-of-the-recursiontheorem%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
It's about the existential proof
– RM777
Nov 21 at 21:14
I would also like to no how the uniqueness is used of $(1,x_1),...,(n,x_n)$ in the inductionstep
– RM777
Nov 22 at 14:16