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.

PC distinguishes a chain from an unshielded collider

Example

Let all exogenous variables below be mutually independent standard normals. The chain model is X=UX, Y=X+UY, Z=Y+UZ, with graph X→Y→Z. The collider model is X=UX, Z=UZ, Y=X+Z+UY, with graph X→Y←Z. For a perfect conditional-independence oracle, PC retains an undirected chain in the first model and orients both arrows into Y in the second: the chain's unique endpoint separator contains Y, whereas the collider's endpoint separator is empty.

XYZchainXYZcollider

The diagrams use vertices for variables and arrows for structural parenthood; they illustrate the two DAGs but are not used in the verification.

Facts & Assumptions

Given: Independent N(0,1) exogenous variables and the two recursive Gaussian models in the Example.

[F1]

Finite independent sums and affine shifts have the stated characteristic-function formulas. Independent random elements Characteristic functions under affine maps and independent sums

[F2]

The standard normal has density ϕ, scalar normal laws have characteristic function exp⁡(iμt−σ2t2/2), and equal scalar characteristic functions determine equal laws. Standard normal and normal laws Characteristic function of a normal law Uniqueness of a law from its characteristic function

[F3]

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

[F4]

For a nondegenerate Gaussian vector, zero conditional covariance between two coordinates is equivalent to conditional independence given the conditioning coordinates. Zero Gaussian partial correlation is conditional independence

[F5]

PC deletes a pair at the first conditioning level with a separating set, records that set, orients an unshielded triple as a collider exactly when the middle vertex is absent from its recorded set, then applies R1–R3. Population PC causal-discovery algorithm

[F6]

The middle vertex of an unshielded triple lies outside a valid separating set exactly when the triple is a collider. A separating set identifies an unshielded collider

[F7]

A Gaussian law is faithful to a DAG when its conditional independences agree exactly with that DAG's d-separations. Causally sufficient perfect-oracle discovery regime

[F8]

A recursive SCM is Markovian when its exogenous variables are mutually independent; its displayed structural functions define the endogenous variables along the graph. Recursive structural causal models on finite DAGs

[F9]

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

[F10]

D-separation requires every path between the queried vertex sets to be blocked by the conditioning set. Paths, active paths, and d-separation in a finite DAG

[A1]

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

Verification

technique · direct covariance calculation and the population PC search
1.1F1F2F3A1construct

Let W1,…,Wm be a finite independent family of scalar normal variables with means μr and variances σr2. For any real coefficients a1,…,am,b, [F1]–[F2] give 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 [F3] proves that every such image is multivariate normal, including when a projection has variance zero.

2.1givenF1F2F4F7F8F10A1algebra

The chain model's density is ϕ(x)ϕ(y−x)ϕ(z−y), where ϕ is the standard-normal density. Its factors are exactly the parent probability kernels KX(dx)=N(0,1)(dx), KY(x,dy)=N(x,1)(dy), and KZ(y,dz)=N(y,1)(dz), so the full-joint law factorizes in the topological order X,Y,Z. All three vertices are observed and [F8] gives the Markovian SCM condition. Its moments are Var⁡(X)=1, Var⁡(Y)=2, Var⁡(Z)=3, and distinct covariances Cov⁡(X,Y)=1, Cov⁡(Y,Z)=2, Cov⁡(X,Z)=1. The vector is multivariate normal by step 1.1, and its covariance matrix is positive definite because (X,Y,Z) is an invertible triangular linear transform of (UX,UY,UZ). The conditional covariance formula gives Cov⁡(X,Z∣Y)=1−1⋅22=0,Cov⁡(X,Y∣Z)=1−1⋅23=13,Cov⁡(Y,Z∣X)=2−1⋅11=1. Together with the nonzero marginal covariances, [F4] shows that the only conditional independence between distinct variables is X⊥Z∣Y. By [F10], the only d-separated vertex pair is also X,Z given Y: the adjacent pairs have an active one-edge path, and the X–Z path is blocked only by conditioning on Y. Any conditional independence between vertex sets would imply the corresponding coordinate independences, so the set-level independence and d-separation models also agree. This verifies faithfulness in [F7].

2.2givenF1F2F4F7F8F10A1algebra

The collider model's density is ϕ(x)ϕ(z)ϕ(y−x−z). Its factors are exactly the parent probability kernels KX(dx)=N(0,1)(dx), KZ(dz)=N(0,1)(dz), and KY(x,z,dy)=N(x+z,1)(dy), so the full-joint law factorizes in the topological order X,Z,Y. All vertices are observed and [F8] gives the Markovian SCM condition. Its variances are Var⁡(X)=Var⁡(Z)=1, Var⁡(Y)=3, its covariances are Cov⁡(X,Y)=Cov⁡(Z,Y)=1, and Cov⁡(X,Z)=0. The vector is multivariate normal by step 1.1, and this covariance matrix is positive definite by the invertible triangular map from the exogenous variables. The conditional covariances are Cov⁡(X,Z∣Y)=0−1⋅13=−13,Cov⁡(X,Y∣Z)=1,Cov⁡(Y,Z∣X)=1. Therefore [F4] shows that X⊥Z marginally, but there is no conditional independence after conditioning on the third variable and no independence for an adjacent pair. By [F10], this is exactly the collider DAG's d-separation list: the collider path is blocked unconditioned and opened by conditioning on Y, while each adjacent pair has an active one-edge path. Any set conditional independence would imply coordinate independences, so [F7] holds at the set level as well.

3.1F5F6F9step 2.1cases

Thus PC does not delete any pair at level 0. At level 1, X−Z is deleted and its separator is recorded as {Y}; X−Y and Y−Z remain because step 2.1 shows that each is dependent both marginally and conditional on the third variable. The sole unshielded triple has its middle vertex in the separator, so [F5] or [F6] leaves both edges undirected. No Meek rule applies without a directed edge, and the output is the undirected chain CPDAG. The run terminates under [F9], since step 2.1 verifies the chain model's discovery-regime hypotheses.

4.1F4F5F9step 2.2cases∎

PC deletes X−Z at level 0 and records the empty separator. It retains X−Y and Y−Z by their nonzero marginal covariances. Since Y is absent from the separator, [F5] orients X→Y←Z; the output is the collider CPDAG. The run terminates under [F9], since step 2.2 verifies the collider model's discovery-regime hypotheses. These calculations verify both claimed outputs without relying on the diagrams.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

64 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