Mdthbs

How would a mousetrap for use in space work?

How could we fake a moon landing now?

How fail-safe is nr as stop bytes?

Why do we need to use the builder design pattern when we can do the same thing with setters?

The code below, is it ill-formed NDR or is it well formed?

Why is my ESD wriststrap failing with nitrile gloves on?

Illegal assignment from sObject to Id

Take 2! Is this homebrew Lady of Pain warlock patron balanced?

Does the Weapon Master feat grant you a fighting style?

If Windows 7 doesn't support WSL, then what does Linux subsystem option mean?

Is there any word for a place full of confusion?

Putting class ranking in CV, but against dept guidelines

What is a fractional matching?

What's the meaning of "fortified infraction restraint"?

Should I use a zero-interest credit card for a large one-time purchase?

What does it mean that physics no longer uses mechanical models to describe phenomena?

Project Euler #1 in C++

What was the first language to use conditional keywords?

Is CEO the "profession" with the most psychopaths?

Do I really need to have a message in a novel to appeal to readers?

Dating a Former Employee

Do any jurisdictions seriously consider reclassifying social media websites as publishers?

An adverb for when you're not exaggerating

Can a new player join a group only when a new campaign starts?

Chebyshev inequality in terms of RMS

.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ margin-bottom:0;
}

3

$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

share|cite|improve this question

asked 7 hours ago

H. YongH. Yong

162

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 | 

3

$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

share|cite|improve this question

asked 7 hours ago

H. YongH. Yong

162

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

share|cite|improve this question

asked 7 hours ago

H. YongH. Yong

162

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$

share|cite|improve this question

asked 7 hours ago

H. YongH. Yong

162

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.

share|cite|improve this question

asked 7 hours ago

H. YongH. Yong

162

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 7 hours ago

H. YongH. Yong

162

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 7 hours ago

H. YongH. Yong

162

1 Answer
1

active

oldest

votes

4

$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 $vec{x}=(x_1,ldots,x_n)$ such that $||x_i|| geq a > 0$.

Hence $|vec{x}|^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 $operatorname{rms}(vec{x}) = sqrt{frac{|vec{x}|^2}{n}}$, it follows that $operatorname{rms}(vec{x})^2 = frac{|vec{x}|^2}{n} geq frac {k a^2}{n}$.

Therefore, we get the final expression that says

$$frac {k}{n} leq left( frac{operatorname{rms}(vec{x})}{a} right) ^2$$

So, following the example, where $a = 5 operatorname{rms}(vec{x})$, we have that $frac {k}{n} leq left( frac{1}{5} right) ^2 = 4 %$, so, the fraction of elements of the vector larger (in absolute value) than $5operatorname{rms}$ is at most $4%$.

If we chose another number, say $a = 2 operatorname{rms}(vec{x})$, we would have that $frac {k}{n} leq left( frac{1}{2} right) ^2 = 25 %$.

share|cite|improve this answer

edited 2 hours ago

StubbornAtom

3,1361535

answered 6 hours ago

ErtxiemErtxiem

31718

$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.

draft saved

draft discarded

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

Name

Email

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

Name

Email

Required, but never shown

4

$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 $vec{x}=(x_1,ldots,x_n)$ such that $||x_i|| geq a > 0$.

Hence $|vec{x}|^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 $operatorname{rms}(vec{x}) = sqrt{frac{|vec{x}|^2}{n}}$, it follows that $operatorname{rms}(vec{x})^2 = frac{|vec{x}|^2}{n} geq frac {k a^2}{n}$.

Therefore, we get the final expression that says

$$frac {k}{n} leq left( frac{operatorname{rms}(vec{x})}{a} right) ^2$$

So, following the example, where $a = 5 operatorname{rms}(vec{x})$, we have that $frac {k}{n} leq left( frac{1}{5} right) ^2 = 4 %$, so, the fraction of elements of the vector larger (in absolute value) than $5operatorname{rms}$ is at most $4%$.

If we chose another number, say $a = 2 operatorname{rms}(vec{x})$, we would have that $frac {k}{n} leq left( frac{1}{2} right) ^2 = 25 %$.

share|cite|improve this answer

edited 2 hours ago

StubbornAtom

3,1361535

answered 6 hours ago

ErtxiemErtxiem

31718

$endgroup$

add a comment | 

4

$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 $vec{x}=(x_1,ldots,x_n)$ such that $||x_i|| geq a > 0$.

Hence $|vec{x}|^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 $operatorname{rms}(vec{x}) = sqrt{frac{|vec{x}|^2}{n}}$, it follows that $operatorname{rms}(vec{x})^2 = frac{|vec{x}|^2}{n} geq frac {k a^2}{n}$.

Therefore, we get the final expression that says

$$frac {k}{n} leq left( frac{operatorname{rms}(vec{x})}{a} right) ^2$$

So, following the example, where $a = 5 operatorname{rms}(vec{x})$, we have that $frac {k}{n} leq left( frac{1}{5} right) ^2 = 4 %$, so, the fraction of elements of the vector larger (in absolute value) than $5operatorname{rms}$ is at most $4%$.

If we chose another number, say $a = 2 operatorname{rms}(vec{x})$, we would have that $frac {k}{n} leq left( frac{1}{2} right) ^2 = 25 %$.

share|cite|improve this answer

edited 2 hours ago

StubbornAtom

3,1361535

answered 6 hours ago

ErtxiemErtxiem

31718

$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 $vec{x}=(x_1,ldots,x_n)$ such that $||x_i|| geq a > 0$.

Hence $|vec{x}|^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 $operatorname{rms}(vec{x}) = sqrt{frac{|vec{x}|^2}{n}}$, it follows that $operatorname{rms}(vec{x})^2 = frac{|vec{x}|^2}{n} geq frac {k a^2}{n}$.

Therefore, we get the final expression that says

$$frac {k}{n} leq left( frac{operatorname{rms}(vec{x})}{a} right) ^2$$

So, following the example, where $a = 5 operatorname{rms}(vec{x})$, we have that $frac {k}{n} leq left( frac{1}{5} right) ^2 = 4 %$, so, the fraction of elements of the vector larger (in absolute value) than $5operatorname{rms}$ is at most $4%$.

If we chose another number, say $a = 2 operatorname{rms}(vec{x})$, we would have that $frac {k}{n} leq left( frac{1}{2} right) ^2 = 25 %$.

share|cite|improve this answer

edited 2 hours ago

StubbornAtom

3,1361535

answered 6 hours ago

ErtxiemErtxiem

31718

$endgroup$

share|cite|improve this answer

edited 2 hours ago

StubbornAtom

3,1361535

answered 6 hours ago

ErtxiemErtxiem

31718

edited 2 hours ago

StubbornAtom

3,1361535

edited 2 hours ago

StubbornAtom

3,1361535

answered 6 hours ago

ErtxiemErtxiem

31718

answered 6 hours ago

ErtxiemErtxiem

31718