Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

Gaussian precision zeros characterize pairwise conditional independence

Statement

Assume AC. Let p≥2 and let X=(X1,…,Xp) have multivariate normal law Np(μ,Σ) with real symmetric positive-definite covariance Σ; put Θ=Σ−1. For every pair of distinct indices i,j, Xi and Xj are conditionally independent given σ(Xk:k∉{i,j}) if and only if Θij=0. Thus the graph whose edges are exactly the nonzero off-diagonal entries of Θ is the Gaussian pairwise conditional-dependence graph.

Facts & Assumptions

Given: AC, p≥2, a random vector X with law Np(μ,Σ), and real symmetric positive-definite Σ.

[F1]

A multivariate normal law has the scalar normal projections prescribed by its mean and covariance, including the covariance of every linear projection. Multivariate normal law, including singular covariance.

[F2]

When Σ is positive definite, the law has density (2π)−p/2det⁡(Σ)−1/2exp⁡(−12(x−μ)TΣ−1(x−μ)). A positive-definite multivariate normal law has its Gaussian density.

[F3]

For a joint density with positive finite marginal sections, normalizing each section gives a regular conditional distribution of the first coordinate given the second. Conditional density formula.

[F4]

Conditional independence given a sigma-algebra is factorization of conditional expectations for every pair of bounded measurable real functions. Conditional independence given a sigma-algebra.

[F5]

A scalar N(m,s2) law has characteristic function exp⁡(itm−12s2t2). Characteristic function of a normal law.

[F6]

On Borel subsets of Rr+s, product Lebesgue measure agrees with Euclidean Lebesgue measure under countable choice. On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n} The Axiom of Countable Choice (ACω).

[F8]

The pairwise Markov property tests conditional independence exactly at nonedges of a finite simple undirected graph. Finite undirected graphs, Markov properties, and clique factorization.

[F9]

A conditional-expectation version is measurable and has the defining integral identity on every conditioning event. Conditional expectation given a sigma algebra.

[F10]

Tonelli's theorem factors nonnegative product-measurable integrals on sigma-finite product spaces into iterated integrals. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product.

[A1]

AC is the explicit hypothesis of the conditional-independence convention, and here means that every family of nonempty sets has a choice function. Conditional independence given a sigma-algebra The Axiom of Choice.

Proof

Given: The hypotheses in the Statement.

1.1givenA1F1F2

Fix distinct i,j. By [A1], [F1] and [F2], the joint density of X is the stated nondegenerate Gaussian density; here positive definiteness is an additional hypothesis beyond the singular-covariance multivariate-normal definition.

2.1step 1.1algebra

Reorder coordinates so Y=(Xi,Xj) and Z=(Xk)k∉{i,j}. In the correspondingly permuted precision matrix write Θ=(ABBTC), where A=(accd). For every nonzero u∈R2, uTAu=(u,0)TΘ(u,0)>0, so A is positive definite. In particular, a>0 and evaluating the quadratic form of A at (−c/a,1) gives d−c2/a>0, hence det⁡A=ad−c2>0. For p=2, Z ranges over the singleton R0 and the density of Y is unconditional.

3.1step 2.1F2F6F7algebra

For p>2, [F7] supplies the countable-choice hypothesis of [F6], so the joint Euclidean density in [F2] is also a density relative to λ2⊗λp−2. Put u=y−μY, w=z−μZ, and D=C−BTA−1B. For nonzero w, (−A−1Bw,w)TΘ(−A−1Bw,w)=wTDw>0, hence D is positive definite. Completing the square gives uTAu+2uTBw+wTCw=(u+A−1Bw)TA(u+A−1Bw)+wTDw. The section integral over y is therefore positive and finite for every z: its y factor is the normalized two-dimensional Gaussian density with precision A, multiplied by a finite positive constant.

4.1givenstep 2.1step 3.1F2F3

For p>2, use the explicit filler probability concentrated at (0,0) on R2 in [F3]; the positive finite marginal sections from step 3.1 show that the conditional law at every z has density det⁡A2πexp⁡(−12(u+A−1Bw)TA(u+A−1Bw)). It is N2(m(z),A−1), where m(z)=μY−A−1B(z−μZ). For p=2, conditioning on the constant Z is unconditional; since A=Θ in this case, the law is N2(m(∗),A−1) with m(∗)=μY. Thus in either case the conditional law is N2(m(z),A−1), interpreting z=∗ when p=2.

5.1step 4.1F3F4F9F10algebra

If Θij=c=0, then A is diagonal. For p>2, the conditional density in step 4.1 is a product of two univariate Gaussian densities for every z; for p=2, the unconditional bivariate density is that product. For p>2, [F3] gives the conditional-event identities and [F9] identifies the corresponding conditional expectations; for p=2, conditional expectations given the constant Z are ordinary expectations. In either case, simple-function approximation extends the indicator identities to bounded measurable functions. Tonelli's theorem [F10], applied to the positive and negative parts of the product integrand, factors the integrals against the product density. Hence the conditional expectations factor for all bounded measurable coordinate functions, and [F4] gives Xi⊥ ⁣ ⁣ ⁣⊥Xj∣σ(Z).

5.2step 4.1F1F3F4F5F9

Conversely, suppose Xi⊥ ⁣ ⁣ ⁣⊥Xj∣σ(Z). Apply [F4] to the four bounded pairs formed from cos⁡(Xi),sin⁡(Xi) and cos⁡(Xj),sin⁡(Xj) and combine the resulting identities. For p>2, [F3] and [F9] identify these conditional expectations with integrals under the conditional law in step 4.1, so for almost every z its joint characteristic function at (1,1) equals the product of its conditional marginal characteristic functions. For p=2 the same identity is unconditional, at the unique value z=∗. By [F1] and [F5], in either case the joint characteristic function is exp⁡(i(m1(z)+m2(z))−12((A−1)11+2(A−1)12+(A−1)22)), whereas the product of the marginals omits the middle covariance term. Equality implies exp⁡(−(A−1)12)=1, and since (A−1)12 is real this forces (A−1)12=0.

6.1step 2.1step 5.1step 5.2F8algebra∎

The inverse of A is (ad−c2)−1(d−c−ca). Since det⁡A>0, (A−1)12=0 if and only if c=0, which is exactly Θij=0. Steps 5.1 and 5.2 prove the two implications; by [F8], these are exactly the nonedge and conditional-independence cases of the Gaussian pairwise Markov graph.

Depends on

Used by

Dependency tree · two levels

70 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