Proving an infinite product for generating function
$begingroup$
The following is from chapter 1, problem 10 from Wilf's Generatingfunctionology. The first part of the problem states that you are given a function defined for $ngeq 1$ with the following relations, $f(1)=1, f(2n)=f(n), f(2n+1)=f(n)+f(n+1)$, with $$F(x)=sumlimits_{ngeq 1}f(n)x^{n-1}$$
and show that this satisfies the relation, $F(x)=(1+x+x^2)F(x^2)$. I have done this, it is the second part of the question I'm concerned about as it's slightly outside of the content covered in the chapter. It asks to prove that, $$F(x)=prodlimits_{jgeq 0}^{infty}left{1+x^{2^j}+x^{2^{j+1}}right}$$ Obviously, this is true for finite $n$ as we can inductively just keep applying the relation, ie $F(x^2)=(1+x^2+x^4)F(x^4)$, so plugging into the original gives, $F(x)=(1+x+x^2)(1+x^2+x^4)F(x^4)$ and so on, but I'm sort of at a loss how to prove this infinite product in general, or just a technique to do so. This book has solutions, but the explanation for this part is not given and just stated as "obvious", which it is not to me. Any help appreciated.
combinatorics generating-functions
$endgroup$
add a comment |
$begingroup$
The following is from chapter 1, problem 10 from Wilf's Generatingfunctionology. The first part of the problem states that you are given a function defined for $ngeq 1$ with the following relations, $f(1)=1, f(2n)=f(n), f(2n+1)=f(n)+f(n+1)$, with $$F(x)=sumlimits_{ngeq 1}f(n)x^{n-1}$$
and show that this satisfies the relation, $F(x)=(1+x+x^2)F(x^2)$. I have done this, it is the second part of the question I'm concerned about as it's slightly outside of the content covered in the chapter. It asks to prove that, $$F(x)=prodlimits_{jgeq 0}^{infty}left{1+x^{2^j}+x^{2^{j+1}}right}$$ Obviously, this is true for finite $n$ as we can inductively just keep applying the relation, ie $F(x^2)=(1+x^2+x^4)F(x^4)$, so plugging into the original gives, $F(x)=(1+x+x^2)(1+x^2+x^4)F(x^4)$ and so on, but I'm sort of at a loss how to prove this infinite product in general, or just a technique to do so. This book has solutions, but the explanation for this part is not given and just stated as "obvious", which it is not to me. Any help appreciated.
combinatorics generating-functions
$endgroup$
$begingroup$
You have a "$+f(n+1)$" floating in the air in your question...
$endgroup$
– Jean Marie
Dec 28 '18 at 9:15
add a comment |
$begingroup$
The following is from chapter 1, problem 10 from Wilf's Generatingfunctionology. The first part of the problem states that you are given a function defined for $ngeq 1$ with the following relations, $f(1)=1, f(2n)=f(n), f(2n+1)=f(n)+f(n+1)$, with $$F(x)=sumlimits_{ngeq 1}f(n)x^{n-1}$$
and show that this satisfies the relation, $F(x)=(1+x+x^2)F(x^2)$. I have done this, it is the second part of the question I'm concerned about as it's slightly outside of the content covered in the chapter. It asks to prove that, $$F(x)=prodlimits_{jgeq 0}^{infty}left{1+x^{2^j}+x^{2^{j+1}}right}$$ Obviously, this is true for finite $n$ as we can inductively just keep applying the relation, ie $F(x^2)=(1+x^2+x^4)F(x^4)$, so plugging into the original gives, $F(x)=(1+x+x^2)(1+x^2+x^4)F(x^4)$ and so on, but I'm sort of at a loss how to prove this infinite product in general, or just a technique to do so. This book has solutions, but the explanation for this part is not given and just stated as "obvious", which it is not to me. Any help appreciated.
combinatorics generating-functions
$endgroup$
The following is from chapter 1, problem 10 from Wilf's Generatingfunctionology. The first part of the problem states that you are given a function defined for $ngeq 1$ with the following relations, $f(1)=1, f(2n)=f(n), f(2n+1)=f(n)+f(n+1)$, with $$F(x)=sumlimits_{ngeq 1}f(n)x^{n-1}$$
and show that this satisfies the relation, $F(x)=(1+x+x^2)F(x^2)$. I have done this, it is the second part of the question I'm concerned about as it's slightly outside of the content covered in the chapter. It asks to prove that, $$F(x)=prodlimits_{jgeq 0}^{infty}left{1+x^{2^j}+x^{2^{j+1}}right}$$ Obviously, this is true for finite $n$ as we can inductively just keep applying the relation, ie $F(x^2)=(1+x^2+x^4)F(x^4)$, so plugging into the original gives, $F(x)=(1+x+x^2)(1+x^2+x^4)F(x^4)$ and so on, but I'm sort of at a loss how to prove this infinite product in general, or just a technique to do so. This book has solutions, but the explanation for this part is not given and just stated as "obvious", which it is not to me. Any help appreciated.
combinatorics generating-functions
combinatorics generating-functions
asked Dec 28 '18 at 6:12
Jimmy2GoonsJimmy2Goons
16015
16015
$begingroup$
You have a "$+f(n+1)$" floating in the air in your question...
$endgroup$
– Jean Marie
Dec 28 '18 at 9:15
add a comment |
$begingroup$
You have a "$+f(n+1)$" floating in the air in your question...
$endgroup$
– Jean Marie
Dec 28 '18 at 9:15
$begingroup$
You have a "$+f(n+1)$" floating in the air in your question...
$endgroup$
– Jean Marie
Dec 28 '18 at 9:15
$begingroup$
You have a "$+f(n+1)$" floating in the air in your question...
$endgroup$
– Jean Marie
Dec 28 '18 at 9:15
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Two parts:
Does the given product satisfy the relationship?
Is it a unique solution? I.e. can there be more than one function which satisfies the relationship and also evaluates to $f(1)$ at $x=0$? Suppose $F(x) = (1 + x+ x^2)F(x^2)$, $G(x) = (1 + x + x^2)G(x^2)$, $F(0) = G(0) = 1$. Then $F(x) - G(x) = (1 + x + x^2)left(F(x^2) - G(x^2)right)$ and you can do the same expansion. Then suppose that the first coefficient of $x^a$ which differs is finite, and derive a contradiction by expanding $k + lg a$ times.
$endgroup$
$begingroup$
For uniqueness, you might also consider $H(x) = F(x) / G(x)$, so $H(x) = H(x^2)$ for all $x$. If $H$ is continuous this implies $H(x)$ is a constant, and since $H(1) = 1$, $H(x) = 1$ for all $x$.
$endgroup$
– awkward
Dec 28 '18 at 13:34
$begingroup$
I played around with a few ideas like that, but I'm not sure how to justify the assumption that $H$ is continuous.
$endgroup$
– Peter Taylor
Dec 28 '18 at 14:13
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',
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%2f3054623%2fproving-an-infinite-product-for-generating-function%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Two parts:
Does the given product satisfy the relationship?
Is it a unique solution? I.e. can there be more than one function which satisfies the relationship and also evaluates to $f(1)$ at $x=0$? Suppose $F(x) = (1 + x+ x^2)F(x^2)$, $G(x) = (1 + x + x^2)G(x^2)$, $F(0) = G(0) = 1$. Then $F(x) - G(x) = (1 + x + x^2)left(F(x^2) - G(x^2)right)$ and you can do the same expansion. Then suppose that the first coefficient of $x^a$ which differs is finite, and derive a contradiction by expanding $k + lg a$ times.
$endgroup$
$begingroup$
For uniqueness, you might also consider $H(x) = F(x) / G(x)$, so $H(x) = H(x^2)$ for all $x$. If $H$ is continuous this implies $H(x)$ is a constant, and since $H(1) = 1$, $H(x) = 1$ for all $x$.
$endgroup$
– awkward
Dec 28 '18 at 13:34
$begingroup$
I played around with a few ideas like that, but I'm not sure how to justify the assumption that $H$ is continuous.
$endgroup$
– Peter Taylor
Dec 28 '18 at 14:13
add a comment |
$begingroup$
Two parts:
Does the given product satisfy the relationship?
Is it a unique solution? I.e. can there be more than one function which satisfies the relationship and also evaluates to $f(1)$ at $x=0$? Suppose $F(x) = (1 + x+ x^2)F(x^2)$, $G(x) = (1 + x + x^2)G(x^2)$, $F(0) = G(0) = 1$. Then $F(x) - G(x) = (1 + x + x^2)left(F(x^2) - G(x^2)right)$ and you can do the same expansion. Then suppose that the first coefficient of $x^a$ which differs is finite, and derive a contradiction by expanding $k + lg a$ times.
$endgroup$
$begingroup$
For uniqueness, you might also consider $H(x) = F(x) / G(x)$, so $H(x) = H(x^2)$ for all $x$. If $H$ is continuous this implies $H(x)$ is a constant, and since $H(1) = 1$, $H(x) = 1$ for all $x$.
$endgroup$
– awkward
Dec 28 '18 at 13:34
$begingroup$
I played around with a few ideas like that, but I'm not sure how to justify the assumption that $H$ is continuous.
$endgroup$
– Peter Taylor
Dec 28 '18 at 14:13
add a comment |
$begingroup$
Two parts:
Does the given product satisfy the relationship?
Is it a unique solution? I.e. can there be more than one function which satisfies the relationship and also evaluates to $f(1)$ at $x=0$? Suppose $F(x) = (1 + x+ x^2)F(x^2)$, $G(x) = (1 + x + x^2)G(x^2)$, $F(0) = G(0) = 1$. Then $F(x) - G(x) = (1 + x + x^2)left(F(x^2) - G(x^2)right)$ and you can do the same expansion. Then suppose that the first coefficient of $x^a$ which differs is finite, and derive a contradiction by expanding $k + lg a$ times.
$endgroup$
Two parts:
Does the given product satisfy the relationship?
Is it a unique solution? I.e. can there be more than one function which satisfies the relationship and also evaluates to $f(1)$ at $x=0$? Suppose $F(x) = (1 + x+ x^2)F(x^2)$, $G(x) = (1 + x + x^2)G(x^2)$, $F(0) = G(0) = 1$. Then $F(x) - G(x) = (1 + x + x^2)left(F(x^2) - G(x^2)right)$ and you can do the same expansion. Then suppose that the first coefficient of $x^a$ which differs is finite, and derive a contradiction by expanding $k + lg a$ times.
answered Dec 28 '18 at 12:22
Peter TaylorPeter Taylor
9,12712343
9,12712343
$begingroup$
For uniqueness, you might also consider $H(x) = F(x) / G(x)$, so $H(x) = H(x^2)$ for all $x$. If $H$ is continuous this implies $H(x)$ is a constant, and since $H(1) = 1$, $H(x) = 1$ for all $x$.
$endgroup$
– awkward
Dec 28 '18 at 13:34
$begingroup$
I played around with a few ideas like that, but I'm not sure how to justify the assumption that $H$ is continuous.
$endgroup$
– Peter Taylor
Dec 28 '18 at 14:13
add a comment |
$begingroup$
For uniqueness, you might also consider $H(x) = F(x) / G(x)$, so $H(x) = H(x^2)$ for all $x$. If $H$ is continuous this implies $H(x)$ is a constant, and since $H(1) = 1$, $H(x) = 1$ for all $x$.
$endgroup$
– awkward
Dec 28 '18 at 13:34
$begingroup$
I played around with a few ideas like that, but I'm not sure how to justify the assumption that $H$ is continuous.
$endgroup$
– Peter Taylor
Dec 28 '18 at 14:13
$begingroup$
For uniqueness, you might also consider $H(x) = F(x) / G(x)$, so $H(x) = H(x^2)$ for all $x$. If $H$ is continuous this implies $H(x)$ is a constant, and since $H(1) = 1$, $H(x) = 1$ for all $x$.
$endgroup$
– awkward
Dec 28 '18 at 13:34
$begingroup$
For uniqueness, you might also consider $H(x) = F(x) / G(x)$, so $H(x) = H(x^2)$ for all $x$. If $H$ is continuous this implies $H(x)$ is a constant, and since $H(1) = 1$, $H(x) = 1$ for all $x$.
$endgroup$
– awkward
Dec 28 '18 at 13:34
$begingroup$
I played around with a few ideas like that, but I'm not sure how to justify the assumption that $H$ is continuous.
$endgroup$
– Peter Taylor
Dec 28 '18 at 14:13
$begingroup$
I played around with a few ideas like that, but I'm not sure how to justify the assumption that $H$ is continuous.
$endgroup$
– Peter Taylor
Dec 28 '18 at 14:13
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.
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%2f3054623%2fproving-an-infinite-product-for-generating-function%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 have a "$+f(n+1)$" floating in the air in your question...
$endgroup$
– Jean Marie
Dec 28 '18 at 9:15