Proving identity generalizing $frac1{(a-b)(a-c)}+frac1{(b-a)(b-c)} + frac1{(c-a)(c-b)} = 0$
$begingroup$
It is simple to see $frac{1}{a-b} + frac{1}{b-a}=0$ and $frac1{(a-b)(a-c)}+frac1{(b-a)(b-c)} + frac1{(c-a)(c-b)} = 0$, but the generalization
$$
sum_{j=1}^n frac{1}{(a_j-a_1) cdots widehat{(a_j-a_j)} cdots (a_j-a_n)}=0$$
where the hat denotes omission, isn't as simple for me. I was unable to prove by induction. I also tried to show the derivative w.r.t. each $a_i$ vanishes, but this too is difficult. I've also tried to relate this to the determinant of a matrix with entries of the form $1/(a_i-a_j)$ but this didn't get me anywhere.
Any help would be much appreciated.
combinatorics functions
$endgroup$
add a comment |
$begingroup$
It is simple to see $frac{1}{a-b} + frac{1}{b-a}=0$ and $frac1{(a-b)(a-c)}+frac1{(b-a)(b-c)} + frac1{(c-a)(c-b)} = 0$, but the generalization
$$
sum_{j=1}^n frac{1}{(a_j-a_1) cdots widehat{(a_j-a_j)} cdots (a_j-a_n)}=0$$
where the hat denotes omission, isn't as simple for me. I was unable to prove by induction. I also tried to show the derivative w.r.t. each $a_i$ vanishes, but this too is difficult. I've also tried to relate this to the determinant of a matrix with entries of the form $1/(a_i-a_j)$ but this didn't get me anywhere.
Any help would be much appreciated.
combinatorics functions
$endgroup$
add a comment |
$begingroup$
It is simple to see $frac{1}{a-b} + frac{1}{b-a}=0$ and $frac1{(a-b)(a-c)}+frac1{(b-a)(b-c)} + frac1{(c-a)(c-b)} = 0$, but the generalization
$$
sum_{j=1}^n frac{1}{(a_j-a_1) cdots widehat{(a_j-a_j)} cdots (a_j-a_n)}=0$$
where the hat denotes omission, isn't as simple for me. I was unable to prove by induction. I also tried to show the derivative w.r.t. each $a_i$ vanishes, but this too is difficult. I've also tried to relate this to the determinant of a matrix with entries of the form $1/(a_i-a_j)$ but this didn't get me anywhere.
Any help would be much appreciated.
combinatorics functions
$endgroup$
It is simple to see $frac{1}{a-b} + frac{1}{b-a}=0$ and $frac1{(a-b)(a-c)}+frac1{(b-a)(b-c)} + frac1{(c-a)(c-b)} = 0$, but the generalization
$$
sum_{j=1}^n frac{1}{(a_j-a_1) cdots widehat{(a_j-a_j)} cdots (a_j-a_n)}=0$$
where the hat denotes omission, isn't as simple for me. I was unable to prove by induction. I also tried to show the derivative w.r.t. each $a_i$ vanishes, but this too is difficult. I've also tried to relate this to the determinant of a matrix with entries of the form $1/(a_i-a_j)$ but this didn't get me anywhere.
Any help would be much appreciated.
combinatorics functions
combinatorics functions
asked Dec 18 '18 at 2:07
DwaggDwagg
307111
307111
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Consider the function
$$ f(x) := sum_{j=1}^n frac{(x-a_1) cdots widehat{(x-a_j)} cdots (x-a_n)}{(a_j-a_1) cdots widehat{(a_j-a_j)} cdots (a_j-a_n)}. $$
This is a polynomial function of degree at most $n-1$. Also, $f(a_1) = f(a_2) = cdots = f(a_n) = 1$. Therefore, $f(x) equiv 1$. If $n ge 2$, then that implies that the coefficient of $x^{n-1}$ in this polynomial must be 0. However, the coefficient of $x^{n-1}$ is exactly
$$sum_{j=1}^n frac{1}{(a_j-a_1) cdots widehat{(a_j-a_j)} cdots (a_j-a_n)}.$$
$endgroup$
$begingroup$
Very elegant.${}$
$endgroup$
– Cheerful Parsnip
Dec 18 '18 at 2:24
add a comment |
$begingroup$
Another proof is the following. Let
$$p(x) = (z-a_1)cdots (z-a_n)$$
with $a_1,ldots, a_n$ distinct. By the residue theorem we have
$$int_{z=|R|} frac{1}{p(z)} dz = 2pi i sum_{|a_j|<R} text{Res}left(frac{1}{p(z)}, a_jright).$$
If $ngeq 2$ then the absolute value of the integral is bounded by $sim 2pi R/R^n to 0$ as $Rto infty$. Since the RHS is independent of $R$ for large $R$, this implies
$$sum_{j} text{Res}left(frac{1}{p(z)}, a_jright) = sum_j frac{1}{p'(a_j)}=0$$
which is equivalent to the identity.
$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%2f3044701%2fproving-identity-generalizing-frac1a-ba-c-frac1b-ab-c-frac1c%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$
Consider the function
$$ f(x) := sum_{j=1}^n frac{(x-a_1) cdots widehat{(x-a_j)} cdots (x-a_n)}{(a_j-a_1) cdots widehat{(a_j-a_j)} cdots (a_j-a_n)}. $$
This is a polynomial function of degree at most $n-1$. Also, $f(a_1) = f(a_2) = cdots = f(a_n) = 1$. Therefore, $f(x) equiv 1$. If $n ge 2$, then that implies that the coefficient of $x^{n-1}$ in this polynomial must be 0. However, the coefficient of $x^{n-1}$ is exactly
$$sum_{j=1}^n frac{1}{(a_j-a_1) cdots widehat{(a_j-a_j)} cdots (a_j-a_n)}.$$
$endgroup$
$begingroup$
Very elegant.${}$
$endgroup$
– Cheerful Parsnip
Dec 18 '18 at 2:24
add a comment |
$begingroup$
Consider the function
$$ f(x) := sum_{j=1}^n frac{(x-a_1) cdots widehat{(x-a_j)} cdots (x-a_n)}{(a_j-a_1) cdots widehat{(a_j-a_j)} cdots (a_j-a_n)}. $$
This is a polynomial function of degree at most $n-1$. Also, $f(a_1) = f(a_2) = cdots = f(a_n) = 1$. Therefore, $f(x) equiv 1$. If $n ge 2$, then that implies that the coefficient of $x^{n-1}$ in this polynomial must be 0. However, the coefficient of $x^{n-1}$ is exactly
$$sum_{j=1}^n frac{1}{(a_j-a_1) cdots widehat{(a_j-a_j)} cdots (a_j-a_n)}.$$
$endgroup$
$begingroup$
Very elegant.${}$
$endgroup$
– Cheerful Parsnip
Dec 18 '18 at 2:24
add a comment |
$begingroup$
Consider the function
$$ f(x) := sum_{j=1}^n frac{(x-a_1) cdots widehat{(x-a_j)} cdots (x-a_n)}{(a_j-a_1) cdots widehat{(a_j-a_j)} cdots (a_j-a_n)}. $$
This is a polynomial function of degree at most $n-1$. Also, $f(a_1) = f(a_2) = cdots = f(a_n) = 1$. Therefore, $f(x) equiv 1$. If $n ge 2$, then that implies that the coefficient of $x^{n-1}$ in this polynomial must be 0. However, the coefficient of $x^{n-1}$ is exactly
$$sum_{j=1}^n frac{1}{(a_j-a_1) cdots widehat{(a_j-a_j)} cdots (a_j-a_n)}.$$
$endgroup$
Consider the function
$$ f(x) := sum_{j=1}^n frac{(x-a_1) cdots widehat{(x-a_j)} cdots (x-a_n)}{(a_j-a_1) cdots widehat{(a_j-a_j)} cdots (a_j-a_n)}. $$
This is a polynomial function of degree at most $n-1$. Also, $f(a_1) = f(a_2) = cdots = f(a_n) = 1$. Therefore, $f(x) equiv 1$. If $n ge 2$, then that implies that the coefficient of $x^{n-1}$ in this polynomial must be 0. However, the coefficient of $x^{n-1}$ is exactly
$$sum_{j=1}^n frac{1}{(a_j-a_1) cdots widehat{(a_j-a_j)} cdots (a_j-a_n)}.$$
answered Dec 18 '18 at 2:20
Daniel ScheplerDaniel Schepler
9,1191721
9,1191721
$begingroup$
Very elegant.${}$
$endgroup$
– Cheerful Parsnip
Dec 18 '18 at 2:24
add a comment |
$begingroup$
Very elegant.${}$
$endgroup$
– Cheerful Parsnip
Dec 18 '18 at 2:24
$begingroup$
Very elegant.${}$
$endgroup$
– Cheerful Parsnip
Dec 18 '18 at 2:24
$begingroup$
Very elegant.${}$
$endgroup$
– Cheerful Parsnip
Dec 18 '18 at 2:24
add a comment |
$begingroup$
Another proof is the following. Let
$$p(x) = (z-a_1)cdots (z-a_n)$$
with $a_1,ldots, a_n$ distinct. By the residue theorem we have
$$int_{z=|R|} frac{1}{p(z)} dz = 2pi i sum_{|a_j|<R} text{Res}left(frac{1}{p(z)}, a_jright).$$
If $ngeq 2$ then the absolute value of the integral is bounded by $sim 2pi R/R^n to 0$ as $Rto infty$. Since the RHS is independent of $R$ for large $R$, this implies
$$sum_{j} text{Res}left(frac{1}{p(z)}, a_jright) = sum_j frac{1}{p'(a_j)}=0$$
which is equivalent to the identity.
$endgroup$
add a comment |
$begingroup$
Another proof is the following. Let
$$p(x) = (z-a_1)cdots (z-a_n)$$
with $a_1,ldots, a_n$ distinct. By the residue theorem we have
$$int_{z=|R|} frac{1}{p(z)} dz = 2pi i sum_{|a_j|<R} text{Res}left(frac{1}{p(z)}, a_jright).$$
If $ngeq 2$ then the absolute value of the integral is bounded by $sim 2pi R/R^n to 0$ as $Rto infty$. Since the RHS is independent of $R$ for large $R$, this implies
$$sum_{j} text{Res}left(frac{1}{p(z)}, a_jright) = sum_j frac{1}{p'(a_j)}=0$$
which is equivalent to the identity.
$endgroup$
add a comment |
$begingroup$
Another proof is the following. Let
$$p(x) = (z-a_1)cdots (z-a_n)$$
with $a_1,ldots, a_n$ distinct. By the residue theorem we have
$$int_{z=|R|} frac{1}{p(z)} dz = 2pi i sum_{|a_j|<R} text{Res}left(frac{1}{p(z)}, a_jright).$$
If $ngeq 2$ then the absolute value of the integral is bounded by $sim 2pi R/R^n to 0$ as $Rto infty$. Since the RHS is independent of $R$ for large $R$, this implies
$$sum_{j} text{Res}left(frac{1}{p(z)}, a_jright) = sum_j frac{1}{p'(a_j)}=0$$
which is equivalent to the identity.
$endgroup$
Another proof is the following. Let
$$p(x) = (z-a_1)cdots (z-a_n)$$
with $a_1,ldots, a_n$ distinct. By the residue theorem we have
$$int_{z=|R|} frac{1}{p(z)} dz = 2pi i sum_{|a_j|<R} text{Res}left(frac{1}{p(z)}, a_jright).$$
If $ngeq 2$ then the absolute value of the integral is bounded by $sim 2pi R/R^n to 0$ as $Rto infty$. Since the RHS is independent of $R$ for large $R$, this implies
$$sum_{j} text{Res}left(frac{1}{p(z)}, a_jright) = sum_j frac{1}{p'(a_j)}=0$$
which is equivalent to the identity.
answered Dec 18 '18 at 16:41
DwaggDwagg
307111
307111
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%2f3044701%2fproving-identity-generalizing-frac1a-ba-c-frac1b-ab-c-frac1c%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