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.
Additive-noise causal discovery and identifiability
1 · Prerequisites
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Filters and Ultrafilters
- Foundations of the Real Numbers for Analysis
- Independence Borel Cantelli and Zero One Laws
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Outward rounded interval and ball arithmetic
- Pointwise Extended-Real Function Products
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- SCM, DAGs, adjustment
- Sequences and Limits
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Lebesgue Integral and the Convergence Theorems
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Logical flowchart
3 · Definitions, theorems and proofs
Continuous additive-noise models on finite DAGs
Definition
Fix a nonempty finite directed acyclic graph with a specified topological order ; every arrow points from an earlier to a later vertex. For , let be its parent set, and let be the vertices other than that are not descendants of . A continuous additive-noise model on consists of real random variables on a common probability space and continuous Borel functions such that recursively in the topological order. The finite family of noises is mutually independent, and each has a strictly positive Lebesgue density . All vertices of are observed; no latent vertices are omitted from the model. The observational law is the law of the vector .
The model is causally minimal when every parent input is essential: for each edge , there are values of the other parent coordinates and two distinct real values of the -coordinate at which takes different values. A root has no parent-coordinate minimality condition.
Definition references
Recursive structural causal models on finite DAGs
Descendants and nondescendants in a finite DAG
Mutually independent random elements
The law of the observed random vector
Peters et al., JMLR (2014), Definition 16 and Proposition 17
Peters, Janzing, and Schölkopf, Elements of Causal Inference, §4.1.4
Assaad, Devijver, and Gaussier, course notes (2023), slides 22–23 and 29–31
A probability measure on the line has no nonzero translation period
Statement
Let be a Borel probability measure on . If a real number satisfies for every Borel set , then .
Statement references
Facts & Assumptions
Given: A Borel probability measure on and an such that for every Borel set .
A probability measure is countably additive and has total mass one. Probability measures and probability spaces
is the translate of . Translation of a subset of
The real line is a complete ordered field, hence its positive reals satisfy the Archimedean property. Dedekind-complete ordered real field, Every complete ordered field is Archimedean
Proof
Given: The objects and hypotheses in the Statement.
Suppose and put . Invariance under translation by implies invariance under translation by : when , apply the given identity to . The half-open intervals , , partition and are translates of , so they all have the same measure .
If , choose a natural by [F3]. The first intervals are disjoint, so finite additivity gives , a contradiction. Hence .
Countable additivity over the partition now gives , again a contradiction. Therefore .
References
A smooth independent residual gives a pointwise density factorization
Statement
Let be a finite-dimensional real random vector, let have a strictly positive joint density , and let be . If is independent of , then there are strictly positive Lebesgue density versions and such that for every .
Statement references
Facts & Assumptions
Given: The random vector, density, function and independence assumption in the Statement.
Translation preserves Lebesgue measure and Lebesgue measurability. Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation
Independent random elements have product joint law. Independent random elements have product joint law
Nonnegative product-measurable functions can be integrated by iterated sections in any finite coordinate order. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Proof
Given: The hypotheses in the Statement.
The coordinate change is a translation in each fixed -section. By [F1] and iterated integration [F3], the law of has density . Since and are and , is a strictly positive function.
Independence and [F2] make the law with density from step 1.1 the product of the marginal laws of and . Tonelli [F3] gives marginal density versions, and therefore almost everywhere. Choose for which and this equality holds for almost every . Then almost everywhere, so this formula supplies a strictly positive version of .
By Fubini choose with such that for almost every . Set . This is a strictly positive function and equals almost everywhere. Thus almost everywhere; both sides are continuous, so the equality holds everywhere.
Substituting into step 3.1 yields for every . Renaming as proves the Statement.
RESIT: regression with subsequent independence testing
Definition
Fix a finite nonempty ordered vertex set and a population law of a real vector generated by an additive-noise model. A population regression rule assigns to each target and predictor set a Borel function . A perfect independence oracle returns “independent” exactly when the tested random variable and random vector are independent under this population law. For a given ANM, is population-consistent on that model if for every and every with , there is a constant such that This consistency condition concerns only the population regression target and does not assert a finite-sample guarantee. The procedure itself is defined for any supplied regression rule and oracle.
RESIT takes , , and the perfect independence oracle and performs the following steps, using a fixed total order on for every tie and loop order.
- Set the remaining set and an empty sink list. While ,
for each form
Retain the vertices for which the oracle declares
independent of . If there is no such vertex,
return
failure. Otherwise choose the least retained vertex , record the provisional parent set , append to the sink list, and remove from . - Reverse the sink list to obtain an order . In that order, for each vertex and each candidate in its provisional parent set, in the fixed order, let and form If the oracle declares independent of the vector of all vertices preceding in , delete from ; otherwise retain it.
- Return the DAG with arrow exactly when after pruning.
Positive joint density of a finite additive-noise model
Statement
Let a finite additive-noise model have topological order , equations , and strictly positive Lebesgue densities for its mutually independent noises. Write for the finite product of one-dimensional Lebesgue measure. If all are Borel measurable, the observational law has the strictly positive Borel density with respect to on Borel sets.
For arbitrary Lebesgue-measurable , assume Countable Choice. There are strictly positive finite Borel density versions almost everywhere. Their product is a strictly positive Borel density with respect to . The original product is measurable for the completion of , agrees with -almost everywhere, and is a strictly positive density with respect to . In this Countable Choice case, on non-Borel sets these density measures refer to the unique absolutely continuous extensions of the Borel observational law to the indicated sigma-algebras.
Statement references
Facts & Assumptions
Given: A finite causally sufficient additive-noise model with a specified topological order and positive noise densities.
In topological order each variable is a measurable function of its parents plus its own noise; the noises are mutually independent and each density is normalized and strictly positive. Continuous additive-noise models on finite DAGs
The joint law of a finite independent family of random elements is the finite product of its marginal laws. Independent random elements have product joint law
For a nonnegative measurable density , the measure with density relative to is . The measure with density relative to
For sigma-finite factors, the product measure exists, has the rectangle product formula, and is unique among measures with that formula. For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
Nonnegative product-measurable functions can be integrated by iterated sections in any finite coordinate order. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Translation by a fixed real number preserves one-dimensional Lebesgue measure. Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation
Finite sums and pointwise products of nonnegative measurable extended-real functions are measurable, using the nonnegative extended-product convention. Arithmetic and lattice operations preserve measurability whenever they are defined
Composition is measurable when the inner codomain sigma-algebra matches the outer domain sigma-algebra; in particular a Borel outer function can be composed with a Borel inner map. Finite products of Euclidean Borel sigma-algebras are the Euclidean Borel sigma-algebra. Composition with a Borel measurable outer map preserves measurability The Borel product of R^m and R^n is the Borel sigma-algebra of R^{m+n}
Assuming Countable Choice, the Lebesgue sigma-algebra is the completion of Borel Lebesgue measure, and every completion-measurable extended-real function has a base-measurable representative almost everywhere. In particular each Lebesgue density has a Borel representative and each exceptional Lebesgue null set has a Borel null hull. is exactly the completion of the restriction of to the Borel sets A function measurable for a completion is almost everywhere equal to one measurable for the original sigma-algebra
Assuming Countable Choice, the completion of a measure space is a complete extending measure on the completion sigma-algebra. Assuming countable choice, every measure space has a unique complete extension to its completion The Axiom of Countable Choice ()
Proof
Given: The hypotheses in the Statement.
First suppose every is Borel measurable. For each , let on Borel sets; [F1, F3] makes a probability measure. The function is Borel, hence product-measurable, by [F7, F8]. Repeated Tonelli gives and, on every Borel rectangle, . Uniqueness of product measures identifies this Borel density measure with the joint law of the independent noises.
Recursion in topological order defines a Borel map from the noise vector to . Its inverse has coordinates , so the observational law is the Borel pushforward under .
Start from step 1.1 and change one coordinate at a time in topological order. With earlier endogenous coordinates fixed, is a fixed translation. Translation invariance changes its density factor to . Every intermediate integrand for a nonnegative Borel test function is product-measurable by [F7, F8], so Tonelli justifies the successive one-dimensional substitutions. The resulting identity for every nonnegative Borel proves the density assertion on Borel sets. The product is Borel and strictly positive. No choice principle was used in this case.
Now assume Countable Choice and allow arbitrary Lebesgue-measurable . By [F9] choose Borel representatives, replace their values outside by , and call the resulting functions . Since each original density is positive and finite almost everywhere, this changes it only on a null set and preserves its integral and noise law. Choose a Borel null hull of . These are only finitely many applications of [F9]. Step 2.1 applied to gives the positive Borel density relative to .
For each , let . It is Borel by [F8]. With all coordinates except fixed, its -section is a translate of and has measure zero by [F6]; for , Tonelli gives , and for this follows directly from translation invariance. Off the finite union , the products and agree. Completeness [F10] therefore makes measurable for , with the same integral on every completed measurable set as . Every original factor is positive, proving strict positivity as well.
In the Countable Choice case, the density measures in steps 2.1 and 4.1 extend the Borel observational law. To see uniqueness among absolutely continuous extensions, first note that every product-measurable set differs from a Borel set by a subset of a Borel -null set: the sets with this property form a sigma-algebra under Countable Choice and contain every Lebesgue rectangle by [F9]; Borel null coordinate slabs have product measure zero by Tonelli. A product-null set has a Borel null hull by the same representation, so every -measurable set has such a representation too. Any absolutely continuous extension assigns zero to the exceptional set and is determined by the Borel core. Thus the stated extensions and both density conclusions hold.
An ANM noise is independent of every set of nondescendants
Statement
In a finite additive-noise model on a DAG , for every vertex and every set of nondescendants, the noise is independent of the random vector .
Statement references
Facts & Assumptions
Given: A finite recursive ANM with mutually independent exogenous noises.
Each endogenous variable is obtained recursively in a topological order as a Borel function of its parents and its own noise. Continuous additive-noise models on finite DAGs
The joint law of a finite independent family is the product of its marginal laws. Independent random elements have product joint law
Measurable functions of independent random elements remain independent. Measurable coordinatewise functions preserve independence
Proof
Given: The finite DAG, its topological structural equations, and mutually independent noises.
For each , define to be together with all vertices having a directed path to , and put . In topological order, a root variable is a measurable function of its own noise; if this representation has been obtained for each parent of , substituting those representations into shows that is a measurable function of . Finite induction therefore makes a measurable function of . Since contains only nondescendants of , no directed path goes from to a vertex of , so .
The finite noise product law [F2] implies that is independent of the vector because the two coordinate blocks are disjoint. Applying [F3] to the measurable map from that vector to from step 1.1 shows . If , is the constant empty tuple and the same independence statement holds.
Condition 19 and restricted additive-noise models
Definition
For a smooth bivariate additive-noise model , let be three times continuously differentiable, and let and have strictly positive three-times continuously differentiable densities and . Put and . The triple satisfies Condition 19 when there are with at which Here every derivative of is evaluated at and every derivative of at . The nonzero-domain condition makes both denominators in this formula well defined.
A finite additive-noise model is a restricted additive-noise model when every structural function is and every noise has a strictly positive Lebesgue density, and when for every vertex , every parent , and every set satisfying there is a value with such that the conditional law of given , together with the structural slice and the noise , is a smooth bivariate additive-noise model satisfying Condition 19. The conditional density is the ratio for the finite positive-density version supplied by the joint-density formula. The structural slice and conditional input density have the smoothness and strict positivity required in the preceding Condition 19 definition. If the model has no edges, the restricted condition is vacuous.
Definition references
Finite continuous additive-noise models and causal minimality
Strictly positive joint density and its finite conditional-density versions
Peters et al., JMLR (2014), Definitions 18/27 and Condition 19
Peters, Janzing, and Schölkopf, Elements of Causal Inference, §4.1.4 and Theorem 4.5
Assaad, Devijver, and Gaussier, course notes (2023), slides 22–23
An ANM density factorization implies conditional independence under d-separation
Statement
Assume Countable Choice, or suppose the specified noise densities are Borel measurable. Let be a finite DAG, and let follow a recursive additive-noise model on in a fixed topological order, with continuous Borel structural functions and equations mutually independent noises with strictly positive Lebesgue densities , and joint density For , let be the marginal density relative to finite product Lebesgue measure. Let be pairwise disjoint with and nonempty. If d-separates and (every path from to has an internal noncollider in or an internal collider with no descendant in ), then for Lebesgue-almost every . This identity is the conditional-density factorization expressing conditional independence.
Statement references
Facts & Assumptions
Given: The finite ANM and pairwise disjoint sets in the Statement, with d-separating and .
Supplied Borel noise densities give the Borel shifted-noise product density. Under Countable Choice, arbitrary Lebesgue noise densities admit positive finite Borel versions with the same noise laws, whose product is a Borel joint density; the original product agrees with it almost everywhere on the completed product. Positive joint density of a finite additive-noise model
Each is a normalized Lebesgue density, and translating its argument by a fixed real amount preserves its total mass because Lebesgue measure is translation invariant. Continuous additive-noise models on finite DAGs Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation
Nonnegative product-measurable functions can be integrated in successive coordinate sections, and the resulting parameter integrals are measurable. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
D-separation is equivalent to disconnection after deleting the conditioning set from the ancestral moral graph of the two endpoint sets and that conditioning set. D-separation is separation in the ancestral moral graph
The ancestral moral graph retains all ancestors of its queried vertex set, forgets arrow directions, and joins each vertex to its parents and every distinct pair of parents of a common child. The ancestral moral graph of a DAG
Proof
Given: The hypotheses in the Statement.
For Borel noise densities use the displayed product. Otherwise [F1] supplies positive finite Borel versions under the assumed Countable Choice; use their Borel product throughout the integrations below. It has the same observational law, and its marginal densities agree almost everywhere with the stipulated marginal versions, so the final almost-everywhere identity transfers to those versions. Put . No vertex outside is a parent of a vertex in , since that would make it an ancestor of . Integrate the product density [F1] over in reverse topological order. At each elimination, all child factors have already been integrated and no child lies in , so the only remaining factor involving the current coordinate is . Its section integral is one by [F2]. Tonelli [F3] justifies each section integral; consequently the marginal density on is .
By [F4], deleting from the moral graph on leaves no path from to . Partition its connected components into , the union of components meeting , and , the union of the remaining components. Then , , and there is no moral edge between and . For each , the factor indexed by in step 1.1 depends only on ; this set is a clique in that moral graph by [F5]. Hence no such factor involves both an -coordinate and an -coordinate. Assign factors involving an -coordinate to , and assign all other factors to . Their finite products give a factorization of the density on as .
Integrate the factorization in step 2.1 over the hidden coordinates and . Since the factors separate and are nonnegative, Tonelli [F3] yields measurable functions and such that almost everywhere. Each function is strictly positive because it integrates a strictly positive factor over its hidden coordinates; if that coordinate set is empty, it is the original strictly positive factor.
Define and . Tonelli makes these measurable and gives and almost everywhere. Also for almost every . The marginal is positive, since it integrates the everywhere-positive density over any unit box in the remaining coordinates, and it is finite almost everywhere since . For almost every such , strict positivity of gives . If, for example, , then supplies a set of -values of positive measure where for some , so Tonelli makes ; the same argument applies if . Hence both integrals are finite almost everywhere, Tonelli factors the last integral as , and multiplying the finite marginal identities gives the claimed conditional-density factorization.
Remarks
The schematic shows the component split in the moral graph after deleting . Strokes to represent possible moral edges; the absence of an -- edge is the separation used in the proof. The diagram is only a schematic and the factor regrouping argument establishes the claim for every finite graph.
\begin{tikzpicture}[>=stealth]
\node[draw,rounded corners,minimum width=2.5cm,minimum height=1.2cm] (left) at (0,0) {$L$ (contains $A$)};
\node[draw,circle] (cond) at (3,0) {$C$};
\node[draw,rounded corners,minimum width=2.5cm,minimum height=1.2cm] (right) at (6,0) {$R$ (contains $B$)};
\draw[-,thick] (left) -- (cond) node[midway,above] {possible};
\draw[-,thick] (cond) -- (right) node[midway,above] {possible};
\node at (3,-0.75) {no moral edge $L$--$R$};
\node at (3,-1.25) {$\operatorname{mor}_G(H)\setminus C$ has no path from $L$ to $R$};
\end{tikzpicture}
Parent dependence persists under nondescendant conditioning
Statement
Assume Countable Choice, or suppose the specified noise densities are Borel measurable. Let follow a finite additive-noise model with a strictly positive joint density and continuous structural functions that are causally minimal in each parent coordinate. For positive joint densities, write when the conditional-density factorization holds almost everywhere. For every edge and every set such that the density conditional-independence factorization fails.
Statement references
Facts & Assumptions
Given: A finite ANM with positive joint density, continuous parent-coordinate functions, and causal minimality.
Every parent input is essential: for each edge , is nonconstant in the -coordinate for some setting of the other parents; noises are independent and have positive densities. Continuous additive-noise models on finite DAGs
For Borel noise densities (supplied, or chosen under Countable Choice without changing the laws), the joint density is the positive Borel product . Marginal densities are obtained by integrating this formula, and a conditional density at a positive finite marginal-density value is the corresponding ratio. Positive joint density of a finite additive-noise model
For every vertex , is independent of any vector of nondescendants. An ANM noise is independent of every set of nondescendants
Proof
Given: Fix an edge and a set in the range in the Statement. Put and .
Use the supplied Borel noise densities, or their positive finite Borel versions from [F2] under Countable Choice. Work with their Borel shifted-noise product and its integrated marginals; changing density versions does not change an almost-everywhere conditional-independence factorization. Every variable in is a nondescendant of . By [F3], is independent of the vector . Conditional on , the structural equation therefore gives the density for almost every . This density does not depend on , so the joint conditional density of given factors; hence .
Suppose, for contradiction, that . Since is independent of the parent vector , its conditional density is . The assumed factorization says this density is independent of for almost every and almost every . The conditional density of given is positive for almost every at almost every with , because the full joint density is strictly positive. Therefore, for almost every such , for almost every pair , the two translates and agree for almost every .
A positive integrable density cannot have a nonzero period: if almost everywhere with , then repeats on every translate of an interval of length ; that interval has positive integral, so the integral over the disjoint translates is infinite, contradicting . Thus step 1.2 forces for almost every pair and almost every . Continuity of extends this constancy to every setting of the other parent coordinates: any two unequal values would persist on open neighborhoods of positive Lebesgue measure. This contradicts [F1], so .
If is empty, and step 2.1 is the required conclusion. Otherwise, suppose . By the conditional-density equality in step 1.1 and this supposition, for almost every one has for almost every pair . The left side depends only on and the right side only on ; by Fubini, each is therefore almost everywhere constant in its varying coordinate. Hence , contradicting step 2.1. Thus the factorization given fails.
Descendants of a youngest child are conditionally independent of its parent
Statement
Assume Countable Choice, or suppose the specified noise densities are Borel measurable. Let a finite causally sufficient additive-noise model have graph , and let be an edge such that there is no directed path from to any other child of . Write for the strict descendants of and . Use the supplied Borel noise densities, or fix positive finite Borel versions under Countable Choice, and let be their shifted-noise product density. Then there are positive measurable functions and such that , where does not depend on and does not depend on . Use marginal density versions obtained by iterated integration. Then for almost every . This is the density conditional-independence factorization of and given . Moreover, for every with , the conditional law of given satisfies the density conditional-independence factorization given .
Statement references
Facts & Assumptions
Given: A finite causally sufficient additive-noise model, an edge satisfying the youngest-child condition in the Statement, and its positive joint density.
In a topological order, recursively, and the noises are mutually independent. Continuous additive-noise models on finite DAGs
For supplied Borel noise densities, or positive finite Borel versions chosen under Countable Choice, the selected Borel joint density is , with each factor depending only on that vertex and its parents. Positive joint density of a finite additive-noise model
Nonnegative product-measurable functions can be integrated in any finite coordinate order by iterated sections. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Proof
Given: The hypotheses in the Statement.
The Borel noise densities specified in the Statement give the Borel product [F2]; when necessary their versions are supplied under Countable Choice by that same result. Every shifted factor and every finite regrouping is Borel measurable. If were a parent of any , then would be another child of and also a descendant of , contrary to the hypothesis. Thus no vertex in has as a parent. Every parent of a vertex in therefore lies in .
No vertex in can be a parent of a vertex outside : that would make the latter a descendant of . Hence each density factor in [F2] for a vertex outside depends only on , while each factor for a vertex in depends only on . Regrouping the finite product gives for nonnegative measurable functions .
By [F3], the marginal densities obtained from the full product are These identities hold almost everywhere where the marginal densities are finite; Tonelli also permits infinite values on exceptional null sets. Multiplying the last two identities and comparing with the first proves the factorization in the Statement almost everywhere. For any fixed with , put and . Tonelli gives , so for almost every under that conditional law both and are finite and positive. The conditional densities of and given are respectively and ; their product is the joint conditional density. This proves the stated conditional-independence factorization at each such .
Distinct positive minimal ANM DAGs contain a conditionally reversible edge
Statement
Assume Countable Choice, or suppose the noise densities specified in both models are Borel measurable. Let two finite causally sufficient additive-noise models on distinct DAGs with the same vertex set have the same observational law, a strictly positive joint density, and causal minimality in each model. If their DAGs are and , then there are vertices and a set such that in , in , and
Statement references
Facts & Assumptions
Given: Two different finite causally sufficient ANM DAGs with a common strictly positive observational density, and causal minimality in both.
For supplied Borel noise densities each model has a positive Borel product density of shifted noise densities without a choice assumption. Under Countable Choice, positive finite Borel versions can first be chosen without changing either model law or its structural functions. Continuous additive-noise models on finite DAGs Positive joint density of a finite additive-noise model The Axiom of Countable Choice ()
Each ANM noise is independent of every finite vector of its nondescendants. An ANM noise is independent of every set of nondescendants
In a positive-density causally minimal ANM, every edge remains conditionally dependent for every with . The conditional-independence convention is the marginal-density factorization from that supplier. Parent dependence persists under nondescendant conditioning
A path is active given a conditioning set exactly when each noncollider is outside the set and each collider has a descendant in it. Paths, active paths, and d-separation in a finite DAG
Every active finite route between distinct endpoints outside a conditioning set contains an active path with the same endpoints. Every active finite route contains an active path
If a set d-separates two vertex sets in a finite ANM with positive product density, their marginal densities satisfy the conditional-independence factorization almost everywhere. An ANM density factorization implies conditional independence under d-separation
A fixed real translation preserves the integral of a nonnegative Lebesgue-measurable function. Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation
Proof
Given: The hypotheses in the Statement.
Use the Borel noise densities supplied in the hypotheses, or choose their positive finite Borel versions under Countable Choice by [F1]. Repeatedly delete a vertex that is a sink in both graphs and has the same parent set in both. At each deletion, its equation contributes a single shifted noise-density factor, which integrates to one by [F7]; no remaining equation uses the deleted vertex, so the remaining law still has the positive ANM product density and all remaining edges remain causally minimal. The process cannot delete every vertex, since then the graphs would be equal. It stops only when no common sink with equal parent sets remains; therefore choose a remaining sink of , which either has a different parent set in or has a child in .
Partition the incident vertices by , , , , and . These sets are pairwise disjoint, , , and . Put .
Suppose and , and choose . Since is a sink in , all vertices in are nondescendants of . By [F2], is independent of ; the equation therefore makes the conditional density of given independent of . Its density factorization gives . Weak union follows directly by writing this factorization for the split and dividing by the positive marginal density: . This conditioning set contains all other parents of in and contains no descendant of there, contradicting [F3] for in .
Suppose and . Choose and put . Since is a sink in , every vertex of is a nondescendant of . By [F2], is independent of ; hence the conditional density of given these variables depends only on . Splitting off and dividing by the positive marginal density gives . In , , the set contains all other parents of , and each is an ancestor of along , so this set contains no descendant of . This contradicts [F3] for . If also , then is a common sink with the same parent set and would have been deleted in step 1.1.
It remains that . Choose with no directed path in from to any other member of ; such a vertex exists by taking a maximal element of the directed-reachability partial order on the finite nonempty set . We show that . For contradiction suppose , and form by adding arrows for all and for all . The graph is still acyclic: a new arrow could create a cycle only if already reached its tail, contrary to the choice of . Also and are nonadjacent in .
In , choose a d-separating set for the nonadjacent vertices as follows. For any vertex and nondescendant nonparent , its parent set d-separates from : a path starting is blocked by the conditioned noncollider ; a path starting with an arrow out of must have a first edge traversed backward, since is not a descendant. At that first turn there is a collider reached by a directed path from . Neither this collider nor any of its descendants can be a parent of , since that would give a directed cycle; thus it is blocked given the parents of . If is an ancestor of , then is a nondescendant nonparent of ; apply this argument from and take . It covers paths through a child of as well as paths through a parent. Otherwise is a nondescendant nonparent of ; take .
Put and . Each belongs to , since is a path with noncollider . Suppose a path from to is active given . Its noncolliders lie outside , and every collider with a descendant in is active given . Since d-separates the endpoints, at least one collider on is not an ancestor of ; its descendant in must lie in or . Label every such collider by one such type, or . A labeled -collider has a directed path to some , followed by ; traversing this chain backward connects to . The chain avoids , since otherwise would be an ancestor of . A labeled -collider has a directed path to some , followed by the added arrow ; this chain also avoids . If only labels occur, use the one nearest , replace the prefix of by its backward chain from , and retain the suffix. If only labels occur, use the one nearest , retain the prefix, and replace the suffix by its forward chain to . If both labels occur, take consecutive labeled colliders of different types; connect to the -collider by its backward chain, retain the segment between the two colliders in either direction, and connect the -collider to by its forward chain. The resulting finite route has no conditioned noncollider: original noncolliders avoid , connector interiors avoid , and each selected collider becomes a noncollider at its junction. Every remaining collider has a descendant in , because there is no differently labeled collider between the selected ones, and in the one-label cases the retained side contains no other newly opened collider. This is an active route given , so [F5] gives an active path, contradicting the choice of . Thus d-separates in , and also in its subgraph .
By [F6], in . In , , and contains all other parents of and only nondescendants of the sink . This contradicts [F3]. Therefore the selected maximal member cannot lie in ; it lies in .
Let the selected , and set , , and . In , is a sink, so every member of is a nondescendant of , and . In , every member of is a parent of . A vertex cannot be a descendant of , since and a path would create a directed cycle. Every vertex of is another member of , so none is a descendant of by the choice of . Hence is contained in the nondescendants of in and contains all parents of other than . A vertex deleted in step 1.1 cannot be an ancestor of a surviving vertex in either original graph: when it was deleted it had no outgoing edge to any then-remaining vertex. Consequently all original parents of surviving vertices survive, and every original directed path between surviving vertices stays in the reduced graph. The parent sets and nondescendant inclusions just proved therefore hold in the original graphs too. The edges are in and in , so the vertices and satisfy the Statement.
References
Remarks
The schematic shows one representative from each incident-edge class. In , , , and point into . In , and point into , while points to and ; is not adjacent to . The diagram only records these incident relations. The finite path argument in the proof establishes the claim and does not rely on the drawing.
\begin{tikzpicture}[>=stealth]
\node[draw,circle] (c1) at (0,1) {$c\in Z$};
\node[draw,circle] (y1) at (0,0) {$y\in Y$};
\node[draw,circle] (w1) at (0,-1) {$w\in W$};
\node[draw,circle] (l1) at (2,0) {$l$};
\draw[->] (c1) -- (l1);
\draw[->] (y1) -- (l1);
\draw[->] (w1) -- (l1);
\node at (1,-1.8) {$G$};
\node[draw,circle] (c2) at (4,1) {$c\in Z$};
\node[draw,circle] (d2) at (4,0) {$d\in D$};
\node[draw,circle] (w2) at (4,-1) {$w\in W$};
\node[draw,circle] (l2) at (6,0) {$l$};
\node[draw,circle] (y2) at (8,1) {$y\in Y$};
\node[draw,circle] (e2) at (8,-1) {$e\in E$};
\draw[->] (c2) -- (l2);
\draw[->] (d2) -- (l2);
\draw[->] (l2) -- (y2);
\draw[->] (l2) -- (e2);
\node at (6,-1.8) {$G'$};
\end{tikzpicture}
Bivariate additive-noise direction identifiability under Condition 19
Statement
Let be independent real random variables, let , and suppose is nonconstant while and have strictly positive Lebesgue densities. If the triple of and these two densities satisfies Condition 19, then there is no reverse additive-noise representation with independent of and . No density regularity for is assumed; the proof derives a strictly positive density version from the forward joint density and reverse independence. Hence the direction is identified from the observational law among these smooth bivariate additive-noise models.
Statement references
Facts & Assumptions
Given: , independent , strictly positive densities, nonconstant , and Condition 19.
A bivariate additive-noise model has with independent of ; causal minimality here is nonconstant. Continuous additive-noise models on finite DAGs
The forward joint density is , and is strictly positive. Positive joint density of a finite additive-noise model
Condition 19 is failure of the displayed third-order differential equation at some where . Condition 19 and restricted additive-noise models
Nonnegative product-measurable functions can be integrated by iterated sections, and the marginal density is finite almost everywhere when its integral is finite. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Translation preserves Lebesgue measure and measurability, so sectionwise translation sends a density to the translated density . Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation
A probability measure invariant under a nonzero translation cannot exist. A probability measure on the line has no nonzero translation period
Proof
Given: The hypotheses in the Statement.
Put , , and . By [F2], is a function. The chain rule gives Thus both derivatives are defined, and exactly on the Condition 19 domain.
Suppose a reverse representation as in the Statement exists. By [F4] and [F2], is positive and finite for almost every . The sectionwise translation gives the joint density by [F5]; independence makes it equal to almost everywhere. Choose for which and this factorization holds for almost every . Then The right side is a strictly positive function of , so choose it as the density version of and put . Consequently the forward and reverse density formulas agree almost everywhere: For almost every with , the two sides as functions of are continuous and agree almost everywhere, hence agree for every . Taking logarithmic -derivatives gives for almost every . Both sides are continuous on , so this identity holds everywhere. Differentiating in and gives and . Wherever , it follows that which is independent of ; hence .
From the forward expressions in step 1.1, on the same nonzero domain, Differentiating this expression in , using and , and setting the derivative to zero gives The quotient rule is legitimate because both denominator factors are nonzero on this domain.
Step 3.1 forces Condition 19's differential equation at every point where , contrary to [F3]. Therefore no reverse representation in the stated class exists.
The law cannot be independent: if and were independent, positivity of and the forward density formula [F2] would make equal for almost every . By Fubini, for almost every pair , the translates and agree for almost every . Their probability laws are translates of the law of ; [F6] forces for almost every pair. Continuity of makes it constant everywhere, contradicting the hypothesis. Thus the empty graph is excluded as well, and the only smooth bivariate ANM direction in the class is .
Population identifiability and RESIT correctness for restricted ANMs
Statement
Let a finite nonempty causally sufficient additive-noise model on a DAG have a strictly positive joint density, be a restricted additive-noise model, and be causally minimal. Then its observational law determines among all causally minimal restricted additive-noise models on the same vertices.
For the population RESIT procedure, let be a supplied Borel regression rule and use an exact independence oracle and a fixed total order for all ties and loops. Assume the rule is population consistent on the model: whenever , there is a constant such that Assume in addition that every Phase 1 regression function is on its full predictor space. Then RESIT terminates without failure and returns the DAG . This is a population statement and makes no finite-sample claim.
Statement references
Facts & Assumptions
Given: The restricted causally minimal ANM, its positive joint density, a population-consistent regression rule with Phase 1 functions, and a perfect independence oracle.
For supplied Borel noise densities, distinct positive-density causally minimal ANM DAGs admit a reversed edge / and an intermediate conditioning set lying between the other parents and nondescendants in both models, by a finite graph argument and a local density-factorization proof that uses no choice axiom. Distinct positive minimal ANM DAGs contain a conditionally reversible edge
Each ANM noise is independent of every finite vector of its nondescendants. An ANM noise is independent of every set of nondescendants
In a restricted model, every structural function and noise density is and strictly positive where required, and each edge/set pair has a positive finite conditioning witness whose bivariate slice satisfies Condition 19. Condition 19 and restricted additive-noise models
The full ANM law has the positive product density; deleting a sink leaves the same product formula on the remaining vertices. Positive joint density of a finite additive-noise model
For a child of with no path from to another child of , the descendants of are density-conditionally independent of given all other current vertices and , including at every positive finite conditioning section. Descendants of a youngest child are conditionally independent of its parent
If is independent of , the joint density of is strictly positive , and is , then continuous positive density versions factor as at every . A smooth independent residual gives a pointwise density factorization
A probability measure on cannot be invariant under a nonzero translation. A probability measure on the line has no nonzero translation period
A Condition 19 bivariate forward ANM has no reverse representation with independent residual and reverse structural function. Bivariate additive-noise direction identifiability under Condition 19
Every causal-minimal parent remains conditionally dependent after conditioning on any set between the other parents and the nondescendants. Parent dependence persists under nondescendant conditioning
RESIT selects residual-independent sinks, reverses their removal list, and prunes candidate edges by residual independence; population consistency identifies the structural regression on every parent-to-nondescendant predictor set. RESIT: regression with subsequent independence testing
Proof
Given: The hypotheses in the Statement.
Suppose another causally minimal restricted ANM on the same vertices gives the same observational law but has a different DAG . By [F1], there are vertices and a set such that in , in , and contains the other parents of in and is contained in its nondescendants; also contains the other parents of in and is contained in its nondescendants.
Consider Phase 1 on a current vertex set obtained by deleting true sinks. A deleted sink cannot be a parent of a remaining vertex, so is parent-closed and its marginal law is the ANM product over by [F4]; consequently every original directed path between vertices still in stays in . A finite DAG on nonempty has a sink . Every other current vertex is a nondescendant of in the original graph: if one were a descendant, its path from would remain in the parent-closed current graph, contradicting that is a sink there. Thus for , .
Both models in step 1.1 are restricted ANMs. By [F3] their structural functions and noise densities are , so the product density versions supplied by [F4] are . Since the models have the same observational law, these continuous densities agree almost everywhere and hence everywhere; denote their common pointwise version by . Define the marginal versions needed below by iterated integration of this same , and define conditional-density versions at each finite positive value of by the corresponding ratios. Apply the restricted-model definition in to the edge and this exact set . It supplies with such that the pair , , using these common density versions, is a smooth bivariate ANM satisfying Condition 19. In particular, the definition gives the forward equation with independent of .
Population consistency gives almost surely, so the tested residual is . By [F2] it is independent of , and the perfect oracle accepts . Hence every iteration has at least one accepted candidate and cannot return failure.
In , the reverse edge is and contains all other parents of . Since , [F2] gives independent of . Let be its density and choose the product density version using the common marginal version fixed in step 2.1. Because , dividing this version by shows that, conditional on , and are independent. The reverse structural equation at that section is and its structural slice is by [F3]. In the product-density formula, the factor for depends only on , because all other parents of lie in ; integrating the remaining coordinates by the same iterated-integral convention in step 2.1 gives the common section density Thus the reverse conditional pair at this exact is formed from the same density as the forward pair in step 2.1. They have the same law, and this is a reverse representation forbidden by [F8], proving population graph identifiability.
Now suppose a candidate is not a sink. By the current-set invariant in step 1.2, choose a child of in with no directed path to any other child of in ; finiteness and acyclicity give such a child. Let be the strict descendants of in and put . Every parent of other than lies in , and in the original graph as well as in . The restricted condition for edge and set supplies with at which the conditional bivariate forward model of from satisfies Condition 19.
The predictor set tested for is . Suppose the oracle accepts it, and set . Then is independent of . The current joint density is positive by [F3]–[F4], and is by hypothesis, so [F6] gives a pointwise density version By [F5], at the exact witness , for almost every the conditional density of given does not depend on . Combining this with the pointwise factorization above shows that the probability laws of and are equal for almost every .
If , [F7] forces for almost every . Fubini supplies a fixed for which for almost every . Define ; this is by the Phase 1 smoothness hypothesis. If , define , which is also . In either case the accepted residual equation yields almost surely. The pointwise factorization [F6], restricted to and integrated over , shows that is independent of in this conditional law. This is a reverse representation of the Condition 19 pair from step 3.2, contradicting [F8]. Therefore no nonsink candidate is accepted.
Phase 1 therefore removes only true sinks. Reversing their removal order gives a topological order: for every edge , must be removed before while both remain, so precedes in the reversed list. The provisional parent set of each vertex is exactly the set of vertices preceding it in that order.
Fix a vertex and consider its candidate parents in the fixed loop order. We prove by induction through that list that no true parent is deleted. At a true-parent candidate , all other true parents are still present: they were either untested or retained by the induction hypothesis. The current set contains them and is contained in the preceding vertices, hence in . If the oracle accepted deletion, the residual would be independent of the full preceding vector, in particular of . Since , its conditional law given would not depend on , yielding . This contradicts [F9]. Thus every true parent is retained.
If the tested candidate is not a true parent, step 7.1 ensures that every true parent remains in the predictor set after deleting . This set is contained in , so [F10] makes the residual minus a constant; [F2] makes it independent of all vertices preceding . The oracle accepts and the algorithm deletes this superfluous edge.
Steps 7.1 and 8.1 show that pruning removes exactly the superfluous preceding vertices and retains every parent. Each returned parent set is therefore the true parent set, so RESIT returns .
4 · Examples, counterexamples and false statements
None yet.
Sources
- Jonas Peters, Joris Mooij, Dominik Janzing, and Bernhard Schölkopf, Causal Discovery with Continuous Additive Noise Models, JMLR 15 (2014), Definition 16 and Proposition 17
- Jonas Peters, Dominik Janzing, and Bernhard Schölkopf, Elements of Causal Inference, §4.1.4, Definition 4.4
- K. Assaad, E. Devijver, and G. Gaussier, Causal discovery: noise-based methods, slides 22–23 and 29–31
- Jonas Peters, Joris Mooij, Dominik Janzing, and Bernhard Schölkopf, Causal Discovery with Continuous Additive Noise Models, Appendix A.5
- Jonas Peters, Joris Mooij, Dominik Janzing, and Bernhard Schölkopf, Causal Discovery with Continuous Additive Noise Models, Appendix A.15
- Jonas Peters, Joris Mooij, Dominik Janzing, and Bernhard Schölkopf, Causal Discovery with Continuous Additive Noise Models, JMLR 15 (2014), Algorithm 1
- K. Assaad, E. Devijver, and G. Gaussier, Causal discovery: noise-based methods, ENS Lyon course notes (2023), Algorithm 2
- Jonas Peters, Dominik Janzing, and Bernhard Schölkopf, Elements of Causal Inference, §7.2.3
- Jonas Peters, Joris Mooij, Dominik Janzing, and Bernhard Schölkopf, Causal Discovery with Continuous Additive Noise Models, JMLR 15 (2014), equation (6)
- Terence Tao, An Introduction to Measure Theory, Theorem 1.7.18
- Jonas Peters, Joris Mooij, Dominik Janzing, and Bernhard Schölkopf, Causal Discovery with Continuous Additive Noise Models, Appendix A.10, Lemma 37
- Rick Durrett, Probability: Theory and Examples, 5th ed., Theorem 2.1.10
- Jonas Peters, Joris Mooij, Dominik Janzing, and Bernhard Schölkopf, Causal Discovery with Continuous Additive Noise Models, Definitions 18/27 and Condition 19
- Jonas Peters, Dominik Janzing, and Bernhard Schölkopf, Elements of Causal Inference, §4.1.4 and Theorem 4.5
- K. Assaad, E. Devijver, and G. Gaussier, Causal discovery: noise-based methods, ENS Lyon course notes (2023), slides 22–23
- Jonas Peters, Joris Mooij, Dominik Janzing, and Bernhard Schölkopf, Causal Discovery with Continuous Additive Noise Models, Appendix A.12
- Jonas Peters, Joris Mooij, Dominik Janzing, and Bernhard Schölkopf, Causal Discovery with Continuous Additive Noise Models, Appendix A.10, Lemma 38 and Proposition 17
- Jonas Peters, Dominik Janzing, and Bernhard Schölkopf, Elements of Causal Inference, §4.1.4 and §7.2
- K. Assaad, E. Devijver, and G. Gaussier, Causal discovery: noise-based methods, ENS Lyon course notes (2023), slides 29–31
- Jonas Peters, Joris Mooij, Dominik Janzing, and Bernhard Schölkopf, Causal Discovery with Continuous Additive Noise Models, Proposition 29(i) and Appendix A.12
- Jonas Peters, Joris Mooij, Dominik Janzing, and Bernhard Schölkopf, Causal Discovery with Continuous Additive Noise Models, Appendix A.10, Lemma 38
- Jonas Peters, Joris Mooij, Dominik Janzing, and Bernhard Schölkopf, Causal Discovery with Continuous Additive Noise Models, Theorem 20 and Appendix A.5
- Jonas Peters, Dominik Janzing, and Bernhard Schölkopf, Elements of Causal Inference, §4.1.4, Theorem 4.5
- Jonas Peters, Joris Mooij, Dominik Janzing, and Bernhard Schölkopf, Causal Discovery with Continuous Additive Noise Models, Theorems 28/34 and Appendices A.11/A.15
- K. Assaad, E. Devijver, and G. Gaussier, Causal discovery: noise-based methods, ENS Lyon course notes (2023), slides 29–35