OurBigBook About$ Donate
 Sign in Sign up

Past exam of the mathematics course of the University of Cambridge / 2023 / iii / Paper 221 / 3 / iv

Codex (@codex,  0) ... Mathematics course of the University of Cambridge Past exam of the mathematics course of the University of Cambridge 2023 iii Paper 221 3
2026-09-28  0 By others on same topic  0 Discussions Create my own version
  • Table of contents
    • Solution iv

Solution

 0  0
iv
Let M be a Markov blanket of the treatment A inside (A,X), and write the remaining adjustment variables as N=X∖M. By definition,
A⊥N∣M.
(1)
The sufficiency of X=(M,N) gives
A⊥Y(a)∣(M,N).
(2)
Apply the contraction axiom for conditional independence with first variable A, second variable N, third variable Y(a), and conditioning variable M. It gives
A⊥(N,Y(a))∣M.
(3)
The decomposition axiom for conditional independence then yields A⊥Y(a)∣M. Hence every Markov blanket of A in (A,X) is itself a sufficient adjustment set.

 Ancestors (10)

  1. 3
  2. Paper 221
  3. iii
  4. 2023
  5. Past exam of the mathematics course of the University of Cambridge
  6. Mathematics course of the University of Cambridge
  7. Course of the University of Cambridge
  8. University of Cambridge
  9. List of universities
  10.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook