Alphabeta Math
Pipeline-generated
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

2 · Logical flowchart

3 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Continuous additive-noise models on finite DAGs

Definition

Fix a nonempty finite directed acyclic graph G=(V,E) with a specified topological order v1,…,vp; every arrow points from an earlier to a later vertex. For j∈V, let pa⁡(j)={i∈V:(i,j)∈E} be its parent set, and let nd⁡(j) be the vertices other than j that are not descendants of j. A continuous additive-noise model on G consists of real random variables Xj,Nj on a common probability space and continuous Borel functions fj:Rpa⁡(j)→R such that Xj=fj(Xpa⁡(j))+Nj recursively in the topological order. The finite family of noises is mutually independent, and each Nj has a strictly positive Lebesgue density qj. All vertices of G are observed; no latent vertices are omitted from the model. The observational law is the law of the vector X=(Xj)j∈V.

The model is causally minimal when every parent input is essential: for each edge i→j, there are values of the other parent coordinates and two distinct real values of the i-coordinate at which fj takes different values. A root has no parent-coordinate minimality condition.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

A probability measure on the line has no nonzero translation period

Statement

Let μ be a Borel probability measure on R. If a real number a satisfies μ(A+a)=μ(A) for every Borel set A⊆R, then a=0.

Facts & Assumptions

Given: A Borel probability measure μ on R and an a∈R such that μ(A+a)=μ(A) for every Borel set A.

[F1]

A probability measure is countably additive and has total mass one. Probability measures and probability spaces

[F2]

A+a={x+a:x∈A} is the translate of A. Translation of a subset of Rn

[F3]

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.

1.1givenF2construct

Suppose a≠0 and put ℓ=∣a∣>0. Invariance under translation by a implies invariance under translation by ℓ: when a=−ℓ, apply the given identity to A+ℓ. The half-open intervals Ik=[kℓ,(k+1)ℓ), k∈Z, partition R and are translates of I0, so they all have the same measure c=μ(I0).

2.1step 1.1F1F3contradiction

If c>0, choose a natural n>1/c by [F3]. The first n intervals are disjoint, so finite additivity gives 1≥μ(⋃k=0n−1Ik)=nc>1, a contradiction. Hence c=0.

3.1step 1.1step 2.1F1discharge-contradiction∎

Countable additivity over the partition (Ik)k∈Z now gives 1=μ(R)=∑k∈Zμ(Ik)=0, again a contradiction. Therefore a=0.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

A smooth independent residual gives a pointwise density factorization

Statement

Let C be a finite-dimensional real random vector, let (Y,C) have a strictly positive C3 joint density p(y,c), and let m:Rd→R be C3. If R=Y−m(C) is independent of C, then there are strictly positive C3 Lebesgue density versions qR and pC such that p(y,c)=qR(y−m(c))pC(c) for every (y,c)∈R×Rd.

Facts & Assumptions

Given: The random vector, density, function and independence assumption in the Statement.

[F1]

Translation preserves Lebesgue measure and Lebesgue measurability. Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation

[F2]

Independent random elements have product joint law. Independent random elements have product joint law

[F3]

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.

1.1givenF1F3construct

The coordinate change (y,c)↦(r,c)=(y−m(c),c) is a translation in each fixed c-section. By [F1] and iterated integration [F3], the law of (R,C) has density h(r,c)=p(r+m(c),c). Since p and m are C3 and p>0, h is a strictly positive C3 function.

2.1step 1.1givenF2F3construct

Independence and [F2] make the law with density h(r,c) from step 1.1 the product of the marginal laws of R and C. Tonelli [F3] gives marginal density versions, and therefore h(r,c)=qR(r)pC(c) almost everywhere. Choose c0 for which 0<pC(c0)<∞ and this equality holds for almost every r. Then qR(r)=h(r,c0)/pC(c0) almost everywhere, so this formula supplies a strictly positive C3 version of qR.

3.1step 1.1step 2.1F2F3algebra

By Fubini choose r0 with qR(r0)>0 such that h(r0,c)=qR(r0)pC(c) for almost every c. Set pC∗(c)=h(r0,c)/qR(r0). This is a strictly positive C3 function and equals pC almost everywhere. Thus h(r,c)=qR(r)pC∗(c) almost everywhere; both sides are continuous, so the equality holds everywhere.

4.1step 1.1step 3.1algebra∎

Substituting r=y−m(c) into step 3.1 yields p(y,c)=qR(y−m(c))pC∗(c) for every (y,c). Renaming pC∗ as pC proves the Statement.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableOpen item page →

RESIT: regression with subsequent independence testing

Definition

Fix a finite nonempty ordered vertex set V and a population law of a real vector X=(Xj)j∈V generated by an additive-noise model. A population regression rule R assigns to each target j∈V and predictor set C⊆V∖{j} a Borel function mj,C:RC→R. 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, R is population-consistent on that model if for every j and every C with pa⁡(j)⊆C⊆nd⁡(j), there is a constant cj,C∈R such that mj,C(XC)=fj(Xpa⁡(j))+cj,Calmost surely. 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 X, R, and the perfect independence oracle and performs the following steps, using a fixed total order on V for every tie and loop order.

  1. Set the remaining set S:=V and an empty sink list. While S≠∅, for each j∈S form Rj:=Xj−mj,S∖{j}(XS∖{j}). Retain the vertices for which the oracle declares Rj independent of XS∖{j}. If there is no such vertex, return failure. Otherwise choose the least retained vertex k, record the provisional parent set pa⁡^(k):=S∖{k}, append k to the sink list, and remove k from S.
  2. Reverse the sink list to obtain an order π. In that order, for each vertex j and each candidate ℓ in its provisional parent set, in the fixed order, let C:=pa⁡^(j)∖{ℓ} and form Rj,ℓ:=Xj−mj,C(XC). If the oracle declares Rj,ℓ independent of the vector of all vertices preceding j in π, delete ℓ from pa⁡^(j); otherwise retain it.
  3. Return the DAG with arrow i→j exactly when i∈pa⁡^(j) after pruning.
LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Positive joint density of a finite additive-noise model

Statement

Let a finite additive-noise model have topological order v1,…,vp, equations Xj=fj(Xpa⁡(j))+Nj, and strictly positive Lebesgue densities qj for its mutually independent noises. Write ρ=λ⊗p for the finite product of one-dimensional Lebesgue measure. If all qj are Borel measurable, the observational law has the strictly positive Borel density pX(x)=∏r=1pqvr ⁣(xvr−fvr(xpa⁡(vr))) with respect to ρ on Borel sets.

For arbitrary Lebesgue-measurable qj, assume Countable Choice. There are strictly positive finite Borel density versions qˉj=qj almost everywhere. Their product pˉX(x)=∏r=1pqˉvr ⁣(xvr−fvr(xpa⁡(vr))) is a strictly positive Borel density with respect to ρ. The original product pX is measurable for the completion ρˉ of ρ, agrees with pˉX ρˉ-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.

Facts & Assumptions

Given: A finite causally sufficient additive-noise model with a specified topological order and positive noise densities.

[F1]

In topological order each variable is a measurable function of its parents plus its own noise; the noises are mutually independent and each density qj is normalized and strictly positive. Continuous additive-noise models on finite DAGs

[F2]

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

[F3]

For a nonnegative measurable density g, the measure with density g relative to μ is A↦∫Ag dμ. The measure with density f relative to μ

[F4]

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

[F5]

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

[F6]

Translation by a fixed real number preserves one-dimensional Lebesgue measure. Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation

[F7]

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

[F8]

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}

[F9]

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. L(Rn) is exactly the completion of the restriction of λn to the Borel sets A function measurable for a completion is almost everywhere equal to one measurable for the original sigma-algebra

[F10]

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 (ACω)

Proof

Given: The hypotheses in the Statement.

1.1givenF1F2F3F4F5F7F8

First suppose every qj is Borel measurable. For each j, let Qj=qj dλ on Borel sets; [F1, F3] makes Qj a probability measure. The function g(n)=∏r=1pqvr(nvr) is Borel, hence product-measurable, by [F7, F8]. Repeated Tonelli gives ∫g dρ=1 and, on every Borel rectangle, ∫∏Bjg dρ=∏jQj(Bj). Uniqueness of product measures identifies this Borel density measure with the joint law of the independent noises.

1.2givenF1F8construct

Recursion in topological order defines a Borel map T:Rp→Rp from the noise vector to X. Its inverse has coordinates nj=xj−fj(xpa⁡(j)), so the observational law is the Borel pushforward under T.

2.1step 1.1step 1.2F1F5F6F7F8construct

Start from step 1.1 and change one coordinate at a time in topological order. With earlier endogenous coordinates fixed, xvr=nvr+fvr(xpa⁡(vr)) is a fixed translation. Translation invariance changes its density factor to qvr(xvr−fvr(xpa⁡(vr))). 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 E[h(X)]=∫h(x)pX(x) dρ(x) for every nonnegative Borel h proves the density assertion on Borel sets. The product is Borel and strictly positive. No choice principle was used in this case.

3.1givenF1F9step 2.1chooseconstruct

Now assume Countable Choice and allow arbitrary Lebesgue-measurable qj. By [F9] choose Borel representatives, replace their values outside (0,∞) by 1, and call the resulting functions qˉj. 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 Zj of {qj≠qˉj}. These are only finitely many applications of [F9]. Step 2.1 applied to qˉj gives the positive Borel density pˉX relative to ρ.

4.1F5F6F8F10step 3.1construct

For each j, let Ej={x:xj−fj(xpa⁡(j))∈Zj}. It is Borel by [F8]. With all coordinates except xj fixed, its xj-section is a translate of Zj and has measure zero by [F6]; for p>1, Tonelli gives ρ(Ej)=0, and for p=1 this follows directly from translation invariance. Off the finite union E=⋃jEj, the products pX and pˉX agree. Completeness [F10] therefore makes pX measurable for ρˉ, with the same integral on every completed measurable set as pˉX. Every original factor is positive, proving strict positivity as well.

5.1F4F5F9F10step 2.1step 4.1∎

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

An ANM noise is independent of every set of nondescendants

Statement

In a finite additive-noise model on a DAG G, for every vertex j and every set S⊆nd⁡(j) of nondescendants, the noise Nj is independent of the random vector XS=(Xk)k∈S.

Facts & Assumptions

Given: A finite recursive ANM with mutually independent exogenous noises.

[F1]

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

[F2]

The joint law of a finite independent family is the product of its marginal laws. Independent random elements have product joint law

[F3]

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.

1.1givenF1construct

For each k∈S, define Ak to be k together with all vertices having a directed path to k, and put A=⋃k∈SAk. In topological order, a root variable is a measurable function of its own noise; if this representation has been obtained for each parent of k, substituting those representations into Xk=fk(Xpa⁡(k))+Nk shows that Xk is a measurable function of (Ni)i∈Ak. Finite induction therefore makes XS a measurable function of (Ni)i∈A. Since S contains only nondescendants of j, no directed path goes from j to a vertex of S, so j∉A.

