Find a Closed form for the Combinatorial Sum $sum_{k=0}^mbinom{n-k}{m-k} $ and Provide a Combinatorial Proof...
$begingroup$
Question
Find a closed form for the combinatorial sum $sum_{k=0}^mbinom{n-k}{m-k} $ and provide a combinatorial proof of the resulting identity.
My attempt
I was able to find a closed form using the method of "snake-oil" but unable to provide a combinatorial proof. We claim that
$$
sum_{k=0}^mbinom{n-k}{m-k}=binom{n+1}{m}tag{0}.
$$
Indeed note that (formally)
$$
begin{align}
sum_{m=0}^inftyleft(sum_{k=0}^mbinom{n-k}{m-k}right)z^m&=sum_{k=0}^inftyleft(sum_{m=k}^inftybinom{n-k}{m-k}right)z^mtag{1}\
&=sum_{k=0}^infty z^kleft(sum_{u=0}^inftybinom{n-k}{u}z^uright)\
&=sum_{k=0}^infty z^k(1+z)^{n-k}tag{2}\
&=(1+z)^nsum_{k=0}^inftyleft(frac{z}{1+z}right)^k\
&=(1+z)^nfrac{1}{1-frac{z}{1+z}}=(1+z)^{n+1}.tag{3}
end{align}
$$
Taking the coefficient of $z^m$ from $(1+z)^{n+1}$ yields the result. In the above computation we interchanged summation in $(1)$, used the binomial thoerem in $(2)$ and used the formula for a geometric series in $(3)$.
My problem
The simplicity of the identity in $(0)$ (supposing I have not made any mistakes) suggests a combinatorial proof. Unfortunately, I have not been able to make much progress here. I don't know how to classify the $m$ element subsets of $[n+1]$ to obtain $(0)$.
Any help is appreciated.
combinatorics discrete-mathematics binomial-coefficients generating-functions
$endgroup$
add a comment |
$begingroup$
Question
Find a closed form for the combinatorial sum $sum_{k=0}^mbinom{n-k}{m-k} $ and provide a combinatorial proof of the resulting identity.
My attempt
I was able to find a closed form using the method of "snake-oil" but unable to provide a combinatorial proof. We claim that
$$
sum_{k=0}^mbinom{n-k}{m-k}=binom{n+1}{m}tag{0}.
$$
Indeed note that (formally)
$$
begin{align}
sum_{m=0}^inftyleft(sum_{k=0}^mbinom{n-k}{m-k}right)z^m&=sum_{k=0}^inftyleft(sum_{m=k}^inftybinom{n-k}{m-k}right)z^mtag{1}\
&=sum_{k=0}^infty z^kleft(sum_{u=0}^inftybinom{n-k}{u}z^uright)\
&=sum_{k=0}^infty z^k(1+z)^{n-k}tag{2}\
&=(1+z)^nsum_{k=0}^inftyleft(frac{z}{1+z}right)^k\
&=(1+z)^nfrac{1}{1-frac{z}{1+z}}=(1+z)^{n+1}.tag{3}
end{align}
$$
Taking the coefficient of $z^m$ from $(1+z)^{n+1}$ yields the result. In the above computation we interchanged summation in $(1)$, used the binomial thoerem in $(2)$ and used the formula for a geometric series in $(3)$.
My problem
The simplicity of the identity in $(0)$ (supposing I have not made any mistakes) suggests a combinatorial proof. Unfortunately, I have not been able to make much progress here. I don't know how to classify the $m$ element subsets of $[n+1]$ to obtain $(0)$.
Any help is appreciated.
combinatorics discrete-mathematics binomial-coefficients generating-functions
$endgroup$
3
$begingroup$
If you replace $m-k$ with $n-m$ on the left, and the $m$ on the right with $n-m$, then this becomes the hockey stick identity.
$endgroup$
– Mike Earnest
Dec 25 '18 at 17:18
$begingroup$
Partition the set of subsets of ${1,2,ldots,n+1}$ of size $m$ into $m+1$ parts $P_i$, $iin{0,1,ldots,m}$ where $P_i$ is the set of size-$m$ subsets whose least missing element is $i+1$.
$endgroup$
– Will Orrick
Dec 26 '18 at 1:05
add a comment |
$begingroup$
Question
Find a closed form for the combinatorial sum $sum_{k=0}^mbinom{n-k}{m-k} $ and provide a combinatorial proof of the resulting identity.
My attempt
I was able to find a closed form using the method of "snake-oil" but unable to provide a combinatorial proof. We claim that
$$
sum_{k=0}^mbinom{n-k}{m-k}=binom{n+1}{m}tag{0}.
$$
Indeed note that (formally)
$$
begin{align}
sum_{m=0}^inftyleft(sum_{k=0}^mbinom{n-k}{m-k}right)z^m&=sum_{k=0}^inftyleft(sum_{m=k}^inftybinom{n-k}{m-k}right)z^mtag{1}\
&=sum_{k=0}^infty z^kleft(sum_{u=0}^inftybinom{n-k}{u}z^uright)\
&=sum_{k=0}^infty z^k(1+z)^{n-k}tag{2}\
&=(1+z)^nsum_{k=0}^inftyleft(frac{z}{1+z}right)^k\
&=(1+z)^nfrac{1}{1-frac{z}{1+z}}=(1+z)^{n+1}.tag{3}
end{align}
$$
Taking the coefficient of $z^m$ from $(1+z)^{n+1}$ yields the result. In the above computation we interchanged summation in $(1)$, used the binomial thoerem in $(2)$ and used the formula for a geometric series in $(3)$.
My problem
The simplicity of the identity in $(0)$ (supposing I have not made any mistakes) suggests a combinatorial proof. Unfortunately, I have not been able to make much progress here. I don't know how to classify the $m$ element subsets of $[n+1]$ to obtain $(0)$.
Any help is appreciated.
combinatorics discrete-mathematics binomial-coefficients generating-functions
$endgroup$
Question
Find a closed form for the combinatorial sum $sum_{k=0}^mbinom{n-k}{m-k} $ and provide a combinatorial proof of the resulting identity.
My attempt
I was able to find a closed form using the method of "snake-oil" but unable to provide a combinatorial proof. We claim that
$$
sum_{k=0}^mbinom{n-k}{m-k}=binom{n+1}{m}tag{0}.
$$
Indeed note that (formally)
$$
begin{align}
sum_{m=0}^inftyleft(sum_{k=0}^mbinom{n-k}{m-k}right)z^m&=sum_{k=0}^inftyleft(sum_{m=k}^inftybinom{n-k}{m-k}right)z^mtag{1}\
&=sum_{k=0}^infty z^kleft(sum_{u=0}^inftybinom{n-k}{u}z^uright)\
&=sum_{k=0}^infty z^k(1+z)^{n-k}tag{2}\
&=(1+z)^nsum_{k=0}^inftyleft(frac{z}{1+z}right)^k\
&=(1+z)^nfrac{1}{1-frac{z}{1+z}}=(1+z)^{n+1}.tag{3}
end{align}
$$
Taking the coefficient of $z^m$ from $(1+z)^{n+1}$ yields the result. In the above computation we interchanged summation in $(1)$, used the binomial thoerem in $(2)$ and used the formula for a geometric series in $(3)$.
My problem
The simplicity of the identity in $(0)$ (supposing I have not made any mistakes) suggests a combinatorial proof. Unfortunately, I have not been able to make much progress here. I don't know how to classify the $m$ element subsets of $[n+1]$ to obtain $(0)$.
Any help is appreciated.
combinatorics discrete-mathematics binomial-coefficients generating-functions
combinatorics discrete-mathematics binomial-coefficients generating-functions
asked Dec 25 '18 at 17:07
Foobaz JohnFoobaz John
22.1k41452
22.1k41452
3
$begingroup$
If you replace $m-k$ with $n-m$ on the left, and the $m$ on the right with $n-m$, then this becomes the hockey stick identity.
$endgroup$
– Mike Earnest
Dec 25 '18 at 17:18
$begingroup$
Partition the set of subsets of ${1,2,ldots,n+1}$ of size $m$ into $m+1$ parts $P_i$, $iin{0,1,ldots,m}$ where $P_i$ is the set of size-$m$ subsets whose least missing element is $i+1$.
$endgroup$
– Will Orrick
Dec 26 '18 at 1:05
add a comment |
3
$begingroup$
If you replace $m-k$ with $n-m$ on the left, and the $m$ on the right with $n-m$, then this becomes the hockey stick identity.
$endgroup$
– Mike Earnest
Dec 25 '18 at 17:18
$begingroup$
Partition the set of subsets of ${1,2,ldots,n+1}$ of size $m$ into $m+1$ parts $P_i$, $iin{0,1,ldots,m}$ where $P_i$ is the set of size-$m$ subsets whose least missing element is $i+1$.
$endgroup$
– Will Orrick
Dec 26 '18 at 1:05
3
3
$begingroup$
If you replace $m-k$ with $n-m$ on the left, and the $m$ on the right with $n-m$, then this becomes the hockey stick identity.
$endgroup$
– Mike Earnest
Dec 25 '18 at 17:18
$begingroup$
If you replace $m-k$ with $n-m$ on the left, and the $m$ on the right with $n-m$, then this becomes the hockey stick identity.
$endgroup$
– Mike Earnest
Dec 25 '18 at 17:18
$begingroup$
Partition the set of subsets of ${1,2,ldots,n+1}$ of size $m$ into $m+1$ parts $P_i$, $iin{0,1,ldots,m}$ where $P_i$ is the set of size-$m$ subsets whose least missing element is $i+1$.
$endgroup$
– Will Orrick
Dec 26 '18 at 1:05
$begingroup$
Partition the set of subsets of ${1,2,ldots,n+1}$ of size $m$ into $m+1$ parts $P_i$, $iin{0,1,ldots,m}$ where $P_i$ is the set of size-$m$ subsets whose least missing element is $i+1$.
$endgroup$
– Will Orrick
Dec 26 '18 at 1:05
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
In how many ways can you choose the m-element subsets of {1,...,n}? In ${n choose m}$ ways. But you may also write this as (the number of ways to choose m-element subsets that contain n )+ (the ones that don’t contain n but contain (n-1) +(the number of subsets that contain neither n, nor n-1, but contain n-2) +...(keep going)+(the number of subsets that contain neither n, nor n-1,nor...,nor m+1) and this gives you ${n-1 choose m} + {n-2 choose m}+...+{m choose m}$
This is the same identity as the one you need to prove once you note that ${n-k choose m-k}={n-k choose n-m}$ and change the order of sumation from m to 0 instead of 0 to m.
$endgroup$
add a comment |
$begingroup$
Lemma:
$$binom{n}{k}=binom{n}{n-k}$$
$$binom{n}{k}=frac{n!}{(n-k)!k!}=binom{n}{n-k}=frac{n!}{k!(n-k)!}$$
Proof:
$$binom{n-k}{m-k}=binom{n-k}{(n-k)-(m-k)}=binom{n-k}{n-m}$$
Therefore,
$$sum_{k=0}^{m}binom{n-k}{m-k}=sum_{k=0}^{m}binom{n-k}{n-m}$$
Notice that
$$sum_{k=0}^{m}binom{n-k}{n-m}=sum_{k=n-m}^{n}binom{k}{n-m}$$
Using Hockey Stick identity
$$sum_{i=r}^{n}binom{i}{r}=binom{n+1}{r+1}$$
We have
$$sum_{k=0}^{m}binom{n-k}{m-k}=sum_{k=0}^{m}binom{n-k}{n-m}=sum_{k=n-m}^{n}binom{k}{n-m}=binom{n+1}{n+1-m}=binom{n+1}{m}$$
$endgroup$
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%2f3052280%2ffind-a-closed-form-for-the-combinatorial-sum-sum-k-0m-binomn-km-k-and%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$
In how many ways can you choose the m-element subsets of {1,...,n}? In ${n choose m}$ ways. But you may also write this as (the number of ways to choose m-element subsets that contain n )+ (the ones that don’t contain n but contain (n-1) +(the number of subsets that contain neither n, nor n-1, but contain n-2) +...(keep going)+(the number of subsets that contain neither n, nor n-1,nor...,nor m+1) and this gives you ${n-1 choose m} + {n-2 choose m}+...+{m choose m}$
This is the same identity as the one you need to prove once you note that ${n-k choose m-k}={n-k choose n-m}$ and change the order of sumation from m to 0 instead of 0 to m.
$endgroup$
add a comment |
$begingroup$
In how many ways can you choose the m-element subsets of {1,...,n}? In ${n choose m}$ ways. But you may also write this as (the number of ways to choose m-element subsets that contain n )+ (the ones that don’t contain n but contain (n-1) +(the number of subsets that contain neither n, nor n-1, but contain n-2) +...(keep going)+(the number of subsets that contain neither n, nor n-1,nor...,nor m+1) and this gives you ${n-1 choose m} + {n-2 choose m}+...+{m choose m}$
This is the same identity as the one you need to prove once you note that ${n-k choose m-k}={n-k choose n-m}$ and change the order of sumation from m to 0 instead of 0 to m.
$endgroup$
add a comment |
$begingroup$
In how many ways can you choose the m-element subsets of {1,...,n}? In ${n choose m}$ ways. But you may also write this as (the number of ways to choose m-element subsets that contain n )+ (the ones that don’t contain n but contain (n-1) +(the number of subsets that contain neither n, nor n-1, but contain n-2) +...(keep going)+(the number of subsets that contain neither n, nor n-1,nor...,nor m+1) and this gives you ${n-1 choose m} + {n-2 choose m}+...+{m choose m}$
This is the same identity as the one you need to prove once you note that ${n-k choose m-k}={n-k choose n-m}$ and change the order of sumation from m to 0 instead of 0 to m.
$endgroup$
In how many ways can you choose the m-element subsets of {1,...,n}? In ${n choose m}$ ways. But you may also write this as (the number of ways to choose m-element subsets that contain n )+ (the ones that don’t contain n but contain (n-1) +(the number of subsets that contain neither n, nor n-1, but contain n-2) +...(keep going)+(the number of subsets that contain neither n, nor n-1,nor...,nor m+1) and this gives you ${n-1 choose m} + {n-2 choose m}+...+{m choose m}$
This is the same identity as the one you need to prove once you note that ${n-k choose m-k}={n-k choose n-m}$ and change the order of sumation from m to 0 instead of 0 to m.
edited Dec 25 '18 at 17:52
answered Dec 25 '18 at 17:21
Sorin TircSorin Tirc
1,800213
1,800213
add a comment |
add a comment |
$begingroup$
Lemma:
$$binom{n}{k}=binom{n}{n-k}$$
$$binom{n}{k}=frac{n!}{(n-k)!k!}=binom{n}{n-k}=frac{n!}{k!(n-k)!}$$
Proof:
$$binom{n-k}{m-k}=binom{n-k}{(n-k)-(m-k)}=binom{n-k}{n-m}$$
Therefore,
$$sum_{k=0}^{m}binom{n-k}{m-k}=sum_{k=0}^{m}binom{n-k}{n-m}$$
Notice that
$$sum_{k=0}^{m}binom{n-k}{n-m}=sum_{k=n-m}^{n}binom{k}{n-m}$$
Using Hockey Stick identity
$$sum_{i=r}^{n}binom{i}{r}=binom{n+1}{r+1}$$
We have
$$sum_{k=0}^{m}binom{n-k}{m-k}=sum_{k=0}^{m}binom{n-k}{n-m}=sum_{k=n-m}^{n}binom{k}{n-m}=binom{n+1}{n+1-m}=binom{n+1}{m}$$
$endgroup$
add a comment |
$begingroup$
Lemma:
$$binom{n}{k}=binom{n}{n-k}$$
$$binom{n}{k}=frac{n!}{(n-k)!k!}=binom{n}{n-k}=frac{n!}{k!(n-k)!}$$
Proof:
$$binom{n-k}{m-k}=binom{n-k}{(n-k)-(m-k)}=binom{n-k}{n-m}$$
Therefore,
$$sum_{k=0}^{m}binom{n-k}{m-k}=sum_{k=0}^{m}binom{n-k}{n-m}$$
Notice that
$$sum_{k=0}^{m}binom{n-k}{n-m}=sum_{k=n-m}^{n}binom{k}{n-m}$$
Using Hockey Stick identity
$$sum_{i=r}^{n}binom{i}{r}=binom{n+1}{r+1}$$
We have
$$sum_{k=0}^{m}binom{n-k}{m-k}=sum_{k=0}^{m}binom{n-k}{n-m}=sum_{k=n-m}^{n}binom{k}{n-m}=binom{n+1}{n+1-m}=binom{n+1}{m}$$
$endgroup$
add a comment |
$begingroup$
Lemma:
$$binom{n}{k}=binom{n}{n-k}$$
$$binom{n}{k}=frac{n!}{(n-k)!k!}=binom{n}{n-k}=frac{n!}{k!(n-k)!}$$
Proof:
$$binom{n-k}{m-k}=binom{n-k}{(n-k)-(m-k)}=binom{n-k}{n-m}$$
Therefore,
$$sum_{k=0}^{m}binom{n-k}{m-k}=sum_{k=0}^{m}binom{n-k}{n-m}$$
Notice that
$$sum_{k=0}^{m}binom{n-k}{n-m}=sum_{k=n-m}^{n}binom{k}{n-m}$$
Using Hockey Stick identity
$$sum_{i=r}^{n}binom{i}{r}=binom{n+1}{r+1}$$
We have
$$sum_{k=0}^{m}binom{n-k}{m-k}=sum_{k=0}^{m}binom{n-k}{n-m}=sum_{k=n-m}^{n}binom{k}{n-m}=binom{n+1}{n+1-m}=binom{n+1}{m}$$
$endgroup$
Lemma:
$$binom{n}{k}=binom{n}{n-k}$$
$$binom{n}{k}=frac{n!}{(n-k)!k!}=binom{n}{n-k}=frac{n!}{k!(n-k)!}$$
Proof:
$$binom{n-k}{m-k}=binom{n-k}{(n-k)-(m-k)}=binom{n-k}{n-m}$$
Therefore,
$$sum_{k=0}^{m}binom{n-k}{m-k}=sum_{k=0}^{m}binom{n-k}{n-m}$$
Notice that
$$sum_{k=0}^{m}binom{n-k}{n-m}=sum_{k=n-m}^{n}binom{k}{n-m}$$
Using Hockey Stick identity
$$sum_{i=r}^{n}binom{i}{r}=binom{n+1}{r+1}$$
We have
$$sum_{k=0}^{m}binom{n-k}{m-k}=sum_{k=0}^{m}binom{n-k}{n-m}=sum_{k=n-m}^{n}binom{k}{n-m}=binom{n+1}{n+1-m}=binom{n+1}{m}$$
answered Dec 25 '18 at 18:28
LarryLarry
2,41331129
2,41331129
add a comment |
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%2f3052280%2ffind-a-closed-form-for-the-combinatorial-sum-sum-k-0m-binomn-km-k-and%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
3
$begingroup$
If you replace $m-k$ with $n-m$ on the left, and the $m$ on the right with $n-m$, then this becomes the hockey stick identity.
$endgroup$
– Mike Earnest
Dec 25 '18 at 17:18
$begingroup$
Partition the set of subsets of ${1,2,ldots,n+1}$ of size $m$ into $m+1$ parts $P_i$, $iin{0,1,ldots,m}$ where $P_i$ is the set of size-$m$ subsets whose least missing element is $i+1$.
$endgroup$
– Will Orrick
Dec 26 '18 at 1:05