Probability Distribution verification
$begingroup$
a probability distribution must satisfy two conditions
1- the probability of each value of the random variable is between 0 and 1.
2- the sum over all the probabilities is equal to 1.
I think to exclude all the zero's mass probability, I should take the summation over all the support of x,y,z.
Can anyone please help me in how to write the verification. I know the concept but donot know how to write it.
Thanks
probability probability-distributions
$endgroup$
add a comment |
$begingroup$
a probability distribution must satisfy two conditions
1- the probability of each value of the random variable is between 0 and 1.
2- the sum over all the probabilities is equal to 1.
I think to exclude all the zero's mass probability, I should take the summation over all the support of x,y,z.
Can anyone please help me in how to write the verification. I know the concept but donot know how to write it.
Thanks
probability probability-distributions
$endgroup$
$begingroup$
Are you trying to write software? What does it mean to “write the verification”?
$endgroup$
– NicNic8
Jan 14 at 2:40
$begingroup$
I mean the answer to the question as a proof
$endgroup$
– Salwa Mostafa
Jan 14 at 2:52
add a comment |
$begingroup$
a probability distribution must satisfy two conditions
1- the probability of each value of the random variable is between 0 and 1.
2- the sum over all the probabilities is equal to 1.
I think to exclude all the zero's mass probability, I should take the summation over all the support of x,y,z.
Can anyone please help me in how to write the verification. I know the concept but donot know how to write it.
Thanks
probability probability-distributions
$endgroup$
a probability distribution must satisfy two conditions
1- the probability of each value of the random variable is between 0 and 1.
2- the sum over all the probabilities is equal to 1.
I think to exclude all the zero's mass probability, I should take the summation over all the support of x,y,z.
Can anyone please help me in how to write the verification. I know the concept but donot know how to write it.
Thanks
probability probability-distributions
probability probability-distributions
asked Jan 14 at 1:54
Salwa MostafaSalwa Mostafa
274
274
$begingroup$
Are you trying to write software? What does it mean to “write the verification”?
$endgroup$
– NicNic8
Jan 14 at 2:40
$begingroup$
I mean the answer to the question as a proof
$endgroup$
– Salwa Mostafa
Jan 14 at 2:52
add a comment |
$begingroup$
Are you trying to write software? What does it mean to “write the verification”?
$endgroup$
– NicNic8
Jan 14 at 2:40
$begingroup$
I mean the answer to the question as a proof
$endgroup$
– Salwa Mostafa
Jan 14 at 2:52
$begingroup$
Are you trying to write software? What does it mean to “write the verification”?
$endgroup$
– NicNic8
Jan 14 at 2:40
$begingroup$
Are you trying to write software? What does it mean to “write the verification”?
$endgroup$
– NicNic8
Jan 14 at 2:40
$begingroup$
I mean the answer to the question as a proof
$endgroup$
– Salwa Mostafa
Jan 14 at 2:52
$begingroup$
I mean the answer to the question as a proof
$endgroup$
– Salwa Mostafa
Jan 14 at 2:52
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Since $p(x,y,z) geq 0$ by definition the only thing you have to prove is that $sum_{x,y,z} p(x,y,z)=1$. First take the sum over $x$. Since $sum_x frac {p(x,y)} {p(y)}=1$ we are left with the proof of $sum_{y,z} p(y,z)=1$ which is clear.
$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%2f3072761%2fprobability-distribution-verification%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$
Since $p(x,y,z) geq 0$ by definition the only thing you have to prove is that $sum_{x,y,z} p(x,y,z)=1$. First take the sum over $x$. Since $sum_x frac {p(x,y)} {p(y)}=1$ we are left with the proof of $sum_{y,z} p(y,z)=1$ which is clear.
$endgroup$
add a comment |
$begingroup$
Since $p(x,y,z) geq 0$ by definition the only thing you have to prove is that $sum_{x,y,z} p(x,y,z)=1$. First take the sum over $x$. Since $sum_x frac {p(x,y)} {p(y)}=1$ we are left with the proof of $sum_{y,z} p(y,z)=1$ which is clear.
$endgroup$
add a comment |
$begingroup$
Since $p(x,y,z) geq 0$ by definition the only thing you have to prove is that $sum_{x,y,z} p(x,y,z)=1$. First take the sum over $x$. Since $sum_x frac {p(x,y)} {p(y)}=1$ we are left with the proof of $sum_{y,z} p(y,z)=1$ which is clear.
$endgroup$
Since $p(x,y,z) geq 0$ by definition the only thing you have to prove is that $sum_{x,y,z} p(x,y,z)=1$. First take the sum over $x$. Since $sum_x frac {p(x,y)} {p(y)}=1$ we are left with the proof of $sum_{y,z} p(y,z)=1$ which is clear.
answered Jan 14 at 6:05
Kavi Rama MurthyKavi Rama Murthy
68.9k53169
68.9k53169
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%2f3072761%2fprobability-distribution-verification%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$
Are you trying to write software? What does it mean to “write the verification”?
$endgroup$
– NicNic8
Jan 14 at 2:40
$begingroup$
I mean the answer to the question as a proof
$endgroup$
– Salwa Mostafa
Jan 14 at 2:52