Show $ sum_1^n (x_i-bar{x})^2 = sum_1^{n-1} (x_i -bar{x}^*)^2+frac n{n-1}(x_n-bar{x})^2 $
$begingroup$
Let $x_1,...,x_n$ be a random sample from some population with $ngeq3$ and with at most $n-2$ sample points being equal.
How can one show
$$ sum_1^n (x_i-bar{x})^2 = sum_1^{n-1} (x_i -bar{x}^*)^2+frac n{n-1}(x_n-bar{x})^2, $$
where $ bar{x}=frac1nsum_1^nx_i$ and $ bar{x}^* = frac 1{n-1} sum_1^{n-1} x_i.$
This is a useful identity since it would allow me to have an upper bound on the deviation of $x_i$ from the mean. That is
$$ max_{1leq i leq n} | x_i - bar{x}| < frac {n-1} {sqrt{n}} S, $$ where $ S^2 = frac 1 {n-1} sum_1^n (x_i - bar{x})^2.$
Thank you very much for your help.
Source of the question
A Matrix Formulation on How Deviant an Observation Can Be
Author: Ingram Olkin.
Source: The American Statistician, Vol. 46, No. 3 (Aug., 1992), pp. 205-209
https://www.jstor.org/stable/2685215
I will add shortly what I've tried so far.
statistics
$endgroup$
|
show 1 more comment
$begingroup$
Let $x_1,...,x_n$ be a random sample from some population with $ngeq3$ and with at most $n-2$ sample points being equal.
How can one show
$$ sum_1^n (x_i-bar{x})^2 = sum_1^{n-1} (x_i -bar{x}^*)^2+frac n{n-1}(x_n-bar{x})^2, $$
where $ bar{x}=frac1nsum_1^nx_i$ and $ bar{x}^* = frac 1{n-1} sum_1^{n-1} x_i.$
This is a useful identity since it would allow me to have an upper bound on the deviation of $x_i$ from the mean. That is
$$ max_{1leq i leq n} | x_i - bar{x}| < frac {n-1} {sqrt{n}} S, $$ where $ S^2 = frac 1 {n-1} sum_1^n (x_i - bar{x})^2.$
Thank you very much for your help.
Source of the question
A Matrix Formulation on How Deviant an Observation Can Be
Author: Ingram Olkin.
Source: The American Statistician, Vol. 46, No. 3 (Aug., 1992), pp. 205-209
https://www.jstor.org/stable/2685215
I will add shortly what I've tried so far.
statistics
$endgroup$
$begingroup$
Your first term on the right hand side is $0$.
$endgroup$
– lightxbulb
Jan 18 at 2:05
$begingroup$
Welcome to MSE. Please indicate what you've tried so far, and are possibly having difficulty with. Also, I haven't checked your equation carefully, but I'm fairly certain you are missing a square of the values being added in the first the term on the right.
$endgroup$
– John Omielan
Jan 18 at 2:06
$begingroup$
I found the answer in another question. I just didn't find it prior to posting mine. math.stackexchange.com/a/2442224/512044
$endgroup$
– Fiori_Modena
Jan 18 at 3:21
1
$begingroup$
The main result you are trying to prove is Samuelson's inequality. Did you see the original paper How Deviant Can You Be??
$endgroup$
– StubbornAtom
Jan 18 at 14:40
$begingroup$
@StubbornAtom, Yes, I have seen that article. It's in that article that I have found this useful equality that I am trying to show. The proof of the equality is in this question math.stackexchange.com/a/2442224/512044. I used it and I managed to answer my question. Should I write my own answer or leave to somebody else the chance to answer?
$endgroup$
– Fiori_Modena
Jan 22 at 3:03
|
show 1 more comment
$begingroup$
Let $x_1,...,x_n$ be a random sample from some population with $ngeq3$ and with at most $n-2$ sample points being equal.
How can one show
$$ sum_1^n (x_i-bar{x})^2 = sum_1^{n-1} (x_i -bar{x}^*)^2+frac n{n-1}(x_n-bar{x})^2, $$
where $ bar{x}=frac1nsum_1^nx_i$ and $ bar{x}^* = frac 1{n-1} sum_1^{n-1} x_i.$
This is a useful identity since it would allow me to have an upper bound on the deviation of $x_i$ from the mean. That is
$$ max_{1leq i leq n} | x_i - bar{x}| < frac {n-1} {sqrt{n}} S, $$ where $ S^2 = frac 1 {n-1} sum_1^n (x_i - bar{x})^2.$
Thank you very much for your help.
Source of the question
A Matrix Formulation on How Deviant an Observation Can Be
Author: Ingram Olkin.
Source: The American Statistician, Vol. 46, No. 3 (Aug., 1992), pp. 205-209
https://www.jstor.org/stable/2685215
I will add shortly what I've tried so far.
statistics
$endgroup$
Let $x_1,...,x_n$ be a random sample from some population with $ngeq3$ and with at most $n-2$ sample points being equal.
How can one show
$$ sum_1^n (x_i-bar{x})^2 = sum_1^{n-1} (x_i -bar{x}^*)^2+frac n{n-1}(x_n-bar{x})^2, $$
where $ bar{x}=frac1nsum_1^nx_i$ and $ bar{x}^* = frac 1{n-1} sum_1^{n-1} x_i.$
This is a useful identity since it would allow me to have an upper bound on the deviation of $x_i$ from the mean. That is
$$ max_{1leq i leq n} | x_i - bar{x}| < frac {n-1} {sqrt{n}} S, $$ where $ S^2 = frac 1 {n-1} sum_1^n (x_i - bar{x})^2.$
Thank you very much for your help.
Source of the question
A Matrix Formulation on How Deviant an Observation Can Be
Author: Ingram Olkin.
Source: The American Statistician, Vol. 46, No. 3 (Aug., 1992), pp. 205-209
https://www.jstor.org/stable/2685215
I will add shortly what I've tried so far.
statistics
statistics
edited Jan 18 at 2:35
Fiori_Modena
asked Jan 18 at 1:58
Fiori_ModenaFiori_Modena
225
225
$begingroup$
Your first term on the right hand side is $0$.
$endgroup$
– lightxbulb
Jan 18 at 2:05
$begingroup$
Welcome to MSE. Please indicate what you've tried so far, and are possibly having difficulty with. Also, I haven't checked your equation carefully, but I'm fairly certain you are missing a square of the values being added in the first the term on the right.
$endgroup$
– John Omielan
Jan 18 at 2:06
$begingroup$
I found the answer in another question. I just didn't find it prior to posting mine. math.stackexchange.com/a/2442224/512044
$endgroup$
– Fiori_Modena
Jan 18 at 3:21
1
$begingroup$
The main result you are trying to prove is Samuelson's inequality. Did you see the original paper How Deviant Can You Be??
$endgroup$
– StubbornAtom
Jan 18 at 14:40
$begingroup$
@StubbornAtom, Yes, I have seen that article. It's in that article that I have found this useful equality that I am trying to show. The proof of the equality is in this question math.stackexchange.com/a/2442224/512044. I used it and I managed to answer my question. Should I write my own answer or leave to somebody else the chance to answer?
$endgroup$
– Fiori_Modena
Jan 22 at 3:03
|
show 1 more comment
$begingroup$
Your first term on the right hand side is $0$.
$endgroup$
– lightxbulb
Jan 18 at 2:05
$begingroup$
Welcome to MSE. Please indicate what you've tried so far, and are possibly having difficulty with. Also, I haven't checked your equation carefully, but I'm fairly certain you are missing a square of the values being added in the first the term on the right.
$endgroup$
– John Omielan
Jan 18 at 2:06
$begingroup$
I found the answer in another question. I just didn't find it prior to posting mine. math.stackexchange.com/a/2442224/512044
$endgroup$
– Fiori_Modena
Jan 18 at 3:21
1
$begingroup$
The main result you are trying to prove is Samuelson's inequality. Did you see the original paper How Deviant Can You Be??
$endgroup$
– StubbornAtom
Jan 18 at 14:40
$begingroup$
@StubbornAtom, Yes, I have seen that article. It's in that article that I have found this useful equality that I am trying to show. The proof of the equality is in this question math.stackexchange.com/a/2442224/512044. I used it and I managed to answer my question. Should I write my own answer or leave to somebody else the chance to answer?
$endgroup$
– Fiori_Modena
Jan 22 at 3:03
$begingroup$
Your first term on the right hand side is $0$.
$endgroup$
– lightxbulb
Jan 18 at 2:05
$begingroup$
Your first term on the right hand side is $0$.
$endgroup$
– lightxbulb
Jan 18 at 2:05
$begingroup$
Welcome to MSE. Please indicate what you've tried so far, and are possibly having difficulty with. Also, I haven't checked your equation carefully, but I'm fairly certain you are missing a square of the values being added in the first the term on the right.
$endgroup$
– John Omielan
Jan 18 at 2:06
$begingroup$
Welcome to MSE. Please indicate what you've tried so far, and are possibly having difficulty with. Also, I haven't checked your equation carefully, but I'm fairly certain you are missing a square of the values being added in the first the term on the right.
$endgroup$
– John Omielan
Jan 18 at 2:06
$begingroup$
I found the answer in another question. I just didn't find it prior to posting mine. math.stackexchange.com/a/2442224/512044
$endgroup$
– Fiori_Modena
Jan 18 at 3:21
$begingroup$
I found the answer in another question. I just didn't find it prior to posting mine. math.stackexchange.com/a/2442224/512044
$endgroup$
– Fiori_Modena
Jan 18 at 3:21
1
1
$begingroup$
The main result you are trying to prove is Samuelson's inequality. Did you see the original paper How Deviant Can You Be??
$endgroup$
– StubbornAtom
Jan 18 at 14:40
$begingroup$
The main result you are trying to prove is Samuelson's inequality. Did you see the original paper How Deviant Can You Be??
$endgroup$
– StubbornAtom
Jan 18 at 14:40
$begingroup$
@StubbornAtom, Yes, I have seen that article. It's in that article that I have found this useful equality that I am trying to show. The proof of the equality is in this question math.stackexchange.com/a/2442224/512044. I used it and I managed to answer my question. Should I write my own answer or leave to somebody else the chance to answer?
$endgroup$
– Fiori_Modena
Jan 22 at 3:03
$begingroup$
@StubbornAtom, Yes, I have seen that article. It's in that article that I have found this useful equality that I am trying to show. The proof of the equality is in this question math.stackexchange.com/a/2442224/512044. I used it and I managed to answer my question. Should I write my own answer or leave to somebody else the chance to answer?
$endgroup$
– Fiori_Modena
Jan 22 at 3:03
|
show 1 more comment
0
active
oldest
votes
Your Answer
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%2f3077749%2fshow-sum-1n-x-i-barx2-sum-1n-1-x-i-barx2-frac-nn-1x%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
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.
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%2f3077749%2fshow-sum-1n-x-i-barx2-sum-1n-1-x-i-barx2-frac-nn-1x%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$
Your first term on the right hand side is $0$.
$endgroup$
– lightxbulb
Jan 18 at 2:05
$begingroup$
Welcome to MSE. Please indicate what you've tried so far, and are possibly having difficulty with. Also, I haven't checked your equation carefully, but I'm fairly certain you are missing a square of the values being added in the first the term on the right.
$endgroup$
– John Omielan
Jan 18 at 2:06
$begingroup$
I found the answer in another question. I just didn't find it prior to posting mine. math.stackexchange.com/a/2442224/512044
$endgroup$
– Fiori_Modena
Jan 18 at 3:21
1
$begingroup$
The main result you are trying to prove is Samuelson's inequality. Did you see the original paper How Deviant Can You Be??
$endgroup$
– StubbornAtom
Jan 18 at 14:40
$begingroup$
@StubbornAtom, Yes, I have seen that article. It's in that article that I have found this useful equality that I am trying to show. The proof of the equality is in this question math.stackexchange.com/a/2442224/512044. I used it and I managed to answer my question. Should I write my own answer or leave to somebody else the chance to answer?
$endgroup$
– Fiori_Modena
Jan 22 at 3:03