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.
Gaussian mixture likelihood is unbounded under covariance collapse
Example
Assume AC. Use with its Borel sigma-algebra as the scale parameter space, with the first component's standard deviation; let with its Borel sigma-algebra and Lebesgue measure, and let latent labels have the power-set sigma-algebra and counting measure. Let for , the density of from A positive-variance normal law has its location-scale density. Put , , , and . For two independent observations and their two latent labels, use the complete-data density relative to Lebesgue measure on and counting measure on : Its one-observation marginal is the two-component mixture For observations the likelihood is . The Gaussian components are proper for every positive , but as , so this observed likelihood has no finite global maximizer.
Facts & Assumptions
Given: AC, the displayed Gaussian densities, mixture weights , observations , the two-label product model above, and the parameter .
The Axiom of Choice: AC is the hypothesis of the positive-variance normal location-scale density result used below.
A positive-variance normal law has its location-scale density: under AC, has Lebesgue density for every and .
Latent-variable joint and observed-data factorization: a complete-data density must be jointly measurable and normalized on each parameter fibre; its observed marginal is obtained by integrating over the latent coordinate.
EM does not decrease the observed log likelihood: the proved EM conclusion is a one-step nondecrease on admissible fibers and does not assert existence of a global likelihood maximum.
Likelihood ascent alone gives no global optimality or convergence conclusion: likelihood ascent alone supplies no global-optimality or convergence theorem.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: for a nonnegative product-measurable function on sigma-finite measure spaces, the product integral equals either iterated integral.
Verification
For each fixed label pair the displayed density is continuous in on ; the finite label space therefore makes it jointly measurable. For each observation coordinate, by [F1]. Lebesgue measure and finite counting measure are sigma-finite, so Tonelli [F5] gives integral for the nonnegative two-coordinate product density. This verifies the requirements of [F2] directly. Summing over the two labels in each coordinate gives the observed joint density , so its value at is .
At the two observations, and . Thus . For every , choosing gives , so the likelihood is unbounded while each fixed- value is finite. No finite parameter attains a global maximum.
This is compatible with [F3]–[F4]: the ascent theorem only compares consecutive admissible iterates; it neither bounds the likelihood sequence nor supplies a parameter attaining its unbounded supremum.
Depends on
- Expectation-maximization
- The Axiom of Choice
- Latent-variable joint and observed-data factorization
- A positive-variance normal law has its location-scale density
- Likelihood ascent alone gives no global optimality or convergence conclusion
- EM does not decrease the observed log likelihood
- The observed density is the latent marginal under Tonelli
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
41 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
- Mario A. T. Figueiredo, Lecture Notes on the EM Algorithm (2004) (standard reference, not scraped)