2.1F2F3step 1.1∎

The finite noise product law [F2] implies that Nj is independent of the vector (Ni)i∈A because the two coordinate blocks are disjoint. Applying [F3] to the measurable map from that vector to XS from step 1.1 shows Nj⊥XS. If S=∅, XS is the constant empty tuple and the same independence statement holds.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Condition 19 and restricted additive-noise models

Definition

For a smooth bivariate additive-noise model Y=f(X)+N, let f be three times continuously differentiable, and let X and N have strictly positive three-times continuously differentiable densities pX and pN. Put ξ(x)=log⁡pX(x) and ν(z)=log⁡pN(z). The triple (f,pX,pN) satisfies Condition 19 when there are x,y∈R with ν′′(y−f(x))f′(x)≠0 at which ξ′′′(x)≠ξ′′(x)(−ν′′′(y−f(x))f′(x)ν′′(y−f(x))+f′′(x)f′(x))−2ν′′(y−f(x))f′′(x)f′(x)+ν′(y−f(x))f′′′(x)+ν′(y−f(x))ν′′′(y−f(x))f′′(x)f′(x)ν′′(y−f(x))−ν′(y−f(x))(f′′(x))2f′(x). Here every derivative of ν is evaluated at y−f(x) and every derivative of f at x. 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 fj is C3 and every noise has a strictly positive C3 Lebesgue density, and when for every vertex j, every parent i∈pa⁡(j), and every set S satisfying pa⁡(j)∖{i}⊆S⊆nd⁡(j)∖{i}, there is a value s with 0<pS(s)<∞ such that the conditional law of Xi given XS=s, together with the structural slice u↦fj(spa⁡(j)∖{i},u) and the noise Nj, is a smooth bivariate additive-noise model satisfying Condition 19. The conditional density is the ratio pXi,XS(u,s)/pS(s) 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.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

An ANM density factorization implies conditional independence under d-separation

Statement

Assume Countable Choice, or suppose the specified noise densities are Borel measurable. Let G=(V,E) be a finite DAG, and let X follow a recursive additive-noise model on G in a fixed topological order, with continuous Borel structural functions fv:Rpa⁡(v)→R and equations Xv=fv(Xpa⁡(v))+Nv, mutually independent noises with strictly positive Lebesgue densities qv, and joint density pX(x)=∏v∈Vqv ⁣(xv−fv(xpa⁡(v))). For T⊆V, let pT(xT)=∫RV∖TpX(x) dxV∖T be the marginal density relative to finite product Lebesgue measure. Let A,B,C⊆V be pairwise disjoint with A and B nonempty. If C d-separates A and B (every path from A to B has an internal noncollider in C or an internal collider with no descendant in C), then pA∪B∪C(xA,xB,xC)pC(xC)=pA∪C(xA,xC)pB∪C(xB,xC) for Lebesgue-almost every (xA,xB,xC). This identity is the conditional-density factorization expressing conditional independence.

Facts & Assumptions

Given: The finite ANM and pairwise disjoint sets in the Statement, with C d-separating A and B.

[F1]

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

[F2]

Each qv 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

[F3]

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

[F4]

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

[F5]

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.

1.1givenF1F2F3construct

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 H=An⁡G(A∪B∪C). No vertex outside H is a parent of a vertex in H, since that would make it an ancestor of A∪B∪C. Integrate the product density [F1] over V∖H in reverse topological order. At each elimination, all child factors have already been integrated and no child lies in H, so the only remaining factor involving the current coordinate xv is qv(xv−fv(xpa⁡(v))). Its section integral is one by [F2]. Tonelli [F3] justifies each section integral; consequently the marginal density on H is ∏v∈Hqv(xv−fv(xpa⁡(v))).

2.1givenF4F5step 1.1construct

By [F4], deleting C from the moral graph on H leaves no path from A to B. Partition its connected components into L, the union of components meeting A, and R, the union of the remaining components. Then A⊆L, B⊆R, and there is no moral edge between L and R. For each v∈H, the factor indexed by v in step 1.1 depends only on {v}∪pa⁡(v)⊆H; this set is a clique in that moral graph by [F5]. Hence no such factor involves both an L-coordinate and an R-coordinate. Assign factors involving an L-coordinate to U, and assign all other factors to W. Their finite products give a factorization of the density on H as U(xL,xC)W(xR,xC).

3.1step 2.1F1F3construct

Integrate the factorization in step 2.1 over the hidden coordinates L∖A and R∖B. Since the factors separate and are nonnegative, Tonelli [F3] yields measurable functions u(xA,xC) and w(xB,xC) such that pA∪B∪C(xA,xB,xC)=u(xA,xC)w(xB,xC) 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.

4.1givenstep 3.1F1F3algebra∎

Define α(xC)=∫u(xA,xC) dxA and β(xC)=∫w(xB,xC) dxB. Tonelli makes these measurable and gives pA∪C=uβ and pB∪C=wα almost everywhere. Also pC(xC)=∫u(xA,xC)w(xB,xC) dxAdxB for almost every xC. The marginal pC is positive, since it integrates the everywhere-positive density over any unit box in the remaining coordinates, and it is finite almost everywhere since ∫pC=1. For almost every such xC, strict positivity of u,w gives α,β>0. If, for example, α=∞, then β>0 supplies a set of b-values of positive measure where w(b,xC)>1/n for some n, so Tonelli makes ∫u(a,xC)w(b,xC) da db=∞; the same argument applies if β=∞. Hence both integrals are finite almost everywhere, Tonelli factors the last integral as pC=αβ, 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 C. Strokes to C represent possible moral edges; the absence of an L--R 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}
LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Parent dependence persists under nondescendant conditioning

