The rules apply to a causal graph \mathcal{G} and assume the
Markov condition holds:
Rule 1: Insertion/deletion of observations : P(y \mid \mathrm{do}(x), z, w) = P(y \mid \mathrm{do}(x), w) \quad \text{if } Y \perp\!\!\!\perp Z \mid X, W \text{ in } \mathcal{G}_{\overline{X}} This rule allows the removal of irrelevant observations (Z) if they are
d-separated from Y given X and W in the graph where incoming edges to X are removed.
Rule 2: Action/observation exchange : P(y \mid \mathrm{do}(x), \mathrm{do}(z), w) = P(y \mid \mathrm{do}(x), z, w) \quad \text{if } Y \perp\!\!\!\perp Z \mid X, W \text{ in } \mathcal{G}_{\overline{X}\, \underline{Z}} This rule permits replacing an intervention (\mathrm{do}(z)) with an observation (z) if Y and Z are
d-separated in the graph where outgoing edges from Z and incoming edges to X are removed.
Rule 3: Insertion/deletion of interventions : P(y \mid \mathrm{do}(x), \mathrm{do}(z), w) = P(y \mid \mathrm{do}(x), w) \quad \text{if } Y \perp\!\!\!\perp Z \mid X, W \text{ in } \mathcal{G}_{\overline{X}\, \overline{Z(W)}} This rule removes irrelevant interventions (\mathrm{do}(z)) if Y and Z are
d-separated in a graph modified to block paths through Z. == Applications ==