Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 A,M,Y and any number of latent vertices. Suppose: (i) every directed path from A to Y contains M; (ii) A and M are d-separated by the empty set in GA‾; and (iii) A d-separates M and Y in GM‾. For each supplied value a∈SA, let Ma be the response under do(A=a). Define IM=An⁡GA‾(M)∖{A},IY=An⁡GM‾(Y)∖{M}, where ancestry includes the vertex itself and UI is the finite vector of exogenous coordinates (Uv)v∈I. Then Ma is measurable with respect to σ(UIM), each response Ym is measurable with respect to σ(UIY), and Ma⊥ ⁣ ⁣ ⁣⊥A,IM∩IY=∅,Ma⊥ ⁣ ⁣ ⁣⊥UIY,M⊥ ⁣ ⁣ ⁣⊥UIY∣A. The recursive responses also satisfy Ya=YMa 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.

[F1]

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

[F2]

D-separation in a finite DAG-kernel factorization implies conditional independence. DAG factorization implies the global Markov property

[F3]

Disjoint subfamilies of a finite mutually independent exogenous family are independent. Independent random elements, Independent random elements have product joint law

[F4]

Conditional independence has the bounded-function factorization meaning under the stated AC assumption. Conditional independence given a sigma-algebra, The Axiom of Choice

Proof

technique · identify the exogenous coordinates used by each intervention, separate those coordinates with the front-door path conditions, and apply the global Markov implication to the factual mediator and the outcome-side roots

Given: The hypotheses in the statement.

1.1F1giveninduction

Let IA=An⁡G(A), including A. By recursive substitution, A is measurable with respect to UIA; under do(A=a), the equation at A is replaced, so Ma is measurable with respect to UIM. Under do(M=m), the equation at M is replaced, so Ym is measurable with respect to UIY. 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.

1.2givenconstruct

Suppose v∈IM∩IA. Since v≠A, there are directed paths v→⋯→A in G and v→⋯→M in GA‾; the latter avoids A. Take the last common vertex w of these paths in a topological ordering. Their suffixes are disjoint, so they form a simple fork path A←⋯←w→⋯→M with no internal collider. It is retained in GA‾, because the path uses no arrow out of its endpoint A, and is active given the empty set. This contradicts (ii), so IM∩IA=∅.

1.3givenconstruct

Suppose v∈IM∩IY. There are directed paths v→⋯→M in GA‾ and v→⋯→Y in GM‾. The first path avoids A. The second avoids M; it also avoids A, since otherwise its segment A→⋯→Y would be a directed A-to-Y path avoiding M, contrary to (i). Take the last common vertex w of the paths. Their suffixes form a simple fork path M←⋯←w→⋯→Y with no internal collider and no internal A. It lies in GM‾ and is active given {A}, contradicting (iii). Thus IM∩IY=∅.

1.4givenF2construct

Fix v∈IY. There is a directed path q from v to Y in GM‾. It avoids M by definition and avoids A, because an occurrence of A would leave a directed A-to-Y suffix avoiding M, contrary to (i). Thus q is retained in GM‾. If an active path p from M to v given {A} existed there, choose the last vertex w of p that also lies on q when q is traversed from v to Y. Keep the prefix of p from M to w and append the directed suffix of q from w to Y. The suffix after w is disjoint from the prefix by the choice of w, so this is a path. Its old internal vertices remain active; w∉A and the outgoing directed edge makes it a noncollider; all new internal vertices are noncolliders outside A. This would be an active path from M to Y given A, contradicting (iii). Hence A d-separates M and v in GM‾. 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 Uv would therefore have penultimate vertex v; deleting its last edge leaves an active path from M to v (or v=M). The latter case is excluded by M∉IY, 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 A also d-separates M and the whole root set UIY in the expanded graph with arrows out of M deleted.

2.1F3step 1.1step 1.2

By [F3], the disjoint exogenous vectors UIM and UIA are independent. Step 1.1 makes Ma and factual A measurable functions of these respective vectors, so Ma⊥A.

2.2F3step 1.1step 1.3

The finite vectors UIM and UIY are independent by [F3]. By step 1.1, Ma and the response family (Ym)m∈SM are measurable functions of these disjoint vectors; in particular Ma⊥UIY.

2.3F1F2F4step 1.4given

Adjoin all exogenous coordinates as independent root vertices. In the factual law, no strict descendant of M is an ancestor of (M,A,UIY): it cannot be an ancestor of an exogenous root, and if it were an ancestor of A, the directed path from M to A would remain in GA‾ and contradict (ii). Reverse-topological integration therefore marginalizes all other vertices and leaves the joint law of (M,A,UIY) factored on its ancestral subgraph, which has no outgoing edge from M. 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 M⊥UIY∣A.

3.1F1giveninduction∎

In GM‾ there is no directed path from A to Y, since every directed A-to-Y path in G contains M and arrows into M were deleted. With M fixed, changing the equation at A therefore cannot change Y by recursive substitution: any directed route by which A could affect Y would have to reach the fixed node M. Under do(A=a), the mediator equals Ma. Replacing the mediator equation by that same realized value leaves every other equation unchanged; the no-directed-path argument shows that leaving A factual has no further effect on Y. Thus Ya=YMa.

Depends on

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