Statement

Assume Countable Choice, or suppose the specified noise densities are Borel measurable. Let X 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 Y⊥dA∣Z when the conditional-density factorization pY,A,Z(y,a,z)pZ(z)=pY,Z(y,z)pA,Z(a,z) holds almost everywhere. For every edge i→j and every set S such that pa⁡(j)∖{i}⊆S⊆nd⁡(j)∖{i}, the density conditional-independence factorization Xj⊥dXi∣XS fails.

Facts & Assumptions

Given: A finite ANM with positive joint density, continuous parent-coordinate functions, and causal minimality.

[F1]

Every parent input is essential: for each edge i→j, fj is nonconstant in the i-coordinate for some setting of the other parents; noises are independent and have positive densities. Continuous additive-noise models on finite DAGs

[F2]

For Borel noise densities (supplied, or chosen under Countable Choice without changing the laws), the joint density is the positive Borel product pX(x)=∏kqk(xk−fk(xpa⁡(k))). 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

[F3]

For every vertex j, Nj is independent of any vector of nondescendants. An ANM noise is independent of every set of nondescendants

Proof

Given: Fix an edge i→j and a set S in the range in the Statement. Put P=pa⁡(j)∖{i} and Q=S∖P.

1.1givenF1F2F3

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 {i}∪P∪Q is a nondescendant of j. By [F3], Nj is independent of the vector (Xi,XP,XQ). Conditional on (Xi=x,XP=p,XQ=q), the structural equation therefore gives the density pXj∣Xi,XP,XQ(y∣x,p,q)=qj(y−fj(p,x)) for almost every (x,p,q,y). This density does not depend on q, so the joint conditional density of (Xj,XQ) given (Xi,XP) factors; hence Xj⊥dXQ∣(Xi,XP).

1.2givenF1F2F3algebra

Suppose, for contradiction, that Xj⊥dXi∣XP. Since Nj is independent of the parent vector (Xi,XP), its conditional density is qj(y−fj(p,x)). The assumed factorization says this density is independent of x for almost every p and almost every x. The conditional density of Xi given XP=p is positive for almost every x at almost every p with 0<pP(p)<∞, because the full joint density is strictly positive. Therefore, for almost every such p, for almost every pair x,x′, the two translates qj(y−fj(p,x)) and qj(y−fj(p,x′)) agree for almost every y.

2.1step 1.2F1F2algebra

A positive integrable density cannot have a nonzero period: if qj(y−a)=qj(y−b) almost everywhere with a≠b, then qj repeats on every translate of an interval of length ∣a−b∣; that interval has positive integral, so the integral over the disjoint translates is infinite, contradicting ∫qj=1. Thus step 1.2 forces fj(p,x)=fj(p,x′) for almost every pair x,x′ and almost every p. Continuity of fj 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 Xj̸⊥dXi∣XP.

3.1step 1.1step 2.1F2algebra∎

If Q is empty, S=P and step 2.1 is the required conclusion. Otherwise, suppose Xj⊥dXi∣XP,Q. By the conditional-density equality in step 1.1 and this supposition, for almost every (p,y) one has pXj∣Xi=x,XP=p(y)=pXj∣XP=p,XQ=q(y) for almost every pair (x,q). The left side depends only on x and the right side only on q; by Fubini, each is therefore almost everywhere constant in its varying coordinate. Hence Xj⊥dXi∣XP, contradicting step 2.1. Thus the factorization given XS fails.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

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 G, and let y→z be an edge such that there is no directed path from z to any other child of y. Write D=de⁡G(z) for the strict descendants of z and S=V∖(D∪{y,z}). Use the supplied Borel noise densities, or fix positive finite Borel versions under Countable Choice, and let p be their shifted-noise product density. Then there are positive measurable functions A(y,s,z) and B(d,s,z) such that p(d,y,s,z)=A(y,s,z)B(d,s,z), where A does not depend on d and B does not depend on y. Use marginal density versions obtained by iterated integration. Then pXD,Xy,XS,Xz(d,y,s,z) pXS,Xz(s,z)=pXD,XS,Xz(d,s,z) pXy,XS,Xz(y,s,z) for almost every (d,y,s,z). This is the density conditional-independence factorization of XD and Xy given (XS,Xz). Moreover, for every s with 0<pXS(s)<∞, the conditional law of (XD,Xy) given XS=s satisfies the density conditional-independence factorization given Xz.

Facts & Assumptions

Given: A finite causally sufficient additive-noise model, an edge y→z satisfying the youngest-child condition in the Statement, and its positive joint density.

[F1]

In a topological order, Xv=fv(Xpa⁡(v))+Nv recursively, and the noises are mutually independent. Continuous additive-noise models on finite DAGs

[F2]

For supplied Borel noise densities, or positive finite Borel versions chosen under Countable Choice, the selected Borel joint density is p(x)=∏v∈Vqv(xv−fv(xpa⁡(v))), with each factor depending only on that vertex and its parents. Positive joint density of a finite additive-noise model

[F3]

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.

1.1givenF1construct

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 y were a parent of any d∈D, then d would be another child of y and also a descendant of z, contrary to the hypothesis. Thus no vertex in D has y as a parent. Every parent of a vertex in D therefore lies in D∪{z}∪S.

