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.
Exact Gaussian-mixture EM does not decrease observed log likelihood
Statement
Assume AC. Let be positive integers, let have affine span (equivalently, no nonzero makes constant over all ), and start from a finite Gaussian-mixture parameter with positive weights summing to one and symmetric positive-definite covariances. For , where , set
and update
For each , define
Every update is well-defined, every remains in the stated mixture domain, and
No strict increase, parameter convergence, or global maximum conclusion is asserted.
Facts & Assumptions
Given: Assume AC; take positive integers , a full-affine-span sample , an initial finite Gaussian-mixture parameter, and a finite number of exact EM updates.
The Axiom of Choice: AC is assumed by the finite-Gaussian density construction and by the published KL/EM interface. The density construction also uses countable choice, which AC supplies through [F10]. No stronger choice principle is used.
Finite Gaussian mixture with positive-definite component covariances: a finite mixture has positive weights summing to one, SPD component covariances, component density , observation density , and iid-sample log likelihood .
Positive-definite multivariate Gaussian density is normalized: for every positive-definite component covariance, is finite, strictly positive at each finite observation, and integrates to one with respect to -dimensional Lebesgue measure.
Latent-variable joint and observed-data factorization: a latent-variable model supplies one jointly measurable nonnegative density on parameter, observation, and latent spaces, normalized on every parameter fibre; the observed marginal is its latent integral and the posterior is defined on positive finite marginal fibres.
The observed density is the latent marginal under Tonelli: under [F3], the observed marginal is a density, and the normalized latent fibre is a probability density wherever its marginal is positive and finite.
Expectation-maximization: exact mode selects an attained maximizer of the expected complete-data log density over an admissible candidate set containing the current parameter; admissible candidates satisfy positive finite observed marginal, directional support, finite KL, and absolute log integrability.
EM does not decrease the observed log likelihood: for a normalized jointly measurable complete-data density and current/candidate parameters satisfying those conditions, the observed log-likelihood difference equals the Q difference plus the directional KL divergence; an admissible Q-ascent update therefore cannot decrease observed log likelihood.
The full-affine-span Gaussian-mixture M-step maximizes Q: under the stated full-affine-span hypothesis, the finite Gaussian responsibilities have positive effective counts, their weighted covariance matrices are SPD, and the displayed updates are an attained global maximizer of the finite expected complete-data log density over the full mixture domain.
Kullback–Leibler divergence: for , is the integral of the log Radon–Nikodym derivative with respect to ; on a finite space with positive masses it is a finite sum.
Finite, sigma-finite, and semifinite measures and For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique: finite-dimensional Lebesgue measure and counting measure on the finite label set are sigma-finite, and their product reference measure exists with the rectangle formula.
AC supplies countable selections and prescribed serial paths: AC implies countable choice, as required for the product-Lebesgue identity and the local component-density normalization proof.
On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n}: under countable choice, finite products of Euclidean Lebesgue measures agree with Lebesgue measure on the corresponding Euclidean product space.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: a nonnegative product-measurable function on sigma-finite factors has measurable section integrals, and its product integral equals either iterated integral.
The product sigma-algebra and its finite iterates: finite product sigma-algebras are generated by measurable rectangles.
Continuous functions on Euclidean spaces are Borel measurable: a continuous function on a finite-dimensional Euclidean space is Borel measurable; the relative version on a Borel parameter domain follows by taking relative Borel preimages.
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis, The determinant differential is at every matrix, and Jacobi's formula holds on the invertible locus, and On the invertible locus, : real symmetric matrices diagonalize orthogonally; determinant and matrix inverse are continuous on their respective finite-dimensional domains (the cited differentiability statements imply continuity).
The Borel product of R^m and R^n is the Borel sigma-algebra of R^{m+n}: for finite-dimensional Euclidean factors, the product Borel sigma-algebra is the Euclidean Borel sigma-algebra.
The measure with density relative to and Probability measures and probability spaces: a nonnegative density relative to counting measure defines the measure , and when its finite sum is one this is a probability measure.
Additivity of the nonnegative Lebesgue integral: the nonnegative integral is additive for finite sums of nonnegative measurable functions.
The Cauchy-Schwarz inequality for finite sums: for finite real lists and , .
Proof
Let be the set of mixture parameters in [F1], let with product Lebesgue measure , and let with counting measure for . The parameter domain is Borel: the positive-weight simplex is relatively open in its affine hyperplane, and the SPD cone is open as follows. For a symmetric positive-definite matrix , the spectral theorem [F15] gives an orthonormal eigenbasis. Every eigenvalue has a unit eigenvector with , so the least eigenvalue is positive. For a symmetric perturbation , define . Applying [F19] to the finite lists and gives . Therefore, whenever , for every nonzero , so is positive definite. This supplies a relative open neighborhood of each in the symmetric-matrix subspace. For each fixed , the formula below is continuous in : determinants and inverses are continuous on the SPD cone by [F15], and the remaining operations are sums, products, and exponentials. A continuous map on this Borel subspace has Borel preimages relative to it; those relative Borel sets are ambient Borel. The product-Borel identification for Euclidean factors [F16] and finite discreteness of then make the function jointly measurable for the required product sigma-algebra.
Define the complete-data density, relative to times counting measure on , by Repeated use of [F9] constructs the finite product measures, including , and preserves sigma-finiteness. AC supplies the countable-choice premise of [F11] by [F10]; repeated use of [F11] then identifies with Euclidean Lebesgue measure on . For each component, [F1,F2] and finite-sum additivity [F18] give . Distributing the finite sum over labels gives . Repeated Tonelli integration [F12] therefore gives Thus is normalized on each parameter fibre as required by [F3].
For a fixed observed sample , summing the complete density over the finite label set yields Every factor is finite and strictly positive by [F1,F2], so this marginal is positive and finite. Its logarithm is exactly the likelihood in the statement. By [F4], every normalized posterior is a probability mass function. More explicitly it is and every one of its finitely many masses is positive.
At any current parameter and its exact update , both posterior measures obtained from the probability masses in step 3.1 by [F17] are strictly positive on the same finite label set. Hence , and the directional KL divergence is a sum of finitely many finite terms by [F8], so it is finite. For each , and are strictly positive and finite; their logarithms are finite. The posterior expectations of the absolute log densities are finite sums and therefore finite. Thus every admissibility condition in [F5,F6] holds for this current/candidate pair.
The posterior in step 3.1 factors over observations. Taking the finite expectation of the complete log density gives where is the function in [F7]. Indeed, expand as the sum over , sum first over , and use for every . This is a finite-sum identity, and all terms are finite by step 3.1.
The local exact M-step result [F7] says globally maximizes this same Q over the full mixture domain. Step 4.1 verifies that both and are admissible, so the two-point candidate set is admissible and contains the current parameter; the global maximizer is therefore an attained maximizer over this set as required by the exact mode of [F5]. Consequently . Applying the identity and nonnegativity conclusion of [F6], with the verified conditions from step 4.1, yields Thus one exact update does not decrease observed log likelihood.
Initially is in the mixture domain by hypothesis. If is in that domain, step 3.1 supplies positive finite marginals and positive responsibilities, and [F7] supplies the next positive weights and SPD covariances; hence is again in the domain. Induction gives valid parameters through , and step 5.1 applies at each , proving every displayed likelihood inequality. This proves the claim without asserting strict increase or convergence.
Depends on
- Expectation-maximization
- Exact EM updates for a finite Gaussian mixture
- Additivity of the nonnegative Lebesgue integral
- Continuous functions on Euclidean spaces are Borel measurable
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- The Axiom of Choice
- Finite Gaussian mixture with positive-definite component covariances
- Finite, sigma-finite, and semifinite measures
- Kullback–Leibler divergence
- Latent-variable joint and observed-data factorization
- The measure with density $f$ relative to $\mu$
- Probability measures and probability spaces
- The product sigma-algebra and its finite iterates
- AC supplies countable selections and prescribed serial paths
- The determinant differential is $D\det(A)[H]=\operatorname{tr}(\operatorname{adj}(A)H)$ at every matrix, and Jacobi's formula holds on the invertible locus
- On the invertible locus, $D\operatorname{inv}(A)[H]=-A^{-1}HA^{-1}$
- EM does not decrease the observed log likelihood
- Positive-definite multivariate Gaussian density is normalized
- The full-affine-span Gaussian-mixture M-step maximizes Q
- The Borel product of R^m and R^n is the Borel sigma-algebra of R^{m+n}
- On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n}
- The observed density is the latent marginal under Tonelli
- For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
- Kullback–Leibler divergence is nonnegative
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- The Cauchy-Schwarz inequality for finite sums
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
147 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
- Hastie, Tibshirani, and Friedman, The Elements of Statistical Learning, 2nd ed., corrected 12th printing, §8.5.2 and §14.3.7 (standard reference, not scraped)
- Christopher M. Bishop, Pattern Recognition and Machine Learning, §§9.2.2 and 9.4 (standard reference, not scraped)