Prove if two variables are conditionally independent












0












$begingroup$


I have 4 random variables A, B, C, D.
I know that the joint is
$$p(A,B,C,D) = p(A)p(B|C,A)p(C)p(D|B,C) $$
And I want to prove (if true) that
$$ A perp D | B $$



I have tried this:
$$p(A,D,B) = sum_C p(A,B,C,D)
= sum_C p(A)p(B|C,A)p(C)p(D|B,C)
= sum_C p(A)p(B,C|A)p(D,C|B)
= p(A)p(B|A)p(D|B)$$

Then
$$p(A,D|B) = frac{p(A,D,B)}{p(B)} = frac{p(A)p(B|A)}{p(B)}p(D|B) = p(A|B) p(D|B)$$
My question is: is the marginalization correct? I know it works for $p(X)=sum_Y p(X,Y)$, but does it work in the same way in this case?










share|cite|improve this question









$endgroup$












  • $begingroup$
    If you are asking about the step $$p(A,D,B) = sum_C p(A,B,C,D) $$ then yes, it is rock solid.
    $endgroup$
    – Did
    Dec 7 '18 at 13:58










  • $begingroup$
    The whole step? So $p(A,D,B) = p(A)p(B|A)p(D|B)$ ? I am not sure because maybe forobtaining those 2 joints $p(B,C|A)p(D,C|B)$ we would need two $p(C)$ and not only one?
    $endgroup$
    – Xemnas
    Dec 7 '18 at 16:44
















0












$begingroup$


I have 4 random variables A, B, C, D.
I know that the joint is
$$p(A,B,C,D) = p(A)p(B|C,A)p(C)p(D|B,C) $$
And I want to prove (if true) that
$$ A perp D | B $$



I have tried this:
$$p(A,D,B) = sum_C p(A,B,C,D)
= sum_C p(A)p(B|C,A)p(C)p(D|B,C)
= sum_C p(A)p(B,C|A)p(D,C|B)
= p(A)p(B|A)p(D|B)$$

Then
$$p(A,D|B) = frac{p(A,D,B)}{p(B)} = frac{p(A)p(B|A)}{p(B)}p(D|B) = p(A|B) p(D|B)$$
My question is: is the marginalization correct? I know it works for $p(X)=sum_Y p(X,Y)$, but does it work in the same way in this case?










share|cite|improve this question









$endgroup$












  • $begingroup$
    If you are asking about the step $$p(A,D,B) = sum_C p(A,B,C,D) $$ then yes, it is rock solid.
    $endgroup$
    – Did
    Dec 7 '18 at 13:58










  • $begingroup$
    The whole step? So $p(A,D,B) = p(A)p(B|A)p(D|B)$ ? I am not sure because maybe forobtaining those 2 joints $p(B,C|A)p(D,C|B)$ we would need two $p(C)$ and not only one?
    $endgroup$
    – Xemnas
    Dec 7 '18 at 16:44














0












0








0





$begingroup$


I have 4 random variables A, B, C, D.
I know that the joint is
$$p(A,B,C,D) = p(A)p(B|C,A)p(C)p(D|B,C) $$
And I want to prove (if true) that
$$ A perp D | B $$



I have tried this:
$$p(A,D,B) = sum_C p(A,B,C,D)
= sum_C p(A)p(B|C,A)p(C)p(D|B,C)
= sum_C p(A)p(B,C|A)p(D,C|B)
= p(A)p(B|A)p(D|B)$$

Then
$$p(A,D|B) = frac{p(A,D,B)}{p(B)} = frac{p(A)p(B|A)}{p(B)}p(D|B) = p(A|B) p(D|B)$$
My question is: is the marginalization correct? I know it works for $p(X)=sum_Y p(X,Y)$, but does it work in the same way in this case?










share|cite|improve this question









$endgroup$




I have 4 random variables A, B, C, D.
I know that the joint is
$$p(A,B,C,D) = p(A)p(B|C,A)p(C)p(D|B,C) $$
And I want to prove (if true) that
$$ A perp D | B $$



I have tried this:
$$p(A,D,B) = sum_C p(A,B,C,D)
= sum_C p(A)p(B|C,A)p(C)p(D|B,C)
= sum_C p(A)p(B,C|A)p(D,C|B)
= p(A)p(B|A)p(D|B)$$

Then
$$p(A,D|B) = frac{p(A,D,B)}{p(B)} = frac{p(A)p(B|A)}{p(B)}p(D|B) = p(A|B) p(D|B)$$
My question is: is the marginalization correct? I know it works for $p(X)=sum_Y p(X,Y)$, but does it work in the same way in this case?







independence conditional-probability bayes-theorem






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 7 '18 at 12:56









XemnasXemnas

11




11












  • $begingroup$
    If you are asking about the step $$p(A,D,B) = sum_C p(A,B,C,D) $$ then yes, it is rock solid.
    $endgroup$
    – Did
    Dec 7 '18 at 13:58










  • $begingroup$
    The whole step? So $p(A,D,B) = p(A)p(B|A)p(D|B)$ ? I am not sure because maybe forobtaining those 2 joints $p(B,C|A)p(D,C|B)$ we would need two $p(C)$ and not only one?
    $endgroup$
    – Xemnas
    Dec 7 '18 at 16:44


















  • $begingroup$
    If you are asking about the step $$p(A,D,B) = sum_C p(A,B,C,D) $$ then yes, it is rock solid.
    $endgroup$
    – Did
    Dec 7 '18 at 13:58










  • $begingroup$
    The whole step? So $p(A,D,B) = p(A)p(B|A)p(D|B)$ ? I am not sure because maybe forobtaining those 2 joints $p(B,C|A)p(D,C|B)$ we would need two $p(C)$ and not only one?
    $endgroup$
    – Xemnas
    Dec 7 '18 at 16:44
















$begingroup$
If you are asking about the step $$p(A,D,B) = sum_C p(A,B,C,D) $$ then yes, it is rock solid.
$endgroup$
– Did
Dec 7 '18 at 13:58




$begingroup$
If you are asking about the step $$p(A,D,B) = sum_C p(A,B,C,D) $$ then yes, it is rock solid.
$endgroup$
– Did
Dec 7 '18 at 13:58












$begingroup$
The whole step? So $p(A,D,B) = p(A)p(B|A)p(D|B)$ ? I am not sure because maybe forobtaining those 2 joints $p(B,C|A)p(D,C|B)$ we would need two $p(C)$ and not only one?
$endgroup$
– Xemnas
Dec 7 '18 at 16:44




$begingroup$
The whole step? So $p(A,D,B) = p(A)p(B|A)p(D|B)$ ? I am not sure because maybe forobtaining those 2 joints $p(B,C|A)p(D,C|B)$ we would need two $p(C)$ and not only one?
$endgroup$
– Xemnas
Dec 7 '18 at 16:44










0






active

oldest

votes











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3029870%2fprove-if-two-variables-are-conditionally-independent%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
















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3029870%2fprove-if-two-variables-are-conditionally-independent%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Wiesbaden

Marschland

Dieringhausen