2.1F2step 1.1algebra

No vertex in D can be a parent of a vertex outside D: that would make the latter a descendant of z. Hence each density factor in [F2] for a vertex outside D depends only on (y,s,z), while each factor for a vertex in D depends only on (d,s,z). Regrouping the finite product gives p(d,y,s,z)=A(y,s,z)B(d,s,z) for nonnegative measurable functions A,B.

3.1step 2.1F3algebra∎

By [F3], the marginal densities obtained from the full product are pXS,Xz(s,z)=(∫A(y,s,z) dy)(∫B(d,s,z) dd), pXy,XS,Xz(y,s,z)=A(y,s,z)∫B(d,s,z) dd,pXD,XS,Xz(d,s,z)=B(d,s,z)∫A(y,s,z) dy. 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 s with 0<pXS(s)<∞, put as(z)=∫A(y,s,z) dy and bs(z)=∫B(d,s,z) dd. Tonelli gives pXS(s)=∫as(z)bs(z) dz<∞, so for almost every z under that conditional law both as(z) and bs(z) are finite and positive. The conditional densities of Xy and XD given (XS=s,Xz=z) are respectively A(y,s,z)/as(z) and B(d,s,z)/bs(z); their product is the joint conditional density. This proves the stated conditional-independence factorization at each such s.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

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 G and G′, then there are vertices y,l and a set S such that y→l in G, l→y in G′, and pa⁡G(l)∖{y}⊆S⊆nd⁡G(l)∖{y},pa⁡G′(y)∖{l}⊆S⊆nd⁡G′(y)∖{l}.

Facts & Assumptions

Given: Two different finite causally sufficient ANM DAGs with a common strictly positive observational density, and causal minimality in both.

[F1]

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 (ACω)

[F2]

Each ANM noise is independent of every finite vector of its nondescendants. An ANM noise is independent of every set of nondescendants

[F3]

In a positive-density causally minimal ANM, every edge i→j remains conditionally dependent for every S with pa⁡(j)∖{i}⊆S⊆nd⁡(j)∖{i}. The conditional-independence convention is the marginal-density factorization from that supplier. Parent dependence persists under nondescendant conditioning

[F4]

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

[F5]

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

[F6]

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

[F7]

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.

1.1givenF1F7constructcontradiction

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 l of G, which either has a different parent set in G′ or has a child in G′.

2.1step 1.1construct

Partition the incident vertices by Z=pa⁡G(l)∩pa⁡G′(l), Y=pa⁡G(l)∩ch⁡G′(l), W=pa⁡G(l)∖(Z∪Y), D=pa⁡G′(l)∖pa⁡G(l), and E=ch⁡G′(l)∖pa⁡G(l). These sets are pairwise disjoint, pa⁡G(l)=Z∪Y∪W, pa⁡G′(l)=Z∪D, and ch⁡G′(l)=Y∪E. Put T=Y∪W.

3.1F2F3step 2.1algebracontradiction

Suppose T=∅ and D≠∅, and choose d∈D. Since l is a sink in G, all vertices in D∪Z are nondescendants of l. By [F2], Nl is independent of (XD,XZ); the equation Xl=fl(XZ)+Nl therefore makes the conditional density of Xl given (XD,XZ) independent of XD. Its density factorization gives Xl⊥dXD∣XZ. Weak union follows directly by writing this factorization for the split D={d}∪(D∖{d}) and dividing by the positive marginal density: Xl⊥dXd∣XZ∪(D∖{d}). This conditioning set contains all other parents of l in G′ and contains no descendant of l there, contradicting [F3] for d→l in G′.

3.2F2F3step 1.1step 2.1algebracontradiction

Suppose T=D=∅ and E≠∅. Choose e∈E and put R=pa⁡G′(e)∖{l}. Since l is a sink in G, every vertex of {e}∪Z∪R is a nondescendant of l. By [F2], Nl is independent of (Xe,XR,XZ); hence the conditional density of Xl given these variables depends only on XZ. Splitting off Xe and dividing by the positive marginal density gives Xl⊥dXe∣XZ∪R. In G′, l→e, the set Z∪R contains all other parents of e, and each z∈Z is an ancestor of e along z→l→e, so this set contains no descendant of e. This contradicts [F3] for l→e. If also E=∅, then l is a common sink with the same parent set and would have been deleted in step 1.1.

4.1step 2.1step 3.1step 3.2F4constructchoose

It remains that T≠∅. Choose t∈T with no directed path in G′ from t to any other member of T; such a vertex exists by taking a maximal element of the directed-reachability partial order on the finite nonempty set T. We show that t∉W. For contradiction suppose t=w∈W, and form G~′ by adding arrows y′→w for all y′∈Y and w′→w for all w′∈W∖{w}. The graph is still acyclic: a new arrow could create a cycle only if w already reached its tail, contrary to the choice of w. Also l and w are nonadjacent in G~′.

5.1F4step 4.1construct

In G~′, choose a d-separating set S0 for the nonadjacent vertices l,w as follows. For any vertex v and nondescendant nonparent u, its parent set d-separates v from u: a path starting v←a is blocked by the conditioned noncollider a; a path starting with an arrow out of v must have a first edge traversed backward, since u is not a descendant. At that first turn there is a collider reached by a directed path from v. Neither this collider nor any of its descendants can be a parent of v, since that would give a directed cycle; thus it is blocked given the parents of v. If l is an ancestor of w, then l is a nondescendant nonparent of w; apply this argument from w and take S0=pa⁡G~′(w). It covers paths through a child of w as well as paths through a parent. Otherwise w is a nondescendant nonparent of l; take S0=pa⁡G~′(l).

6.1F4F5step 5.1constructcontradiction

Put W0=W∖{w} and S=S0∪Y∪Z∪W0. Each y′∈Y belongs to S0, since l→y′→w is a path with noncollider y′. Suppose a path π from l to w is active given S. Its noncolliders lie outside S0, and every collider with a descendant in S0 is active given S0. Since S0 d-separates the endpoints, at least one collider on π is not an ancestor of S0; its descendant in S must lie in Z or W0. Label every such collider by one such type, Z or W0. A labeled Z-collider v has a directed path to some z∈Z, followed by z→l; traversing this chain backward connects l to v. The chain avoids S0, since otherwise v would be an ancestor of S0. A labeled W0-collider u has a directed path to some w′∈W0, followed by the added arrow w′→w; this chain also avoids S0. If only Z labels occur, use the one nearest w, replace the prefix of π by its backward chain from l, and retain the suffix. If only W0 labels occur, use the one nearest l, retain the prefix, and replace the suffix by its forward chain to w. If both labels occur, take consecutive labeled colliders of different types; connect l to the Z-collider by its backward chain, retain the segment between the two colliders in either direction, and connect the W0-collider to w by its forward chain. The resulting finite route has no conditioned noncollider: original noncolliders avoid S0, connector interiors avoid S0, and each selected collider becomes a noncollider at its junction. Every remaining collider has a descendant in S0, 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 S0, so [F5] gives an active path, contradicting the choice of S0. Thus S d-separates l,w in G~′, and also in its subgraph G′.

7.1F3F6step 2.1step 6.1contradiction

By [F6], Xl⊥dXw∣XS in G′. In G, w→l, and S contains all other parents of l and only nondescendants of the sink l. This contradicts [F3]. Therefore the selected maximal member t cannot lie in W; it lies in Y.

8.1step 2.1step 4.1step 7.1construct∎

Let the selected y=t∈Y, and set Q=pa⁡G(l)∖{y}, R=pa⁡G′(y)∖{l}, and S=Q∪R. In G, l is a sink, so every member of S is a nondescendant of l, and Q⊆S. In G′, every member of R is a parent of y. A vertex z∈Z cannot be a descendant of y, since z→l→y and a path y→⋯→z would create a directed cycle. Every vertex of Y∖{y}∪W is another member of T, so none is a descendant of y by the choice of t. Hence S is contained in the nondescendants of y in G′ and contains all parents of y other than l. 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 y→l in G and l→y in G′, so the vertices and S satisfy the Statement.

Remarks

The schematic shows one representative from each incident-edge class. In G, y∈Y, c∈Z, and w∈W point into l. In G′, c∈Z and d∈D point into l, while l points to y∈Y and e∈E; w is not adjacent to l. 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}
TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Bivariate additive-noise direction identifiability under Condition 19

Statement

Let X,N be independent real random variables, let Y=f(X)+N, and suppose f∈C3(R) is nonconstant while X and N have strictly positive C3 Lebesgue densities. If the triple of f and these two densities satisfies Condition 19, then there is no reverse additive-noise representation X=g(Y)+M with M independent of Y and g∈C3(R). No density regularity for M is assumed; the proof derives a strictly positive C3 density version from the forward joint density and reverse independence. Hence the direction X→Y is identified from the observational law among these smooth bivariate additive-noise models.

Facts & Assumptions

Given: Y=f(X)+N, independent X,N, strictly positive C3 densities, nonconstant f∈C3, and Condition 19.

[F1]

A bivariate additive-noise model has Y=f(X)+N with N independent of X; causal minimality here is f nonconstant. Continuous additive-noise models on finite DAGs

[F2]

The forward joint density is p(x,y)=pX(x)pN(y−f(x)), and is strictly positive. Positive joint density of a finite additive-noise model

[F3]

Condition 19 is failure of the displayed third-order differential equation at some (x,y) where ν′′(y−f(x))f′(x)≠0. Condition 19 and restricted additive-noise models

[F4]

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

[F5]

Translation preserves Lebesgue measure and measurability, so sectionwise translation sends a density h(x) to the translated density h(x+a). Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation

[F6]

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.

1.1givenF2construct

Put ξ=log⁡pX, ν=log⁡pN, and π(x,y)=log⁡p(x,y). By [F2], π(x,y)=ξ(x)+ν(y−f(x)) is a C3 function. The chain rule gives πxy=−ν′′(y−f(x))f′(x),πxx=ν′′(y−f(x))(f′(x))2−ν′(y−f(x))f′′(x)+ξ′′(x). Thus both derivatives are defined, and πxy≠0 exactly on the Condition 19 domain.

2.1givenF1F2F4F5step 1.1construct

