Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Exact Gaussian-mixture EM does not decrease observed log likelihood

Statement

Assume AC. Let n,p,K be positive integers, let x1,…,xn∈Rp have affine span Rp (equivalently, no nonzero v∈Rp makes vTxi constant over all i), and start from a finite Gaussian-mixture parameter θ0=((πk(0),μk(0),Σk(0)))k=1K with positive weights summing to one and symmetric positive-definite covariances. For t=0,…,T−1, where T≥1, set

γik(t):=πk(t)ϕp(xi;μk(t),Σk(t))∑j=1Kπj(t)ϕp(xi;μj(t),Σj(t)),Nk(t):=∑iγik(t),

and update

πk(t+1):=Nk(t)/n,μk(t+1):=∑iγik(t)xiNk(t),Σk(t+1):=∑iγik(t)(xi−μk(t+1))(xi−μk(t+1))TNk(t).

For each t, define

ℓ(θt;x1:n):=∑i=1nlog⁡ ⁣(∑k=1Kπk(t)ϕp(xi;μk(t),Σk(t))).

Every update is well-defined, every θt remains in the stated mixture domain, and

ℓ(θt+1;x1:n)≥ℓ(θt;x1:n)(0≤t<T).

No strict increase, parameter convergence, or global maximum conclusion is asserted.

Facts & Assumptions

Given: Assume AC; take positive integers n,p,K, a full-affine-span sample x1:n, an initial finite Gaussian-mixture parameter, and a finite number T of exact EM updates.

[A1]

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.

[F1]

Finite Gaussian mixture with positive-definite component covariances: a finite mixture has positive weights summing to one, SPD component covariances, component density ϕp, observation density fθ(y)=∑kπkϕp(y;μk,Σk), and iid-sample log likelihood ∑ilog⁡fθ(xi).

[F2]

Positive-definite multivariate Gaussian density is normalized: for every positive-definite component covariance, ϕp is finite, strictly positive at each finite observation, and integrates to one with respect to p-dimensional Lebesgue measure.

[F3]

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.

[F4]

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.

[F5]

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.

[F6]

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.

[F7]

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.

[F8]

Kullback–Leibler divergence: for P≪R, D(P∥R) is the integral of the log Radon–Nikodym derivative with respect to P; on a finite space with positive masses it is a finite sum.

[F9]

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.

[F10]

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.

[F11]

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.

[F12]

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.

[F13]

The product sigma-algebra and its finite iterates: finite product sigma-algebras are generated by measurable rectangles.

[F14]

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.

[F16]

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.

[F17]

The measure with density f relative to μ and Probability measures and probability spaces: a nonnegative density q relative to counting measure defines the measure q #, and when its finite sum is one this is a probability measure.

[F18]

Additivity of the nonnegative Lebesgue integral: the nonnegative integral is additive for finite sums of nonnegative measurable functions.

[F19]

The Cauchy-Schwarz inequality for finite sums: for finite real lists (ar) and (br), ∣∑rarbr∣≤(∑rar2)1/2(∑rbr2)1/2.

Proof

1.1A1F1F10F13F14F15F16F19algebra

Let ΘK be the set of mixture parameters in [F1], let Y=(Rp)n with product Lebesgue measure ν=λp⊗n, and let Z={1,…,K}n with counting measure #(B):=∣B∣ for B⊆Z. 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 A, the spectral theorem [F15] gives an orthonormal eigenbasis. Every eigenvalue λ has a unit eigenvector u with λ=uTAu>0, so the least eigenvalue λmin⁡(A) is positive. For a symmetric perturbation E, define ∥E∥F:=(∑i,jeij2)1/2. Applying [F19] to the finite lists (eij) and (vivj) gives ∣vTEv∣≤∥E∥F(∑i,jvi2vj2)1/2=∥E∥F∥v∥22. Therefore, whenever ∥E∥F<λmin⁡(A), vT(A+E)v≥(λmin⁡(A)−∥E∥F)∥v∥22>0 for every nonzero v, so A+E is positive definite. This supplies a relative open neighborhood of each A in the symmetric-matrix subspace. For each fixed z∈Z, the formula below is continuous in (η,y)∈ΘK×Y: 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 Z then make the function jointly measurable for the required product sigma-algebra.

2.1A1F1F2F3F9F10F11F12F18step 1.1algebra

Define the complete-data density, relative to ν times counting measure on Z, by p(η,y,z):=∏i=1nπziϕp(yi;μzi,Σzi). 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 ν=λp⊗n with Euclidean Lebesgue measure on Rpn. For each component, [F1,F2] and finite-sum additivity [F18] give ∫fη(yi) λp(dyi)=∑kπk=1. Distributing the finite sum over labels gives ∑z∈Zp(η,y,z)=∏ifη(yi). Repeated Tonelli integration [F12] therefore gives ∑z∈Z∫Yp(η,y,z) ν(dy)=∫Y∏ifη(yi) ν(dy)=∏i∫Rpfη(yi) λp(dyi)=1. Thus p is normalized on each parameter fibre as required by [F3].

3.1F1F2F3F4step 2.1algebra

For a fixed observed sample x1:n, summing the complete density over the finite label set yields mη(x1:n)=∑z∈Zp(η,x1:n,z)=∏i∑kπkϕp(xi;μk,Σk)=∏ifη(xi). Every factor is finite and strictly positive by [F1,F2], so this marginal is positive and finite. Its logarithm is exactly the likelihood ℓ(η;x1:n) in the statement. By [F4], every normalized posterior qηx1:n(z)=p(η,x1:n,z)/mη(x1:n) is a probability mass function. More explicitly it is qηx1:n(z)=∏iγi,zi(η), and every one of its finitely many masses is positive.

4.1F5F6F8F17step 3.1algebra

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 qθx1:n≪qθ′x1:n, and the directional KL divergence is a sum of finitely many finite terms by [F8], so it is finite. For each z, p(θ,x1:n,z) and p(θ′,x1:n,z) 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.

4.2F1F7step 3.1algebra

The posterior in step 3.1 factors over observations. Taking the finite expectation of the complete log density gives ∑z∈Zqθx1:n(z)log⁡p(ϑ,x1:n,z)=∑i=1n∑k=1Kγik(θ)log⁡ ⁣(ρkϕp(xi;mk,Vk))=Q(ϑ∣θ), where Q is the function in [F7]. Indeed, expand log⁡p as the sum over i, sum first over zi=k, and use ∑zj=1Kγj,zj(θ)=1 for every j≠i. This is a finite-sum identity, and all terms are finite by step 3.1.

5.1F5F6F7step 4.1step 4.2algebra

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 Q(θ′∣θ)≥Q(θ∣θ). Applying the identity and nonnegativity conclusion of [F6], with the verified conditions from step 4.1, yields ℓ(θ′;x1:n)−ℓ(θ;x1:n)=Q(θ′∣θ)−Q(θ∣θ)+D(qθx1:n∥qθ′x1:n)≥0. Thus one exact update does not decrease observed log likelihood.

6.1givenF1F7step 3.1step 5.1induction∎

Initially θ0 is in the mixture domain by hypothesis. If θt 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 θt+1 is again in the domain. Induction gives valid parameters through T, and step 5.1 applies at each t<T, proving every displayed likelihood inequality. This proves the claim without asserting strict increase or convergence.

Depends on

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