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 , , , with graph . The collider model is , , , with graph . For a perfect conditional-independence oracle, PC retains an undirected chain in the first model and orients both arrows into in the second: the chain's unique endpoint separator contains , whereas the collider's endpoint separator is empty.
The diagrams use vertices for variables and arrows for structural parenthood; they illustrate the two DAGs but are not used in the verification.
Example references
Facts & Assumptions
Given: Independent exogenous variables and the two recursive Gaussian models in the Example.
Finite independent sums and affine shifts have the stated characteristic-function formulas. Independent random elements Characteristic functions under affine maps and independent sums
The standard normal has density , scalar normal laws have characteristic function , 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
A finite vector is multivariate normal when every scalar linear projection has its corresponding normal law. Multivariate normal law, including singular covariance
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
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
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
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
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
Under the causally sufficient perfect-oracle regime, population PC terminates and returns the DAG's CPDAG. The PC algorithm recovers the oracle CPDAG
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
AC is assumed by the supplied Gaussian probability interfaces. The Axiom of Choice
Verification
Let be a finite independent family of scalar normal variables with means and variances . For any real coefficients , [F1]–[F2] give the characteristic function of as ; scalar uniqueness identifies this as the normal law with that mean and variance. Every scalar projection of a finite affine image of is such a sum, so [F3] proves that every such image is multivariate normal, including when a projection has variance zero.
The chain model's density is , where is the standard-normal density. Its factors are exactly the parent probability kernels , , and , so the full-joint law factorizes in the topological order . All three vertices are observed and [F8] gives the Markovian SCM condition. Its moments are , , , and distinct covariances , , . The vector is multivariate normal by step 1.1, and its covariance matrix is positive definite because is an invertible triangular linear transform of . The conditional covariance formula gives Together with the nonzero marginal covariances, [F4] shows that the only conditional independence between distinct variables is . By [F10], the only d-separated vertex pair is also given : the adjacent pairs have an active one-edge path, and the – path is blocked only by conditioning on . 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].
The collider model's density is . Its factors are exactly the parent probability kernels , , and , so the full-joint law factorizes in the topological order . All vertices are observed and [F8] gives the Markovian SCM condition. Its variances are , , its covariances are , and . 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 Therefore [F4] shows that 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 , 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.
Thus PC does not delete any pair at level . At level , is deleted and its separator is recorded as ; and 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.
PC deletes at level and records the empty separator. It retains and by their nonzero marginal covariances. Since is absent from the separator, [F5] orients ; 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
- Population PC causal-discovery algorithm
- Causally sufficient perfect-oracle discovery regime
- DAG Markov equivalence, patterns, and CPDAGs
- A separating set identifies an unshielded collider
- Zero Gaussian partial correlation is conditional independence
- Standard normal and normal laws
- Independent random elements
- Multivariate normal law, including singular covariance
- Recursive structural causal models on finite DAGs
- Paths, active paths, and d-separation in a finite DAG
- The Axiom of Choice
- Characteristic function of a normal law
- Characteristic functions under affine maps and independent sums
- Uniqueness of a law from its characteristic function
- The PC algorithm recovers the oracle CPDAG
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
- Kalisch and Bühlmann, Estimating High-Dimensional Directed Acyclic Graphs with the PC-Algorithm, §2.3 (standard reference, not scraped)
- Meek, Causal Inference and Causal Explanation with Background Knowledge, §2.1 (standard reference, not scraped)