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.
Zero Gaussian partial correlation is conditional independence
Statement
Assume AC. Let be a nondegenerate multivariate-normal vector, so is positive definite. For distinct and , the block in the definition of Gaussian partial correlation is positive definite, and
Statement references
Facts & Assumptions
Given: AC, a positive-definite Gaussian covariance matrix, and the indices in the Statement.
A finite vector is multivariate normal when every linear projection is a univariate normal with the corresponding projected mean and variance; its covariance is the stated matrix. Multivariate normal law, including singular covariance
A positive-definite multivariate-normal law has density proportional to . A positive-definite multivariate normal law has its Gaussian density
Conditional independence is the conditional-product identity for every pair of bounded measurable real functions. Conditional independence given a sigma-algebra
Finite random vectors use the finite product sigma-algebra. The product sigma-algebra and its finite iterates
Independence of random elements means independence of their generated sigma-algebras. Independent random elements
AC is assumed, as required by [F1]–[F3]. The Axiom of Choice
Proof
Given: The hypotheses in the Statement.
Partition with and ; if , omit the block. For nonempty , is positive definite because every nonzero vector supported on has positive -quadratic form, so it is invertible. Put and . Then and . For every nonzero , the quadratic form of at equals . Thus is positive definite; for empty this follows directly from the principal covariance block.
The vector is a linear image of , hence is jointly Gaussian by [F1]. Its covariance is block diagonal with blocks and . By [F2], the joint density factors as the product of the two Gaussian densities, since the inverse and determinant of a block-diagonal covariance split by blocks. Integrating over measurable rectangles shows and are independent by [F5]. It follows that, conditionally on , is the translate and has conditional covariance .
If , the positive-definite bivariate Gaussian density of factors into its one-coordinate densities. Thus the coordinates of are independent. Since is independent of , the conditional law of given is the product of its conditional marginals. Integrating bounded measurable functions against this product conditional law gives the identity in [F3], hence conditional independence.
Conversely assume the conditional independence in the Statement. Apply [F3] to the sine and cosine functions of each coordinate and combine the four real identities to obtain factorization of the conditional characteristic function at . By step 2.1, the joint conditional characteristic function is the product of the marginal factors times . All other factors are nonzero; therefore . The covariance entry is real, so .
The diagonal entries of are positive by step 1.1. Its off-diagonal entry is zero exactly when the normalized entry is zero, proving both implications.
Depends on
Used by
- PC distinguishes a chain from an unshielded collider Example
- Uniform concentration of Gaussian sample partial correlations Lemma
- High-dimensional consistency of Gaussian PC structure learning Theorem
Cited to discharge well-definedness by Gaussian partial correlation.
Dependency tree · two levels
39 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, Proposition 2 (standard reference, not scraped)
- Lauritzen, Graphical Models lecture notes, §4.1.3, Proposition 4.2, pp. 97–98 (standard reference, not scraped)