Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

A hidden common cause is observationally indistinguishable from an edge

Example

Let L,UX,UY be independent standard normals and set X=L+UX, Y=L+UY, with latent common-cause graph L→X and L→Y; only X,Y are observed. Their joint law is the same as that of the observed direct-edge model X=VX, Y=12X+ε, where VX∼N(0,2) and ε∼N(0,32) are independent. A perfect observational PC oracle therefore returns the undirected edge X−Y. This identifies an association but cannot distinguish the hidden common cause from a direct causal edge, and the latent model violates the observed-only causal-sufficiency requirement.

diagram failed to render:
\begin{tikzpicture}[>=stealth, node distance=16mm]
  \node[draw,dashed,rounded corners,inner sep=2pt] at (0,0) (l) {$L$};
  \node at (1.6,0) (x) {$X$}; \node at (1.6,-1.3) (y) {$Y$};
  \draw[->] (l) -- (x); \draw[->] (l) -- (y);
  \node at (0,0.6) {latent model};
  \node at (4,0) (x2) {$X$}; \node at (5.6,0) (y2) {$Y$};
  \draw[->] (x2) -- (y2);
  \node at (4.8,0.6) {observed direct-edge model};
\end{tikzpicture}

Arrows represent structural causes, the dashed box marks the unobserved vertex, and the second graph is a different model with the same observed law. The diagram is explanatory; equality of laws and the PC output are verified below.

Facts & Assumptions

Given: Independent Gaussian exogenous variables in the latent model and independent variables VX,ε in the direct-edge model.

[F1]

A recursive structural causal model may distinguish observed and latent vertices; its Markovian case uses mutually independent exogenous variables. Recursive structural causal models on finite DAGs

[F2]

The causally sufficient discovery regime requires every graph vertex to be observed and the full-joint law to have a parent-kernel factorization, so an omitted latent vertex is outside that regime. Causally sufficient perfect-oracle discovery regime

[F3]

Independent scalar normal inputs have product characteristic functions, and finite affine sums use the scalar normal characteristic formula and scalar uniqueness. Independent random elements Standard normal and normal laws Characteristic functions under affine maps and independent sums Characteristic function of a normal law Uniqueness of a law from its characteristic function

[F4]

A finite vector is multivariate normal when every scalar linear projection has its corresponding normal law. Multivariate normal law, including singular covariance

[F5]

A multivariate normal law has characteristic function exp⁡(it⋅m−tTΣt/2), and this function uniquely determines its vector law. Characteristic function of a multivariate normal law

[F6]

DAGs with the same skeleton and no unshielded colliders are Markov equivalent. DAG Markov equivalence is determined by skeletons and unshielded colliders

[F7]

With two vertices, a CPDAG leaves the only edge undirected when both orientations occur among equivalent DAGs. DAG Markov equivalence, patterns, and CPDAGs

[F8]

PC retains an edge unless a tested conditioning set establishes independence; with two vertices it has no unshielded triples or Meek-rule configurations. Population PC causal-discovery algorithm

[F9]

Under the causally sufficient perfect-oracle regime, population PC terminates and returns the DAG's CPDAG. The PC algorithm recovers the oracle CPDAG

[A1]

AC is assumed by the Gaussian-law probability interfaces. The Axiom of Choice

Verification

technique · covariance comparison and direct inspection of the two-vertex PC search
1.1F3F4A1construct

Let W1,…,Wm be a finite independent family of scalar normal variables with means μr and variances σr2. For real coefficients a1,…,am,b, [F3] gives the characteristic function of b+∑rarWr as exp⁡ ⁣(it(b+∑rarμr)−t22∑rar2σr2); scalar uniqueness identifies this as the normal law with that mean and variance. Every scalar projection of a finite affine image of W=(W1,…,Wm) is such a sum, so [F4] proves that every such image is multivariate normal, including when a projection has variance zero.

2.1givenF5step 1.1A1algebra

In the latent model, E(X,Y)=(0,0), Var⁡(X)=Var⁡(Y)=2, and Cov⁡(X,Y)=1, by independence of L,UX,UY. In the direct-edge model, E(X,Y)=(0,0), Var⁡(X)=2, Cov⁡(X,Y)=12Var⁡(X)=1, and Var⁡(Y)=14(2)+32=2. Both vectors are Gaussian by step 1.1 and have the same positive-definite covariance matrix Σ=(2112), whose leading principal minors are 2 and 3. By [F5], both vector characteristic functions equal exp⁡(−tTΣt/2) for every t∈R2; the uniqueness clause of [F5] gives equality of the full observed laws.

3.1F1F2step 2.1algebra

The latent model is a finite recursive Markovian SCM with observed set {X,Y} and omitted latent vertex L, so it does not satisfy [F2]. The direct-edge model has observed set {X,Y} and independent exogenous variables; its full-joint law factors as N(0,2)(dx)N(x/2,3/2)(dy), the root probability kernel for X followed by the probability kernel for Y given its parent X. In its two-vertex graph X→Y, the only pair of nonempty disjoint endpoint sets is {X},{Y}, which is not d-separated because of the direct path; step 2.1 gives Cov⁡(X,Y)=1, so they are not independent. Thus this law is faithful to the direct-edge DAG, and the direct-edge model satisfies the observed-only Markovian factorization and faithfulness conditions in the discovery regime. Since the observed laws agree by step 2.1, no procedure using only that law can distinguish the two causal explanations.

4.1F6F7F8F9step 2.1step 3.1A1algebra∎

The common observed law has Cov⁡(X,Y)=1≠0, so X,Y are dependent and the perfect oracle does not delete their only edge. With only two vertices there is no unshielded triple and none of R1–R3 applies; by [F9] the regime-compliant run terminates, and its computed output is X−Y. Reversing the single edge in the direct-edge DAG keeps the same skeleton and no unshielded collider, so [F6] proves the reverse DAG is equivalent; [F7] therefore gives the same undirected CPDAG. The PC output reports adjacency but cannot recover the latent-versus-direct causal distinction.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

65 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