Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Kullback–Leibler divergence between nondegenerate centered Gaussian laws

Statement

Let p≥1 and let Σ0,Σ1 be real symmetric positive-definite p×p matrices. Under the Gaussian law and directional KL conventions of Multivariate normal law, including singular covariance and Kullback–Leibler divergence, D(Np(0,Σ0)∥Np(0,Σ1))=12[tr⁡(Σ1−1Σ0)−p+log⁡det⁡Σ1det⁡Σ0].

Facts & Assumptions

Given: Axiom of Choice, an integer p≥1, and positive-definite real symmetric matrices Σ0,Σ1∈Rp×p.

[F1]

Multivariate normal law, including singular covariance: Np(0,Σ) is the law of Σ1/2Z for independent standard-normal coordinates and has mean zero and covariance Σ.

[F2]

Standard normal and normal laws: each standard-normal coordinate has density ϕ1(t)=(2π)−1/2e−t2/2 with respect to one-dimensional Lebesgue measure.

[F3]

Independent random elements have product joint law: independent coordinates have their finite product law.

[F4]

On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n}, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, and Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system: coordinate Lebesgue product measure agrees with Euclidean Lebesgue measure; nonnegative product integrals factor; finite measures agreeing on a generating pi-system agree on its sigma-algebra.

[F6]

Borel change of variables from the compact-support formula and Radon uniqueness: for an invertible linear map T:Rp→Rp and nonnegative Borel h, ∫h(y) dy=∫h(Tx)∣det⁡T∣ dx. Its Countable Choice hypothesis follows from the assumed AC by AC supplies countable selections and prescribed serial paths.

[F7]

Change of variables for expectation: expectation of a measurable function of a random vector is integration against its law when the function is integrable.

[F8]

Kullback–Leibler divergence: for mutually absolutely continuous probability laws with positive Lebesgue densities f0,f1, D(P0∥P1)=∫log⁡(f0/f1) dP0.

Proof

1.1F1F2F3F4

Let Z=(Z1,…,Zp) be the independent standard-normal vector in [F1], and put ϕp(z)=∏i=1pϕ1(zi)=(2π)−p/2e−∥z∥22/2. For every Borel rectangle R=∏iBi, [F3] gives P(Z∈R)=∏i∫Biϕ1(t) dt. Tonelli's theorem and the product-Lebesgue identity in [F4] show that this equals ∫Rϕp(z) dz. Rectangles generate the Borel sigma-algebra, so measure uniqueness in [F4] proves that Z has density ϕp.

2.1F1F5F6step 1.1algebra

Let Σ be positive definite and write A=Σ1/2 using the real spectral theorem. If λ1,…,λp>0 are the eigenvalues of Σ, then A has eigenvalues λi; [F5] gives det⁡A=det⁡Σ>0. For a Borel set E⊆Rp, apply [F6] to T=A and the nonnegative Borel function gE(x)=1E(x)ϕp(A−1x)∣det⁡A−1∣. This gives P(AZ∈E)=∫Eϕp(A−1x)∣det⁡A−1∣ dx. Because ∥A−1x∥22=xTΣ−1x and ∣det⁡A−1∣=(det⁡Σ)−1/2, [F1] yields the positive density fΣ(x)=(2π)−p/2(det⁡Σ)−1/2exp⁡ ⁣(−12xTΣ−1x).

3.1F1F7F8F9step 2.1algebra

The two densities in step 2.1 are strictly positive. Their log ratio is log⁡fΣ0(x)fΣ1(x)=12log⁡det⁡Σ1det⁡Σ0+12xT(Σ1−1−Σ0−1)x. It is integrable under Np(0,Σ0) because it is a constant plus a finite quadratic form and [F1] gives finite second moments. Applying [F7] and [F8], D(Np(0,Σ0)∥Np(0,Σ1))=12log⁡det⁡Σ1det⁡Σ0+12tr⁡((Σ1−1−Σ0−1)Σ0). The trace identity follows by expanding the quadratic form as a finite sum and using E[XiXj]=(Σ0)ij.

4.1F9step 3.1algebra∎

Finite trace linearity and Σ0−1Σ0=Ip give tr⁡((Σ1−1−Σ0−1)Σ0)=tr⁡(Σ1−1Σ0)−p. Substitution into step 3.1 proves the formula.

Depends on

Used by

Dependency tree · two levels

108 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