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.
Correctness of finite Gaussian block elimination
Statement
Assume the Axiom of Countable Choice and the hypotheses of Exact finite Gaussian block elimination with input and retained sets . Let be the algorithm outputs. At each stage write , and use the empty-set conventions of the algorithm. Then the algorithm terminates after stages, every nonempty retained precision is positive definite, and for every fixed retained vector ,
where lists the eliminated coordinates in increasing order and is the unique full coordinate vector agreeing with on and with on . The measure is Euclidean Lebesgue measure when the eliminated-coordinate space has positive dimension; if , identify with the singleton and let assign mass one to it. If , the normalized marginal law of the retained coordinates under is exactly ; if , the final retained space is the singleton and the identity gives . In all cases,
with under the empty-space convention. These are exact finite-dimensional Gaussian identities and make no approximation or empirical claim.
Statement references
Facts & Assumptions
Given: , a finite symmetric positive-definite , and a finite nested retained-coordinate list as in the algorithm.
For a positive-definite precision matrix on with , the density proportional to has normalizer ; the empty-space normalizer is by definition (Gaussian covariance for positive quadratic forms and a boundary counterexample, Finite Gaussian probability with a positive precision matrix).
Completing the square gives the Schur-complement identity, and for a nonempty retained block its Schur complement is positive definite (Positive Schur complements for finite Gaussian precisions).
Under , the nonnegative Lebesgue integral is defined for nonnegative measurable functions, obeys the change-of-variables formula for a diffeomorphism, and Tonelli identifies it with either iterated integral on finite-dimensional Lebesgue product spaces (The Axiom of Countable Choice (), The nonnegative Lebesgue integral, A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions, Lebesgue measurable sets, the family , and the restricted set function , A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included, 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).
The natural logarithm sends positive products to sums and (Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, , and the complex exponential extends the real exponential).
Proof
Initially is positive definite. At any later stage with nonempty , the current is positive definite by induction, so its principal block is positive definite. The Schur identity in [F2] then gives exactly the algorithm's and proves it positive definite when is nonempty. If is empty, the empty-matrix convention applies. Stages with leave . The algorithm is consequently well-defined at every one of its finitely many stages.
Fix one stage with and fix its retained coordinates . By step 1.1 the current matrix is well-defined and positive definite. Reordering the coordinates is a linear permutation with Jacobian determinant of absolute value , so the change-of-variables formula in [F3] preserves the integral. With eliminated coordinates denoted by , [F2] gives For fixed , the translation is a diffeomorphism of Euclidean space with Jacobian . The change-of-variables formula [F3] and the Gaussian normalizer [F1] therefore give The last equality follows from the definition of and positivity of . If , the same identity holds with factor by definition.
Apply step 2.1 successively for the finite stages. At each stage the integrand is nonnegative, so Tonelli [F3] permits the iterated eliminations in the stated order. Multiplying the one-stage factors yields, for each fixed final retained vector , using exponential addition in [F4]. If , including , the integral is with respect to the unit mass on and the equality is the identity with an empty product.
If no coordinates are eliminated, then every , , and , so the normalizer identity is immediate. If , then has coordinates; evaluating step 3.1 at the unique empty retained vector gives , while . In the remaining case both and are nonempty, so Tonelli [F3] and the Euclidean product-measure identity in [F3] allow integration of step 3.1 over the retained vector and give . The nonempty is positive definite by step 1.1, so [F1] makes finite and positive. In each case, dividing step 3.1 by gives the retained density when , exactly ; for empty the marginal is the unit mass . Taking natural logarithms of the positive normalizer identity and using [F4] proves the logarithmic formula, including the empty-space case.
Depends on
Exact finite Gaussian block elimination
Finite Gaussian probability with a positive precision matrix
Gaussian covariance for positive quadratic forms and a boundary counterexample
Positive Schur complements for finite Gaussian precisions
The Axiom of Countable Choice ()
A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Lebesgue measurable sets, the family , and the restricted set function
The nonnegative Lebesgue integral
A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included
On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n}
Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
, and the complex exponential extends the real exponential