Suppose a reverse representation as in the Statement exists. By [F4] and [F2], pY(y)=∫Rp(x,y) dx is positive and finite for almost every y. The sectionwise translation m=x−g(y) gives the joint density pM,Y(m,y)=p(m+g(y),y) by [F5]; independence makes it equal to pM(m)pY(y) almost everywhere. Choose y0 for which 0<pY(y0)<∞ and this factorization holds for almost every m. Then pM(m)=p(m+g(y0),y0)pY(y0)for almost every m. The right side is a strictly positive C3 function of m, so choose it as the density version of M and put ν~=log⁡pM. Consequently the forward and reverse density formulas agree almost everywhere: p(x,y)=pY(y)pM(x−g(y)). For almost every y with 0<pY(y)<∞, the two sides as functions of x are continuous and agree almost everywhere, hence agree for every x. Taking logarithmic x-derivatives gives πx(x,y)=ν~′(x−g(y)) for almost every (x,y). Both sides are continuous on R2, so this identity holds everywhere. Differentiating in x and y gives πxx=ν~′′(x−g(y)) and πxy=−ν~′′(x−g(y))g′(y). Wherever πxy≠0, it follows that πxxπxy=−1g′(y), which is independent of x; hence ∂x(πxx/πxy)=0.

3.1givenF2step 1.1step 2.1algebra

From the forward expressions in step 1.1, on the same nonzero domain, πxxπxy=−f′(x)+ν′(y−f(x))ν′′(y−f(x))f′′(x)f′(x)−ξ′′(x)ν′′(y−f(x))f′(x). Differentiating this expression in x, using ∂xν′=−f′ν′′ and ∂xν′′=−f′ν′′′, and setting the derivative to zero gives ξ′′′(x)=ξ′′(x)(−ν′′′(y−f(x))f′(x)ν′′(y−f(x))+f′′(x)f′(x))−2ν′′(y−f(x))f′′(x)f′(x)+ν′(y−f(x))f′′′(x)+ν′(y−f(x))ν′′′(y−f(x))f′′(x)f′(x)ν′′(y−f(x))−ν′(y−f(x))(f′′(x))2f′(x). The quotient rule is legitimate because both denominator factors are nonzero on this domain.

4.1F3step 3.1

Step 3.1 forces Condition 19's differential equation at every point where ν′′(y−f(x))f′(x)≠0, contrary to [F3]. Therefore no reverse representation in the stated class exists.

5.1givenF1F2F6step 4.1algebra∎

The law cannot be independent: if X and Y were independent, positivity of pX and the forward density formula [F2] would make pN(y−f(x)) equal pY(y) for almost every (x,y). By Fubini, for almost every pair x,x′, the translates pN(y−f(x)) and pN(y−f(x′)) agree for almost every y. Their probability laws are translates of the law of N; [F6] forces f(x)=f(x′) for almost every pair. Continuity of f 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 X→Y.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Population identifiability and RESIT correctness for restricted ANMs

Statement

Let a finite nonempty causally sufficient additive-noise model on a DAG G have a strictly positive joint density, be a restricted additive-noise model, and be causally minimal. Then its observational law determines G among all causally minimal restricted additive-noise models on the same vertices.

For the population RESIT procedure, let mj,C:RC→R 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 pa⁡(j)⊆C⊆nd⁡(j), there is a constant cj,C such that mj,C(XC)=fj(Xpa⁡(j))+cj,Calmost surely. Assume in addition that every Phase 1 regression function mj,C is C3 on its full predictor space. Then RESIT terminates without failure and returns the DAG G. This is a population statement and makes no finite-sample claim.

Facts & Assumptions

Given: The restricted causally minimal ANM, its positive joint density, a population-consistent regression rule with C3 Phase 1 functions, and a perfect independence oracle.

[F1]

For supplied Borel noise densities, distinct positive-density causally minimal ANM DAGs admit a reversed edge y→l / l→y and an intermediate conditioning set S 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

[F2]

Each ANM noise is independent of every finite vector of its nondescendants. An ANM noise is independent of every set of nondescendants

[F3]

In a restricted model, every structural function and noise density is C3 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

[F4]

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

[F5]

For a child z of y with no path from z to another child of y, the descendants of z are density-conditionally independent of y given all other current vertices and z, including at every positive finite conditioning section. Descendants of a youngest child are conditionally independent of its parent

[F6]

If R=Y−m(C) is independent of C, the joint density of (Y,C) is strictly positive C3, and m is C3, then continuous positive C3 density versions factor as p(y,c)=qR(y−m(c))pC(c) at every (y,c). A smooth independent residual gives a pointwise density factorization

[F7]

A probability measure on R cannot be invariant under a nonzero translation. A probability measure on the line has no nonzero translation period

[F8]

A Condition 19 bivariate forward ANM has no reverse representation with independent residual and C3 reverse structural function. Bivariate additive-noise direction identifiability under Condition 19

[F9]

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

[F10]

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.

1.1givenF1contradiction

Suppose another causally minimal restricted ANM on the same vertices gives the same observational law but has a different DAG G′. By [F1], there are vertices y,l and a set S such that y→l in G, l→y in G′, and S contains the other parents of l in G and is contained in its nondescendants; also S contains the other parents of y in G′ and is contained in its nondescendants.

1.2F4F10construct

Consider Phase 1 on a current vertex set J obtained by deleting true sinks. A deleted sink cannot be a parent of a remaining vertex, so J is parent-closed and its marginal law is the ANM product over J by [F4]; consequently every original directed path between vertices still in J stays in J. A finite DAG on nonempty J has a sink j. Every other current vertex is a nondescendant of j in the original graph: if one were a descendant, its path from j would remain in the parent-closed current graph, contradicting that j is a sink there. Thus for C=J∖{j}, pa⁡(j)⊆C⊆nd⁡(j).

2.1F2F3F4step 1.1construct

