Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

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}

Depends on

Used by

Dependency tree · two levels

43 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources