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.
The full-affine-span Gaussian-mixture M-step maximizes Q
Statement
Assume AC. Let be positive integers, let have affine span (equivalently, no nonzero makes constant over all ), and let be a finite Gaussian-mixture parameter with every and every symmetric positive definite. Define
and
For a candidate parameter in the same domain, let
Then every is positive, , every is positive definite, and the unique global maximizer of over all positive mixture weights summing to one, means in , and symmetric positive-definite covariances is
In particular, the displayed E-step responsibilities and M-step update formulas are well-defined and attain this maximum.
Facts & Assumptions
Given: Assume AC, positive integers , observations whose affine span is , and a current finite Gaussian-mixture parameter with positive weights and symmetric positive-definite covariances.
The Axiom of Choice: AC is assumed by the KL definition and its nonnegativity theorem; this is the only choice use in the proof.
Finite Gaussian mixture with positive-definite component covariances: mixture weights are strictly positive and sum to one, covariances are symmetric positive definite, and the component formula is used for finite observations.
Positive-definite multivariate Gaussian density is normalized: for these parameters, each Gaussian component formula is finite, strictly positive, and normalized; its logarithm is finite at every finite observation.
Probability measures and probability spaces: a probability measure has total mass one.
Kullback–Leibler divergence: for probability measures , the directional divergence is ; on a finite set with positive atom masses , this is .
Kullback–Leibler divergence is nonnegative: under AC, , with equality exactly when , for probability measures with the first absolutely continuous with respect to the second.
Strict concavity of log determinant on positive-definite matrices: is strictly concave on the symmetric positive-definite cone.
The chain rule for total derivatives: : the derivative of a differentiable composition is given by the chain rule.
The trace as the sum of the diagonal entries: is the sum of the diagonal entries; finite coordinate expansion gives whenever the products are defined.
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: a real symmetric matrix has an orthonormal eigenbasis; in particular its eigenvalues are positive when it is positive definite, and its inverse is positive definite.
The natural logarithm as the inverse of the exponential function and Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: is inverse to , and for positive , and ; hence for , .
Proof
By [F1] and [F2], every numerator and denominator in is finite and strictly positive. Hence . Summing the responsibility formula over gives , so and . Thus all displayed weighted means and scatters are defined.
For each nonzero , . If it were zero, positivity of each would force for every . That would put all observations in the proper affine hyperplane , contradicting their full affine span. Since is visibly symmetric, it is positive definite.
Expanding the component density in [F1,F2] in the definition of gives Here [F13] supplies and the product and reciprocal laws. For each positive , follows by applying those laws to ; applying the product law times gives . All logarithms are finite: weights are positive, and [F2] gives finite positive component densities for each positive-definite covariance, so their determinants are positive.
Define , and for each subset set and . Finite sums make these set functions additive on disjoint subsets; a disjoint sequence has at most nonempty members, so they are countably additive. Step 1.1 and the candidate weight constraint give total mass one, hence [F3] makes probability measures. Each , so . For every subset , , hence . The KL definition [F4] therefore gives by [A1,F5]. The weight-dependent part of at minus that at is , with equality only when , hence for every by [F5].
For fixed candidate covariance , write and . Since , expanding the quadratic form gives The last term is nonnegative and is zero exactly when , because is positive definite by [F12]. It occurs with a negative coefficient in by step 2.2, so the unique maximizing mean is .
At this mean, coordinate expansion of the finite trace gives . Therefore the covariance-dependent part of is by step 2.2. Set ; determinant identity [F11], the logarithm reciprocal law [F13], and the finite trace identity [F10] rewrite this as . The candidate is symmetric positive definite by step 2.1 and [F12]. Conversely, every symmetric positive-definite has positive-definite inverse, so this reparameterization ranges over the full covariance domain.
Fix any other positive-definite and put , , and . Each is positive definite by convexity of the cone. By [F6], is strictly concave when . Jacobi's formula [F7], the scalar logarithm derivative [F8], and the chain rule [F9] give , since and [F10] permits cyclic rearrangement of the finite trace. If , strict concavity gives for each . For , concavity gives . Letting contradicts . Hence for every , so is the unique maximizing covariance.
The expression for is a sum over components of a weight term, a mean-dependent quadratic term, and a covariance-dependent term, with no cross-component parameter terms. Steps 3.1, 3.2, and 3.4 show each is uniquely maximized by the displayed parameters; step 2.1 ensures each maximizing covariance remains in the permitted positive-definite domain. The product choice is therefore an admissible attained global maximizer, and equality forces every component parameter to equal the displayed update formulas. Thus the displayed E-step responsibilities and M-step formulas are well-defined and attain the claimed maximum, without using a procedure-level property.
Depends on
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- The Axiom of Choice
- For $n\ge1$, the determinant over a commutative ring by the Leibniz formula, and $|\det A|$ for a real matrix
- Finite Gaussian mixture with positive-definite component covariances
- Kullback–Leibler divergence
- Probability measures and probability spaces
- The trace $\operatorname{tr}(A)$ as the sum of the diagonal entries
- Strict concavity of log determinant on positive-definite matrices
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
- 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
- For same-sized finite square matrices over a commutative ring, $\det(AB)=\det(A)\det(B)$
- Positive-definite multivariate Gaussian density is normalized
- Kullback–Leibler divergence is nonnegative
- The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
- The natural logarithm as the inverse of the exponential function
Used by
Dependency tree · two levels
105 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
- Christopher M. Bishop, Pattern Recognition and Machine Learning, §9.2.2 (standard reference, not scraped)
- Hastie, Tibshirani, and Friedman, The Elements of Statistical Learning, 2nd ed., corrected 12th printing, §8.5.2 (standard reference, not scraped)