Both models in step 1.1 are restricted ANMs. By [F3] their structural functions and noise densities are C3, so the product density versions supplied by [F4] are C3. Since the models have the same observational law, these continuous densities agree almost everywhere and hence everywhere; denote their common pointwise version by p. Define the marginal versions needed below by iterated integration of this same p, and define conditional-density versions at each finite positive value of pXS by the corresponding ratios. Apply the restricted-model definition in G to the edge y→l and this exact set S. It supplies s with 0<pXS(s)<∞ such that the pair Y∗=Xy∣XS=s, L∗=Xl∣XS=s, using these common density versions, is a smooth bivariate ANM satisfying Condition 19. In particular, the definition gives the forward equation L∗=fl(spa⁡(l)∖{y},Y∗)+Nl with Nl independent of Y∗.

2.2F2F10step 1.2algebra

Population consistency gives mj,C(XC)=fj(Xpa⁡(j))+cj,C almost surely, so the tested residual is Nj−cj,C. By [F2] it is independent of XC, and the perfect oracle accepts j. Hence every iteration has at least one accepted candidate and cannot return failure.

3.1F2F3F4F8step 1.1step 2.1contradiction

In G′, the reverse edge is l→y and S contains all other parents of y. Since S∪{l}⊆nd⁡G′(y), [F2] gives Ny′ independent of (Xl,XS). Let qNy′ be its density and choose the product density version pNy′,Xl,XS(n,l,s):=qNy′(n)pXl,XS(l,s), using the common marginal version fixed in step 2.1. Because 0<pXS(s)<∞, dividing this version by pXS(s) shows that, conditional on XS=s, Ny′ and Xl are independent. The reverse structural equation at that section is Y∗=gy(spa⁡G′(y)∖{l},L∗)+Ny′, and its structural slice is C3 by [F3]. In the G′ product-density formula, the factor for Xy depends only on y,l,s, because all other parents of y lie in S; integrating the remaining coordinates by the same iterated-integral convention in step 2.1 gives the common section density pXy,Xl,XS(y,l,s)=qNy′ ⁣(y−gy(spa⁡G′(y)∖{l},l))pXl,XS(l,s). Thus the reverse conditional pair at this exact s is formed from the same density pXy,Xl,XS(⋅,⋅,s)/pXS(s) 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.

3.2givenF3step 1.2step 2.2chooseconstruct

Now suppose a candidate y∈J is not a sink. By the current-set invariant in step 1.2, choose a child z of y in G[J] with no directed path to any other child of y in G[J]; finiteness and acyclicity give such a child. Let D be the strict descendants of z in G[J] and put T=J∖(D∪{y,z}). Every parent of z other than y lies in T, and T⊆nd⁡(z)∖{y,z} in the original graph as well as in G[J]. The restricted condition for edge y→z and set T supplies t with 0<pXT(t)<∞ at which the conditional bivariate forward model of Z∗=Xz∣XT=t from Y∗=Xy∣XT=t satisfies Condition 19.

4.1F3F4F5F6step 3.2algebra

The predictor set tested for y is C=J∖{y}=T∪{z}∪D. Suppose the oracle accepts it, and set Ry=Xy−my,C(XC). Then Ry is independent of XC. The current joint density is positive C3 by [F3]–[F4], and my,C is C3 by hypothesis, so [F6] gives a pointwise density version pXy,XC(u,c)=qRy(u−my,C(c))pXC(c). By [F5], at the exact witness t, for almost every (z,d) the conditional density of Y∗ given (Z∗=z,XD=d,XT=t) does not depend on d. Combining this with the pointwise factorization above shows that the probability laws of Ry+my,C(t,z,d) and Ry+my,C(t,z,d′) are equal for almost every z,d,d′.

5.1F6F7F8step 3.2step 4.1F10constructcontradiction

If D≠∅, [F7] forces my,C(t,z,d)=my,C(t,z,d′) for almost every (z,d,d′). Fubini supplies a fixed d0 for which my,C(t,z,d)=my,C(t,z,d0) for almost every (z,d). Define gt(z)=my,C(t,z,d0); this is C3 by the Phase 1 smoothness hypothesis. If D=∅, define gt(z)=my,C(t,z), which is also C3. In either case the accepted residual equation yields Y∗=gt(Z∗)+Ry almost surely. The pointwise factorization [F6], restricted to XT=t and integrated over XD, shows that Ry is independent of Z∗ 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.

6.1F10step 2.2step 5.1construct

Phase 1 therefore removes only true sinks. Reversing their removal order gives a topological order: for every edge i→j, j must be removed before i while both remain, so i precedes j in the reversed list. The provisional parent set of each vertex is exactly the set of vertices preceding it in that order.

7.1F9F10step 6.1inductioncontradiction

Fix a vertex j 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 C contains them and is contained in the preceding vertices, hence in nd⁡(j)∖{ℓ}. If the oracle accepted deletion, the residual U=Xj−mj,C(XC) would be independent of the full preceding vector, in particular of (Xℓ,XC). Since Xj=mj,C(XC)+U, its conditional law given (Xℓ,XC) would not depend on Xℓ, yielding Xj⊥dXℓ∣XC. This contradicts [F9]. Thus every true parent is retained.

8.1F2F10step 6.1step 7.1algebra

If the tested candidate ℓ is not a true parent, step 7.1 ensures that every true parent remains in the predictor set C after deleting ℓ. This set is contained in nd⁡(j), so [F10] makes the residual Nj minus a constant; [F2] makes it independent of all vertices preceding j. The oracle accepts and the algorithm deletes this superfluous edge.

9.1step 7.1step 8.1F10∎

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 G.

4 · Examples, counterexamples and false statements

None yet.

Sources