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.

The full-affine-span Gaussian-mixture M-step maximizes Q

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 let θ=((πk,μk,Σk))k=1K be a finite Gaussian-mixture parameter with every πk>0 and every Σk symmetric positive definite. Define

γik=πkϕp(xi;μk,Σk)∑j=1Kπjϕp(xi;μj,Σj),Nk=∑i=1nγik,xˉk=1Nk∑i=1nγikxi,

and

Sk=1Nk∑i=1nγik(xi−xˉk)(xi−xˉk)T.

For a candidate parameter ϑ=((ρk,mk,Vk))k=1K in the same domain, let

Q(ϑ∣θ)=∑i=1n∑k=1Kγiklog⁡ ⁣(ρkϕp(xi;mk,Vk)).

Then every Nk is positive, ∑kNk=n, every Sk is positive definite, and the unique global maximizer of Q(ϑ∣θ) over all positive mixture weights summing to one, means in Rp, and symmetric positive-definite covariances is

ρk∗=Nk/n,mk∗=xˉk,Vk∗=Sk.

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 n,p,K, observations whose affine span is Rp, and a current finite Gaussian-mixture parameter with positive weights and symmetric positive-definite covariances.

[A1]

The Axiom of Choice: AC is assumed by the KL definition and its nonnegativity theorem; this is the only choice use in the proof.

[F1]

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 ϕp(x;μ,Σ) is used for finite observations.

[F2]

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.

[F3]

Probability measures and probability spaces: a probability measure has total mass one.

[F4]

Kullback–Leibler divergence: for probability measures P≪R, the directional divergence is D(P∥R)=∫log⁡(dP/dR) dP; on a finite set with positive atom masses ak,rk, this is ∑kaklog⁡(ak/rk).

[F5]

Kullback–Leibler divergence is nonnegative: under AC, D(P∥R)≥0, with equality exactly when P=R, for probability measures with the first absolutely continuous with respect to the second.

[F6]

Strict concavity of log determinant on positive-definite matrices: A↦log⁡det⁡A is strictly concave on the symmetric positive-definite cone.

[F9]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): the derivative of a differentiable composition is given by the chain rule.

[F10]

The trace tr⁡(A) as the sum of the diagonal entries: tr⁡(M) is the sum of the diagonal entries; finite coordinate expansion gives tr⁡(AB)=tr⁡(BA) whenever the products are defined.

[F12]

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.

[F13]

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: log⁡ is inverse to exp⁡, and for positive u,v, log⁡(uv)=log⁡u+log⁡v and log⁡(1/u)=−log⁡u; hence for a>0, log⁡(a−1/2)=−12log⁡a.

Proof

1.1F1F2algebra

By [F1] and [F2], every numerator and denominator in γik is finite and strictly positive. Hence γik>0. Summing the responsibility formula over k gives ∑kγik=1, so Nk>0 and ∑kNk=n. Thus all displayed weighted means and scatters are defined.

2.1givenstep 1.1algebra

For each nonzero v∈Rp, vTSkv=Nk−1∑iγik(vT(xi−xˉk))2. If it were zero, positivity of each γik would force vTxi=vTxˉk for every i. That would put all observations in the proper affine hyperplane {x:vTx=vTxˉk}, contradicting their full affine span. Since Sk is visibly symmetric, it is positive definite.

2.2F1F2F13step 1.1algebra

Expanding the component density in [F1,F2] in the definition of Q gives Q(ϑ∣θ)=∑kNklog⁡ρk−np2log⁡(2π)−12∑k(Nklog⁡det⁡Vk+∑iγik(xi−mk)TVk−1(xi−mk)). Here [F13] supplies log⁡(exp⁡u)=u and the product and reciprocal laws. For each positive a, log⁡(a−1/2)=−12log⁡a follows by applying those laws to (a−1/2)2=1/a; applying the product law p times gives log⁡((2π)−p/2)=−p2log⁡(2π). All logarithms are finite: weights are positive, and [F2] gives finite positive component densities for each positive-definite covariance, so their determinants are positive.

3.1A1F3F4F5step 1.1step 2.2algebra

Define αk=Nk/n, and for each subset B⊆{1,…,K} set P(B):=∑k∈Bαk and R(B):=∑k∈Bρk. Finite sums make these set functions additive on disjoint subsets; a disjoint sequence has at most K nonempty members, so they are countably additive. Step 1.1 and the candidate weight constraint give total mass one, hence [F3] makes P,R probability measures. Each ρk>0, so P≪R. For every subset B, ∑k∈B(αk/ρk)ρk=P(B), hence dP/dR(k)=αk/ρk. The KL definition [F4] therefore gives D(P∥R)=∑kαklog⁡(αk/ρk)≥0 by [A1,F5]. The weight-dependent part of Q at α minus that at ρ is ∑kNklog⁡(αk/ρk)=nD(P∥R)≥0, with equality only when P=R, hence ρk=αk for every k by [F5].

3.2F1F12step 1.1step 2.2algebra

For fixed candidate covariance Vk, write di=xi−xˉk and e=xˉk−mk. Since ∑iγikdi=0, expanding the quadratic form gives ∑iγik(xi−mk)TVk−1(xi−mk)=∑iγikdiTVk−1di+NkeTVk−1e. The last term is nonnegative and is zero exactly when mk=xˉk, because Vk−1 is positive definite by [F12]. It occurs with a negative coefficient in Q by step 2.2, so the unique maximizing mean is xˉk.

3.3F10F11F12F13step 2.1step 2.2algebra

At this mean, coordinate expansion of the finite trace gives ∑iγikdiTVk−1di=Nktr⁡(Vk−1Sk). Therefore the covariance-dependent part of Q is −Nk2(log⁡det⁡Vk+tr⁡(Vk−1Sk)) by step 2.2. Set A=Vk−1; determinant identity [F11], the logarithm reciprocal law [F13], and the finite trace identity [F10] rewrite this as Nk2(log⁡det⁡A−tr⁡(ASk)). The candidate A∗=Sk−1 is symmetric positive definite by step 2.1 and [F12]. Conversely, every symmetric positive-definite A has positive-definite inverse, so this reparameterization ranges over the full covariance domain.

3.4F6F7F8F9F10step 2.1algebra

Fix any other positive-definite A and put H=A−A∗, At=A∗+tH, and h(t)=log⁡det⁡At−tr⁡(AtSk). Each At is positive definite by convexity of the cone. By [F6], h is strictly concave when H≠0. Jacobi's formula [F7], the scalar logarithm derivative [F8], and the chain rule [F9] give h′(0)=tr⁡(A∗−1H)−tr⁡(HSk)=0, since A∗−1=Sk and [F10] permits cyclic rearrangement of the finite trace. If h(1)≥h(0), strict concavity gives h(s)>h(0) for each 0<s<1. For 0<u<s, concavity gives (h(u)−h(0))/u≥(h(s)−h(0))/s>0. Letting u↓0 contradicts h′(0)=0. Hence h(1)<h(0) for every A≠A∗, so Vk=Sk is the unique maximizing covariance.

4.1F1step 2.1step 3.1step 3.2step 3.4algebra∎

The expression for Q 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

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