How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Counterfactual identities under the front-door conditions
Statement
Assume AC and a finite Markovian recursive SCM on a full DAG with pairwise distinct observed vertices and any number of latent vertices. Suppose: (i) every directed path from to contains ; (ii) and are d-separated by the empty set in ; and (iii) d-separates and in . For each supplied value , let be the response under . Define where ancestry includes the vertex itself and is the finite vector of exogenous coordinates . Then is measurable with respect to , each response is measurable with respect to , and The recursive responses also satisfy almost surely. The conditional independence is for the factual law; it supplies a genuine conditional product law for the exogenous coordinates used by the outcome response.
Facts & Assumptions
Given: The Markovian recursive SCM, its finite full DAG, and the three graph conditions in the statement.
Under intervention, recursion makes each response a measurable function of the exogenous coordinates at its nonintervened ancestors. The full law factors over a DAG after independent exogenous coordinates are added as roots. Recursive structural causal models on finite DAGs, A Markovian recursive SCM has a topological kernel factorization
D-separation in a finite DAG-kernel factorization implies conditional independence. DAG factorization implies the global Markov property
Disjoint subfamilies of a finite mutually independent exogenous family are independent. Independent random elements, Independent random elements have product joint law
Conditional independence has the bounded-function factorization meaning under the stated AC assumption. Conditional independence given a sigma-algebra, The Axiom of Choice
Proof
Given: The hypotheses in the statement.
Let , including . By recursive substitution, is measurable with respect to ; under , the equation at is replaced, so is measurable with respect to . Under , the equation at is replaced, so is measurable with respect to . These claims follow by induction in the finite topological order: an endogenous value depends only on the exogenous coordinates at vertices with directed paths to it in the relevant mutilated graph.
Suppose . Since , there are directed paths in and in ; the latter avoids . Take the last common vertex of these paths in a topological ordering. Their suffixes are disjoint, so they form a simple fork path with no internal collider. It is retained in , because the path uses no arrow out of its endpoint , and is active given the empty set. This contradicts (ii), so .
Suppose . There are directed paths in and in . The first path avoids . The second avoids ; it also avoids , since otherwise its segment would be a directed -to- path avoiding , contrary to (i). Take the last common vertex of the paths. Their suffixes form a simple fork path with no internal collider and no internal . It lies in and is active given , contradicting (iii). Thus .
Fix . There is a directed path from to in . It avoids by definition and avoids , because an occurrence of would leave a directed -to- suffix avoiding , contrary to (i). Thus is retained in . If an active path from to given existed there, choose the last vertex of that also lies on when is traversed from to . Keep the prefix of from to and append the directed suffix of from to . The suffix after is disjoint from the prefix by the choice of , so this is a path. Its old internal vertices remain active; and the outgoing directed edge makes it a noncollider; all new internal vertices are noncolliders outside . This would be an active path from to given , contradicting (iii). Hence d-separates and in . In the expanded graph each added root has only one skeleton neighbor, its own equation vertex, so a simple path cannot contain a root internally. An active path ending at would therefore have penultimate vertex ; deleting its last edge leaves an active path from to (or ). The latter case is excluded by , and the former was just excluded. Adding roots does not create new directed descendants of endogenous vertices, so the remaining collider-activity tests are unchanged. Thus also d-separates and the whole root set in the expanded graph with arrows out of deleted.
By [F3], the disjoint exogenous vectors and are independent. Step 1.1 makes and factual measurable functions of these respective vectors, so .
The finite vectors and are independent by [F3]. By step 1.1, and the response family are measurable functions of these disjoint vectors; in particular .
Adjoin all exogenous coordinates as independent root vertices. In the factual law, no strict descendant of is an ancestor of : it cannot be an ancestor of an exogenous root, and if it were an ancestor of , the directed path from to would remain in and contradict (ii). Reverse-topological integration therefore marginalizes all other vertices and leaves the joint law of factored on its ancestral subgraph, which has no outgoing edge from . This is a subgraph of the expanded mutilated graph in step 1.4, so the separation there still holds. The global Markov implication [F2], interpreted by the conditional-independence definition [F4], gives .
In there is no directed path from to , since every directed -to- path in contains and arrows into were deleted. With fixed, changing the equation at therefore cannot change by recursive substitution: any directed route by which could affect would have to reach the fixed node . Under , the mediator equals . Replacing the mediator equation by that same realized value leaves every other equation unchanged; the no-directed-path argument shows that leaving factual has no further effect on . Thus .
Depends on
- Recursive structural causal models on finite DAGs
- Paths, active paths, and d-separation in a finite DAG
- A Markovian recursive SCM has a topological kernel factorization
- DAG factorization implies the global Markov property
- Independent random elements
- Independent random elements have product joint law
- Conditional independence given a sigma-algebra
- The Axiom of Choice
Used by
Dependency tree · two levels
32 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Judea Pearl, Causal Diagrams for Empirical Research, §3-2, pp. 675–676 (standard reference, not scraped)
- Miguel A. Hernán and James M. Robins, Causal Inference: What If, Technical Point 7.4, p. 101 (standard reference, not scraped)