Chebyshev inequality in terms of RMS Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Inequality for trace of product of matrices given norms of the matricesCoding for Regression AnalysisQR factorization and linear regressionWhat is the “expressive power” of the composition function in a Recursive Neural Tensor Network?How can one design a polynomial function that really does require higher order terms to approximate it well?Matrix Orthogonal to Vector: why take transpose?
Is there any word for a place full of confusion?
What is the effect of altitude on true airspeed?
Do Fourier frequencies actually exist in real life in form of "instantaneous frequency"?
How would a mousetrap for use in space work?
Did Deadpool rescue all of the X-Force?
How do I find out the mythology and history of my Fortress?
Is it ethical to give a final exam after the professor has quit before teaching the remaining chapters of the course?
Project Euler #1 in C++
How does the math work when buying airline miles?
Did MS DOS itself ever use blinking text?
Most bit efficient text communication method?
Drawing without replacement: why the order of draw is irrelevant?
What do you call the main part of a joke?
How to tell that you are a giant?
What is the font for "b" letter?
Did Krishna say in Bhagavad Gita "I am in every living being"
Should I use a zero-interest credit card for a large one-time purchase?
How to react to hostile behavior from a senior developer?
How to install press fit bottom bracket into new frame
Can anything be seen from the center of the Boötes void? How dark would it be?
Generate an RGB colour grid
How come Sam didn't become Lord of Horn Hill?
Take 2! Is this homebrew Lady of Pain warlock patron balanced?
What's the meaning of "fortified infraction restraint"?
Chebyshev inequality in terms of RMS
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Inequality for trace of product of matrices given norms of the matricesCoding for Regression AnalysisQR factorization and linear regressionWhat is the “expressive power” of the composition function in a Recursive Neural Tensor Network?How can one design a polynomial function that really does require higher order terms to approximate it well?Matrix Orthogonal to Vector: why take transpose?
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
I'm self studying the book Introduction to Applied Linear Algebra – Vectors, Matrices, and Least Squares
In page 48, the author write: "It says,for example, that no more than 1/25 = 4% of the entries of a vector can exceed its RMS value by more than a factor of 5."
I need more explain about it. Especially about why the factor is 5?
linear-algebra
New contributor
H. Yong is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I'm self studying the book Introduction to Applied Linear Algebra – Vectors, Matrices, and Least Squares
In page 48, the author write: "It says,for example, that no more than 1/25 = 4% of the entries of a vector can exceed its RMS value by more than a factor of 5."
I need more explain about it. Especially about why the factor is 5?
linear-algebra
New contributor
H. Yong is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I'm self studying the book Introduction to Applied Linear Algebra – Vectors, Matrices, and Least Squares
In page 48, the author write: "It says,for example, that no more than 1/25 = 4% of the entries of a vector can exceed its RMS value by more than a factor of 5."
I need more explain about it. Especially about why the factor is 5?
linear-algebra
New contributor
H. Yong is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
I'm self studying the book Introduction to Applied Linear Algebra – Vectors, Matrices, and Least Squares
In page 48, the author write: "It says,for example, that no more than 1/25 = 4% of the entries of a vector can exceed its RMS value by more than a factor of 5."
I need more explain about it. Especially about why the factor is 5?
linear-algebra
linear-algebra
New contributor
H. Yong is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
H. Yong is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
H. Yong is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 2 hours ago
H. YongH. Yong
112
112
New contributor
H. Yong is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
H. Yong is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
H. Yong is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
According to Chebyshev's_inequality, the probability of a value to deviate more than $k=5$ standard deviations from the mean is at most $1/k^2$.
When applied to vectors in your specific case, and following the book you cited, let $k$ be the number of elements of the vector $vecx=(x_1,ldots,x_n)$ such that $||x_i|| geq a > 0$.
Hence $||vecx||^2 = sum x_i^2 geq k a^2 + (n - k) times 0$, which means that we have $k$ values larger than $a^2$ and the others $n-k$ values are at least zero.
Since the root mean square value is $rms(vecx) = sqrtfracn$, it follows that $rms(vecx)^2 = fracn geq frac k a^2n$.
Therefore, we get the final expression that says
$$
frac kn leq left( fracrms(vecx)a right) ^2
$$
So, following the example, where $a = 5 rms(vecx)$, we have that $frac kn leq left( frac15 right) ^2 = 4 %$, so, the fraction of elements of the vector larger (in absolute value) than $5 rms$ is at most $4%$.
If we chose another number, say $a = 2 rms(vecx)$, we would have that $frac kn leq left( frac12 right) ^2 = 25 %$.
$endgroup$
add a comment |
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "65"
;
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
H. Yong is a new contributor. Be nice, and check out our Code of Conduct.
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%2fstats.stackexchange.com%2fquestions%2f403846%2fchebyshev-inequality-in-terms-of-rms%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$
According to Chebyshev's_inequality, the probability of a value to deviate more than $k=5$ standard deviations from the mean is at most $1/k^2$.
When applied to vectors in your specific case, and following the book you cited, let $k$ be the number of elements of the vector $vecx=(x_1,ldots,x_n)$ such that $||x_i|| geq a > 0$.
Hence $||vecx||^2 = sum x_i^2 geq k a^2 + (n - k) times 0$, which means that we have $k$ values larger than $a^2$ and the others $n-k$ values are at least zero.
Since the root mean square value is $rms(vecx) = sqrtfracn$, it follows that $rms(vecx)^2 = fracn geq frac k a^2n$.
Therefore, we get the final expression that says
$$
frac kn leq left( fracrms(vecx)a right) ^2
$$
So, following the example, where $a = 5 rms(vecx)$, we have that $frac kn leq left( frac15 right) ^2 = 4 %$, so, the fraction of elements of the vector larger (in absolute value) than $5 rms$ is at most $4%$.
If we chose another number, say $a = 2 rms(vecx)$, we would have that $frac kn leq left( frac12 right) ^2 = 25 %$.
$endgroup$
add a comment |
$begingroup$
According to Chebyshev's_inequality, the probability of a value to deviate more than $k=5$ standard deviations from the mean is at most $1/k^2$.
When applied to vectors in your specific case, and following the book you cited, let $k$ be the number of elements of the vector $vecx=(x_1,ldots,x_n)$ such that $||x_i|| geq a > 0$.
Hence $||vecx||^2 = sum x_i^2 geq k a^2 + (n - k) times 0$, which means that we have $k$ values larger than $a^2$ and the others $n-k$ values are at least zero.
Since the root mean square value is $rms(vecx) = sqrtfracn$, it follows that $rms(vecx)^2 = fracn geq frac k a^2n$.
Therefore, we get the final expression that says
$$
frac kn leq left( fracrms(vecx)a right) ^2
$$
So, following the example, where $a = 5 rms(vecx)$, we have that $frac kn leq left( frac15 right) ^2 = 4 %$, so, the fraction of elements of the vector larger (in absolute value) than $5 rms$ is at most $4%$.
If we chose another number, say $a = 2 rms(vecx)$, we would have that $frac kn leq left( frac12 right) ^2 = 25 %$.
$endgroup$
add a comment |
$begingroup$
According to Chebyshev's_inequality, the probability of a value to deviate more than $k=5$ standard deviations from the mean is at most $1/k^2$.
When applied to vectors in your specific case, and following the book you cited, let $k$ be the number of elements of the vector $vecx=(x_1,ldots,x_n)$ such that $||x_i|| geq a > 0$.
Hence $||vecx||^2 = sum x_i^2 geq k a^2 + (n - k) times 0$, which means that we have $k$ values larger than $a^2$ and the others $n-k$ values are at least zero.
Since the root mean square value is $rms(vecx) = sqrtfracn$, it follows that $rms(vecx)^2 = fracn geq frac k a^2n$.
Therefore, we get the final expression that says
$$
frac kn leq left( fracrms(vecx)a right) ^2
$$
So, following the example, where $a = 5 rms(vecx)$, we have that $frac kn leq left( frac15 right) ^2 = 4 %$, so, the fraction of elements of the vector larger (in absolute value) than $5 rms$ is at most $4%$.
If we chose another number, say $a = 2 rms(vecx)$, we would have that $frac kn leq left( frac12 right) ^2 = 25 %$.
$endgroup$
According to Chebyshev's_inequality, the probability of a value to deviate more than $k=5$ standard deviations from the mean is at most $1/k^2$.
When applied to vectors in your specific case, and following the book you cited, let $k$ be the number of elements of the vector $vecx=(x_1,ldots,x_n)$ such that $||x_i|| geq a > 0$.
Hence $||vecx||^2 = sum x_i^2 geq k a^2 + (n - k) times 0$, which means that we have $k$ values larger than $a^2$ and the others $n-k$ values are at least zero.
Since the root mean square value is $rms(vecx) = sqrtfracn$, it follows that $rms(vecx)^2 = fracn geq frac k a^2n$.
Therefore, we get the final expression that says
$$
frac kn leq left( fracrms(vecx)a right) ^2
$$
So, following the example, where $a = 5 rms(vecx)$, we have that $frac kn leq left( frac15 right) ^2 = 4 %$, so, the fraction of elements of the vector larger (in absolute value) than $5 rms$ is at most $4%$.
If we chose another number, say $a = 2 rms(vecx)$, we would have that $frac kn leq left( frac12 right) ^2 = 25 %$.
answered 1 hour ago
ErtxiemErtxiem
30718
30718
add a comment |
add a comment |
H. Yong is a new contributor. Be nice, and check out our Code of Conduct.
H. Yong is a new contributor. Be nice, and check out our Code of Conduct.
H. Yong is a new contributor. Be nice, and check out our Code of Conduct.
H. Yong is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Cross Validated!
- 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%2fstats.stackexchange.com%2fquestions%2f403846%2fchebyshev-inequality-in-terms-of-rms%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